{"as_of":"2026-08-23T19:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8db21c3b8db67f78696a970f7c7b2d6bfd1f344ca9bcc1c4ed815cf36991af96","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T19:31:54.212171Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T16:20:11.626377Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.17005","snapshot_observed_at":"2026-07-30T16:20:11.626377Z","title":"Provably good prim–dijkstra revisited: New theory and a practical algorithm for a classical vlsi routing problem with llms,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23672","last_updated":"2026-07-26T14:09:58Z","snapshot_observed_at":"2026-08-04T02:19:34.439693Z","submitted_at":"2026-07-26T14:09:58Z","title":"Rethinking Logic Optimization Operators: Theory-Derived Operator Compression via Agentic Source Analysis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-30T16:20:11.626377Z"},"links":{"cited_paper":"/paper/2607.17005","citing_paper":"/paper/2607.23672"},"observation_digest":"sha256:efe39cdbb8d4c1b3e937fc7b020e2946967dbb45b632ca973a165a9404ce0434","observation_id":"5c936114-c9f1-457f-91ab-a0d842ebc4b9","resolution":{"observed_at":"2026-07-30T16:20:11.626377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.17005/citation-record","integrity":"/paper/2607.17005/integrity","json":"/paper/2607.17005/citation-record.json","paper":"/paper/2607.17005"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3177540","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Alpert, Wing-Kai Chow, Kwangsoo Han, Andrew B","venue":null,"work_id":"6fd2cb39-251a-47aa-9eca-2fd08e78e767","year":2018},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:50.912680Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:2b6b367e505cdf4774c2b291584822af5cec6f960649d699f44af78af3fdf7f1","observation_id":"9300d712-ad1d-4bb4-9507-7ee574074e84","resolution":{"observed_at":"2026-08-01T19:33:28.412277Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/43.391737","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Alpert, T","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","work_id":"b2192275-e7f0-4385-b5e6-877423ec6ef8","year":1995},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:51.018581Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:6ce465c6c422acb487a25c296b8adbabe5e57b1e1ae4f508020a58dccd55067c","observation_id":"dd23d261-7bef-4b91-aeda-1cd5e2104725","resolution":{"observed_at":"2026-08-01T19:33:28.278924Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10898-023-01295-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Carvalho and Amadeu A","venue":"Journal of Global Optimization","work_id":"57f85228-9ff9-4761-8844-2fcdfcb75296","year":2023},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:51.127815Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:e031c0a5f02b01e2981e05bfc05f4e4ee4bb6889997ce7ce741f88cecceae5a3","observation_id":"20f5dc27-4aba-4e15-aecf-e363c1c8c151","resolution":{"observed_at":"2026-08-01T19:33:28.047098Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:51.282843Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:51.282843Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:1e038dcec3da473617ac6c94fb00058a09509fe5bfd0d632e959b86898185bdc","observation_id":"0b329a5a-0263-445a-acdd-74aa39d98cc2","resolution":{"observed_at":"2026-08-01T19:31:51.282843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s0218195913500052","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"International Journal of Computational Geometry & Applications","work_id":"9d27fc82-aa30-44bc-8d3a-876020d7e3c7","year":2013},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:51.496790Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:380fb42aea2b6b99bb082a583c9676ed653843789c74e8e47c10e8b73ce669c2","observation_id":"e2b968cb-b8a8-4f7e-8604-438ae0847aa0","resolution":{"observed_at":"2026-08-01T19:33:27.784562Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/43.137519","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kahng, Gabriel Robins, Majid Sarrafzadeh, and C","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","work_id":"94b2befb-b0eb-43a4-92fa-350050b832a5","year":1992},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:51.725359Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:e71035e3224bd5fd4cea25b2f1086ab279a2613ae5d8455a39572d66363dd3e6","observation_id":"eca06092-441e-437f-95f0-e2bb03b11891","resolution":{"observed_at":"2026-08-01T19:33:27.556972Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3587044","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM Transactions on Design Automation of Electronic Systems","work_id":"934f18cd-c44e-4486-8398-fedf077e82ab","year":2023},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:51.888656Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:aee7d759233f8e3ccf14e3cee2a036def99f5c70a615c1dac037cf1c5731ea1b","observation_id":"ec32cbaf-8a7b-4071-89a1-50b8f33fe808","resolution":{"observed_at":"2026-08-01T19:33:27.361722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.038707Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.038707Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:6a51f6dbba3ef631d853e198ff0e65de9d3b632f566d2ddb648d0483973a1cd5","observation_id":"a760cf9b-d2a1-4608-aa87-5f6d114339a3","resolution":{"observed_at":"2026-08-01T19:31:52.038707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.193976Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.193976Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:4820f0a040ec973eaf5ae2a004ff8be0f2f017bb67a03f236da44c07c6ab6fab","observation_id":"cce9d300-1673-455c-b68d-c2db20248dca","resolution":{"observed_at":"2026-08-01T19:31:52.193976Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.282952Z","title":"Garey and David S","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.282952Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:4f26e181f8a93bf85bee522164aa8460ee4ea693cabd34ad265780f6cc483865","observation_id":"b917c4e9-5476-4ac3-b965-a6890a2dbefe","resolution":{"observed_at":"2026-08-01T19:31:52.282952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.372478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.372478Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:61c99edd7feba961ed2882eb48b1e9514b569552280d1660d333a9a5026bb8b0","observation_id":"6871a7be-6417-4233-ae9a-c0ed829227c5","resolution":{"observed_at":"2026-08-01T19:31:52.372478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.457765Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.457765Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:059d669bfeb307cd7ad4b2b1ff3250f6a19e2fa744ede4d7eac145b0ab89242f","observation_id":"4c266ed7-f855-477c-8da5-16095af5c7bf","resolution":{"observed_at":"2026-08-01T19:31:52.457765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.591364Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.591364Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:7bc62feb335b08739692c0b4793cf833850eeef262156edd0f7bed6e665adc38","observation_id":"0390739e-a366-4402-a6a8-aad2778cef5e","resolution":{"observed_at":"2026-08-01T19:31:52.591364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.732441Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.732441Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:8548a0f8d3aeb72522716e6772f83d92898a70e21dd525db285e37bf95633e08","observation_id":"5362316d-3529-41b3-a7fb-042ee90a4ab8","resolution":{"observed_at":"2026-08-01T19:31:52.732441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0220060","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Computing","work_id":"013b4d71-084c-4dd7-83ed-21ce460058cc","year":1991},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.868846Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:82cf61cf72bfa2aecd92a601161cc7fe615e9cc69b81feae428dd6275e6ce3ea","observation_id":"f35da3a3-f011-4cb0-b1fc-ee6e0081e41e","resolution":{"observed_at":"2026-08-01T19:33:27.108975Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:52.957163Z","title":"Kahng, Shreyas Thumathy, and Mingyu Woo","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:52.957163Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:8c3b63c0193fe056e96a6a1f6667939b63ba717d64eb2487aa92f91c569f281c","observation_id":"30583b7c-3e9c-4882-b565-e5d76f40ad37","resolution":{"observed_at":"2026-08-01T19:31:52.957163Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-80879-2_13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"8ceab22f-1ab3-4829-986d-0dcec016c8e4","year":2021},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.057050Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:d41982ff01ba9a7ae95df7456722e074a9ddbcb35b2f82b5dfc3145712491714","observation_id":"6184c40f-78cf-48db-86dc-516e15af7dbf","resolution":{"observed_at":"2026-08-01T19:33:26.838885Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:53.154424Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.154424Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:ed3edb05ec2a92423df276e0284530a3eff7a92cc4355f68c66ff56761a7219c","observation_id":"426238bc-12cc-4f1a-a652-5fb465e1add9","resolution":{"observed_at":"2026-08-01T19:31:53.154424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.socg.2026.71","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tóth, and Tianyi Zhang","venue":"ArXiv.org","work_id":"8d1649aa-643f-4e26-b854-d48a8ab6a837","year":2026},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.225084Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:24f60fb077b9c56f23daf19f905b51bd17c95deceac6f9c3f6ba773093036c39","observation_id":"f84a8916-9d37-4855-9691-88abbbb0a003","resolution":{"observed_at":"2026-08-01T19:33:26.483656Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/050629665","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Computing","work_id":"fb2e8e25-fe11-4898-9400-2e462ec15a1f","year":2008},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.322964Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:b810dc787c092e5617559895659cbe70175839efc14e8de9ccf428e79c838085","observation_id":"494fcc64-8751-48e7-a879-0919665fa407","resolution":{"observed_at":"2026-08-01T19:33:26.280457Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0167-9260(97)00009-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Integration","work_id":"1d9c3d2d-bbeb-4861-bf8e-6e5109fd35bc","year":1997},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.424069Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:007ed249fbad9d6bb8a7acfc54c090679f1110d8f30dc3126ec1518157eee850","observation_id":"7d3e8945-4cd0-4419-9863-4be4ae5e7a61","resolution":{"observed_at":"2026-08-01T19:33:25.936371Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:53.497188Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.497188Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:ab4329b4e04bea53ac952841875ce22d9ca3c89edfad9e3f1e382978c6a8163d","observation_id":"1d74d00a-2394-4963-b24d-bd62566c18d6","resolution":{"observed_at":"2026-08-01T19:31:53.497188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:53.582690Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.582690Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:eaac68e2b5c047adfb1174f9c09faa68b314ae1f2c3253449448f51748780d6d","observation_id":"b1413b81-9eba-43e7-9878-df65af20c24a","resolution":{"observed_at":"2026-08-01T19:31:53.582690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:53.647434Z","title":"Salama, Douglas S","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.647434Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:7ab24ced4748627aff6abe86c76a80ced94158270b6dda1b21df375b82760b94","observation_id":"c79c8fcb-fff2-49dd-b1fd-6c25ddfe5307","resolution":{"observed_at":"2026-08-01T19:31:53.647434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-10631-6_30","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"7a94bb62-770b-4dca-8c7e-ccb072063ebb","year":2009},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.747133Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:421fd5521286860e9de67ade25c5f8f44422faea0e54fec140cff31bd7b60acc","observation_id":"7b676d2d-7eeb-424f-bb9f-be6568ba8999","resolution":{"observed_at":"2026-08-01T19:33:25.644172Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:53.848012Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.848012Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:51778239be3b9bea1dc21273305be0978065312e492e05f025e6374ffd85d0bf","observation_id":"47c4bca9-e717-4319-abc2-7f546c7a155a","resolution":{"observed_at":"2026-08-01T19:31:53.848012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.07779","last_updated":"2026-07-08T17:46:36Z","snapshot_observed_at":"2026-07-12T23:17:59.879344Z","submitted_at":"2026-07-08T17:46:36Z","title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.07779","snapshot_observed_at":"2026-08-01T19:31:53.915839Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.915839Z"},"links":{"cited_paper":"/paper/2607.07779","citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:45c2b54a161cff4b56c1a4fa590837b9010511995d10a99885fbd26d2b0c67fe","observation_id":"c90a1538-8087-4d71-9988-ad50a5615d94","resolution":{"observed_at":"2026-08-01T19:31:53.915839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:53.976002Z","title":"Trinh, Yuhuai Wu, Quoc V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:53.976002Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:441fa3d5403c98ac88dabb72679d2401367de3c7438cfaf0e526bfea53de9084","observation_id":"644e9f33-f12c-417c-9988-1c8e0f7bafc3","resolution":{"observed_at":"2026-08-01T19:31:53.976002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:54.045110Z","title":"Prenger, and Animashree Anandkumar","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:54.045110Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:1389e181f5778d9d78d2ddebe2dbdea4592a13915bc05764fe6ef91946bf5e9b","observation_id":"fa8f3fa3-2ca0-425f-a5e0-9b22f8581fcf","resolution":{"observed_at":"2026-08-01T19:31:54.045110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:54.143829Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:54.143829Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:b1b8ef49d9b7f7d1a7b38fa8a967798896db85cacf115ce325b2c3c7f3b14727","observation_id":"cf1a7944-6b10-41fa-ab03-95dd0e554569","resolution":{"observed_at":"2026-08-01T19:31:54.143829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:31:54.212171Z","title":"Construction only","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T19:31:54.212171Z"},"links":{"citing_paper":"/paper/2607.17005"},"observation_digest":"sha256:a6bee93efe79312c5b137334b51eaab034f041908e8242f83d2f5a68659e2476","observation_id":"239727db-8cfc-4568-b7e1-93289f6a10d7","resolution":{"observed_at":"2026-08-01T19:31:54.212171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17005","last_updated":"2026-07-18T23:42:59Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-17T19:51:59.216354Z","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":12,"verified_fuzzy":0},"total_outbound_references":31},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2607.17005."}