{"as_of":"2026-08-10T21:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e331d175a4ea37b434fa59449c3f8874f5e63b04d1a050ecda4c9a6875d967b","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-10T06:31:04.303077+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-07-13T03:13:46.776350Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1210.1890","last_updated":"2013-03-04T16:28:24Z","snapshot_observed_at":"2026-08-10T18:27:30.570088Z","submitted_at":"2012-10-05T23:22:20Z","title":"Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1210.1890","snapshot_observed_at":"2026-07-13T03:13:46.776350Z","title":"arXiv preprint arXiv:1210.1890 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09410","last_updated":"2026-07-10T13:43:24Z","snapshot_observed_at":"2026-08-10T14:37:37.726145Z","submitted_at":"2026-07-10T13:43:24Z","title":"Strong Refutation of Random Ordering CSPs","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-13T03:13:46.776350Z"},"links":{"cited_paper":"/paper/1210.1890","citing_paper":"/paper/2607.09410"},"observation_digest":"sha256:400db91bac30a46866516e255d622e6e3cbe7db969e5be8334f6cfab6eee2eeb","observation_id":"f7d1ef21-fdd7-49ad-bcad-d338bb67bc2f","resolution":{"observed_at":"2026-07-13T03:13:46.776350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1210.1890/citation-record","integrity":"/paper/1210.1890/integrity","json":"/paper/1210.1890/citation-record.json","paper":"/paper/1210.1890"},"outbound":[],"paper":{"arxiv_id":"1210.1890","last_updated":"2013-03-04T16:28:24Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T18:27:30.570088Z","submitted_at":"2012-10-05T23:22:20Z","title":"Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1210.1890."}