{"as_of":"2026-08-15T13:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97967db79daa5b0c919f3fe795825f9a7564e3b9ef0a265b9ca200a64e8e19a0","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-07-03T06:56:31.693595Z","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-07-03T06:57:42.578612Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1112.5507","last_updated":"2014-09-13T15:08:28Z","snapshot_observed_at":"2026-08-15T04:24:38.353246Z","submitted_at":"2011-12-23T02:56:26Z","title":"Fast Approximate Quadratic Programming for Large (Brain) Graph Matching","version":5},"cited_work":{"arxiv_id":"1112.5507","doi":null,"metadata_source":"pith","pith_arxiv_id":"1112.5507","snapshot_observed_at":"2026-07-03T06:57:42.578612Z","title":"Fast Approximate Quadratic Programming for Large (Brain) Graph Matching","venue":"math.OC","work_id":"1354c245-adb8-4e26-a96d-3703eca7f5a0","year":2011},"citing_paper":{"arxiv_id":"2607.02013","last_updated":"2026-07-02T10:45:46Z","snapshot_observed_at":"2026-08-02T08:45:30.250062Z","submitted_at":"2026-07-02T10:45:46Z","title":"Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-03T06:56:31.693595Z"},"links":{"cited_paper":"/paper/1112.5507","citing_paper":"/paper/2607.02013"},"observation_digest":"sha256:777007bb2b9cc1777aa6d8bf8e987a8272c0a92788885162b828893904807d8f","observation_id":"de780eb7-7e05-4c88-b1bd-9fbaaa09a4c1","resolution":{"observed_at":"2026-07-03T06:57:42.580016Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1112.5507/citation-record","integrity":"/paper/1112.5507/integrity","json":"/paper/1112.5507/citation-record.json","paper":"/paper/1112.5507"},"outbound":[],"paper":{"arxiv_id":"1112.5507","last_updated":"2014-09-13T15:08:28Z","latest_version":5,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T04:24:38.353246Z","submitted_at":"2011-12-23T02:56:26Z","title":"Fast Approximate Quadratic Programming for Large (Brain) Graph Matching"},"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:1112.5507."}