{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QA623B6OO324VJGPQW4DUP5BSA","short_pith_number":"pith:QA623B6O","canonical_record":{"source":{"id":"1505.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T19:32:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95fde011f167ecd96a9f0fbbd1ce01a0ae4a371a8a0fc458e60ccb60057ef0c4","abstract_canon_sha256":"43a62739d47572ff8205632e1074e2466133400ef187427c2c441f982cbd2419"},"schema_version":"1.0"},"canonical_sha256":"803dad87ce76f5caa4cf85b83a3fa190016c2f55278fb8d1d3862f5dcdec5aa5","source":{"kind":"arxiv","id":"1505.01137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01137","created_at":"2026-05-18T01:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01137v1","created_at":"2026-05-18T01:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01137","created_at":"2026-05-18T01:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"QA623B6OO324","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QA623B6OO324VJGP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QA623B6O","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QA623B6OO324VJGPQW4DUP5BSA","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T19:32:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"95fde011f167ecd96a9f0fbbd1ce01a0ae4a371a8a0fc458e60ccb60057ef0c4","abstract_canon_sha256":"43a62739d47572ff8205632e1074e2466133400ef187427c2c441f982cbd2419"},"schema_version":"1.0"},"canonical_sha256":"803dad87ce76f5caa4cf85b83a3fa190016c2f55278fb8d1d3862f5dcdec5aa5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:47.021406Z","signature_b64":"JJ1XLCnZKOUmYqZ6+xYlXMw044pYkVFCEicP21g9LZLd7F2G4boCNXmeBxVi7eD0lPTj1DkzV84NeQ4JS0cJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"803dad87ce76f5caa4cf85b83a3fa190016c2f55278fb8d1d3862f5dcdec5aa5","last_reissued_at":"2026-05-18T01:09:47.020725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:47.020725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01137","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-18T01:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8QDfp9kV3w+hU02pKfDNvEiZVC3tSeXOAD7/NF/vTWHaLyAVv3a/HavzKAL/mC2uS5Q66GSs2Z89ytr+LvgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:17:54.691242Z"},"content_sha256":"1a985c754c0e39719f9ab511b0a5aec625e30e7366aa4426ede79c388ae24dd7","schema_version":"1.0","event_id":"sha256:1a985c754c0e39719f9ab511b0a5aec625e30e7366aa4426ede79c388ae24dd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QA623B6OO324VJGPQW4DUP5BSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Reliability Function of Variable-Rate Slepian-Wolf Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Jagmohan, Da-ke He, Jun Chen, Luis A. Lastras-Monta\\~no","submitted_at":"2015-05-05T19:32:10Z","abstract_excerpt":"The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepian-Wolf codes can significantly outperform fixed-rate Slepian-Wolf codes in terms of rate-error tradeoff. The reliability function of variable-rate Slepian-Wolf coding with rate below the Slepian-Wolf lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01137","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-18T01:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+twyqFVz3l76xeEML1OTWOJr3BM7ELnuji/QT1fpW1usJcEvr4/f+kKfIItEVmc5QjTX8GIuTXG79xHLMkgNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:17:54.691594Z"},"content_sha256":"905660ee28aed4e5cde733b463f270c377e1d2cd1230a63b6def13059f58153d","schema_version":"1.0","event_id":"sha256:905660ee28aed4e5cde733b463f270c377e1d2cd1230a63b6def13059f58153d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QA623B6OO324VJGPQW4DUP5BSA/bundle.json","state_url":"https://pith.science/pith/QA623B6OO324VJGPQW4DUP5BSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QA623B6OO324VJGPQW4DUP5BSA/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-27T09:17:54Z","links":{"resolver":"https://pith.science/pith/QA623B6OO324VJGPQW4DUP5BSA","bundle":"https://pith.science/pith/QA623B6OO324VJGPQW4DUP5BSA/bundle.json","state":"https://pith.science/pith/QA623B6OO324VJGPQW4DUP5BSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QA623B6OO324VJGPQW4DUP5BSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QA623B6OO324VJGPQW4DUP5BSA","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":"43a62739d47572ff8205632e1074e2466133400ef187427c2c441f982cbd2419","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T19:32:10Z","title_canon_sha256":"95fde011f167ecd96a9f0fbbd1ce01a0ae4a371a8a0fc458e60ccb60057ef0c4"},"schema_version":"1.0","source":{"id":"1505.01137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01137","created_at":"2026-05-18T01:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01137v1","created_at":"2026-05-18T01:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01137","created_at":"2026-05-18T01:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"QA623B6OO324","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QA623B6OO324VJGP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QA623B6O","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:905660ee28aed4e5cde733b463f270c377e1d2cd1230a63b6def13059f58153d","target":"graph","created_at":"2026-05-18T01:09:47Z","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":"The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepian-Wolf codes can significantly outperform fixed-rate Slepian-Wolf codes in terms of rate-error tradeoff. The reliability function of variable-rate Slepian-Wolf coding with rate below the Slepian-Wolf lim","authors_text":"Ashish Jagmohan, Da-ke He, Jun Chen, Luis A. Lastras-Monta\\~no","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T19:32:10Z","title":"On the Reliability Function of Variable-Rate Slepian-Wolf Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01137","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:1a985c754c0e39719f9ab511b0a5aec625e30e7366aa4426ede79c388ae24dd7","target":"record","created_at":"2026-05-18T01:09:47Z","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":"43a62739d47572ff8205632e1074e2466133400ef187427c2c441f982cbd2419","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-05T19:32:10Z","title_canon_sha256":"95fde011f167ecd96a9f0fbbd1ce01a0ae4a371a8a0fc458e60ccb60057ef0c4"},"schema_version":"1.0","source":{"id":"1505.01137","kind":"arxiv","version":1}},"canonical_sha256":"803dad87ce76f5caa4cf85b83a3fa190016c2f55278fb8d1d3862f5dcdec5aa5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"803dad87ce76f5caa4cf85b83a3fa190016c2f55278fb8d1d3862f5dcdec5aa5","first_computed_at":"2026-05-18T01:09:47.020725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:47.020725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JJ1XLCnZKOUmYqZ6+xYlXMw044pYkVFCEicP21g9LZLd7F2G4boCNXmeBxVi7eD0lPTj1DkzV84NeQ4JS0cJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:47.021406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a985c754c0e39719f9ab511b0a5aec625e30e7366aa4426ede79c388ae24dd7","sha256:905660ee28aed4e5cde733b463f270c377e1d2cd1230a63b6def13059f58153d"],"state_sha256":"38e246435aedc2219cc4e9dfb1a5072c27029f2d33c352816d079a3fef97937e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQ8uGayNg6dqXslDWYBkqmhmwZA8AWw+HxgXJdxQh0SuzIBbCRI0/CjWnWmIWQUYURSlrJLJNt1X46W6EQ1sBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:17:54.693650Z","bundle_sha256":"3738699a773ed783bfab0612c94ccddf107786f0df928d9ef45851bbfbfd6f77"}}