Crawler Inspector

1. Shard Calculation

Query:

Response:

Calculated Shard: 172 (from laksa004)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa172.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 = 20 AND (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://www.dinocajic.com/bellman-ford-algorithm-visually-explained/\')), getAhrefsUnparsedNoserviceFromURL(\'https://www.dinocajic.com/bellman-ford-algorithm-visually-explained/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/www.dinocajic.com\/bellman-ford-algorithm-visually-explained\/","crawl_time":1779180873,"first_indexed_time":1702433820,"http_code":200,"src_unparsed":"com,dinocajic!www,\/bellman-ford-algorithm-visually-explained\/ s443","src_root_hash":"10735637622951024172","history_drop_reason":null,"meta_title":"Bellman-Ford Algorithm Visually Explained - Algorithms","meta_descriptions":["The Bellman-Ford algorithm finds the shortest path to each vertex in the directed graph from the source vertex. Bellman-Ford can have negative edges.","The Bellman-Ford algorithm finds the shortest path to each vertex in the directed graph from the source vertex. Bellman-Ford can have negative edges."],"meta_canonical":null,"ml_categories_json":"","ml_types_json":"","ml_intent_types_json":"","meta_language":"en-us","attrs_author":"Dino Cajic","attrs_publish_time":1702429474,"attrs_original_publish_time":1702429474,"attrs_is_republished":0,"attrs_nr_words":"1578","attrs_boilerpipe_nr_words":"1202","body_ext_links_number":8,"body_int_links_number":51,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":0,"src_redirect":"","download_time_msec":24,"download_ttfb_msec":21,"download_size":39598}

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.5 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

Property	Value
URL	https://www.dinocajic.com/bellman-ford-algorithm-visually-explained/
Last Crawled	2026-05-19 08:54:33 (14 days ago)
First Indexed	2023-12-13 02:17:00 (2 years ago)
HTTP Status Code	200
Content
Meta Title	Bellman-Ford Algorithm Visually Explained - Algorithms
Meta Description	The Bellman-Ford algorithm finds the shortest path to each vertex in the directed graph from the source vertex. Bellman-Ford can have negative edges., The Bellman-Ford algorithm finds the shortest path to each vertex in the directed graph from the source vertex. Bellman-Ford can have negative edges.
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	null
ML Page Types	null
ML Intent Types	null
Content Metadata
Language	en-us
Author	Dino Cajic
Publish Time	2023-12-13 01:04:34 (2 years ago)
Original Publish Time	2023-12-13 01:04:34 (2 years ago)
Republished	No
Word Count (Total)	1,578
Word Count (Content)	1,202
Links
External Links	8
Internal Links	51
Technical SEO
Meta Nofollow	No
Meta Noarchive	No
JS Rendered	No
Redirect Target	null
Performance
Download Time (ms)	24
TTFB (ms)	21
Download Size (bytes)	39,598
Location
Host ID	172 (laksa172)
Partition ID	20
Root Hash	10735637622951024172
Unparsed URL	com,dinocajic!www,/bellman-ford-algorithm-visually-explained/ s443

🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

1. Shard Calculation

Query:

Response:

2. Crawled Status Check

Query:

Response:

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

Page Info Filters

Page Details