{"as_of":"2026-08-15T15:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2684b3026bc445e67b3d9ddcdae96712d8006ed746e34b8a5e2c405584d38be0","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-15T06:32:42.880941+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-12T10:16:54.290390Z","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-12T10:16:54.736418Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1402.2543","last_updated":"2014-02-11T16:06:35Z","snapshot_observed_at":"2026-08-14T23:45:03.636472Z","submitted_at":"2014-02-11T16:06:35Z","title":"Large Cuts with Local Algorithms on Triangle-Free Graphs","version":1},"cited_work":{"arxiv_id":"1402.2543","doi":null,"metadata_source":"pith","pith_arxiv_id":"1402.2543","snapshot_observed_at":"2026-08-12T10:16:54.736418Z","title":"Large Cuts with Local Algorithms on Triangle-Free Graphs","venue":"cs.DC","work_id":"16d6f258-453d-4f6b-ad23-58bee5f85a6f","year":2014},"citing_paper":{"arxiv_id":"2411.19388","last_updated":"2024-11-28T21:39:58Z","snapshot_observed_at":"2026-08-15T13:49:43.567277Z","submitted_at":"2024-11-28T21:39:58Z","title":"Limitations of Quantum Approximate Optimization in Solving Generic Higher-Order Constraint-Satisfaction Problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T10:16:54.290390Z"},"links":{"cited_paper":"/paper/1402.2543","citing_paper":"/paper/2411.19388"},"observation_digest":"sha256:5e10070d83c759d0e8377d9cf791c78a06cffa8c6100eb4d463788ed96a0f56c","observation_id":"f9fc4e1f-a969-40ea-a600-d17e50500d00","resolution":{"observed_at":"2026-08-12T10:16:54.742742Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1402.2543/citation-record","integrity":"/paper/1402.2543/integrity","json":"/paper/1402.2543/citation-record.json","paper":"/paper/1402.2543"},"outbound":[],"paper":{"arxiv_id":"1402.2543","last_updated":"2014-02-11T16:06:35Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-14T23:45:03.636472Z","submitted_at":"2014-02-11T16:06:35Z","title":"Large Cuts with Local Algorithms on Triangle-Free 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1402.2543."}