{"as_of":"2026-08-19T22:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1be3693c2b037317c9637734b5df082f877af7c2e686565c0ee69142ab76bd7","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:12:39.768634Z","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-10T15:27:10.182415Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.03185","last_updated":"2023-11-06T15:25:13Z","snapshot_observed_at":"2026-08-19T10:12:01.942351Z","submitted_at":"2023-11-06T15:25:13Z","title":"Spanning trees in pseudorandom graphs via sorting networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03185","snapshot_observed_at":"2026-08-11T00:12:39.768634Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.19756","last_updated":"2025-02-12T12:34:50Z","snapshot_observed_at":"2026-08-17T02:32:14.423715Z","submitted_at":"2024-12-27T17:35:47Z","title":"Tree tilings in random regular graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T00:12:39.768634Z"},"links":{"cited_paper":"/paper/2311.03185","citing_paper":"/paper/2412.19756"},"observation_digest":"sha256:c2f52403884f6dcd97e283da52d3639c3f227f088e3d1f29e1cb31fad2b12e0a","observation_id":"accf5294-0e2c-4fa2-b0c2-c6e874e83930","resolution":{"observed_at":"2026-08-11T00:12:39.768634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03185","last_updated":"2023-11-06T15:25:13Z","snapshot_observed_at":"2026-08-19T10:12:01.942351Z","submitted_at":"2023-11-06T15:25:13Z","title":"Spanning trees in pseudorandom graphs via sorting networks","version":1},"cited_work":{"arxiv_id":"2311.03185","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.03185","snapshot_observed_at":"2026-08-10T15:27:10.182415Z","title":"Spanning trees in pseudorandom graphs via sorting networks","venue":"math.CO","work_id":"24a3c7d3-ec0b-4053-b397-3ed1030a198d","year":2023},"citing_paper":{"arxiv_id":"2501.14286","last_updated":"2025-01-24T06:58:11Z","snapshot_observed_at":"2026-08-19T14:51:44.187504Z","submitted_at":"2025-01-24T06:58:11Z","title":"Embedding edge-colored graphs in expanders with roll-back","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T15:27:10.077111Z"},"links":{"cited_paper":"/paper/2311.03185","citing_paper":"/paper/2501.14286"},"observation_digest":"sha256:9149bd06b1d992da1c0a2e33101470bcc40cdbbc5b63547ab2dac15ce4a65a99","observation_id":"3ab6d197-7d45-4c1f-894a-26f16eb772a2","resolution":{"observed_at":"2026-08-10T15:27:10.189735Z","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/2311.03185/citation-record","integrity":"/paper/2311.03185/integrity","json":"/paper/2311.03185/citation-record.json","paper":"/paper/2311.03185"},"outbound":[],"paper":{"arxiv_id":"2311.03185","last_updated":"2023-11-06T15:25:13Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-19T10:12:01.942351Z","submitted_at":"2023-11-06T15:25:13Z","title":"Spanning trees in pseudorandom graphs via sorting networks"},"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 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.03185."}