{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:CA56K75CNDZO37SN3FPFEDIY5X","short_pith_number":"pith:CA56K75C","canonical_record":{"source":{"id":"0905.4164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-26T11:11:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f17664e30a0a9c9899ecdd56055d2fff707a4813a88423af26e550032a92202d","abstract_canon_sha256":"e26eb00c4c93e6f664ea2a1abb4cb73afabfcb3b08e706a4f9bf516a525cd459"},"schema_version":"1.0"},"canonical_sha256":"103be57fa268f2edfe4dd95e520d18edd8ad9456b03a45391eb5f5f29b766345","source":{"kind":"arxiv","id":"0905.4164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4164","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4164v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4164","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"CA56K75CNDZO","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"CA56K75CNDZO37SN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"CA56K75C","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:CA56K75CNDZO37SN3FPFEDIY5X","target":"record","payload":{"canonical_record":{"source":{"id":"0905.4164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-26T11:11:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f17664e30a0a9c9899ecdd56055d2fff707a4813a88423af26e550032a92202d","abstract_canon_sha256":"e26eb00c4c93e6f664ea2a1abb4cb73afabfcb3b08e706a4f9bf516a525cd459"},"schema_version":"1.0"},"canonical_sha256":"103be57fa268f2edfe4dd95e520d18edd8ad9456b03a45391eb5f5f29b766345","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.095532Z","signature_b64":"VHKVhp8jDdooCdEdEAV3Q5G7LtKSD9px3aF81/gANYD2Vkuxl10473/BmTykpFu0WzUXSyokENRHoR2FviXhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"103be57fa268f2edfe4dd95e520d18edd8ad9456b03a45391eb5f5f29b766345","last_reissued_at":"2026-05-18T00:58:48.094995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.094995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.4164","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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiaS1/IBwQodmhGUSSYZ4SYPVLUYnc0PXwh/0Yq95+7Nj/MtKEkaiR1JVEgjHWelbvX0drg92son7dW3hS76BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:17:59.438231Z"},"content_sha256":"c7582909fbbc015f83f4dbfb7c667019e302d6a0462f64f0ac603b981156e897","schema_version":"1.0","event_id":"sha256:c7582909fbbc015f83f4dbfb7c667019e302d6a0462f64f0ac603b981156e897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:CA56K75CNDZO37SN3FPFEDIY5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Constanza Riera, Eirik Rosnes, Joakim Grahl Knudsen, Lars Eirik Danielsen, Matthew G. Parker","submitted_at":"2009-05-26T11:11:19Z","abstract_excerpt":"In this paper, we propose to enhance the performance of the sum-product algorithm (SPA) by interleaving SPA iterations with a random local graph update rule. This rule is known as edge local complementation (ELC), and has the effect of modifying the Tanner graph while preserving the code. We have previously shown how the ELC operation can be used to implement an iterative permutation group decoder (SPA-PD)--one of the most successful iterative soft-decision decoding strategies at small blocklengths. In this work, we exploit the fact that ELC can also give structurally distinct parity-check mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4164","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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6Hbvkj1g5KvSV+i0AWgCZHndH8ikZLLVvgibWf3tOrZbWKBO/hDzem5Ib1trDfgSz08KbJge+ueNuIjWdtgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:17:59.438587Z"},"content_sha256":"aad51a721be41c7ce91bb9dc957056ee7bfe2d1f8edce46f6cb5ac854805a644","schema_version":"1.0","event_id":"sha256:aad51a721be41c7ce91bb9dc957056ee7bfe2d1f8edce46f6cb5ac854805a644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CA56K75CNDZO37SN3FPFEDIY5X/bundle.json","state_url":"https://pith.science/pith/CA56K75CNDZO37SN3FPFEDIY5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CA56K75CNDZO37SN3FPFEDIY5X/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-02T22:17:59Z","links":{"resolver":"https://pith.science/pith/CA56K75CNDZO37SN3FPFEDIY5X","bundle":"https://pith.science/pith/CA56K75CNDZO37SN3FPFEDIY5X/bundle.json","state":"https://pith.science/pith/CA56K75CNDZO37SN3FPFEDIY5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CA56K75CNDZO37SN3FPFEDIY5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:CA56K75CNDZO37SN3FPFEDIY5X","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":"e26eb00c4c93e6f664ea2a1abb4cb73afabfcb3b08e706a4f9bf516a525cd459","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-26T11:11:19Z","title_canon_sha256":"f17664e30a0a9c9899ecdd56055d2fff707a4813a88423af26e550032a92202d"},"schema_version":"1.0","source":{"id":"0905.4164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4164","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4164v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4164","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"CA56K75CNDZO","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"CA56K75CNDZO37SN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"CA56K75C","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:aad51a721be41c7ce91bb9dc957056ee7bfe2d1f8edce46f6cb5ac854805a644","target":"graph","created_at":"2026-05-18T00:58:48Z","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 paper, we propose to enhance the performance of the sum-product algorithm (SPA) by interleaving SPA iterations with a random local graph update rule. This rule is known as edge local complementation (ELC), and has the effect of modifying the Tanner graph while preserving the code. We have previously shown how the ELC operation can be used to implement an iterative permutation group decoder (SPA-PD)--one of the most successful iterative soft-decision decoding strategies at small blocklengths. In this work, we exploit the fact that ELC can also give structurally distinct parity-check mat","authors_text":"Constanza Riera, Eirik Rosnes, Joakim Grahl Knudsen, Lars Eirik Danielsen, Matthew G. Parker","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-26T11:11:19Z","title":"Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4164","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:c7582909fbbc015f83f4dbfb7c667019e302d6a0462f64f0ac603b981156e897","target":"record","created_at":"2026-05-18T00:58:48Z","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":"e26eb00c4c93e6f664ea2a1abb4cb73afabfcb3b08e706a4f9bf516a525cd459","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-26T11:11:19Z","title_canon_sha256":"f17664e30a0a9c9899ecdd56055d2fff707a4813a88423af26e550032a92202d"},"schema_version":"1.0","source":{"id":"0905.4164","kind":"arxiv","version":1}},"canonical_sha256":"103be57fa268f2edfe4dd95e520d18edd8ad9456b03a45391eb5f5f29b766345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"103be57fa268f2edfe4dd95e520d18edd8ad9456b03a45391eb5f5f29b766345","first_computed_at":"2026-05-18T00:58:48.094995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.094995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VHKVhp8jDdooCdEdEAV3Q5G7LtKSD9px3aF81/gANYD2Vkuxl10473/BmTykpFu0WzUXSyokENRHoR2FviXhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.095532Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.4164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7582909fbbc015f83f4dbfb7c667019e302d6a0462f64f0ac603b981156e897","sha256:aad51a721be41c7ce91bb9dc957056ee7bfe2d1f8edce46f6cb5ac854805a644"],"state_sha256":"8b6ed98eb28beb144eee0f41223caaf224ef89d61ede13c053e8b5e2e1c15794"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrBz/WC0zmIm0G+TvY4dPXph2G2d7Bkdae50t00LgDSggHb3rRiqUUlDCS8cw8gB8AZL9Af25hukmpkQ/HHPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:17:59.440496Z","bundle_sha256":"a6982dafc6791e64eccf3c4c2432195ddc3be0c17bf15908a78b0a5ca007eb56"}}