{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KVF3YXK66E2GPBUJHL5VHXIST4","short_pith_number":"pith:KVF3YXK6","canonical_record":{"source":{"id":"1207.2505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T22:36:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d1fc7e0129253e9be3733e8c798e191708f16a67637fdd6d17aed27db6c8160b","abstract_canon_sha256":"401ec83aac039d2ebc456a07cccea51c66a0e8fa419184f01ae9c206c4b5ebbd"},"schema_version":"1.0"},"canonical_sha256":"554bbc5d5ef1346786893afb53dd129f047d802c96b7090de74b73e1f740ffbb","source":{"kind":"arxiv","id":"1207.2505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2505","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2505v2","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2505","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"KVF3YXK66E2G","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KVF3YXK66E2GPBUJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KVF3YXK6","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KVF3YXK66E2GPBUJHL5VHXIST4","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T22:36:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d1fc7e0129253e9be3733e8c798e191708f16a67637fdd6d17aed27db6c8160b","abstract_canon_sha256":"401ec83aac039d2ebc456a07cccea51c66a0e8fa419184f01ae9c206c4b5ebbd"},"schema_version":"1.0"},"canonical_sha256":"554bbc5d5ef1346786893afb53dd129f047d802c96b7090de74b73e1f740ffbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.651614Z","signature_b64":"CjoH9xFO83XSVvJ+pXRsviM2BWw6b7RHrvVXebzMt+aGZeLClQZ+aTwNT8VRzDejX0+Gt9+9GnuuMls/9GlCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"554bbc5d5ef1346786893afb53dd129f047d802c96b7090de74b73e1f740ffbb","last_reissued_at":"2026-05-18T00:47:59.651125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.651125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2505","source_version":2,"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:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ap/ghdCIhSPCHS/M/+EEHu6T3pDa2zQhPjZvKNurHKe2FNlzw4uQGq2jazxm614pAaUCYRdvERHz7J+Wj5BCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:41:43.025718Z"},"content_sha256":"3cfdcf39e8643ebdb1653cec11abd77dac97e667acfe7a977dd2ddcfeb7fcae8","schema_version":"1.0","event_id":"sha256:3cfdcf39e8643ebdb1653cec11abd77dac97e667acfe7a977dd2ddcfeb7fcae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KVF3YXK66E2GPBUJHL5VHXIST4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ryo Nomura, Te Sun Han","submitted_at":"2012-07-10T22:36:15Z","abstract_excerpt":"The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding system to establish the source coding theorem in the second- order sense. The Slepian-Wolf coding problem for correlated sources is one of typical problems in the multi-terminal i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2505","kind":"arxiv","version":2},"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:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yB5DNsay2Ow2mQkki/mTOq/3/9XSFszLdg8sxgHVCpDFnDTEIXLZdEjDWceTUNJwAD7Kq0Ezn60u5PkUYB1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:41:43.026392Z"},"content_sha256":"f771d3e795a05481f25bf109d39183403ccc6bef70901ec6addf6dadc9c8c265","schema_version":"1.0","event_id":"sha256:f771d3e795a05481f25bf109d39183403ccc6bef70901ec6addf6dadc9c8c265"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/bundle.json","state_url":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVF3YXK66E2GPBUJHL5VHXIST4/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-26T04:41:43Z","links":{"resolver":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4","bundle":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/bundle.json","state":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVF3YXK66E2GPBUJHL5VHXIST4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KVF3YXK66E2GPBUJHL5VHXIST4","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":"401ec83aac039d2ebc456a07cccea51c66a0e8fa419184f01ae9c206c4b5ebbd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T22:36:15Z","title_canon_sha256":"d1fc7e0129253e9be3733e8c798e191708f16a67637fdd6d17aed27db6c8160b"},"schema_version":"1.0","source":{"id":"1207.2505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2505","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2505v2","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2505","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"KVF3YXK66E2G","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KVF3YXK66E2GPBUJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KVF3YXK6","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:f771d3e795a05481f25bf109d39183403ccc6bef70901ec6addf6dadc9c8c265","target":"graph","created_at":"2026-05-18T00:47:59Z","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 second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and analyzed for general sources in the single-user source coding problem. Analogously, in this paper, we first define the second-order achievable rate region for the Slepian-Wolf coding system to establish the source coding theorem in the second- order sense. The Slepian-Wolf coding problem for correlated sources is one of typical problems in the multi-terminal i","authors_text":"Ryo Nomura, Te Sun Han","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T22:36:15Z","title":"Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2505","kind":"arxiv","version":2},"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:3cfdcf39e8643ebdb1653cec11abd77dac97e667acfe7a977dd2ddcfeb7fcae8","target":"record","created_at":"2026-05-18T00:47:59Z","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":"401ec83aac039d2ebc456a07cccea51c66a0e8fa419184f01ae9c206c4b5ebbd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-10T22:36:15Z","title_canon_sha256":"d1fc7e0129253e9be3733e8c798e191708f16a67637fdd6d17aed27db6c8160b"},"schema_version":"1.0","source":{"id":"1207.2505","kind":"arxiv","version":2}},"canonical_sha256":"554bbc5d5ef1346786893afb53dd129f047d802c96b7090de74b73e1f740ffbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"554bbc5d5ef1346786893afb53dd129f047d802c96b7090de74b73e1f740ffbb","first_computed_at":"2026-05-18T00:47:59.651125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:59.651125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CjoH9xFO83XSVvJ+pXRsviM2BWw6b7RHrvVXebzMt+aGZeLClQZ+aTwNT8VRzDejX0+Gt9+9GnuuMls/9GlCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:59.651614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cfdcf39e8643ebdb1653cec11abd77dac97e667acfe7a977dd2ddcfeb7fcae8","sha256:f771d3e795a05481f25bf109d39183403ccc6bef70901ec6addf6dadc9c8c265"],"state_sha256":"48405b63542cf9eb1d99a45b9aa8c58e6e33e657f1cda8db44f111c9239bee26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zYkbyY9VG2UyViaZUhMx8pLZe2UT4XaQEAjTgf1/NlXsKuK8fncPZWd1YPcyMl49zPVw5lZRExCSyRPgVr+hAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:41:43.030176Z","bundle_sha256":"0babbbd5734c1130733ce9b6840e2e70b95989bc03fed1c0af3bb923078704fe"}}