🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 152 (from laksa013)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa152.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 = 23 AND (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://brilliant.org/wiki/bellman-ford-algorithm/\')), getAhrefsUnparsedNoserviceFromURL(\'https://brilliant.org/wiki/bellman-ford-algorithm/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/brilliant.org\/wiki\/bellman-ford-algorithm\/","crawl_time":1778955002,"first_indexed_time":1462822936,"http_code":200,"src_unparsed":"org,brilliant!\/wiki\/bellman-ford-algorithm\/ s443","src_root_hash":"15741013377293584752","history_drop_reason":null,"meta_title":"Bellman-Ford Algorithm | Brilliant Math & Science Wiki","meta_descriptions":["The Bellman-Ford algorithm is a graph search algorithm that finds the shortest path between a given source vertex and all other vertices in the graph. This algorithm can be used on both weighted and unweighted graphs. Like Dijkstra's shortest path algorithm, the Bellman-Ford algorithm is guaranteed to find the shortest path in a graph. Though it is slower than Dijkstra's algorithm, Bellman-Ford is capable of handling graphs that contain negative edge weights, so it …"],"meta_canonical":null,"ml_categories_json":"{\"\/Science\":765,\"\/Science\/Mathematics\":636,\"\/Science\/Mathematics\/Other\":484,\"\/Computers_and_Electronics\":258,\"\/Computers_and_Electronics\/Software\":173,\"\/Computers_and_Electronics\/Software\/Educational_Software\":123}","ml_types_json":"{\"\/Article\":998,\"\/Article\/Wiki\":401}","ml_intent_types_json":"{\"Informational\":999}","meta_language":"en-us","attrs_author":null,"attrs_publish_time":0,"attrs_original_publish_time":1462822936,"attrs_is_republished":0,"attrs_nr_words":"2173","attrs_boilerpipe_nr_words":"1574","body_ext_links_number":0,"body_int_links_number":15,"meta_nofollow":0,"meta_noarchive":0,"props_was_rendered":0,"src_redirect":"","download_time_msec":169,"download_ttfb_msec":168,"download_size":11776}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📍

LOCATION

Host 152 · Partition 23

laksa152

15741013377293584752

📄

INDEXABLE

✅

CRAWLED

17 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.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://brilliant.org/wiki/bellman-ford-algorithm/

Last Crawled

2026-05-16 18:10:02 (17 days ago)

First Indexed

2016-05-09 19:42:16 (10 years ago)

HTTP Status Code

200

Content

Meta Title

Bellman-Ford Algorithm | Brilliant Math & Science Wiki

Meta Description

The Bellman-Ford algorithm is a graph search algorithm that finds the shortest path between a given source vertex and all other vertices in the graph. This algorithm can be used on both weighted and unweighted graphs. Like Dijkstra's shortest path algorithm, the Bellman-Ford algorithm is guaranteed to find the shortest path in a graph. Though it is slower than Dijkstra's algorithm, Bellman-Ford is capable of handling graphs that contain negative edge weights, so it …

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		76.5%
/Science/Mathematics		63.6%
/Science/Mathematics/Other		48.4%
/Computers_and_Electronics		25.8%
/Computers_and_Electronics/Software		17.3%
/Computers_and_Electronics/Software/Educational_Software		12.3%

Raw JSON

{
    "/Science": 765,
    "/Science/Mathematics": 636,
    "/Science/Mathematics/Other": 484,
    "/Computers_and_Electronics": 258,
    "/Computers_and_Electronics/Software": 173,
    "/Computers_and_Electronics/Software/Educational_Software": 123
}

ML Page Types

/Article		99.8%
/Article/Wiki		40.1%

Raw JSON

{
    "/Article": 998,
    "/Article/Wiki": 401
}

ML Intent Types

Informational

99.9%

Raw JSON

{
    "Informational": 999
}

Content Metadata

Language

en-us

Author

null

Publish Time

not set

Original Publish Time

2016-05-09 19:42:16 (10 years ago)

Republished

Word Count (Total)

2,173

Word Count (Content)

1,574

Links

External Links

Internal Links

Technical SEO

Meta Nofollow

Meta Noarchive

JS Rendered

Redirect Target

null

Performance

Download Time (ms)

169

TTFB (ms)

168

Download Size (bytes)

11,776

Location

Host ID

152 (laksa152)

Partition ID

Root Hash

15741013377293584752

Unparsed URL

org,brilliant!/wiki/bellman-ford-algorithm/ s443