{"as_of":"2026-08-08T06:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19ad458812109c911720820eeca3889728f68332af7eb8db90c06e88aaad5451","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:51:34.595423Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.10017/citation-record","integrity":"/paper/2506.10017/integrity","json":"/paper/2506.10017/citation-record.json","paper":"/paper/2506.10017"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:51:34.207740Z","title":"Vehicle Interdiction Strategy in Complex Road Networks-A Simulation Based Approach","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10017","last_updated":"2025-06-27T06:20:24Z","snapshot_observed_at":"2026-08-07T16:02:33.626879Z","submitted_at":"2025-06-02T05:41:02Z","title":"Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:34.207740Z"},"links":{"citing_paper":"/paper/2506.10017"},"observation_digest":"sha256:7de88c8507fdfb26f85ca1a8794392261e59194607a8001f48a2d4b6e9b5c1cc","observation_id":"1f2da031-1872-4c91-9318-846771feb6df","resolution":{"observed_at":"2026-08-07T11:51:34.207740Z","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-07T11:51:34.896299Z","title":"Optimal escape interdiction on transportation networks","venue":null,"work_id":"f5994103-8547-4caa-9095-44580e85e3ab","year":2017},"citing_paper":{"arxiv_id":"2506.10017","last_updated":"2025-06-27T06:20:24Z","snapshot_observed_at":"2026-08-07T16:02:33.626879Z","submitted_at":"2025-06-02T05:41:02Z","title":"Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:34.265365Z"},"links":{"citing_paper":"/paper/2506.10017"},"observation_digest":"sha256:850f38d88faf1d0e3eaed3fd30209d93d97f873ab97be6e59a7a1f9995fc89e3","observation_id":"96335288-af59-465a-8bb5-70ff3634191a","resolution":{"observed_at":"2026-08-07T11:51:34.928086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:51:34.342372Z","title":"Computing the optimal strategy to com- mit to","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.10017","last_updated":"2025-06-27T06:20:24Z","snapshot_observed_at":"2026-08-07T16:02:33.626879Z","submitted_at":"2025-06-02T05:41:02Z","title":"Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:34.342372Z"},"links":{"citing_paper":"/paper/2506.10017"},"observation_digest":"sha256:e7fcb110df4aa8e00a7f62e2c41b4e370e961458bd08ea7a0df3055769d70519","observation_id":"e048d158-e595-4e4a-822b-85304abedad9","resolution":{"observed_at":"2026-08-07T11:51:34.342372Z","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-07T11:51:34.800722Z","title":"A literature review on police patrolling problems","venue":null,"work_id":"f49c46c6-d7ed-4b4a-9cf4-70cbb2f4ee07","year":2022},"citing_paper":{"arxiv_id":"2506.10017","last_updated":"2025-06-27T06:20:24Z","snapshot_observed_at":"2026-08-07T16:02:33.626879Z","submitted_at":"2025-06-02T05:41:02Z","title":"Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:34.433029Z"},"links":{"citing_paper":"/paper/2506.10017"},"observation_digest":"sha256:d24e8cb3a3667c93c9b36f5f2199f63b3c69f3e5f7af553889200d8666867526","observation_id":"13993231-1c31-44b4-9332-4825073ebf9c","resolution":{"observed_at":"2026-08-07T11:51:34.853896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:51:34.527866Z","title":"Discovering influential nodes for SIS models in social networks","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.10017","last_updated":"2025-06-27T06:20:24Z","snapshot_observed_at":"2026-08-07T16:02:33.626879Z","submitted_at":"2025-06-02T05:41:02Z","title":"Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:34.527866Z"},"links":{"citing_paper":"/paper/2506.10017"},"observation_digest":"sha256:ecd72febf62911ab3b99550ca0ccfbb80bb3153205a4093c15cc0ec9d824899c","observation_id":"d880902e-0636-49da-a44f-987434bbc3e6","resolution":{"observed_at":"2026-08-07T11:51:34.527866Z","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-07T11:51:34.668571Z","title":"Assessing vehicle interdiction strategies on a complex transportation network: A simulation-based study","venue":null,"work_id":"a333b92f-93f1-4778-b3af-37f04e7904d5","year":2024},"citing_paper":{"arxiv_id":"2506.10017","last_updated":"2025-06-27T06:20:24Z","snapshot_observed_at":"2026-08-07T16:02:33.626879Z","submitted_at":"2025-06-02T05:41:02Z","title":"Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:34.595423Z"},"links":{"citing_paper":"/paper/2506.10017"},"observation_digest":"sha256:833aacd5df3cd0ea1cb028545b9dcd3b3fd065005cb4cbe176ced69082c07e48","observation_id":"0a3a1356-5bf5-4112-9fa2-2fb12e6100d2","resolution":{"observed_at":"2026-08-07T11:51:34.735580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.10017","last_updated":"2025-06-27T06:20:24Z","latest_version":3,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-07T16:02:33.626879Z","submitted_at":"2025-06-02T05:41:02Z","title":"Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":6},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2506.10017."}