{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:75NLBMXQ5C5ERGW5MH6PVKFEKM","short_pith_number":"pith:75NLBMXQ","canonical_record":{"source":{"id":"1102.3604","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T15:18:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a902378869f094302eac6d9634ef10ee0dd203119291b655eb297642b8cbfc73","abstract_canon_sha256":"ad6dc044d12f348345fbf37bfd352d030e52799573f218160da8f41d956dd379"},"schema_version":"1.0"},"canonical_sha256":"ff5ab0b2f0e8ba489add61fcfaa8a45304debf734daa5c831543d9f540649321","source":{"kind":"arxiv","id":"1102.3604","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3604","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3604v5","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3604","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"75NLBMXQ5C5E","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"75NLBMXQ5C5ERGW5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"75NLBMXQ","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:75NLBMXQ5C5ERGW5MH6PVKFEKM","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3604","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T15:18:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a902378869f094302eac6d9634ef10ee0dd203119291b655eb297642b8cbfc73","abstract_canon_sha256":"ad6dc044d12f348345fbf37bfd352d030e52799573f218160da8f41d956dd379"},"schema_version":"1.0"},"canonical_sha256":"ff5ab0b2f0e8ba489add61fcfaa8a45304debf734daa5c831543d9f540649321","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:32.560206Z","signature_b64":"dRtXqgbkTvO8BdEth5BrrgFxqzo0qrAiYIJaR4kz3g8OI1JeylUybtDJgKWn6hK4LUCrBG8Qv57ka1AHohiODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff5ab0b2f0e8ba489add61fcfaa8a45304debf734daa5c831543d9f540649321","last_reissued_at":"2026-05-18T04:26:32.559699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:32.559699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3604","source_version":5,"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-05-18T04:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ia5i9Z8vGlsLdxL9liVE0njpFeL+lAoZdyI60KNGk7U4a0OZ7J4zo3EtIYuheTf92rFtuGstBpd1UhfxGtMjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:48:51.856651Z"},"content_sha256":"20a7117ad112f7187499a22c0539d7bb86e772474006baab9c983771e8626dc2","schema_version":"1.0","event_id":"sha256:20a7117ad112f7187499a22c0539d7bb86e772474006baab9c983771e8626dc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:75NLBMXQ5C5ERGW5MH6PVKFEKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Decoding of Negacyclic Codes Over Z_4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Eimear Byrne, Jaume Pernas, Jens Zumbr\\\"agel, Marcus Greferath","submitted_at":"2011-02-17T15:18:16Z","abstract_excerpt":"In this article we investigate Berlekamp's negacyclic codes and discover that these codes, when considered over the integers modulo 4, do not suffer any of the restrictions on the minimum distance observed in Berlekamp's original papers. The codes considered here have minimim Lee distance at least 2t+1, where the generator polynomial of the code has roots z,z^3,...,z^{2t+1} for a primitive 2nth root of unity z in a Galois extension of Z4. No restriction on t is imposed. We present an algebraic decoding algorithm for this class of codes that corrects any error pattern of Lee weight at most t. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3604","kind":"arxiv","version":5},"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"},"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-05-18T04:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaiAsmNPn3UAVf/vOWdnY0BjcfiojlaHazUh7bwWie2qEiDgIJKVe4jfP2w7YfIbsvFaFmSKBEnc/p21ha04CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:48:51.857009Z"},"content_sha256":"0051589c5d3bd8e11becc32cd7eb8796cf880081fc53e81907d3393c33e51098","schema_version":"1.0","event_id":"sha256:0051589c5d3bd8e11becc32cd7eb8796cf880081fc53e81907d3393c33e51098"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75NLBMXQ5C5ERGW5MH6PVKFEKM/bundle.json","state_url":"https://pith.science/pith/75NLBMXQ5C5ERGW5MH6PVKFEKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75NLBMXQ5C5ERGW5MH6PVKFEKM/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-06-03T01:48:51Z","links":{"resolver":"https://pith.science/pith/75NLBMXQ5C5ERGW5MH6PVKFEKM","bundle":"https://pith.science/pith/75NLBMXQ5C5ERGW5MH6PVKFEKM/bundle.json","state":"https://pith.science/pith/75NLBMXQ5C5ERGW5MH6PVKFEKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75NLBMXQ5C5ERGW5MH6PVKFEKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:75NLBMXQ5C5ERGW5MH6PVKFEKM","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":"ad6dc044d12f348345fbf37bfd352d030e52799573f218160da8f41d956dd379","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T15:18:16Z","title_canon_sha256":"a902378869f094302eac6d9634ef10ee0dd203119291b655eb297642b8cbfc73"},"schema_version":"1.0","source":{"id":"1102.3604","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3604","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3604v5","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3604","created_at":"2026-05-18T04:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"75NLBMXQ5C5E","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"75NLBMXQ5C5ERGW5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"75NLBMXQ","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:0051589c5d3bd8e11becc32cd7eb8796cf880081fc53e81907d3393c33e51098","target":"graph","created_at":"2026-05-18T04:26:32Z","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"},"paper":{"abstract_excerpt":"In this article we investigate Berlekamp's negacyclic codes and discover that these codes, when considered over the integers modulo 4, do not suffer any of the restrictions on the minimum distance observed in Berlekamp's original papers. The codes considered here have minimim Lee distance at least 2t+1, where the generator polynomial of the code has roots z,z^3,...,z^{2t+1} for a primitive 2nth root of unity z in a Galois extension of Z4. No restriction on t is imposed. We present an algebraic decoding algorithm for this class of codes that corrects any error pattern of Lee weight at most t. O","authors_text":"Eimear Byrne, Jaume Pernas, Jens Zumbr\\\"agel, Marcus Greferath","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T15:18:16Z","title":"Algebraic Decoding of Negacyclic Codes Over Z_4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3604","kind":"arxiv","version":5},"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:20a7117ad112f7187499a22c0539d7bb86e772474006baab9c983771e8626dc2","target":"record","created_at":"2026-05-18T04:26:32Z","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":"ad6dc044d12f348345fbf37bfd352d030e52799573f218160da8f41d956dd379","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T15:18:16Z","title_canon_sha256":"a902378869f094302eac6d9634ef10ee0dd203119291b655eb297642b8cbfc73"},"schema_version":"1.0","source":{"id":"1102.3604","kind":"arxiv","version":5}},"canonical_sha256":"ff5ab0b2f0e8ba489add61fcfaa8a45304debf734daa5c831543d9f540649321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff5ab0b2f0e8ba489add61fcfaa8a45304debf734daa5c831543d9f540649321","first_computed_at":"2026-05-18T04:26:32.559699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:32.559699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dRtXqgbkTvO8BdEth5BrrgFxqzo0qrAiYIJaR4kz3g8OI1JeylUybtDJgKWn6hK4LUCrBG8Qv57ka1AHohiODA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:32.560206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3604","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20a7117ad112f7187499a22c0539d7bb86e772474006baab9c983771e8626dc2","sha256:0051589c5d3bd8e11becc32cd7eb8796cf880081fc53e81907d3393c33e51098"],"state_sha256":"0acfcd636172b2c0fe6b346d8504b2244b7e63cc577a6de976de054bf22fc941"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71+GBDbskVFqjvUy+dHT8tTXoBUYoK7Fxd8Lsr0OYkI2Pl41ti36DyFUohE1eEB6QLYl8Ye8LN6xbyAQ44ArCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:48:51.859394Z","bundle_sha256":"c46eaa8c2639d6d56af1d03f56f818dda38fb29c44daec1a53bfb2920fa211a9"}}