🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 35 (from laksa026)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa035.int.ahrefs:8124/' \
  -H 'Content-Type: text/plain' \
  -H 'X-ClickHouse-Database: crawler3' \
  -H 'Authorization: Basic YXBpOg==' \
  -d 'SELECT getAhrefsURLFromUnparsed(src_unparsed) AS found_url, ifNull(toUnixTimestamp(download_stamp), 0) AS crawl_time, ifNull(toUnixTimestamp(props_url_first_seen), 0) AS first_indexed_time, download_http_code AS http_code, src_unparsed AS src_unparsed, src_root_hash AS src_root_hash, history_drop_reason AS history_drop_reason, meta_title AS meta_title, meta_descriptions AS meta_descriptions, meta_canonical AS meta_canonical, ml_categories_json AS ml_categories_json, ml_types_json AS ml_types_json, ml_intent_types_json AS ml_intent_types_json, meta_language AS meta_language, attrs_author AS attrs_author, ifNull(toUnixTimestamp(attrs_publish_time), 0) AS attrs_publish_time, ifNull(toUnixTimestamp(attrs_original_publish_time), 0) AS attrs_original_publish_time, ifNull(attrs_is_republished, 0) AS attrs_is_republished, ifNull(attrs_nr_words, 0) AS attrs_nr_words, ifNull(attrs_boilerpipe_nr_words, 0) AS attrs_boilerpipe_nr_words, ifNull(body_ext_links_number, 0) AS body_ext_links_number, ifNull(body_int_links_number, 0) AS body_int_links_number, ifNull(meta_nofollow, 0) AS meta_nofollow, ifNull(meta_noarchive, 0) AS meta_noarchive, ifNull(props_was_rendered, 0) AS props_was_rendered, ifNull(src_redirect, \'\') AS src_redirect, ifNull(download_time_msec, 0) AS download_time_msec, ifNull(download_ttfb_msec, 0) AS download_ttfb_msec, ifNull(download_size, 0) AS download_size FROM crawler3.page_info_local FINAL PREWHERE int_partition_id = 59 AND (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://www.programiz.com/dsa/bellman-ford-algorithm\')), getAhrefsUnparsedNoserviceFromURL(\'https://www.programiz.com/dsa/bellman-ford-algorithm\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/www.programiz.com\/dsa\/bellman-ford-algorithm","crawl_time":1779813353,"first_indexed_time":1495109725,"http_code":200,"src_unparsed":"com,programiz!www,\/dsa\/bellman-ford-algorithm s443","src_root_hash":"16786490165506891835","history_drop_reason":null,"meta_title":"Bellman Ford's Algorithm","meta_descriptions":["Bellman Ford's Algorithm is similar to Dijkstra's algorithm but it can work with graphs in which edges can have negative weights. In this tutorial, you will understand the working on Bellman Ford's Algorithm in Python, Java and C\/C++."],"meta_canonical":null,"ml_categories_json":"{\"\/Computers_and_Electronics\":952,\"\/Computers_and_Electronics\/Programming\":891}","ml_types_json":"{\"\/Article\":998,\"\/Article\/Tutorial_or_Guide\":995}","ml_intent_types_json":"{\"Informational\":999}","meta_language":"en-us","attrs_author":null,"attrs_publish_time":0,"attrs_original_publish_time":1495109725,"attrs_is_republished":0,"attrs_nr_words":"2883","attrs_boilerpipe_nr_words":"2163","body_ext_links_number":48,"body_int_links_number":162,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":0,"src_redirect":"","download_time_msec":279,"download_ttfb_msec":278,"download_size":26172}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📍

LOCATION

Host 35 · Partition 59

laksa035

16786490165506891835

📄

INDEXABLE

✅

CRAWLED

8 days ago

🤖

ROBOTS ALLOWED

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.3 months ago
History drop	PASS	`isNull(history_drop_reason)`	No drop reason
Spam/ban	PASS	`fh_dont_index != 1 AND ml_spam_score = 0`	ml_spam_score=0
Canonical	PASS	`meta_canonical IS NULL OR = '' OR = src_unparsed`	Not set

Page Details

Property

Value

URL

https://www.programiz.com/dsa/bellman-ford-algorithm

Last Crawled

2026-05-26 16:35:53 (8 days ago)

First Indexed

2017-05-18 12:15:25 (9 years ago)

HTTP Status Code

200

Content

Meta Title

Bellman Ford's Algorithm

Meta Description

Bellman Ford's Algorithm is similar to Dijkstra's algorithm but it can work with graphs in which edges can have negative weights. In this tutorial, you will understand the working on Bellman Ford's Algorithm in Python, Java and C/C++.

Meta Canonical

null

Boilerpipe Text

heavy column, fetched on demand

Markdown

heavy column, fetched on demand

Readable Markdown

heavy column, fetched on demand

ML Classification

ML Categories

/Computers_and_Electronics		95.2%
/Computers_and_Electronics/Programming		89.1%

Raw JSON

{
    "/Computers_and_Electronics": 952,
    "/Computers_and_Electronics/Programming": 891
}

ML Page Types

/Article		99.8%
/Article/Tutorial_or_Guide		99.5%

Raw JSON

{
    "/Article": 998,
    "/Article/Tutorial_or_Guide": 995
}

ML Intent Types

Informational

99.9%

Raw JSON

{
    "Informational": 999
}

Content Metadata

Language

en-us

Author

null

Publish Time

not set

Original Publish Time

2017-05-18 12:15:25 (9 years ago)

Republished

Word Count (Total)

2,883

Word Count (Content)

2,163

Links

External Links

Internal Links

162

Technical SEO

Meta Nofollow

Meta Noarchive

JS Rendered

Redirect Target

null

Performance

Download Time (ms)

279

TTFB (ms)

278

Download Size (bytes)

26,172

Location

Host ID

35 (laksa035)

Partition ID

Root Hash

16786490165506891835

Unparsed URL

com,programiz!www,/dsa/bellman-ford-algorithm s443