{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XCO5NLBPQR5JCBLE62TCVDKECA","short_pith_number":"pith:XCO5NLBP","schema_version":"1.0","canonical_sha256":"b89dd6ac2f847a910564f6a62a8d441026ea2b9f279dec71db160936e4932733","source":{"kind":"arxiv","id":"1101.1895","version":2},"attestation_state":"computed","paper":{"title":"Constructive spherical codes near the Shannon bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jean-Claude Belfiore, Patrick Sol\\'e","submitted_at":"2011-01-10T17:26:33Z","abstract_excerpt":"Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of $\\rho$. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a Lee metric BCH code over $GF(p),$ we obtain spherical codes that are polynomial time constructible. Their parameters outperform those obtained b"},"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":"1101.1895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-10T17:26:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"152c551ddefc663038517bca3687c7a4de1b0b4760bee16ceae0344f555a74b7","abstract_canon_sha256":"27c5d012bdc5a6d7f1c6a3a48ca16cedfa5d81e16dd37730e66c7dc99081d46d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:18.111732Z","signature_b64":"4C+5Rlbh0ng34X5ap4uE050Xqqag/dn8rNZcqVFeQUYsgORJ0Wi/gBuHz4wSA0VulPgq0mOKKQJILVhZRXlsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89dd6ac2f847a910564f6a62a8d441026ea2b9f279dec71db160936e4932733","last_reissued_at":"2026-05-18T04:14:18.111086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:18.111086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructive spherical codes near the Shannon bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jean-Claude Belfiore, Patrick Sol\\'e","submitted_at":"2011-01-10T17:26:33Z","abstract_excerpt":"Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of $\\rho$. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a Lee metric BCH code over $GF(p),$ we obtain spherical codes that are polynomial time constructible. Their parameters outperform those obtained b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1895","kind":"arxiv","version":2},"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":"1101.1895","created_at":"2026-05-18T04:14:18.111179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1895v2","created_at":"2026-05-18T04:14:18.111179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1895","created_at":"2026-05-18T04:14:18.111179+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCO5NLBPQR5J","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCO5NLBPQR5JCBLE","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCO5NLBP","created_at":"2026-05-18T12:26:44.992195+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/XCO5NLBPQR5JCBLE62TCVDKECA","json":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA.json","graph_json":"https://pith.science/api/pith-number/XCO5NLBPQR5JCBLE62TCVDKECA/graph.json","events_json":"https://pith.science/api/pith-number/XCO5NLBPQR5JCBLE62TCVDKECA/events.json","paper":"https://pith.science/paper/XCO5NLBP"},"agent_actions":{"view_html":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA","download_json":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA.json","view_paper":"https://pith.science/paper/XCO5NLBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1895&json=true","fetch_graph":"https://pith.science/api/pith-number/XCO5NLBPQR5JCBLE62TCVDKECA/graph.json","fetch_events":"https://pith.science/api/pith-number/XCO5NLBPQR5JCBLE62TCVDKECA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA/action/storage_attestation","attest_author":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA/action/author_attestation","sign_citation":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA/action/citation_signature","submit_replication":"https://pith.science/pith/XCO5NLBPQR5JCBLE62TCVDKECA/action/replication_record"}},"created_at":"2026-05-18T04:14:18.111179+00:00","updated_at":"2026-05-18T04:14:18.111179+00:00"}