{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KVF3YXK66E2GPBUJHL5VHXIST4","short_pith_number":"pith:KVF3YXK6","schema_version":"1.0","canonical_sha256":"554bbc5d5ef1346786893afb53dd129f047d802c96b7090de74b73e1f740ffbb","source":{"kind":"arxiv","id":"1207.2505","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.2505","created_at":"2026-05-18T00:47:59.651193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2505v2","created_at":"2026-05-18T00:47:59.651193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2505","created_at":"2026-05-18T00:47:59.651193+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVF3YXK66E2G","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVF3YXK66E2GPBUJ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVF3YXK6","created_at":"2026-05-18T12:27:11.947152+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/KVF3YXK66E2GPBUJHL5VHXIST4","json":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4.json","graph_json":"https://pith.science/api/pith-number/KVF3YXK66E2GPBUJHL5VHXIST4/graph.json","events_json":"https://pith.science/api/pith-number/KVF3YXK66E2GPBUJHL5VHXIST4/events.json","paper":"https://pith.science/paper/KVF3YXK6"},"agent_actions":{"view_html":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4","download_json":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4.json","view_paper":"https://pith.science/paper/KVF3YXK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2505&json=true","fetch_graph":"https://pith.science/api/pith-number/KVF3YXK66E2GPBUJHL5VHXIST4/graph.json","fetch_events":"https://pith.science/api/pith-number/KVF3YXK66E2GPBUJHL5VHXIST4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/action/storage_attestation","attest_author":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/action/author_attestation","sign_citation":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/action/citation_signature","submit_replication":"https://pith.science/pith/KVF3YXK66E2GPBUJHL5VHXIST4/action/replication_record"}},"created_at":"2026-05-18T00:47:59.651193+00:00","updated_at":"2026-05-18T00:47:59.651193+00:00"}