{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YIOEXNB4E7OO566EHFST6H5QKJ","short_pith_number":"pith:YIOEXNB4","canonical_record":{"source":{"id":"1704.07009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-24T01:01:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd7b2dcd71afef39698cea0b8273de759d15ce9179153a0141833676c9a650cb","abstract_canon_sha256":"30ee18d385823b9f6083411ff612eac64f9712495ccb29e7cc200cfaac5af752"},"schema_version":"1.0"},"canonical_sha256":"c21c4bb43c27dceefbc439653f1fb05242b93b62f1f2c1e1a6fab0112603adfc","source":{"kind":"arxiv","id":"1704.07009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07009","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07009v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07009","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"YIOEXNB4E7OO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YIOEXNB4E7OO566E","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YIOEXNB4","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YIOEXNB4E7OO566EHFST6H5QKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-24T01:01:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd7b2dcd71afef39698cea0b8273de759d15ce9179153a0141833676c9a650cb","abstract_canon_sha256":"30ee18d385823b9f6083411ff612eac64f9712495ccb29e7cc200cfaac5af752"},"schema_version":"1.0"},"canonical_sha256":"c21c4bb43c27dceefbc439653f1fb05242b93b62f1f2c1e1a6fab0112603adfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:55.027105Z","signature_b64":"d2aIoodjCg4Xca0Ko051Ps1OeHPHoF8vZMWz9OtAXa6oz5P57wfV947qFipiqCYN76hgdi4QW1MXzF8AzQ6tCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c21c4bb43c27dceefbc439653f1fb05242b93b62f1f2c1e1a6fab0112603adfc","last_reissued_at":"2026-05-18T00:45:55.026614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:55.026614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07009","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-05-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZfcgHWQpt//bDo0CUetoREWavpDenaCWDraFaitut//xY9Mk7uhKS+ZwBXjorczhnbBBCdBVqtkf1hk+GhcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:31:25.019226Z"},"content_sha256":"d3a18495e3650771ca0a51ecaca9d2b1736c531f796e676c48d339c6a9714837","schema_version":"1.0","event_id":"sha256:d3a18495e3650771ca0a51ecaca9d2b1736c531f796e676c48d339c6a9714837"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YIOEXNB4E7OO566EHFST6H5QKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Two-Stage Automorphism Group Decoders for Cyclic Codes in the Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chanki Kim, Jong-Seon No","submitted_at":"2017-04-24T01:01:27Z","abstract_excerpt":"Recently, error correcting codes in the erasure channel have drawn great attention for various applications such as distributed storage systems and wireless sensor networks, but many of their decoding algorithms are not practical because they have higher decoding complexity and longer delay. Thus, the automorphism group decoder (AGD) for cyclic codes in the erasure channel was introduced, which has good erasure decoding performance with low decoding complexity. In this paper, we propose new two-stage AGDs (TS-AGDs) for cyclic codes in the erasure channel by modifying the parity check matrix an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07009","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"},"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-18T00:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DIMhF631UfFmsTnvd79bC8MTOotNqt7WgK7u1EFr6Y6aDZTjIajxAbmKUq4cTCnxSBskQG3lT9HoVjQI1xhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:31:25.019932Z"},"content_sha256":"8da7be14926adebc530ce6811fb6177909ca9350d644f55091d2aba4ca9a233d","schema_version":"1.0","event_id":"sha256:8da7be14926adebc530ce6811fb6177909ca9350d644f55091d2aba4ca9a233d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIOEXNB4E7OO566EHFST6H5QKJ/bundle.json","state_url":"https://pith.science/pith/YIOEXNB4E7OO566EHFST6H5QKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIOEXNB4E7OO566EHFST6H5QKJ/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-07T17:31:25Z","links":{"resolver":"https://pith.science/pith/YIOEXNB4E7OO566EHFST6H5QKJ","bundle":"https://pith.science/pith/YIOEXNB4E7OO566EHFST6H5QKJ/bundle.json","state":"https://pith.science/pith/YIOEXNB4E7OO566EHFST6H5QKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIOEXNB4E7OO566EHFST6H5QKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YIOEXNB4E7OO566EHFST6H5QKJ","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":"30ee18d385823b9f6083411ff612eac64f9712495ccb29e7cc200cfaac5af752","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-24T01:01:27Z","title_canon_sha256":"fd7b2dcd71afef39698cea0b8273de759d15ce9179153a0141833676c9a650cb"},"schema_version":"1.0","source":{"id":"1704.07009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07009","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07009v1","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07009","created_at":"2026-05-18T00:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"YIOEXNB4E7OO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YIOEXNB4E7OO566E","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YIOEXNB4","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:8da7be14926adebc530ce6811fb6177909ca9350d644f55091d2aba4ca9a233d","target":"graph","created_at":"2026-05-18T00:45:55Z","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":"Recently, error correcting codes in the erasure channel have drawn great attention for various applications such as distributed storage systems and wireless sensor networks, but many of their decoding algorithms are not practical because they have higher decoding complexity and longer delay. Thus, the automorphism group decoder (AGD) for cyclic codes in the erasure channel was introduced, which has good erasure decoding performance with low decoding complexity. In this paper, we propose new two-stage AGDs (TS-AGDs) for cyclic codes in the erasure channel by modifying the parity check matrix an","authors_text":"Chanki Kim, Jong-Seon No","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-24T01:01:27Z","title":"New Two-Stage Automorphism Group Decoders for Cyclic Codes in the Erasure Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07009","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:d3a18495e3650771ca0a51ecaca9d2b1736c531f796e676c48d339c6a9714837","target":"record","created_at":"2026-05-18T00:45:55Z","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":"30ee18d385823b9f6083411ff612eac64f9712495ccb29e7cc200cfaac5af752","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-24T01:01:27Z","title_canon_sha256":"fd7b2dcd71afef39698cea0b8273de759d15ce9179153a0141833676c9a650cb"},"schema_version":"1.0","source":{"id":"1704.07009","kind":"arxiv","version":1}},"canonical_sha256":"c21c4bb43c27dceefbc439653f1fb05242b93b62f1f2c1e1a6fab0112603adfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c21c4bb43c27dceefbc439653f1fb05242b93b62f1f2c1e1a6fab0112603adfc","first_computed_at":"2026-05-18T00:45:55.026614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:55.026614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d2aIoodjCg4Xca0Ko051Ps1OeHPHoF8vZMWz9OtAXa6oz5P57wfV947qFipiqCYN76hgdi4QW1MXzF8AzQ6tCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:55.027105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3a18495e3650771ca0a51ecaca9d2b1736c531f796e676c48d339c6a9714837","sha256:8da7be14926adebc530ce6811fb6177909ca9350d644f55091d2aba4ca9a233d"],"state_sha256":"60ab983d13f65319b08b6413175d0896f518bf606ba3a63081bf15aa61d52e8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ByWYVOhF0TDdJfYm4JhnS2anpDhi9Mu6KAxNbHoa6079IvSf0qbYG8VIUpAmVEkXXUQGrjOpe2agNUSTFv8cAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:31:25.023745Z","bundle_sha256":"bcbb938e0bf7449bb5a16ed3033a062f8b11c1bda44ad04eba6417b72c8f958d"}}