{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:AZUQ6KIWYYMW5CKBVEZWYHZTBH","short_pith_number":"pith:AZUQ6KIW","canonical_record":{"source":{"id":"0708.0905","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-08-07T09:55:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1ee153323d57175c64c84e691c15d4a71dbd852178c044d6f2e18e8e96c46ce5","abstract_canon_sha256":"c9311b57411203e5517fc94b4d0f33533271bcdb6da57850ba13bf1a671bd990"},"schema_version":"1.0"},"canonical_sha256":"06690f2916c6196e8941a9336c1f3309f2b5147c4d1fbc457c5b1187418ec25f","source":{"kind":"arxiv","id":"0708.0905","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.0905","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"0708.0905v3","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.0905","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"AZUQ6KIWYYMW","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"AZUQ6KIWYYMW5CKB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"AZUQ6KIW","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:AZUQ6KIWYYMW5CKBVEZWYHZTBH","target":"record","payload":{"canonical_record":{"source":{"id":"0708.0905","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-08-07T09:55:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1ee153323d57175c64c84e691c15d4a71dbd852178c044d6f2e18e8e96c46ce5","abstract_canon_sha256":"c9311b57411203e5517fc94b4d0f33533271bcdb6da57850ba13bf1a671bd990"},"schema_version":"1.0"},"canonical_sha256":"06690f2916c6196e8941a9336c1f3309f2b5147c4d1fbc457c5b1187418ec25f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.047346Z","signature_b64":"NmA0D8zuPwST2tGyv4fi3ala5eZO5zvfzKZ3ANF/qxvUp+O7seSFG/1Fe61qMC9TDwWmLMP8sg1pmJGNKvytCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06690f2916c6196e8941a9336c1f3309f2b5147c4d1fbc457c5b1187418ec25f","last_reissued_at":"2026-05-18T00:59:12.046701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.046701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0708.0905","source_version":3,"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:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtirGXgE7s10CX/3erTvz5GS6LEAVVND+cgLkbseorLqhfjmub9k7oo9X0vnY7AOcVhrTrccFZ14w8FvQ93MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:47:59.259267Z"},"content_sha256":"5ca3fa83eab39ed00484aa2ab06c94343cc1a0a25fc736b3bc63f679368752fc","schema_version":"1.0","event_id":"sha256:5ca3fa83eab39ed00484aa2ab06c94343cc1a0a25fc736b3bc63f679368752fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:AZUQ6KIWYYMW5CKBVEZWYHZTBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","submitted_at":"2007-08-07T09:55:31Z","abstract_excerpt":"We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovasz's Local Lemma and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. Based on the observed properties of parity-check matrices with good stopping redundancy characteristics, we develop a novel decoding technique, termed automorphism group decoding, that combines iterativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.0905","kind":"arxiv","version":3},"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:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPfWiNe1fZPKkE7rB1yxW5qLlwMa+yTeo0vjiXMIVxauSd8F3JefYRkxYGab8/9EVveHwMUm1n/cUeJvKuT0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:47:59.259796Z"},"content_sha256":"a5bc28a0e5b5ea84f49da5cf7ed473f5b8c29e4545ed8c6572c85dae0be581fd","schema_version":"1.0","event_id":"sha256:a5bc28a0e5b5ea84f49da5cf7ed473f5b8c29e4545ed8c6572c85dae0be581fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/bundle.json","state_url":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/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-25T07:47:59Z","links":{"resolver":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH","bundle":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/bundle.json","state":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:AZUQ6KIWYYMW5CKBVEZWYHZTBH","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":"c9311b57411203e5517fc94b4d0f33533271bcdb6da57850ba13bf1a671bd990","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-08-07T09:55:31Z","title_canon_sha256":"1ee153323d57175c64c84e691c15d4a71dbd852178c044d6f2e18e8e96c46ce5"},"schema_version":"1.0","source":{"id":"0708.0905","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.0905","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"0708.0905v3","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.0905","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"AZUQ6KIWYYMW","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"AZUQ6KIWYYMW5CKB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"AZUQ6KIW","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:a5bc28a0e5b5ea84f49da5cf7ed473f5b8c29e4545ed8c6572c85dae0be581fd","target":"graph","created_at":"2026-05-18T00:59:12Z","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":"We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovasz's Local Lemma and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. Based on the observed properties of parity-check matrices with good stopping redundancy characteristics, we develop a novel decoding technique, termed automorphism group decoding, that combines iterativ","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-08-07T09:55:31Z","title":"Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.0905","kind":"arxiv","version":3},"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:5ca3fa83eab39ed00484aa2ab06c94343cc1a0a25fc736b3bc63f679368752fc","target":"record","created_at":"2026-05-18T00:59:12Z","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":"c9311b57411203e5517fc94b4d0f33533271bcdb6da57850ba13bf1a671bd990","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-08-07T09:55:31Z","title_canon_sha256":"1ee153323d57175c64c84e691c15d4a71dbd852178c044d6f2e18e8e96c46ce5"},"schema_version":"1.0","source":{"id":"0708.0905","kind":"arxiv","version":3}},"canonical_sha256":"06690f2916c6196e8941a9336c1f3309f2b5147c4d1fbc457c5b1187418ec25f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06690f2916c6196e8941a9336c1f3309f2b5147c4d1fbc457c5b1187418ec25f","first_computed_at":"2026-05-18T00:59:12.046701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:12.046701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NmA0D8zuPwST2tGyv4fi3ala5eZO5zvfzKZ3ANF/qxvUp+O7seSFG/1Fe61qMC9TDwWmLMP8sg1pmJGNKvytCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:12.047346Z","signed_message":"canonical_sha256_bytes"},"source_id":"0708.0905","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ca3fa83eab39ed00484aa2ab06c94343cc1a0a25fc736b3bc63f679368752fc","sha256:a5bc28a0e5b5ea84f49da5cf7ed473f5b8c29e4545ed8c6572c85dae0be581fd"],"state_sha256":"172b5362b5338d93b34ef491ed78aa2b500ae522898a6933f5a27190c4eeef04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNG6+33qp7MvtMugdC+oNqZjHvlGXsCPMc++cQXBE0Ij+AtrKjLOkzkpW+zVv/0lsC8nWKRu8vrSFQFqbABZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:47:59.262579Z","bundle_sha256":"996f147933658e3fee06c2896a897e820697f778c39d2e712ea827969a089a5c"}}