{"as_of":"2026-08-09T03:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a3fe6df23aaeb372301c919170dd0bccfd2482431a63b22307ca9a101b5d0ffe","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-08-06T20:34:40.990096Z","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:41.579460Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.18318","last_updated":"2024-07-29T20:13:20Z","snapshot_observed_at":"2026-07-06T18:06:44.995721Z","submitted_at":"2024-04-28T21:04:46Z","title":"Reconstructing random graphs from distance queries","version":2},"cited_work":{"arxiv_id":"2404.18318","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.18318","snapshot_observed_at":"2026-08-06T20:34:41.579460Z","title":"Reconstructing random graphs from distance queries","venue":"math.CO","work_id":"88b6025e-48cd-437f-aa0e-d6c24b36c621","year":2024},"citing_paper":{"arxiv_id":"2507.03151","last_updated":"2025-07-03T20:13:05Z","snapshot_observed_at":"2026-08-06T20:14:44.058080Z","submitted_at":"2025-07-03T20:13:05Z","title":"Complexity of learning matchings and half graphs via edge queries","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T20:34:40.990096Z"},"links":{"cited_paper":"/paper/2404.18318","citing_paper":"/paper/2507.03151"},"observation_digest":"sha256:bc31f697e396a49ebf41cf1202a03d281485cbb6f30ac9b7f44f7b92c6174151","observation_id":"e817088c-e51b-4e1e-ae0b-b666ff4631a8","resolution":{"observed_at":"2026-08-06T20:34:41.652505Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2404.18318/citation-record","integrity":"/paper/2404.18318/integrity","json":"/paper/2404.18318/citation-record.json","paper":"/paper/2404.18318"},"outbound":[],"paper":{"arxiv_id":"2404.18318","last_updated":"2024-07-29T20:13:20Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T18:06:44.995721Z","submitted_at":"2024-04-28T21:04:46Z","title":"Reconstructing random graphs from distance queries"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.18318."}