{"as_of":"2026-08-20T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8936ded128f3936664817ef8fee729a28f13428999ad43e234541893996cebd8","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:12:09.139118Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T20:34:42.037125Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.05979","last_updated":"2024-10-16T14:25:09Z","snapshot_observed_at":"2026-08-16T15:25:07.250205Z","submitted_at":"2023-06-09T15:46:35Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05979","snapshot_observed_at":"2026-08-15T21:12:09.139118Z","title":"URL: http://arxiv.org/abs/2306","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.10789","last_updated":"2025-07-08T22:32:53Z","snapshot_observed_at":"2026-08-15T21:01:08.002469Z","submitted_at":"2025-05-16T02:03:04Z","title":"Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T21:12:09.139118Z"},"links":{"cited_paper":"/paper/2306.05979","citing_paper":"/paper/2505.10789"},"observation_digest":"sha256:107e232a31110850e5ae8b8597b0a1fe1722d62533760b86bd93b0e111cc60d6","observation_id":"43088184-9088-4720-acb5-3bb07d7be862","resolution":{"observed_at":"2026-08-15T21:12:09.139118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05979","last_updated":"2024-10-16T14:25:09Z","snapshot_observed_at":"2026-08-16T15:25:07.250205Z","submitted_at":"2023-06-09T15:46:35Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05979","snapshot_observed_at":"2026-08-07T05:29:34.645998Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-14T22:03:14.235477Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.645998Z"},"links":{"cited_paper":"/paper/2306.05979","citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:e9791f9129f44fcf72a587b855abb53ece46e7440a12f4dd085244b2bbc82400","observation_id":"3c24af9a-74e8-4676-afd0-7cca55b53131","resolution":{"observed_at":"2026-08-07T05:29:34.645998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05979","last_updated":"2024-10-16T14:25:09Z","snapshot_observed_at":"2026-08-16T15:25:07.250205Z","submitted_at":"2023-06-09T15:46:35Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","version":4},"cited_work":{"arxiv_id":"2306.05979","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.05979","snapshot_observed_at":"2026-08-06T20:34:42.037125Z","title":"Optimal distance query reconstruction for graphs without long induced cycles","venue":"cs.DS","work_id":"70899b42-39a4-4cad-b62f-572c4eaa9216","year":2023},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-17T21:37:09.896205Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.083523Z"},"links":{"cited_paper":"/paper/2306.05979","citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:d4b5d3aad05d95296032adb8e6a8fa0c323eb001559327e8de80d70b85ad6c17","observation_id":"516cef24-3337-4fdd-8876-ea33865def3b","resolution":{"observed_at":"2026-08-06T20:34:42.100188Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.05979/citation-record","integrity":"/paper/2306.05979/integrity","json":"/paper/2306.05979/citation-record.json","paper":"/paper/2306.05979"},"outbound":[],"paper":{"arxiv_id":"2306.05979","last_updated":"2024-10-16T14:25:09Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:25:07.250205Z","submitted_at":"2023-06-09T15:46:35Z","title":"Optimal distance query reconstruction for graphs without long induced cycles"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2306.05979."}