{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6AVL4XK3JGR3BGJFFXGM42A3Z2","short_pith_number":"pith:6AVL4XK3","canonical_record":{"source":{"id":"1808.06509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T15:17:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f851063820c88f5a4731b7fc5a333b423ff0cdd3d00adb7f5d65709b5c6da63","abstract_canon_sha256":"c7bcdcfc3f9da080ef6d4cc35eef95f6ee17a44b8ead69d057324d2ed825371e"},"schema_version":"1.0"},"canonical_sha256":"f02abe5d5b49a3b099252dccce681bce95325eea31ce19141fc8d33a177fae90","source":{"kind":"arxiv","id":"1808.06509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06509","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06509v1","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06509","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"6AVL4XK3JGR3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6AVL4XK3JGR3BGJF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6AVL4XK3","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6AVL4XK3JGR3BGJFFXGM42A3Z2","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T15:17:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f851063820c88f5a4731b7fc5a333b423ff0cdd3d00adb7f5d65709b5c6da63","abstract_canon_sha256":"c7bcdcfc3f9da080ef6d4cc35eef95f6ee17a44b8ead69d057324d2ed825371e"},"schema_version":"1.0"},"canonical_sha256":"f02abe5d5b49a3b099252dccce681bce95325eea31ce19141fc8d33a177fae90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:44.668557Z","signature_b64":"AXsBNZFu2I5n+rHE33n5RhwsICYVWHLad8hHF9mSRTNw7lmsb66wsl0Hqs9y8RKFMmbsG4/+Q9hIYl5gnBrjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f02abe5d5b49a3b099252dccce681bce95325eea31ce19141fc8d33a177fae90","last_reissued_at":"2026-05-18T00:07:44.667917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:44.667917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06509","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:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gn54Xm7wovRPZHhvLmQkPR47h8BZ0nZMEBMSrlDNUbqaC+WPet3c7hI2x3VqB3Im18hhWXQWOqYHNML/kCeQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:31:29.958062Z"},"content_sha256":"58a61b9a43f9ac4335f99a48d90928c6bf419a35f3ffca71a479ef9a67ad9186","schema_version":"1.0","event_id":"sha256:58a61b9a43f9ac4335f99a48d90928c6bf419a35f3ffca71a479ef9a67ad9186"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6AVL4XK3JGR3BGJFFXGM42A3Z2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elsa Dupraz, Fangping Ye, Karine Amis, Zeina Mheich","submitted_at":"2018-08-20T15:17:14Z","abstract_excerpt":"This paper considers the problem of source coding with side information at the decoder, also called Slepian-Wolf source coding scheme. In practical applications of this coding scheme, the statistical relation between the source and the side information can vary from one data transmission to another, and there is a need to adapt the coding rate depending on the current statistical relation. In this paper, we propose a novel rate-adaptive code construction based on LDPC codes for the Slepian-Wolf source coding scheme. The proposed code design method allows to optimize the code degree distributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06509","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:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCBrcQZUAwqpWXOkNRemPWTqs28mbp4fIm/Uj5L7vrUqIHndQ8lc/AMs6ep+7Ub05zOJhcxa43Z9a91A64k5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:31:29.958476Z"},"content_sha256":"fd852ebee77891f42c2fba7597ca283f467a0b442e08210796838ad515cecd0a","schema_version":"1.0","event_id":"sha256:fd852ebee77891f42c2fba7597ca283f467a0b442e08210796838ad515cecd0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AVL4XK3JGR3BGJFFXGM42A3Z2/bundle.json","state_url":"https://pith.science/pith/6AVL4XK3JGR3BGJFFXGM42A3Z2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AVL4XK3JGR3BGJFFXGM42A3Z2/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-05-27T11:31:29Z","links":{"resolver":"https://pith.science/pith/6AVL4XK3JGR3BGJFFXGM42A3Z2","bundle":"https://pith.science/pith/6AVL4XK3JGR3BGJFFXGM42A3Z2/bundle.json","state":"https://pith.science/pith/6AVL4XK3JGR3BGJFFXGM42A3Z2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AVL4XK3JGR3BGJFFXGM42A3Z2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6AVL4XK3JGR3BGJFFXGM42A3Z2","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":"c7bcdcfc3f9da080ef6d4cc35eef95f6ee17a44b8ead69d057324d2ed825371e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T15:17:14Z","title_canon_sha256":"9f851063820c88f5a4731b7fc5a333b423ff0cdd3d00adb7f5d65709b5c6da63"},"schema_version":"1.0","source":{"id":"1808.06509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06509","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06509v1","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06509","created_at":"2026-05-18T00:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"6AVL4XK3JGR3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6AVL4XK3JGR3BGJF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6AVL4XK3","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:fd852ebee77891f42c2fba7597ca283f467a0b442e08210796838ad515cecd0a","target":"graph","created_at":"2026-05-18T00:07:44Z","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":"This paper considers the problem of source coding with side information at the decoder, also called Slepian-Wolf source coding scheme. In practical applications of this coding scheme, the statistical relation between the source and the side information can vary from one data transmission to another, and there is a need to adapt the coding rate depending on the current statistical relation. In this paper, we propose a novel rate-adaptive code construction based on LDPC codes for the Slepian-Wolf source coding scheme. The proposed code design method allows to optimize the code degree distributio","authors_text":"Elsa Dupraz, Fangping Ye, Karine Amis, Zeina Mheich","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T15:17:14Z","title":"Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding with Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06509","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:58a61b9a43f9ac4335f99a48d90928c6bf419a35f3ffca71a479ef9a67ad9186","target":"record","created_at":"2026-05-18T00:07:44Z","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":"c7bcdcfc3f9da080ef6d4cc35eef95f6ee17a44b8ead69d057324d2ed825371e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T15:17:14Z","title_canon_sha256":"9f851063820c88f5a4731b7fc5a333b423ff0cdd3d00adb7f5d65709b5c6da63"},"schema_version":"1.0","source":{"id":"1808.06509","kind":"arxiv","version":1}},"canonical_sha256":"f02abe5d5b49a3b099252dccce681bce95325eea31ce19141fc8d33a177fae90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f02abe5d5b49a3b099252dccce681bce95325eea31ce19141fc8d33a177fae90","first_computed_at":"2026-05-18T00:07:44.667917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:44.667917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AXsBNZFu2I5n+rHE33n5RhwsICYVWHLad8hHF9mSRTNw7lmsb66wsl0Hqs9y8RKFMmbsG4/+Q9hIYl5gnBrjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:44.668557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58a61b9a43f9ac4335f99a48d90928c6bf419a35f3ffca71a479ef9a67ad9186","sha256:fd852ebee77891f42c2fba7597ca283f467a0b442e08210796838ad515cecd0a"],"state_sha256":"d3bdceed5e48350928ff3511b81628380cec2447718145e7f604c91ecb18272b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rc3mAsNN5jgOlpNTvhktTxphfCbwoetGF6dGuRC9MrG9WljkzNQq2h6v48Grsq3BqFChML9ArabD6vHbKTHsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:31:29.960950Z","bundle_sha256":"0653d4444fe8ab04856a49d0373b603f821a5468562431ef2727140ffc9dfbcb"}}