{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UKR22DX4CTXP43TC2SQ3UQKACY","short_pith_number":"pith:UKR22DX4","schema_version":"1.0","canonical_sha256":"a2a3ad0efc14eefe6e62d4a1ba41401601d11a5cf83ddbbf6accbd52d3fa4ca5","source":{"kind":"arxiv","id":"1603.00762","version":1},"attestation_state":"computed","paper":{"title":"On self-dual double circulant codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adel Alahmadi, Funda \\\"Ozdemir, Patrick Sol\\'e","submitted_at":"2016-03-02T15:50:41Z","abstract_excerpt":"Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with relative distance satisfying a modified Gilbert-Varshamov bound."},"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":"1603.00762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-02T15:50:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38c1db9c34bd6d8bd1736f2cc628ee212c71995be7d39b0cd06b2b072db406f3","abstract_canon_sha256":"84fc50c41ae3beeb905c3b28de924357d86635d148d455aa0ed583757643ac7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:43.020258Z","signature_b64":"QQqeKKLTey3s44MBZAlwDt2v35MIOgIoRi+5X3RQA8dLTDqEgZVvw9bJkeW0k5gsUbQoZm/Iazqk6jwfD2F9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a3ad0efc14eefe6e62d4a1ba41401601d11a5cf83ddbbf6accbd52d3fa4ca5","last_reissued_at":"2026-05-18T01:19:43.019678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:43.019678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On self-dual double circulant codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adel Alahmadi, Funda \\\"Ozdemir, Patrick Sol\\'e","submitted_at":"2016-03-02T15:50:41Z","abstract_excerpt":"Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with relative distance satisfying a modified Gilbert-Varshamov bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00762","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":"1603.00762","created_at":"2026-05-18T01:19:43.019772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00762v1","created_at":"2026-05-18T01:19:43.019772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00762","created_at":"2026-05-18T01:19:43.019772+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKR22DX4CTXP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKR22DX4CTXP43TC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKR22DX4","created_at":"2026-05-18T12:30:46.583412+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/UKR22DX4CTXP43TC2SQ3UQKACY","json":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY.json","graph_json":"https://pith.science/api/pith-number/UKR22DX4CTXP43TC2SQ3UQKACY/graph.json","events_json":"https://pith.science/api/pith-number/UKR22DX4CTXP43TC2SQ3UQKACY/events.json","paper":"https://pith.science/paper/UKR22DX4"},"agent_actions":{"view_html":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY","download_json":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY.json","view_paper":"https://pith.science/paper/UKR22DX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00762&json=true","fetch_graph":"https://pith.science/api/pith-number/UKR22DX4CTXP43TC2SQ3UQKACY/graph.json","fetch_events":"https://pith.science/api/pith-number/UKR22DX4CTXP43TC2SQ3UQKACY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY/action/storage_attestation","attest_author":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY/action/author_attestation","sign_citation":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY/action/citation_signature","submit_replication":"https://pith.science/pith/UKR22DX4CTXP43TC2SQ3UQKACY/action/replication_record"}},"created_at":"2026-05-18T01:19:43.019772+00:00","updated_at":"2026-05-18T01:19:43.019772+00:00"}