🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 122 (from laksa133)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa122.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 = 50 AND (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://downey.io/notes/omscs/cs6515/dynamic-programming-shortests-paths/\')), getAhrefsUnparsedNoserviceFromURL(\'https://downey.io/notes/omscs/cs6515/dynamic-programming-shortests-paths/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/downey.io\/notes\/omscs\/cs6515\/dynamic-programming-shortests-paths\/","crawl_time":1776327995,"first_indexed_time":1560075257,"http_code":200,"src_unparsed":"io,downey!\/notes\/omscs\/cs6515\/dynamic-programming-shortests-paths\/ s443","src_root_hash":"12367762233883290122","history_drop_reason":null,"meta_title":"Dynamic Programming - Bellman-Ford Algorithm: an exploration of the Bellman-Ford shortest paths algorithm|downey.io","meta_descriptions":["Brief explanations of and pseudocode for the Bellman-Ford algorithm using dynamic programming."],"meta_canonical":null,"ml_categories_json":"{\"\/Computers_and_Electronics\":904,\"\/Computers_and_Electronics\/Programming\":840,\"\/Computers_and_Electronics\/Programming\/Scripting_Languages\":392,\"\/Science\":178,\"\/Science\/Mathematics\":106}","ml_types_json":"{\"\/Article\":999,\"\/Article\/Tutorial_or_Guide\":991}","ml_intent_types_json":"{\"Informational\":999}","meta_language":"en","attrs_author":"Tim Downey","attrs_publish_time":0,"attrs_original_publish_time":1560075257,"attrs_is_republished":0,"attrs_nr_words":"1372","attrs_boilerpipe_nr_words":"1321","body_ext_links_number":9,"body_int_links_number":8,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":1,"src_redirect":"","download_time_msec":122,"download_ttfb_msec":121,"download_size":17566}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📍

LOCATION

Host 122 · Partition 50

laksa122

12367762233883290122

📄

INDEXABLE

✅

CRAWLED

1 month 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`	1.6 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://downey.io/notes/omscs/cs6515/dynamic-programming-shortests-paths/

Last Crawled

2026-04-16 08:26:35 (1 month ago)

First Indexed

2019-06-09 10:14:17 (6 years ago)

HTTP Status Code

200

Content

Meta Title

Dynamic Programming - Bellman-Ford Algorithm: an exploration of the Bellman-Ford shortest paths algorithm|downey.io

Meta Description

Brief explanations of and pseudocode for the Bellman-Ford algorithm using dynamic programming.

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		90.4%
/Computers_and_Electronics/Programming		84.0%
/Computers_and_Electronics/Programming/Scripting_Languages		39.2%
/Science		17.8%
/Science/Mathematics		10.6%

Raw JSON

{
    "/Computers_and_Electronics": 904,
    "/Computers_and_Electronics/Programming": 840,
    "/Computers_and_Electronics/Programming/Scripting_Languages": 392,
    "/Science": 178,
    "/Science/Mathematics": 106
}

ML Page Types

/Article		99.9%
/Article/Tutorial_or_Guide		99.1%

Raw JSON

{
    "/Article": 999,
    "/Article/Tutorial_or_Guide": 991
}

ML Intent Types

Informational

99.9%

Raw JSON

{
    "Informational": 999
}

Content Metadata

Language

Author

Tim Downey

Publish Time

not set

Original Publish Time

2019-06-09 10:14:17 (6 years ago)

Republished

Word Count (Total)

1,372

Word Count (Content)

1,321

Links

External Links

Internal Links

Technical SEO

Meta Nofollow

Meta Noarchive

JS Rendered

Yes

Redirect Target

null

Performance

Download Time (ms)

122

TTFB (ms)

121

Download Size (bytes)

17,566

Location

Host ID

122 (laksa122)

Partition ID

Root Hash

12367762233883290122

Unparsed URL

io,downey!/notes/omscs/cs6515/dynamic-programming-shortests-paths/ s443