{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:MOJR3ACLXTLB2A5G4QCNDD3UXN","short_pith_number":"pith:MOJR3ACL","schema_version":"1.0","canonical_sha256":"63931d804bbcd61d03a6e404d18f74bb607b05202c0a59a63f66f09792714e64","source":{"kind":"arxiv","id":"math/0110009","version":3},"attestation_state":"computed","paper":{"title":"New upper bounds on sphere packings I","license":"","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Henry Cohn, Noam Elkies","submitted_at":"2001-10-01T09:32:11Z","abstract_excerpt":"We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24."},"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":"math/0110009","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.MG","submitted_at":"2001-10-01T09:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"d065efc5c9992e8b6161c77616338228586bf44cc572025471ddada04b0ff1eb","abstract_canon_sha256":"6cba35f8908e467fbc7bf0afd9567ee851512b1ebfa9fd624118ad9c58351637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:03.004884Z","signature_b64":"5sOgUoS8nTPcrLLqFX7CB87UifMqRuhDyu/g0ClbZ3/vzqq2mIbpvHnWyAZ+kLKJTWGZt/NJUrsQwMc8Km4mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63931d804bbcd61d03a6e404d18f74bb607b05202c0a59a63f66f09792714e64","last_reissued_at":"2026-05-18T04:00:03.004171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:03.004171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New upper bounds on sphere packings I","license":"","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Henry Cohn, Noam Elkies","submitted_at":"2001-10-01T09:32:11Z","abstract_excerpt":"We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0110009","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":""},"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":"math/0110009","created_at":"2026-05-18T04:00:03.004279+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0110009v3","created_at":"2026-05-18T04:00:03.004279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0110009","created_at":"2026-05-18T04:00:03.004279+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOJR3ACLXTLB","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOJR3ACLXTLB2A5G","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOJR3ACL","created_at":"2026-05-18T12:25:50.845339+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/MOJR3ACLXTLB2A5G4QCNDD3UXN","json":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN.json","graph_json":"https://pith.science/api/pith-number/MOJR3ACLXTLB2A5G4QCNDD3UXN/graph.json","events_json":"https://pith.science/api/pith-number/MOJR3ACLXTLB2A5G4QCNDD3UXN/events.json","paper":"https://pith.science/paper/MOJR3ACL"},"agent_actions":{"view_html":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN","download_json":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN.json","view_paper":"https://pith.science/paper/MOJR3ACL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0110009&json=true","fetch_graph":"https://pith.science/api/pith-number/MOJR3ACLXTLB2A5G4QCNDD3UXN/graph.json","fetch_events":"https://pith.science/api/pith-number/MOJR3ACLXTLB2A5G4QCNDD3UXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN/action/storage_attestation","attest_author":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN/action/author_attestation","sign_citation":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN/action/citation_signature","submit_replication":"https://pith.science/pith/MOJR3ACLXTLB2A5G4QCNDD3UXN/action/replication_record"}},"created_at":"2026-05-18T04:00:03.004279+00:00","updated_at":"2026-05-18T04:00:03.004279+00:00"}