Crawler Inspector

1. Shard Calculation

Query:

Response:

Calculated Shard: 110 (from laksa000)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa110.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 = 39 AND (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'http://www.geekviewpoint.com/python/graph/bellman_ford_shortest_path\')), getAhrefsUnparsedNoserviceFromURL(\'http://www.geekviewpoint.com/python/graph/bellman_ford_shortest_path\'))) FORMAT JSONEachRow'

Response:

{"found_url":"http:\/\/www.geekviewpoint.com\/python\/graph\/bellman_ford_shortest_path","crawl_time":1779577312,"first_indexed_time":1375979365,"http_code":200,"src_unparsed":"com,geekviewpoint!www,\/python\/graph\/bellman_ford_shortest_path h80","src_root_hash":"9738621646448007910","history_drop_reason":null,"meta_title":"Bellman-Ford's Shortest Path","meta_descriptions":["The Bellman-Ford argument is that the longest path in any graph can have at most V-1 edges, where V is the number of vertices. Furthermore, if we perform relaxation on the set of edges once, then we will at least have determined all the one-edged shortest paths; if we traverse the set of edges twice, we will have solved at least all the two-edged shortest paths; ergo, after the V-1 iteration thru the set of edges, we will have determined all the shortest paths in the graph."],"meta_canonical":null,"ml_categories_json":"","ml_types_json":"","ml_intent_types_json":"","meta_language":null,"attrs_author":null,"attrs_publish_time":0,"attrs_original_publish_time":1375979365,"attrs_is_republished":0,"attrs_nr_words":"917","attrs_boilerpipe_nr_words":"835","body_ext_links_number":4,"body_int_links_number":18,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":0,"src_redirect":"","download_time_msec":137,"download_ttfb_msec":134,"download_size":9613}

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.7 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	http://www.geekviewpoint.com/python/graph/bellman_ford_shortest_path
Last Crawled	2026-05-23 23:01:52 (20 days ago)
First Indexed	2013-08-08 16:29:25 (12 years ago)
HTTP Status Code	200
Content
Meta Title	Bellman-Ford's Shortest Path
Meta Description	The Bellman-Ford argument is that the longest path in any graph can have at most V-1 edges, where V is the number of vertices. Furthermore, if we perform relaxation on the set of edges once, then we will at least have determined all the one-edged shortest paths; if we traverse the set of edges twice, we will have solved at least all the two-edged shortest paths; ergo, after the V-1 iteration thru the set of edges, we will have determined all the shortest paths in the graph.
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	null
Author	null
Publish Time	not set
Original Publish Time	2013-08-08 16:29:25 (12 years ago)
Republished	No
Word Count (Total)	917
Word Count (Content)	835
Links
External Links	4
Internal Links	18
Technical SEO
Meta Nofollow	No
Meta Noarchive	No
JS Rendered	No
Redirect Target	null
Performance
Download Time (ms)	137
TTFB (ms)	134
Download Size (bytes)	9,613
Location
Host ID	110 (laksa110)
Partition ID	39
Root Hash	9738621646448007910
Unparsed URL	com,geekviewpoint!www,/python/graph/bellman_ford_shortest_path h80

🕷️ 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