{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HQAWMV2MXHUWOKFGMB4YIB4R2E","short_pith_number":"pith:HQAWMV2M","schema_version":"1.0","canonical_sha256":"3c0166574cb9e96728a66079840791d1182a4ab5ba0f7ed6bc34d95cc1717edd","source":{"kind":"arxiv","id":"1401.6023","version":3},"attestation_state":"computed","paper":{"title":"A Unified Approach for Network Information Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sae-Young Chung, Si-Hyeon Lee","submitted_at":"2014-01-23T16:00:24Z","abstract_excerpt":"In this paper, we take a unified approach for network information theory and prove a coding theorem, which can recover most of the achievability results in network information theory that are based on random coding. The final single-letter expression has a very simple form, which was made possible by many novel elements such as a unified framework that represents various network problems in a simple and unified way, a unified coding strategy that consists of a few basic ingredients but can emulate many known coding techniques if needed, and new proof techniques beyond the use of standard cover"},"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":"1401.6023","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T16:00:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b16d5d5b9741acf738117a01fb93895a86095991fd14a74c908a5cdd0488a65","abstract_canon_sha256":"5016e67948adb4f7788c89dc645e39864c58d17297f80700de4bf0958a857b1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:55.703477Z","signature_b64":"Rr6RP21kijgMzvb169Of/21OA2xL6NULQkAwnpPZ2PEMMxtI3jmaozztMoLCARB0x3f1z1VECZb49bPuYBPQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c0166574cb9e96728a66079840791d1182a4ab5ba0f7ed6bc34d95cc1717edd","last_reissued_at":"2026-05-18T02:03:55.702850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:55.702850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Approach for Network Information Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sae-Young Chung, Si-Hyeon Lee","submitted_at":"2014-01-23T16:00:24Z","abstract_excerpt":"In this paper, we take a unified approach for network information theory and prove a coding theorem, which can recover most of the achievability results in network information theory that are based on random coding. The final single-letter expression has a very simple form, which was made possible by many novel elements such as a unified framework that represents various network problems in a simple and unified way, a unified coding strategy that consists of a few basic ingredients but can emulate many known coding techniques if needed, and new proof techniques beyond the use of standard cover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6023","kind":"arxiv","version":3},"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":"1401.6023","created_at":"2026-05-18T02:03:55.702946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6023v3","created_at":"2026-05-18T02:03:55.702946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6023","created_at":"2026-05-18T02:03:55.702946+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQAWMV2MXHUW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQAWMV2MXHUWOKFG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQAWMV2M","created_at":"2026-05-18T12:28:30.664211+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/HQAWMV2MXHUWOKFGMB4YIB4R2E","json":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E.json","graph_json":"https://pith.science/api/pith-number/HQAWMV2MXHUWOKFGMB4YIB4R2E/graph.json","events_json":"https://pith.science/api/pith-number/HQAWMV2MXHUWOKFGMB4YIB4R2E/events.json","paper":"https://pith.science/paper/HQAWMV2M"},"agent_actions":{"view_html":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E","download_json":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E.json","view_paper":"https://pith.science/paper/HQAWMV2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6023&json=true","fetch_graph":"https://pith.science/api/pith-number/HQAWMV2MXHUWOKFGMB4YIB4R2E/graph.json","fetch_events":"https://pith.science/api/pith-number/HQAWMV2MXHUWOKFGMB4YIB4R2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E/action/storage_attestation","attest_author":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E/action/author_attestation","sign_citation":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E/action/citation_signature","submit_replication":"https://pith.science/pith/HQAWMV2MXHUWOKFGMB4YIB4R2E/action/replication_record"}},"created_at":"2026-05-18T02:03:55.702946+00:00","updated_at":"2026-05-18T02:03:55.702946+00:00"}