{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:32FLJAABUC5UINSRIL2HMKOWKJ","short_pith_number":"pith:32FLJAAB","schema_version":"1.0","canonical_sha256":"de8ab48001a0bb44365142f47629d6524b7fd41a74bb9f33e50cc2a121c453fe","source":{"kind":"arxiv","id":"2206.09876","version":3},"attestation_state":"computed","paper":{"title":"Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.MG","authors_text":"Rupert Li","submitted_at":"2022-06-20T16:27:33Z","abstract_excerpt":"The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension $d>2$. By mapping feasible points of this infinite-dimensional linear program into a finite-dimensional problem via discrete reduction, we provide a general method to obtain dual bounds on the Cohn-Elkies linear program. This reduces the number of variables to be finite, enabling computer optimization techniques to be applied. Using this method, we prove that the Cohn-Elkies bound cannot come close to the best packing densities known i"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2206.09876","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2022-06-20T16:27:33Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"ba4f3c5a23d566fa3e9f55195ca59a3ac8d4af253ae54e28c54026199c5a7396","abstract_canon_sha256":"1a15a8fb318299036597c96195739032ed7e5c479714c84b779e09177294c21f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:26.654148Z","signature_b64":"T2DQAcrBZHlrF0YHvDpmQsvg2q7NR5qjFKQLoY6wggyRmiqw5YBYLLnyAZmzCVom7lRhRZmyr2lMfb+vq3F/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de8ab48001a0bb44365142f47629d6524b7fd41a74bb9f33e50cc2a121c453fe","last_reissued_at":"2026-07-05T11:43:26.653677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:26.653677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.MG","authors_text":"Rupert Li","submitted_at":"2022-06-20T16:27:33Z","abstract_excerpt":"The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension $d>2$. By mapping feasible points of this infinite-dimensional linear program into a finite-dimensional problem via discrete reduction, we provide a general method to obtain dual bounds on the Cohn-Elkies linear program. This reduces the number of variables to be finite, enabling computer optimization techniques to be applied. Using this method, we prove that the Cohn-Elkies bound cannot come close to the best packing densities known i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09876","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.09876/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.09876","created_at":"2026-07-05T11:43:26.653735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.09876v3","created_at":"2026-07-05T11:43:26.653735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09876","created_at":"2026-07-05T11:43:26.653735+00:00"},{"alias_kind":"pith_short_12","alias_value":"32FLJAABUC5U","created_at":"2026-07-05T11:43:26.653735+00:00"},{"alias_kind":"pith_short_16","alias_value":"32FLJAABUC5UINSR","created_at":"2026-07-05T11:43:26.653735+00:00"},{"alias_kind":"pith_short_8","alias_value":"32FLJAAB","created_at":"2026-07-05T11:43:26.653735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ","json":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ.json","graph_json":"https://pith.science/api/pith-number/32FLJAABUC5UINSRIL2HMKOWKJ/graph.json","events_json":"https://pith.science/api/pith-number/32FLJAABUC5UINSRIL2HMKOWKJ/events.json","paper":"https://pith.science/paper/32FLJAAB"},"agent_actions":{"view_html":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ","download_json":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ.json","view_paper":"https://pith.science/paper/32FLJAAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.09876&json=true","fetch_graph":"https://pith.science/api/pith-number/32FLJAABUC5UINSRIL2HMKOWKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/32FLJAABUC5UINSRIL2HMKOWKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ/action/storage_attestation","attest_author":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ/action/author_attestation","sign_citation":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ/action/citation_signature","submit_replication":"https://pith.science/pith/32FLJAABUC5UINSRIL2HMKOWKJ/action/replication_record"}},"created_at":"2026-07-05T11:43:26.653735+00:00","updated_at":"2026-07-05T11:43:26.653735+00:00"}