{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WCEWPJNYUNUW62GDIE4UQKTTUD","short_pith_number":"pith:WCEWPJNY","canonical_record":{"source":{"id":"1201.5167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-25T00:56:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5980a89f4a2ae44ad10b9f24cf4f451966a8658b6b603dd0e62e9660acab6d7","abstract_canon_sha256":"8887a358940e8b9277c7ed2e385ef4d09a20cf6aa9fba71644f1fbad279eb50c"},"schema_version":"1.0"},"canonical_sha256":"b08967a5b8a3696f68c34139482a73a0ea0779096983a54f17fc80e7b7e1a312","source":{"kind":"arxiv","id":"1201.5167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5167","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5167v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5167","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"WCEWPJNYUNUW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WCEWPJNYUNUW62GD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WCEWPJNY","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WCEWPJNYUNUW62GDIE4UQKTTUD","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-25T00:56:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5980a89f4a2ae44ad10b9f24cf4f451966a8658b6b603dd0e62e9660acab6d7","abstract_canon_sha256":"8887a358940e8b9277c7ed2e385ef4d09a20cf6aa9fba71644f1fbad279eb50c"},"schema_version":"1.0"},"canonical_sha256":"b08967a5b8a3696f68c34139482a73a0ea0779096983a54f17fc80e7b7e1a312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.368011Z","signature_b64":"jCu45X1J1M55ywB1aRJrV4nitp+ZDO5XQzfQKsroV5aSurg9QUW/Ydi4gpCqrAi7uVoZJawMQHrR4tbwGXmdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b08967a5b8a3696f68c34139482a73a0ea0779096983a54f17fc80e7b7e1a312","last_reissued_at":"2026-05-18T02:21:18.367306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.367306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5167","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUEe5pOn//nyegOBnSsr22ye1WP+2PFT0lg8OGzjqo7QGU1RACOKD/QOJFo5ZGzLkdkMz5RXJmpA0vQvCyLmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:43:17.580695Z"},"content_sha256":"88a33b3938377bf3cd00d0249bd60107f2145552ed4db444dc9b6c1a4611fdbe","schema_version":"1.0","event_id":"sha256:88a33b3938377bf3cd00d0249bd60107f2145552ed4db444dc9b6c1a4611fdbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WCEWPJNYUNUW62GDIE4UQKTTUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interactive Encoding and Decoding Based on Binary LDPC Codes with Syndrome Accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-Hui Yang (University of Waterloo), Jin Meng","submitted_at":"2012-01-25T00:56:03Z","abstract_excerpt":"Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is $\\mathbf{GF}(2)$, and the side information alphabet is finite. It is first demonstrated how to convert any classical universal lossless code $\\mathcal{C}_n$ (with block length $n$ and side information available to both the encoder and decoder) into a universal SA-LDPC-IED scheme. It is then shown that with the word error probability approaching 0 sub-exponentially with $n$, the compression rate (including both"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5167","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03qveBNzGN271nCStO93OHPLOZb/m3w/tf3Z4lghRic4ch6TsUfTkcEjVzfYr2Y2Xhl/w62YC8KmpGnCSg9tBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:43:17.581052Z"},"content_sha256":"eafcdd966f1309a01c571d801f3d10617bb576957c676c6ed38618f06e9ce0cf","schema_version":"1.0","event_id":"sha256:eafcdd966f1309a01c571d801f3d10617bb576957c676c6ed38618f06e9ce0cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/bundle.json","state_url":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/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-08T15:43:17Z","links":{"resolver":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD","bundle":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/bundle.json","state":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WCEWPJNYUNUW62GDIE4UQKTTUD","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":"8887a358940e8b9277c7ed2e385ef4d09a20cf6aa9fba71644f1fbad279eb50c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-25T00:56:03Z","title_canon_sha256":"a5980a89f4a2ae44ad10b9f24cf4f451966a8658b6b603dd0e62e9660acab6d7"},"schema_version":"1.0","source":{"id":"1201.5167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5167","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5167v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5167","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"WCEWPJNYUNUW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WCEWPJNYUNUW62GD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WCEWPJNY","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:eafcdd966f1309a01c571d801f3d10617bb576957c676c6ed38618f06e9ce0cf","target":"graph","created_at":"2026-05-18T02:21:18Z","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":"Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is $\\mathbf{GF}(2)$, and the side information alphabet is finite. It is first demonstrated how to convert any classical universal lossless code $\\mathcal{C}_n$ (with block length $n$ and side information available to both the encoder and decoder) into a universal SA-LDPC-IED scheme. It is then shown that with the word error probability approaching 0 sub-exponentially with $n$, the compression rate (including both","authors_text":"En-Hui Yang (University of Waterloo), Jin Meng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-25T00:56:03Z","title":"Interactive Encoding and Decoding Based on Binary LDPC Codes with Syndrome Accumulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5167","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:88a33b3938377bf3cd00d0249bd60107f2145552ed4db444dc9b6c1a4611fdbe","target":"record","created_at":"2026-05-18T02:21:18Z","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":"8887a358940e8b9277c7ed2e385ef4d09a20cf6aa9fba71644f1fbad279eb50c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-25T00:56:03Z","title_canon_sha256":"a5980a89f4a2ae44ad10b9f24cf4f451966a8658b6b603dd0e62e9660acab6d7"},"schema_version":"1.0","source":{"id":"1201.5167","kind":"arxiv","version":1}},"canonical_sha256":"b08967a5b8a3696f68c34139482a73a0ea0779096983a54f17fc80e7b7e1a312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b08967a5b8a3696f68c34139482a73a0ea0779096983a54f17fc80e7b7e1a312","first_computed_at":"2026-05-18T02:21:18.367306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.367306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jCu45X1J1M55ywB1aRJrV4nitp+ZDO5XQzfQKsroV5aSurg9QUW/Ydi4gpCqrAi7uVoZJawMQHrR4tbwGXmdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.368011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88a33b3938377bf3cd00d0249bd60107f2145552ed4db444dc9b6c1a4611fdbe","sha256:eafcdd966f1309a01c571d801f3d10617bb576957c676c6ed38618f06e9ce0cf"],"state_sha256":"7115a31dc69101ead22df2360810e2c676e0053516f3ff09837254823f000676"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t06bhCIsd/jpDUum3STlAf10Sf7Nas8CwJouMvgSiIlH2NY26ZAJ13XCgpgIgZm7cfYeh2WNFRYQk4jN/+kQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:43:17.584536Z","bundle_sha256":"9c232a6d4584a5b8bcfe1d39c8525d6e5eef8a50522750824e4df54e5d635dcc"}}