{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X62CXH2YHH7KWVECRPL4KPDEVO","short_pith_number":"pith:X62CXH2Y","canonical_record":{"source":{"id":"1302.1461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T18:14:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"207a7fe78a22fd40fabd85b741d99617f4be1c860dbc868c3227d428cdd74730","abstract_canon_sha256":"4d17bdb20d12a26549d9b3cea4936d1d9fd14bdb12c492f32a7fb81693abc381"},"schema_version":"1.0"},"canonical_sha256":"bfb42b9f5839feab54828bd7c53c64abb2e14fb1bc3f7a3d36ed4252c7fc2572","source":{"kind":"arxiv","id":"1302.1461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1461","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1461v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1461","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"X62CXH2YHH7K","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X62CXH2YHH7KWVEC","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X62CXH2Y","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X62CXH2YHH7KWVECRPL4KPDEVO","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T18:14:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"207a7fe78a22fd40fabd85b741d99617f4be1c860dbc868c3227d428cdd74730","abstract_canon_sha256":"4d17bdb20d12a26549d9b3cea4936d1d9fd14bdb12c492f32a7fb81693abc381"},"schema_version":"1.0"},"canonical_sha256":"bfb42b9f5839feab54828bd7c53c64abb2e14fb1bc3f7a3d36ed4252c7fc2572","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:24.195231Z","signature_b64":"ytJZqtm+TtgqCWbf3IDp4+/OGBxONff2kGUFHBV0bpIINs9OLOcMHDyQprilcuN/JiitXWKdeg6Yv579KrDeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfb42b9f5839feab54828bd7c53c64abb2e14fb1bc3f7a3d36ed4252c7fc2572","last_reissued_at":"2026-05-18T03:34:24.194535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:24.194535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1461","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-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPmBqre/Z6Q/S43dSLi5dQc4Sj0WdKmMDPo/aqbfh4I9zTecLh5+OyYn/6EIAKeYmLcFU/7V0NxsVsz2UdD6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:35:40.398539Z"},"content_sha256":"8e17e984b234164761bccf12d8f4e6a571ef961a6e5e551d221a99ed487beb24","schema_version":"1.0","event_id":"sha256:8e17e984b234164761bccf12d8f4e6a571ef961a6e5e551d221a99ed487beb24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X62CXH2YHH7KWVECRPL4KPDEVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stopping Criteria for Iterative Decoding based on Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branimir R. Vojcic, Jia Sheng, Jinhong Wu","submitted_at":"2013-02-06T18:14:34Z","abstract_excerpt":"In this paper we investigate stopping criteria for iterative decoding from a mutual information perspective. We introduce new iteration stopping rules based on an approximation of the mutual information between encoded bits and decoder soft output. The first type stopping rule sets a threshold value directly on the approximated mutual information for terminating decoding. The threshold can be adjusted according to the expected bit error rate. The second one adopts a strategy similar to that of the well known cross-entropy stopping rule by applying a fixed threshold on the ratio of a simple met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1461","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-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zi5HWJl2ewukcecxUgYVf8+5f0BEzWOvN71KyPSyIUpFA7CG+/jPjP/7Bg5gQWrdzpp0gk7ChbPI84nL53AtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:35:40.398875Z"},"content_sha256":"b3c1ed684b33b6d75f500d596725917a83c5432907d501bf4274404668721b65","schema_version":"1.0","event_id":"sha256:b3c1ed684b33b6d75f500d596725917a83c5432907d501bf4274404668721b65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X62CXH2YHH7KWVECRPL4KPDEVO/bundle.json","state_url":"https://pith.science/pith/X62CXH2YHH7KWVECRPL4KPDEVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X62CXH2YHH7KWVECRPL4KPDEVO/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-27T17:35:40Z","links":{"resolver":"https://pith.science/pith/X62CXH2YHH7KWVECRPL4KPDEVO","bundle":"https://pith.science/pith/X62CXH2YHH7KWVECRPL4KPDEVO/bundle.json","state":"https://pith.science/pith/X62CXH2YHH7KWVECRPL4KPDEVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X62CXH2YHH7KWVECRPL4KPDEVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X62CXH2YHH7KWVECRPL4KPDEVO","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":"4d17bdb20d12a26549d9b3cea4936d1d9fd14bdb12c492f32a7fb81693abc381","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T18:14:34Z","title_canon_sha256":"207a7fe78a22fd40fabd85b741d99617f4be1c860dbc868c3227d428cdd74730"},"schema_version":"1.0","source":{"id":"1302.1461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1461","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1461v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1461","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"X62CXH2YHH7K","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X62CXH2YHH7KWVEC","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X62CXH2Y","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:b3c1ed684b33b6d75f500d596725917a83c5432907d501bf4274404668721b65","target":"graph","created_at":"2026-05-18T03:34:24Z","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 investigate stopping criteria for iterative decoding from a mutual information perspective. We introduce new iteration stopping rules based on an approximation of the mutual information between encoded bits and decoder soft output. The first type stopping rule sets a threshold value directly on the approximated mutual information for terminating decoding. The threshold can be adjusted according to the expected bit error rate. The second one adopts a strategy similar to that of the well known cross-entropy stopping rule by applying a fixed threshold on the ratio of a simple met","authors_text":"Branimir R. Vojcic, Jia Sheng, Jinhong Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T18:14:34Z","title":"Stopping Criteria for Iterative Decoding based on Mutual Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1461","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:8e17e984b234164761bccf12d8f4e6a571ef961a6e5e551d221a99ed487beb24","target":"record","created_at":"2026-05-18T03:34:24Z","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":"4d17bdb20d12a26549d9b3cea4936d1d9fd14bdb12c492f32a7fb81693abc381","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T18:14:34Z","title_canon_sha256":"207a7fe78a22fd40fabd85b741d99617f4be1c860dbc868c3227d428cdd74730"},"schema_version":"1.0","source":{"id":"1302.1461","kind":"arxiv","version":1}},"canonical_sha256":"bfb42b9f5839feab54828bd7c53c64abb2e14fb1bc3f7a3d36ed4252c7fc2572","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfb42b9f5839feab54828bd7c53c64abb2e14fb1bc3f7a3d36ed4252c7fc2572","first_computed_at":"2026-05-18T03:34:24.194535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:24.194535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytJZqtm+TtgqCWbf3IDp4+/OGBxONff2kGUFHBV0bpIINs9OLOcMHDyQprilcuN/JiitXWKdeg6Yv579KrDeDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:24.195231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e17e984b234164761bccf12d8f4e6a571ef961a6e5e551d221a99ed487beb24","sha256:b3c1ed684b33b6d75f500d596725917a83c5432907d501bf4274404668721b65"],"state_sha256":"04ca9cd9c96c00de8264e8c90c39ee959d37e6b1f06b7a0aa3f888ac2a878b29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBalh2r86uJLs+sn9aGqjZGBYjdyDRAS8/UT6k+N0dUdvNtlI9xYrfml019UByeKjHhp3iIDoZrwZgDES7qaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:35:40.400651Z","bundle_sha256":"208eee12006dc2ab40bd70e96cea5ad4b1119c1967d9522372464bb988e57886"}}