{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:ACR6RZYRHWTQHZNKRIGPFK57AS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2c959466015a1b6b53ee811f1f4633705e012af658c0b680e3928c8dc15fc478","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"math.CO","submitted_at":"2003-11-18T21:35:21Z","title_canon_sha256":"259ab5d1a1101d4d067ce1b43c71405d48410981be4efc3265c7e866b084f903"},"schema_version":"1.0","source":{"id":"math/0311319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0311319","created_at":"2026-07-04T15:03:02Z"},{"alias_kind":"arxiv_version","alias_value":"math/0311319v1","created_at":"2026-07-04T15:03:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0311319","created_at":"2026-07-04T15:03:02Z"},{"alias_kind":"pith_short_12","alias_value":"ACR6RZYRHWTQ","created_at":"2026-07-04T15:03:02Z"},{"alias_kind":"pith_short_16","alias_value":"ACR6RZYRHWTQHZNK","created_at":"2026-07-04T15:03:02Z"},{"alias_kind":"pith_short_8","alias_value":"ACR6RZYR","created_at":"2026-07-04T15:03:02Z"}],"graph_snapshots":[{"event_id":"sha256:7c95620716632164d0d440956c27d308e3cb04bc45865d4a0413a51243bc5ed8","target":"graph","created_at":"2026-07-04T15:03:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0311319/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomial X^3 + lambda X^2 + (lambda - 1) X - 1, where lambda satisfies lambda^2 - lambda + 2 =0. This is the 2-adic generalization of both the binary Hamming code and the quaternary octacode (the latter being equivalent to the Nordstrom-Robinson code). Other examples include the 2-adic Golay code of length 24 and the 3-","authors_text":"A. R. Calderbank, N. J. A. Sloane","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2003-11-18T21:35:21Z","title":"Modular and p-adic cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311319","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:abb37d8afbb58ef9dcbc1c746e89a416781cd2378d89d7d611e3e0a2dd783eea","target":"record","created_at":"2026-07-04T15:03:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2c959466015a1b6b53ee811f1f4633705e012af658c0b680e3928c8dc15fc478","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"math.CO","submitted_at":"2003-11-18T21:35:21Z","title_canon_sha256":"259ab5d1a1101d4d067ce1b43c71405d48410981be4efc3265c7e866b084f903"},"schema_version":"1.0","source":{"id":"math/0311319","kind":"arxiv","version":1}},"canonical_sha256":"00a3e8e7113da703e5aa8a0cf2abbf04926c0ea62edffc09f150389fce96dd59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00a3e8e7113da703e5aa8a0cf2abbf04926c0ea62edffc09f150389fce96dd59","first_computed_at":"2026-07-04T15:03:02.846987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:03:02.846987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54xuPcTOG/LPZkzr42UXYer+j6sFnw3EpVB+9tsYDSC7zjJJZ8dedkLq8BPcjLyzraYkPGpekSmSv5HW7XoEAA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:03:02.847382Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0311319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abb37d8afbb58ef9dcbc1c746e89a416781cd2378d89d7d611e3e0a2dd783eea","sha256:7c95620716632164d0d440956c27d308e3cb04bc45865d4a0413a51243bc5ed8"],"state_sha256":"5c0b4b8a525043eaa3062f5f7a3a84d81d7d2975650d0ee5e1b6bdea43837247"}