{"as_of":"2026-08-09T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:644ed1a8558334a47d00775fa3d8743fe33b9c261c19f29b994e6957793b51ef","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-09T06:31:02.800959+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-06T11:24:40.940358Z","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-06T11:24:41.014459Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.02514","last_updated":"2024-06-04T17:37:13Z","snapshot_observed_at":"2026-08-05T03:53:51.150890Z","submitted_at":"2024-06-04T17:37:13Z","title":"Approximate path decompositions of regular graphs","version":1},"cited_work":{"arxiv_id":"2406.02514","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.02514","snapshot_observed_at":"2026-08-06T11:24:41.014459Z","title":"Approximate path decompositions of regular graphs","venue":"math.CO","work_id":"dda12eea-82a3-43f6-98df-b98a88bb7e05","year":2024},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-09T09:35:11.537847Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.940358Z"},"links":{"cited_paper":"/paper/2406.02514","citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:bc9cc3744c2dbd11bc68827cb1823e01fd475793db7a4637c22e5c69d421844d","observation_id":"b283ab3a-36af-4621-8d3b-f81c1d5323aa","resolution":{"observed_at":"2026-08-06T11:24:41.020630Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.02514/citation-record","integrity":"/paper/2406.02514/integrity","json":"/paper/2406.02514/citation-record.json","paper":"/paper/2406.02514"},"outbound":[],"paper":{"arxiv_id":"2406.02514","last_updated":"2024-06-04T17:37:13Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-05T03:53:51.150890Z","submitted_at":"2024-06-04T17:37:13Z","title":"Approximate path decompositions of regular graphs"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:2406.02514."}