{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HI2U7I5BD3DRT3T74VKQO2ZE5V","short_pith_number":"pith:HI2U7I5B","schema_version":"1.0","canonical_sha256":"3a354fa3a11ec719ee7fe555076b24ed7c88bd575d4690970366a657c3771714","source":{"kind":"arxiv","id":"1202.0863","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically Good Codes Over Non-Abelian Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria G. Sahebi, S. Sandeep Pradhan","submitted_at":"2012-02-04T02:50:45Z","abstract_excerpt":"It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group $\\mathds{D}_6$ and show that the performance of these codes is superior to the performance of Abelian group codes of the same alphabet size. This promises the possibility of using non-Abelian codes for multi-terminal settings where the structure of the code can be exploited to gain performance."},"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":"1202.0863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-04T02:50:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"952774c57a544b1287e1d0cabc7cdf0e8c640f992220fd7e05b15e840229a533","abstract_canon_sha256":"79c54377bc53c29d1b3b0ac1d821520031a156ee692a5b979c10982d9da5dc5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:50.677772Z","signature_b64":"SlEtxrksCmAhFYH6zg5vz077o07NrR2cuOANe94uzG1ij2w3orV7sEAxkaRAZnl4X3wYc+uiNzJ7lybs9/LlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a354fa3a11ec719ee7fe555076b24ed7c88bd575d4690970366a657c3771714","last_reissued_at":"2026-05-18T04:01:50.676934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:50.676934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Good Codes Over Non-Abelian Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria G. Sahebi, S. Sandeep Pradhan","submitted_at":"2012-02-04T02:50:45Z","abstract_excerpt":"It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group $\\mathds{D}_6$ and show that the performance of these codes is superior to the performance of Abelian group codes of the same alphabet size. This promises the possibility of using non-Abelian codes for multi-terminal settings where the structure of the code can be exploited to gain performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0863","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":"1202.0863","created_at":"2026-05-18T04:01:50.677064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0863v2","created_at":"2026-05-18T04:01:50.677064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0863","created_at":"2026-05-18T04:01:50.677064+00:00"},{"alias_kind":"pith_short_12","alias_value":"HI2U7I5BD3DR","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HI2U7I5BD3DRT3T7","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HI2U7I5B","created_at":"2026-05-18T12:27:09.501522+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/HI2U7I5BD3DRT3T74VKQO2ZE5V","json":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V.json","graph_json":"https://pith.science/api/pith-number/HI2U7I5BD3DRT3T74VKQO2ZE5V/graph.json","events_json":"https://pith.science/api/pith-number/HI2U7I5BD3DRT3T74VKQO2ZE5V/events.json","paper":"https://pith.science/paper/HI2U7I5B"},"agent_actions":{"view_html":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V","download_json":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V.json","view_paper":"https://pith.science/paper/HI2U7I5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0863&json=true","fetch_graph":"https://pith.science/api/pith-number/HI2U7I5BD3DRT3T74VKQO2ZE5V/graph.json","fetch_events":"https://pith.science/api/pith-number/HI2U7I5BD3DRT3T74VKQO2ZE5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V/action/storage_attestation","attest_author":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V/action/author_attestation","sign_citation":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V/action/citation_signature","submit_replication":"https://pith.science/pith/HI2U7I5BD3DRT3T74VKQO2ZE5V/action/replication_record"}},"created_at":"2026-05-18T04:01:50.677064+00:00","updated_at":"2026-05-18T04:01:50.677064+00:00"}