{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:ACR6RZYRHWTQHZNKRIGPFK57AS","short_pith_number":"pith:ACR6RZYR","canonical_record":{"source":{"id":"math/0311319","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-11-18T21:35:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"259ab5d1a1101d4d067ce1b43c71405d48410981be4efc3265c7e866b084f903","abstract_canon_sha256":"2c959466015a1b6b53ee811f1f4633705e012af658c0b680e3928c8dc15fc478"},"schema_version":"1.0"},"canonical_sha256":"00a3e8e7113da703e5aa8a0cf2abbf04926c0ea62edffc09f150389fce96dd59","source":{"kind":"arxiv","id":"math/0311319","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:ACR6RZYRHWTQHZNKRIGPFK57AS","target":"record","payload":{"canonical_record":{"source":{"id":"math/0311319","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-11-18T21:35:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"259ab5d1a1101d4d067ce1b43c71405d48410981be4efc3265c7e866b084f903","abstract_canon_sha256":"2c959466015a1b6b53ee811f1f4633705e012af658c0b680e3928c8dc15fc478"},"schema_version":"1.0"},"canonical_sha256":"00a3e8e7113da703e5aa8a0cf2abbf04926c0ea62edffc09f150389fce96dd59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:02.847382Z","signature_b64":"54xuPcTOG/LPZkzr42UXYer+j6sFnw3EpVB+9tsYDSC7zjJJZ8dedkLq8BPcjLyzraYkPGpekSmSv5HW7XoEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a3e8e7113da703e5aa8a0cf2abbf04926c0ea62edffc09f150389fce96dd59","last_reissued_at":"2026-07-04T15:03:02.846987Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:02.846987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0311319","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T15:03:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yrpZkdjis+hysdUMJhbc4aWa7x/dvoXnsVpMQORN4265j0tAYuOtMLs/rGZLJApCDfkcgvXazZka6h26OKmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:47:41.958387Z"},"content_sha256":"abb37d8afbb58ef9dcbc1c746e89a416781cd2378d89d7d611e3e0a2dd783eea","schema_version":"1.0","event_id":"sha256:abb37d8afbb58ef9dcbc1c746e89a416781cd2378d89d7d611e3e0a2dd783eea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:ACR6RZYRHWTQHZNKRIGPFK57AS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modular and p-adic cyclic codes","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"A. R. Calderbank, N. J. A. Sloane","submitted_at":"2003-11-18T21:35:21Z","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-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311319","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0311319/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T15:03:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/hrDErACpZ9lIgX1BU8uN++phzwiTybxlvOn6yvHh6gWSViOTa0LUo9QYzQQxUtQJH5DiBEoC9nYnpoKrrhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:47:41.958764Z"},"content_sha256":"7c95620716632164d0d440956c27d308e3cb04bc45865d4a0413a51243bc5ed8","schema_version":"1.0","event_id":"sha256:7c95620716632164d0d440956c27d308e3cb04bc45865d4a0413a51243bc5ed8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACR6RZYRHWTQHZNKRIGPFK57AS/bundle.json","state_url":"https://pith.science/pith/ACR6RZYRHWTQHZNKRIGPFK57AS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACR6RZYRHWTQHZNKRIGPFK57AS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T22:47:41Z","links":{"resolver":"https://pith.science/pith/ACR6RZYRHWTQHZNKRIGPFK57AS","bundle":"https://pith.science/pith/ACR6RZYRHWTQHZNKRIGPFK57AS/bundle.json","state":"https://pith.science/pith/ACR6RZYRHWTQHZNKRIGPFK57AS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACR6RZYRHWTQHZNKRIGPFK57AS/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jCD2jKw6hRvmXxVpDeK1rtOYS0Bg0lNcYDCgBNySQi5aNXwCx2uCT9+nmbc6X5qu/fLc/M/pvv8mwXG6X5TBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T22:47:41.960813Z","bundle_sha256":"4bfbe50fb2cef34087b132fd05d7a6efb943048e87e65dacc5c3334e6d78d3fc"}}