🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 115 (from laksa163)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa115.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 = 88 AND (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://prepbytes.com/blog/bellman-ford-algorithm/\')), getAhrefsUnparsedNoserviceFromURL(\'https://prepbytes.com/blog/bellman-ford-algorithm/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/prepbytes.com\/blog\/bellman-ford-algorithm\/","crawl_time":1771969249,"first_indexed_time":1754462316,"http_code":200,"src_unparsed":"com,prepbytes!\/blog\/bellman-ford-algorithm\/ s443","src_root_hash":"9901871993508497715","history_drop_reason":null,"meta_title":"Bellman Ford Algorithm","meta_descriptions":["The Bellman-Ford algorithm is a single-source shortest-path algorithm. Check here are the steps involved in the Bellman-Ford algorithm."],"meta_canonical":null,"ml_categories_json":"{\"\/Science\":698,\"\/Science\/Mathematics\":633,\"\/Computers_and_Electronics\":312,\"\/Computers_and_Electronics\/Software\":214,\"\/Computers_and_Electronics\/Software\/Educational_Software\":115}","ml_types_json":"{\"\/Article\":999,\"\/Article\/Tutorial_or_Guide\":972}","ml_intent_types_json":"{\"Informational\":999}","meta_language":"en-us","attrs_author":null,"attrs_publish_time":1679637980,"attrs_original_publish_time":1679637980,"attrs_is_republished":0,"attrs_nr_words":"3034","attrs_boilerpipe_nr_words":"2380","body_ext_links_number":4,"body_int_links_number":94,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":1,"src_redirect":"","download_time_msec":518,"download_ttfb_msec":393,"download_size":27827}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📍

LOCATION

Host 115 · Partition 88

laksa115

9901871993508497715

📄

INDEXABLE

✅

CRAWLED

3 months ago

🚫

ROBOTS BLOCKED

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	3.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://prepbytes.com/blog/bellman-ford-algorithm/

Last Crawled

2026-02-24 21:40:49 (3 months ago)

First Indexed

2025-08-06 06:38:36 (10 months ago)

HTTP Status Code

200

Content

Meta Title

Bellman Ford Algorithm

Meta Description

The Bellman-Ford algorithm is a single-source shortest-path algorithm. Check here are the steps involved in the Bellman-Ford algorithm.

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

/Science		69.8%
/Science/Mathematics		63.3%
/Computers_and_Electronics		31.2%
/Computers_and_Electronics/Software		21.4%
/Computers_and_Electronics/Software/Educational_Software		11.5%

Raw JSON

{
    "/Science": 698,
    "/Science/Mathematics": 633,
    "/Computers_and_Electronics": 312,
    "/Computers_and_Electronics/Software": 214,
    "/Computers_and_Electronics/Software/Educational_Software": 115
}

ML Page Types

/Article		99.9%
/Article/Tutorial_or_Guide		97.2%

Raw JSON

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

ML Intent Types

Informational

99.9%

Raw JSON

{
    "Informational": 999
}

Content Metadata

Language

en-us

Author

null

Publish Time

2023-03-24 06:06:20 (3 years ago)

Original Publish Time

2023-03-24 06:06:20 (3 years ago)

Republished

Word Count (Total)

3,034

Word Count (Content)

2,380

Links

External Links

Internal Links

Technical SEO

Meta Nofollow

Meta Noarchive

JS Rendered

Yes

Redirect Target

null

Performance

Download Time (ms)

518

TTFB (ms)

393

Download Size (bytes)

27,827

Location

Host ID

115 (laksa115)

Partition ID

Root Hash

9901871993508497715

Unparsed URL

com,prepbytes!/blog/bellman-ford-algorithm/ s443