{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DVAR4EE7EJIX4F5XQEMKTLCYKB","short_pith_number":"pith:DVAR4EE7","schema_version":"1.0","canonical_sha256":"1d411e109f22517e17b78118a9ac5850468f78e46cdb0fd526d9f8ecc8c658b5","source":{"kind":"arxiv","id":"1602.07645","version":1},"attestation_state":"computed","paper":{"title":"Bounds for spherical codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Peter Keevash","submitted_at":"2016-02-24T19:35:23Z","abstract_excerpt":"A set $C$ of unit vectors in $\\mathbb{R}^d$ is called an $L$-spherical code if $x \\cdot y \\in L$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and Seidel. In this note we prove a conjecture of Bukh on the maximum size of spherical codes. In particular, we show that for any set of $k$ fixed angles, one can choose at most $O(d^k)$ lines in $\\mathbb{R}^d$ such that any pair of them forms one of these angles."},"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":"1602.07645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T19:35:23Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"2633e498a8a371f362a449a5ca86ff6ed096a0681a6a310b1f4bab8535f9f7f6","abstract_canon_sha256":"d136e479f7f2a6e8db64e46532a160ea1a7d6818620be4e733918d16fc136261"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:02.401613Z","signature_b64":"htkcD9RfurLEuNPFXmXdLiTt8ABr0BXFFN0eMsskOUjNJOJSeIwPloPD1DZCyvxgi6EFeVlTny9C+KqMFzggDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d411e109f22517e17b78118a9ac5850468f78e46cdb0fd526d9f8ecc8c658b5","last_reissued_at":"2026-05-18T01:20:02.400922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:02.400922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for spherical codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Peter Keevash","submitted_at":"2016-02-24T19:35:23Z","abstract_excerpt":"A set $C$ of unit vectors in $\\mathbb{R}^d$ is called an $L$-spherical code if $x \\cdot y \\in L$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and Seidel. In this note we prove a conjecture of Bukh on the maximum size of spherical codes. In particular, we show that for any set of $k$ fixed angles, one can choose at most $O(d^k)$ lines in $\\mathbb{R}^d$ such that any pair of them forms one of these angles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07645","kind":"arxiv","version":1},"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":"1602.07645","created_at":"2026-05-18T01:20:02.401039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07645v1","created_at":"2026-05-18T01:20:02.401039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07645","created_at":"2026-05-18T01:20:02.401039+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVAR4EE7EJIX","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVAR4EE7EJIX4F5X","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVAR4EE7","created_at":"2026-05-18T12:30:12.583610+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/DVAR4EE7EJIX4F5XQEMKTLCYKB","json":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB.json","graph_json":"https://pith.science/api/pith-number/DVAR4EE7EJIX4F5XQEMKTLCYKB/graph.json","events_json":"https://pith.science/api/pith-number/DVAR4EE7EJIX4F5XQEMKTLCYKB/events.json","paper":"https://pith.science/paper/DVAR4EE7"},"agent_actions":{"view_html":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB","download_json":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB.json","view_paper":"https://pith.science/paper/DVAR4EE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07645&json=true","fetch_graph":"https://pith.science/api/pith-number/DVAR4EE7EJIX4F5XQEMKTLCYKB/graph.json","fetch_events":"https://pith.science/api/pith-number/DVAR4EE7EJIX4F5XQEMKTLCYKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB/action/storage_attestation","attest_author":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB/action/author_attestation","sign_citation":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB/action/citation_signature","submit_replication":"https://pith.science/pith/DVAR4EE7EJIX4F5XQEMKTLCYKB/action/replication_record"}},"created_at":"2026-05-18T01:20:02.401039+00:00","updated_at":"2026-05-18T01:20:02.401039+00:00"}