{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LNWMM7DRXTU2VYH67AIMUP57XJ","short_pith_number":"pith:LNWMM7DR","schema_version":"1.0","canonical_sha256":"5b6cc67c71bce9aae0fef810ca3fbfba47a87d80fdbe29fb2c5b9a1aac9bb1dd","source":{"kind":"arxiv","id":"1707.01356","version":2},"attestation_state":"computed","paper":{"title":"On the classification of $\\mathbb{Z}_4$-codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Hiroki Ito, Ken Saito, Makoto Araya, Masaaki Harada","submitted_at":"2017-07-05T12:27:35Z","abstract_excerpt":"In this note, we study the classification of $\\mathbb{Z}_4$-codes. For some special cases $(k_1,k_2)$, by hand, we give a classification of $\\mathbb{Z}_4$-codes of length $n$ and type $4^{k_1}2^{k_2}$ satisfying a certain condition. Our exhaustive computer search completes the classification of $\\mathbb{Z}_4$-codes of lengths up to $7$."},"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":"1707.01356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-05T12:27:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3caac80ce4b0ee50e4279f4a9e8991323db56ad7b778b658761c28499423196a","abstract_canon_sha256":"0c9b01aa9968b94aa4e1f6d2e659b1e2f7e258bffabd3d3290406f9dc533be14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:02.673738Z","signature_b64":"15Am3Suog7xMq8LZg8Q29Uv1c1Fj9FVARbKugbxVAj1ubPjNZR2bDtkrPl7SKwiU0bMUcwg1vj1uDObXLc32BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6cc67c71bce9aae0fef810ca3fbfba47a87d80fdbe29fb2c5b9a1aac9bb1dd","last_reissued_at":"2026-05-18T00:31:02.673082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:02.673082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the classification of $\\mathbb{Z}_4$-codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Hiroki Ito, Ken Saito, Makoto Araya, Masaaki Harada","submitted_at":"2017-07-05T12:27:35Z","abstract_excerpt":"In this note, we study the classification of $\\mathbb{Z}_4$-codes. For some special cases $(k_1,k_2)$, by hand, we give a classification of $\\mathbb{Z}_4$-codes of length $n$ and type $4^{k_1}2^{k_2}$ satisfying a certain condition. Our exhaustive computer search completes the classification of $\\mathbb{Z}_4$-codes of lengths up to $7$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01356","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":"1707.01356","created_at":"2026-05-18T00:31:02.673182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01356v2","created_at":"2026-05-18T00:31:02.673182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01356","created_at":"2026-05-18T00:31:02.673182+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNWMM7DRXTU2","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNWMM7DRXTU2VYH6","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNWMM7DR","created_at":"2026-05-18T12:31:28.150371+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/LNWMM7DRXTU2VYH67AIMUP57XJ","json":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ.json","graph_json":"https://pith.science/api/pith-number/LNWMM7DRXTU2VYH67AIMUP57XJ/graph.json","events_json":"https://pith.science/api/pith-number/LNWMM7DRXTU2VYH67AIMUP57XJ/events.json","paper":"https://pith.science/paper/LNWMM7DR"},"agent_actions":{"view_html":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ","download_json":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ.json","view_paper":"https://pith.science/paper/LNWMM7DR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01356&json=true","fetch_graph":"https://pith.science/api/pith-number/LNWMM7DRXTU2VYH67AIMUP57XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LNWMM7DRXTU2VYH67AIMUP57XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ/action/storage_attestation","attest_author":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ/action/author_attestation","sign_citation":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ/action/citation_signature","submit_replication":"https://pith.science/pith/LNWMM7DRXTU2VYH67AIMUP57XJ/action/replication_record"}},"created_at":"2026-05-18T00:31:02.673182+00:00","updated_at":"2026-05-18T00:31:02.673182+00:00"}