{"as_of":"2026-08-19T08:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66a8e46767a9cb60e6b179c1ee14ad86d74a797d77adc8ceb65e47af5a8be9ec","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-15T22:52:44.639012Z","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-15T22:15:13.272026Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1406.4056","last_updated":"2014-06-16T16:06:46Z","snapshot_observed_at":"2026-08-14T23:30:13.481342Z","submitted_at":"2014-06-16T16:06:46Z","title":"Counting perfect matchings in graphs that exclude a single-crossing minor","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.4056","snapshot_observed_at":"2026-08-15T22:52:44.639012Z","title":"Curticapean, Counting perfect matchings in graphs that exclude a single-crossing minor, arXiv:1406.4056 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.06336","last_updated":"2025-05-09T18:00:00Z","snapshot_observed_at":"2026-08-15T22:43:10.568058Z","submitted_at":"2025-05-09T18:00:00Z","title":"2D Quon Language: Unifying Framework for Cliffords, Matchgates, and Beyond","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T22:52:44.639012Z"},"links":{"cited_paper":"/paper/1406.4056","citing_paper":"/paper/2505.06336"},"observation_digest":"sha256:c7c67908963c74949b3dded1c8f63990481c237c18ebf75d80ab7f8b966126e3","observation_id":"12bf3d8a-990c-4827-a21a-57582a259850","resolution":{"observed_at":"2026-08-15T22:52:44.639012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.4056","last_updated":"2014-06-16T16:06:46Z","snapshot_observed_at":"2026-08-14T23:30:13.481342Z","submitted_at":"2014-06-16T16:06:46Z","title":"Counting perfect matchings in graphs that exclude a single-crossing minor","version":1},"cited_work":{"arxiv_id":"1406.4056","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.4056","snapshot_observed_at":"2026-08-15T22:15:13.272026Z","title":"Counting perfect matchings in graphs that exclude a single-crossing minor","venue":"cs.DS","work_id":"b4577468-52e9-4418-a41c-2adf490c99e4","year":2014},"citing_paper":{"arxiv_id":"2505.07804","last_updated":"2025-08-08T16:08:20Z","snapshot_observed_at":"2026-08-18T11:58:03.035390Z","submitted_at":"2025-05-12T17:53:05Z","title":"Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T22:15:12.591144Z"},"links":{"cited_paper":"/paper/1406.4056","citing_paper":"/paper/2505.07804"},"observation_digest":"sha256:6d19cf88333032088a1b71aa22acf8b44f89a73f74a6d4b8fc82c07395ea17da","observation_id":"36ce7a3e-0102-40a3-b04b-4ec72dee6ae4","resolution":{"observed_at":"2026-08-15T22:15:13.276644Z","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/1406.4056/citation-record","integrity":"/paper/1406.4056/integrity","json":"/paper/1406.4056/citation-record.json","paper":"/paper/1406.4056"},"outbound":[],"paper":{"arxiv_id":"1406.4056","last_updated":"2014-06-16T16:06:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T23:30:13.481342Z","submitted_at":"2014-06-16T16:06:46Z","title":"Counting perfect matchings in graphs that exclude a single-crossing minor"},"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:1406.4056."}