{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IIXYIB2DE52VCEDC5UHCPWO2YB","short_pith_number":"pith:IIXYIB2D","schema_version":"1.0","canonical_sha256":"422f8407432775511062ed0e27d9dac048cbb78eb2d87a2e42e7c8fa9411b9be","source":{"kind":"arxiv","id":"1505.03406","version":1},"attestation_state":"computed","paper":{"title":"A Database of $\\mathbb{Z}_4$ Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nuh Aydin, Tsvetan Asamov","submitted_at":"2015-05-13T14:38:59Z","abstract_excerpt":"There has been much research on codes over $\\mathbb{Z}_4$, sometimes called quaternary codes, for over a decade. Yet, no database is available for best known quaternary codes. This work introduces a new database for quaternary codes. It also presents a new search algorithm called genetic code search (GCS), as well as new quaternary codes obtained by existing and new search methods."},"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":"1505.03406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-13T14:38:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"16cc0db5a9ccd8f932057738578c203c41fd104ce2af847b10c18901f26fd7b7","abstract_canon_sha256":"e5480923437d0f413d3f9a677991e2cc3647a037b722ef32a52006732f853df1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:09.231529Z","signature_b64":"4rqQGsU85WaQ/IwBoZFktHx5HtCSFqsR19bILh5Z5U8umm6ZYVtX80dePIISvNJsNfhwxt3Vk7rMJBxU8B45Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"422f8407432775511062ed0e27d9dac048cbb78eb2d87a2e42e7c8fa9411b9be","last_reissued_at":"2026-05-18T02:12:09.230775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:09.230775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Database of $\\mathbb{Z}_4$ Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nuh Aydin, Tsvetan Asamov","submitted_at":"2015-05-13T14:38:59Z","abstract_excerpt":"There has been much research on codes over $\\mathbb{Z}_4$, sometimes called quaternary codes, for over a decade. Yet, no database is available for best known quaternary codes. This work introduces a new database for quaternary codes. It also presents a new search algorithm called genetic code search (GCS), as well as new quaternary codes obtained by existing and new search methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03406","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":"1505.03406","created_at":"2026-05-18T02:12:09.230884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03406v1","created_at":"2026-05-18T02:12:09.230884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03406","created_at":"2026-05-18T02:12:09.230884+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIXYIB2DE52V","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIXYIB2DE52VCEDC","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIXYIB2D","created_at":"2026-05-18T12:29:25.134429+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/IIXYIB2DE52VCEDC5UHCPWO2YB","json":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB.json","graph_json":"https://pith.science/api/pith-number/IIXYIB2DE52VCEDC5UHCPWO2YB/graph.json","events_json":"https://pith.science/api/pith-number/IIXYIB2DE52VCEDC5UHCPWO2YB/events.json","paper":"https://pith.science/paper/IIXYIB2D"},"agent_actions":{"view_html":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB","download_json":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB.json","view_paper":"https://pith.science/paper/IIXYIB2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03406&json=true","fetch_graph":"https://pith.science/api/pith-number/IIXYIB2DE52VCEDC5UHCPWO2YB/graph.json","fetch_events":"https://pith.science/api/pith-number/IIXYIB2DE52VCEDC5UHCPWO2YB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB/action/storage_attestation","attest_author":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB/action/author_attestation","sign_citation":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB/action/citation_signature","submit_replication":"https://pith.science/pith/IIXYIB2DE52VCEDC5UHCPWO2YB/action/replication_record"}},"created_at":"2026-05-18T02:12:09.230884+00:00","updated_at":"2026-05-18T02:12:09.230884+00:00"}