{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WCEWPJNYUNUW62GDIE4UQKTTUD","short_pith_number":"pith:WCEWPJNY","schema_version":"1.0","canonical_sha256":"b08967a5b8a3696f68c34139482a73a0ea0779096983a54f17fc80e7b7e1a312","source":{"kind":"arxiv","id":"1201.5167","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.5167","created_at":"2026-05-18T02:21:18.367431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5167v1","created_at":"2026-05-18T02:21:18.367431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5167","created_at":"2026-05-18T02:21:18.367431+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCEWPJNYUNUW","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCEWPJNYUNUW62GD","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCEWPJNY","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD","json":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD.json","graph_json":"https://pith.science/api/pith-number/WCEWPJNYUNUW62GDIE4UQKTTUD/graph.json","events_json":"https://pith.science/api/pith-number/WCEWPJNYUNUW62GDIE4UQKTTUD/events.json","paper":"https://pith.science/paper/WCEWPJNY"},"agent_actions":{"view_html":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD","download_json":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD.json","view_paper":"https://pith.science/paper/WCEWPJNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5167&json=true","fetch_graph":"https://pith.science/api/pith-number/WCEWPJNYUNUW62GDIE4UQKTTUD/graph.json","fetch_events":"https://pith.science/api/pith-number/WCEWPJNYUNUW62GDIE4UQKTTUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/action/storage_attestation","attest_author":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/action/author_attestation","sign_citation":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/action/citation_signature","submit_replication":"https://pith.science/pith/WCEWPJNYUNUW62GDIE4UQKTTUD/action/replication_record"}},"created_at":"2026-05-18T02:21:18.367431+00:00","updated_at":"2026-05-18T02:21:18.367431+00:00"}