{"as_of":"2026-08-10T18:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49b0c7ae69b437eb7dbec7f0f8525803adc9ced27f9ac3f45b5df3184cf6af70","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T23:33:34.783367Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2501.18496/citation-record","integrity":"/paper/2501.18496/integrity","json":"/paper/2501.18496/citation-record.json","paper":"/paper/2501.18496"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.388561Z","title":"In: Structural Information an d Communication Com- plexity - 31st International Colloquium, SIROCCO 2024","venue":null,"work_id":"6c9990ba-10e7-499b-aa6d-4a9fd3d54714","year":2024},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.485005Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:aa03e97e8da18db10a00da92712c6e27eeb59b9777f599182d915e1dc12cc59d","observation_id":"85b6e801-240b-43e7-bb34-aa3ccc5e7984","resolution":{"observed_at":"2026-08-09T23:33:35.445277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.331534Z","title":"Algorithmica 29(4), 560–581 (2001)","venue":null,"work_id":"8529b9ed-1ea7-433b-9107-a9a570577a53","year":2001},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.489989Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:3151cc98c4b03251234a94385a86e47116f0e30129b1783aca65b05e337d30eb","observation_id":"8c932583-64c0-41a4-8b85-ee90e5ed4828","resolution":{"observed_at":"2026-08-09T23:33:35.335026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.319701Z","title":"In: Proceedings of the 53rd Annual ACM SIGACT Symposiu m on Theory of Computing","venue":null,"work_id":"2a2a32dc-0906-4324-bc87-cf473cf1232b","year":2021},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.493647Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:a7fbcc0181149a58f748efd000e49d3d73c87e8af539a517c8c815789791abfb","observation_id":"6938d987-634d-47ea-a0ad-6ea448d04b49","resolution":{"observed_at":"2026-08-09T23:33:35.323836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.252618Z","title":"In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022","venue":null,"work_id":"2c731a93-daf2-464a-8304-f96f8b46b765","year":2022},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.497198Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:6c15909e2c64f3db52d9e75cb1729d6a6af82066f48e2379b15e4c241d8bf8ff","observation_id":"13c696c7-34bb-4d76-9c1b-aa92e489387f","resolution":{"observed_at":"2026-08-09T23:33:35.312951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.170367Z","title":"In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022)","venue":null,"work_id":"0797b273-4013-4912-85ab-6802c86f2be3","year":2022},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.500868Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:3441d2462b6b232ffc0faa7e185bd2fcca28d15402e33f96df58b1d6ce07cdff","observation_id":"96e1d4d3-a713-4d45-a0f1-991b07cb6ce1","resolution":{"observed_at":"2026-08-09T23:33:35.209035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.148880Z","title":"In: 31st Annual European Symposium on Algo rithms, ESA 2023","venue":null,"work_id":"3ccad171-1cf6-4d74-aeef-7238bec4a0f4","year":2023},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.504749Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:62e2d4bd712cec6f8b772eb7d3f20440689170340cc5c4210491d7da7b88740c","observation_id":"b9a035ca-6b8c-419b-9e87-e8ab12acd7c6","resolution":{"observed_at":"2026-08-09T23:33:35.153039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.135498Z","title":"In: 31st Annual European Symposium o n Algorithms (ESA 2023)","venue":null,"work_id":"84989eff-2b89-4a05-aa46-6590988f1b77","year":2023},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.508493Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:9b582e6f17c057c1ed9eba712047072aa739f512cfd7512f72cc7f064e951a8e","observation_id":"69b24986-d0f3-49a3-8d68-2078c57a0c9f","resolution":{"observed_at":"2026-08-09T23:33:35.140518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/opre.16.3.538","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Opera- tions Research 16(3), 538–558 (1968)","venue":"Operations Research","work_id":"4bd66379-e04c-4519-8c6c-502419ccc7f0","year":1968},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.512159Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:77f67864112b23b62d9b403f6183d229c7b78f98cb3c609f91e2ad8f53a959ce","observation_id":"6715f639-51af-4f8d-8a8f-1e15704c3436","resolution":{"observed_at":"2026-08-09T23:33:34.817188Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.123357Z","title":"Theoretical Computer Scie nce 868 (2021)","venue":null,"work_id":"4f13dcff-94e2-4337-b350-2982cccef24c","year":2021},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.516567Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:808294c36d67de4187716f42a118a817ee82fe70f03f241b6f02d6a8ccd9f2a9","observation_id":"1c2573c3-5861-47f9-a897-1fd47096ce07","resolution":{"observed_at":"2026-08-09T23:33:35.127813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.110303Z","title":"In- formation and Computation 289(Part A) (2022)","venue":null,"work_id":"c2759d70-3b65-4730-a686-edf42563099f","year":2022},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.520489Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:2ea1521ba05d9421913ef36b6ae7aa0ade016dee085e575242ae7b0c44c6b97c","observation_id":"ecf6e20c-3981-409b-8a39-7d887d4ceb7e","resolution":{"observed_at":"2026-08-09T23:33:35.114265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.098637Z","title":": The online knapsack problem: Advice and randomization","venue":null,"work_id":"6dab93fc-fc7e-4844-89e5-f781c854f697","year":2014},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.523877Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:49bf4396f5ceecb9d84ff72894e037255a45a604b098b0b79b524edaae6cc5c9","observation_id":"d0e914e6-1609-488c-b7ce-7cf980667599","resolution":{"observed_at":"2026-08-09T23:33:35.102635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.088959Z","title":"Cam- bridge University Press (1998)","venue":null,"work_id":"f0b606e2-72ce-4ceb-8545-2670e87bb21d","year":1998},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.527516Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:1577c093817bda9fbe656f76d8cc1d8a2b5fa406a7498a6c393585cbda09bb9f","observation_id":"e4f10b5d-18ae-4687-bba1-58316ec58a42","resolution":{"observed_at":"2026-08-09T23:33:35.092458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.078657Z","title":": Online graph exploration on a restricted graph class: Optimal solutions for tadpole g raphs","venue":null,"work_id":"abe988de-6a17-4d0e-8300-47af6d809f6a","year":2020},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.531045Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:74952c5acb9600ae3c1a860246246eab0fe3e0e7eed5c5f5211c4d56a18f93e2","observation_id":"b64029ed-9bc7-4a60-ae7c-51972cb7603f","resolution":{"observed_at":"2026-08-09T23:33:35.081935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.069087Z","title":"Carnegie Mellon University 3, 10 (03 2022)","venue":null,"work_id":"c2fab861-38e3-4cdd-bd60-e7f25772f778","year":2022},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.534803Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:d22f6af4befba8c77f7a53ced4fa4be01f2f8713954758c7edad0d66ef4b782e","observation_id":"a123a218-37d5-4077-8785-42f247dc5b7d","resolution":{"observed_at":"2026-08-09T23:33:35.072680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.060012Z","title":null,"venue":null,"work_id":"c12ee903-1c8f-4c1e-aa40-fd1230e24dbd","year":1954},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.538276Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:4a7f36baf3afe381f38e5e186b143a1f3b5cb3fb28b33e4ea38ea4e6641daade","observation_id":"a12412ec-5184-479b-b64c-3226dffd5565","resolution":{"observed_at":"2026-08-09T23:33:35.063164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.049745Z","title":"In: Structural Information and Communication Complexity - 19t h International Col- loquium, SIROCCO 2012","venue":null,"work_id":"4ca66862-f812-48d5-9b56-2e7facd08836","year":2012},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.541811Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:884cb1d0b6bc829322d1ff33dc3d44e38f62b84f33db607703451816ca7e8426","observation_id":"a02c4d70-f023-4561-8cb3-17e0ce908398","resolution":{"observed_at":"2026-08-09T23:33:35.053838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:35.036886Z","title":"Proceedings of the AAA I Conference on Artificial Intelligence 36(9) (2022)","venue":null,"work_id":"b0910c8d-8168-4ebd-8309-8ab8f8720f0d","year":2022},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.559875Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:19290fe3f6de036a30ae182625b313a20495730fc52db25c6805792adf26c167","observation_id":"bbeda409-dd2d-4b76-a0a9-a68b8717284f","resolution":{"observed_at":"2026-08-09T23:33:35.043411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.983652Z","title":"In: 41st International Symposium on Theoreti cal Aspects of Computer Science (STACS 2024)","venue":null,"work_id":"8495c1db-50a1-47a0-ad14-6a0e123d0804","year":2024},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.604365Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:45fb421e29396d7c0866e4481053288c5058074b7c522070e4e94f31bf91f170","observation_id":"4167e911-ee58-4283-90c5-85fdf39ec454","resolution":{"observed_at":"2026-08-09T23:33:35.006324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.969317Z","title":"Theoretical Computer Science 130(1) (1994)","venue":null,"work_id":"1f8e8f25-0674-4cd3-bd18-8889c60ae6cd","year":1994},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.645778Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:9ccd2b3c2a8e3c40c92cdf7e81e3d06fa6e7825b6d4dd280a7f413ab8d1ea447","observation_id":"4d2dd13b-fb03-409b-9f00-a1e15f07e387","resolution":{"observed_at":"2026-08-09T23:33:34.972931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.959210Z","title":"In: Khuller, S., Williams, V.V","venue":null,"work_id":"f9ae29f5-a6f2-48c8-a8ba-2cbaca049e63","year":2021},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.660420Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:06d0912a6c4f3cc4bb5ac08c5b1530a1c56e4d6b04fb326640ed5851bba2a6d2","observation_id":"36506ce4-62c0-4b8b-823f-75147adf3d4d","resolution":{"observed_at":"2026-08-09T23:33:34.962746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.923246Z","title":"Springer US (1972)","venue":null,"work_id":"4091fe1a-205f-4fe6-a350-9edf6c7d3eee","year":1972},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.680226Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:edf1a6a581bf6544748b0fe77914d3ee8c9cd1f77a72f1f7956356bda43ea23e","observation_id":"880fe4a2-ad23-4634-b6ab-e98bdd7e398d","resolution":{"observed_at":"2026-08-09T23:33:34.936741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.911561Z","title":"Texts in Theoretical Computer Science","venue":null,"work_id":"1ebab060-7d4b-46bd-9a50-9b1b661d0f10","year":2016},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.698730Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:522fa775ac7075071009aa0135c2817d31352879cdd8ad82aeeea29d474d596a","observation_id":"ac06607a-3fee-4650-8d3e-fb5e8dfd3b43","resolution":{"observed_at":"2026-08-09T23:33:34.916106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04147","last_updated":"2023-03-01T14:20:45Z","snapshot_observed_at":"2026-08-09T11:49:16.608328Z","submitted_at":"2023-03-01T14:20:45Z","title":"Heuristics for Vehicle Routing Problem: A Survey and Recent Advances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04147","snapshot_observed_at":"2026-08-09T23:33:34.718023Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.718023Z"},"links":{"cited_paper":"/paper/2303.04147","citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:14a61815eff0130d86e2e3044890459cb9c4077106d99cc75e32cb972356bc24","observation_id":"d11b7e83-beba-4e85-95e0-577f124c3b0c","resolution":{"observed_at":"2026-08-09T23:33:34.718023Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.900619Z","title":"In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","venue":null,"work_id":"bea38a54-0f84-4c50-be92-b225c42e9395","year":1988},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.736133Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:d35266c5d177640f2b8e2881e1b6e2eb1e47e4dd69f576054fc1fd75aaea4c57","observation_id":"386c27b2-b8f7-4918-be78-d2fb289a0912","resolution":{"observed_at":"2026-08-09T23:33:34.904439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.889746Z","title":"Theoretical Computer Science 463 (2012)","venue":null,"work_id":"260e45eb-4734-4c80-8011-fce77e34f7b7","year":2012},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.755132Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:e577ffb5b5180902e8c6395be54cbb277c800cdc7efeaeeac3e031336e01c202","observation_id":"e6399df2-be18-40a0-8262-783d7dda244d","resolution":{"observed_at":"2026-08-09T23:33:34.894173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.878156Z","title":"IEICE Trans","venue":null,"work_id":"79bf256f-9f77-40bb-a2b4-5c0f7f311914","year":2009},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.768902Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:180741c880e62406026d53d684cd324d1c7d788f68fcbc91a73788eba357ce87","observation_id":"3f959c12-a504-47de-935d-71e6922866fe","resolution":{"observed_at":"2026-08-09T23:33:34.881876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.868074Z","title":"In: Advances in Neural Information Processing Syste ms","venue":null,"work_id":"b8cb8fa8-91e8-477b-b7a4-616582eb8556","year":2018},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.772435Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:9e0cb13b90d5d96bb117f3d7094b39e29c7b799bb8e363b4751f05cac0b1b727","observation_id":"3ebdcff4-21b0-4a55-af2e-4fc4f1c50b0b","resolution":{"observed_at":"2026-08-09T23:33:34.871211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.856288Z","title":"SIAM Journal on Computi ng 6(3) (1977)","venue":null,"work_id":"9a3b2823-c4f4-4ef7-ad35-4cf0ad5f2802","year":1977},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.775972Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:f5daa541705a6cdd1800338c7b63c7712ae01f4f32ba8c749839e1d020b76e32","observation_id":"7382f121-e42b-4d71-9e03-77da479dec12","resolution":{"observed_at":"2026-08-09T23:33:34.860063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.845770Z","title":"In: Dis- crete Optimization, Handbooks in Operations Research and M anagement Science, vol","venue":null,"work_id":"838953bd-2ec1-4199-add6-a29ece5a159e","year":2005},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.779754Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:a25196246f065f6b613252b80296a81a1c001c5b304f62fd4909072f685a6c6d","observation_id":"0a21bea4-61c5-43cd-9511-b08fa8a45a31","resolution":{"observed_at":"2026-08-09T23:33:34.849792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:33:34.835386Z","title":"In: DeMillo, R.A","venue":null,"work_id":"58d11d33-4e9a-4cc1-9dd1-62b6bd70ea19","year":1984},"citing_paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T23:33:34.783367Z"},"links":{"citing_paper":"/paper/2501.18496"},"observation_digest":"sha256:c221746331704e257220591d092ba407138291c0558b2d1318c593d20e763479","observation_id":"83a36d04-fa3c-4cf7-b468-2ea3c9a48e78","resolution":{"observed_at":"2026-08-09T23:33:34.838960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.18496","last_updated":"2025-01-30T17:08:12Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T23:13:58.523550Z","submitted_at":"2025-01-30T17:08:12Z","title":"Graph Exploration with Edge Weight Estimates"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":30},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2501.18496."}