{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JJ7OFXXLOYWFHVMEJGW5SIQZ2M","short_pith_number":"pith:JJ7OFXXL","canonical_record":{"source":{"id":"1106.2792","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T19:17:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18f12e38ee2fd113f836ced1a9b4731fc747b690a519ef9fa0c16312544c393e","abstract_canon_sha256":"e518cb5e3065665afd28f84e6d1ef9e505d12c51ae511a42abac2972864e99f1"},"schema_version":"1.0"},"canonical_sha256":"4a7ee2deeb762c53d58449add92219d33c6adbdafca6ceee533b0df8e0a8fc86","source":{"kind":"arxiv","id":"1106.2792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2792","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2792v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2792","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"JJ7OFXXLOYWF","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JJ7OFXXLOYWFHVME","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JJ7OFXXL","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JJ7OFXXLOYWFHVMEJGW5SIQZ2M","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2792","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T19:17:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18f12e38ee2fd113f836ced1a9b4731fc747b690a519ef9fa0c16312544c393e","abstract_canon_sha256":"e518cb5e3065665afd28f84e6d1ef9e505d12c51ae511a42abac2972864e99f1"},"schema_version":"1.0"},"canonical_sha256":"4a7ee2deeb762c53d58449add92219d33c6adbdafca6ceee533b0df8e0a8fc86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:04.124464Z","signature_b64":"mGQBT4SeV0C8isySJLwbk4iKeGkppyx94TJYbAnF3+UnEszAjaINhUGxyvp0rBd3LTlgwcCQ8dxzcGdUxamJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a7ee2deeb762c53d58449add92219d33c6adbdafca6ceee533b0df8e0a8fc86","last_reissued_at":"2026-05-18T04:20:04.123757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:04.123757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2792","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnQBZu9LNOf+/MkUQwiEb7lLa0ttdJUUtP2gmNlOGCMYNm5KhCesdANDKsNvWleyM04bKHQ+Qu9CxTO7xFOfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:31:58.657214Z"},"content_sha256":"88bd576c12f85b87adc104df135f294c61a3e63866be1afab5bd9473d8539f09","schema_version":"1.0","event_id":"sha256:88bd576c12f85b87adc104df135f294c61a3e63866be1afab5bd9473d8539f09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JJ7OFXXLOYWFHVMEJGW5SIQZ2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic codes for Slepian-Wolf code design","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Shizheng Li","submitted_at":"2011-06-14T19:17:21Z","abstract_excerpt":"Practical constructions of lossless distributed source codes (for the Slepian-Wolf problem) have been the subject of much investigation in the past decade. In particular, near-capacity achieving code designs based on LDPC codes have been presented for the case of two binary sources, with a binary-symmetric correlation. However, constructing practical codes for the case of non-binary sources with arbitrary correlation remains by and large open. From a practical perspective it is also interesting to consider coding schemes whose performance remains robust to uncertainties in the joint distributi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2792","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePB/TiuGeQUH8GSrQLJwrr4yU42ETw1mMW/Zd2CBR+UZPYjIbXKz+ZjOGIXJ0eTkiw7fQxWdZiqzF2I27yHOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:31:58.657576Z"},"content_sha256":"effde071015ce5820940d9dd9b71213ddb4054c1c289b6f34a9176f789f69119","schema_version":"1.0","event_id":"sha256:effde071015ce5820940d9dd9b71213ddb4054c1c289b6f34a9176f789f69119"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ7OFXXLOYWFHVMEJGW5SIQZ2M/bundle.json","state_url":"https://pith.science/pith/JJ7OFXXLOYWFHVMEJGW5SIQZ2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ7OFXXLOYWFHVMEJGW5SIQZ2M/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-23T04:31:58Z","links":{"resolver":"https://pith.science/pith/JJ7OFXXLOYWFHVMEJGW5SIQZ2M","bundle":"https://pith.science/pith/JJ7OFXXLOYWFHVMEJGW5SIQZ2M/bundle.json","state":"https://pith.science/pith/JJ7OFXXLOYWFHVMEJGW5SIQZ2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ7OFXXLOYWFHVMEJGW5SIQZ2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JJ7OFXXLOYWFHVMEJGW5SIQZ2M","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":"e518cb5e3065665afd28f84e6d1ef9e505d12c51ae511a42abac2972864e99f1","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T19:17:21Z","title_canon_sha256":"18f12e38ee2fd113f836ced1a9b4731fc747b690a519ef9fa0c16312544c393e"},"schema_version":"1.0","source":{"id":"1106.2792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2792","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2792v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2792","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"JJ7OFXXLOYWF","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JJ7OFXXLOYWFHVME","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JJ7OFXXL","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:effde071015ce5820940d9dd9b71213ddb4054c1c289b6f34a9176f789f69119","target":"graph","created_at":"2026-05-18T04:20:04Z","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":"Practical constructions of lossless distributed source codes (for the Slepian-Wolf problem) have been the subject of much investigation in the past decade. In particular, near-capacity achieving code designs based on LDPC codes have been presented for the case of two binary sources, with a binary-symmetric correlation. However, constructing practical codes for the case of non-binary sources with arbitrary correlation remains by and large open. From a practical perspective it is also interesting to consider coding schemes whose performance remains robust to uncertainties in the joint distributi","authors_text":"Aditya Ramamoorthy, Shizheng Li","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T19:17:21Z","title":"Algebraic codes for Slepian-Wolf code design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2792","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:88bd576c12f85b87adc104df135f294c61a3e63866be1afab5bd9473d8539f09","target":"record","created_at":"2026-05-18T04:20:04Z","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":"e518cb5e3065665afd28f84e6d1ef9e505d12c51ae511a42abac2972864e99f1","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T19:17:21Z","title_canon_sha256":"18f12e38ee2fd113f836ced1a9b4731fc747b690a519ef9fa0c16312544c393e"},"schema_version":"1.0","source":{"id":"1106.2792","kind":"arxiv","version":1}},"canonical_sha256":"4a7ee2deeb762c53d58449add92219d33c6adbdafca6ceee533b0df8e0a8fc86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a7ee2deeb762c53d58449add92219d33c6adbdafca6ceee533b0df8e0a8fc86","first_computed_at":"2026-05-18T04:20:04.123757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:04.123757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mGQBT4SeV0C8isySJLwbk4iKeGkppyx94TJYbAnF3+UnEszAjaINhUGxyvp0rBd3LTlgwcCQ8dxzcGdUxamJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:04.124464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88bd576c12f85b87adc104df135f294c61a3e63866be1afab5bd9473d8539f09","sha256:effde071015ce5820940d9dd9b71213ddb4054c1c289b6f34a9176f789f69119"],"state_sha256":"052e24d698a57dc785d4fc4c4a4975eb77e0588ca1f50bb7aaba466bca5c5689"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsYiwdQ2r0Dudot55wZGs+DNTmZU8/O+F3QBSfEyC3Q/7/Lcnm4LyAG6o7gtlQEGZM24TK8MdMCjDKy5cl9yDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:31:58.659510Z","bundle_sha256":"2f97bfbfdbfa4b5674cb27ee7a90de0ef144a31b474d978c4f472dcd9e4263d1"}}