{"as_of":"2026-08-20T22:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38654e856b6aec4da036c0fe12abc0852d98e300b1ee1aa25a61661e8073d856","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-20T06:33:59.587034+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-02T07:13:17.844621Z","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":"2206.09876","last_updated":"2022-11-06T04:41:33Z","snapshot_observed_at":"2026-08-16T16:51:43.284617Z","submitted_at":"2022-06-20T16:27:33Z","title":"Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09876","snapshot_observed_at":"2026-08-02T07:13:17.844621Z","title":"Li,Dual linear programming bounds for sphere packing via discrete reductions, Adv","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11319","last_updated":"2026-07-15T20:46:54Z","snapshot_observed_at":"2026-08-17T23:27:25.808479Z","submitted_at":"2026-07-13T09:37:13Z","title":"A dual linear programming bound for sphere packing in dimension 36","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T07:13:17.844621Z"},"links":{"cited_paper":"/paper/2206.09876","citing_paper":"/paper/2607.11319"},"observation_digest":"sha256:f3cea8e6ea50750f7966ac23c1a334ce77cc4c56e235d947b1b571a732f30835","observation_id":"eb3a0729-a105-4f4a-af39-52df33132e34","resolution":{"observed_at":"2026-08-02T07:13:17.844621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.09876","last_updated":"2022-11-06T04:41:33Z","snapshot_observed_at":"2026-08-16T16:51:43.284617Z","submitted_at":"2022-06-20T16:27:33Z","title":"Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09876","snapshot_observed_at":"2026-08-01T03:06:24.022101Z","title":"Li,Dual linear programming bounds for sphere packing via discrete reductions, Adv","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.25254","last_updated":"2026-07-28T03:55:29Z","snapshot_observed_at":"2026-08-19T17:42:32.655293Z","submitted_at":"2026-07-28T03:55:29Z","title":"Linear Programming Bounds for Fibered Sphere Packings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T03:06:24.022101Z"},"links":{"cited_paper":"/paper/2206.09876","citing_paper":"/paper/2607.25254"},"observation_digest":"sha256:fb79451cf142e9e5662764771f7e66647866b5dc1ebc985408bff9ee27117afe","observation_id":"cc7ad12b-b594-4e60-863b-1635423f911e","resolution":{"observed_at":"2026-08-01T03:06:24.022101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.09876/citation-record","integrity":"/paper/2206.09876/integrity","json":"/paper/2206.09876/citation-record.json","paper":"/paper/2206.09876"},"outbound":[],"paper":{"arxiv_id":"2206.09876","last_updated":"2022-11-06T04:41:33Z","latest_version":3,"primary_category":"math.MG","snapshot_observed_at":"2026-08-16T16:51:43.284617Z","submitted_at":"2022-06-20T16:27:33Z","title":"Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2206.09876."}