{"as_of":"2026-08-08T05:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4f3f04454902347b78a4e07ba31581b21a931cac29920bb04cd24fd660fb895","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-07T06:34:17.273281+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-06T23:04:03.545746Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T18:00:50.382258Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.06033","last_updated":"2022-11-11T07:09:31Z","snapshot_observed_at":"2026-07-06T14:17:04.086096Z","submitted_at":"2022-11-11T07:09:31Z","title":"A Faster Small Treewidth SDP Solver","version":1},"cited_work":{"arxiv_id":"2211.06033","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.06033","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A faster small treewidth sdp solver","venue":null,"work_id":"c35a0629-a8fc-4bee-941a-b8116bb7586a","year":2022},"citing_paper":{"arxiv_id":"2306.14048","last_updated":"2023-12-18T19:10:00Z","snapshot_observed_at":"2026-08-06T19:19:02.165567Z","submitted_at":"2023-06-24T20:11:14Z","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","version":3},"reference_index":140,"source":"pdf_text","source_observed_at":"2026-05-17T18:00:50.053377Z"},"links":{"cited_paper":"/paper/2211.06033","citing_paper":"/paper/2306.14048"},"observation_digest":"sha256:bcbe3c77ca434562688f674c65c85f554a14a29bb367286e147efc08c079ce6d","observation_id":"c70c066f-4aca-46a1-99cf-61b5ddd5edf8","resolution":{"observed_at":"2026-05-17T18:00:50.384628Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.06033","last_updated":"2022-11-11T07:09:31Z","snapshot_observed_at":"2026-07-06T14:17:04.086096Z","submitted_at":"2022-11-11T07:09:31Z","title":"A Faster Small Treewidth SDP Solver","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.06033","snapshot_observed_at":"2026-08-06T23:04:03.545746Z","title":"A faster small treewidth sdp solver","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.545746Z"},"links":{"cited_paper":"/paper/2211.06033","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:b347d9add4b546b9323ba5e45fe8631967adc031d0b626d265187ae970e0a8d6","observation_id":"66fd9998-7609-4a0e-adaa-e7f6a1c61cb3","resolution":{"observed_at":"2026-08-06T23:04:03.545746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.06033/citation-record","integrity":"/paper/2211.06033/integrity","json":"/paper/2211.06033/citation-record.json","paper":"/paper/2211.06033"},"outbound":[],"paper":{"arxiv_id":"2211.06033","last_updated":"2022-11-11T07:09:31Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T14:17:04.086096Z","submitted_at":"2022-11-11T07:09:31Z","title":"A Faster Small Treewidth SDP Solver"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.06033."}