{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HTSZMCEJSMUH7Z3FQCROR567AT","short_pith_number":"pith:HTSZMCEJ","schema_version":"1.0","canonical_sha256":"3ce596088993287fe76580a2e8f7df04d3e8812b58754f8b5ac29b80274e83f9","source":{"kind":"arxiv","id":"1401.7293","version":1},"attestation_state":"computed","paper":{"title":"Polar coding for interference networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eren Sasoglu, Lele Wang","submitted_at":"2014-01-28T18:46:35Z","abstract_excerpt":"A polar coding scheme for interference networks is introduced. The scheme combines Arikan's monotone chain rules for multiple-access channels and a method by Hassani and Urbanke to 'align' two incompatible polarization processes. It achieves the Han--Kobayashi inner bound for two-user interference channels and generalizes to interference networks."},"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.7293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T18:46:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46948949f418e242da510649e086d5fc338f67faaec712a1edcdd83dc80b128b","abstract_canon_sha256":"7b27a4efe9e1735a924859fd14b57c2172b0ecf73b68432fc5d8ac1e614d76e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:50.355198Z","signature_b64":"nYNcPF/q8ESTkZ3A96UZa3vMJ8Bk4blh5+AyR2NLy5VH4+2gU+1PRKIxeLPJ8N9qa1YpTLyFZXeSbrgsl1FUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ce596088993287fe76580a2e8f7df04d3e8812b58754f8b5ac29b80274e83f9","last_reissued_at":"2026-05-18T03:00:50.354332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:50.354332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar coding for interference networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eren Sasoglu, Lele Wang","submitted_at":"2014-01-28T18:46:35Z","abstract_excerpt":"A polar coding scheme for interference networks is introduced. The scheme combines Arikan's monotone chain rules for multiple-access channels and a method by Hassani and Urbanke to 'align' two incompatible polarization processes. It achieves the Han--Kobayashi inner bound for two-user interference channels and generalizes to interference networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7293","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.7293","created_at":"2026-05-18T03:00:50.354509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7293v1","created_at":"2026-05-18T03:00:50.354509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7293","created_at":"2026-05-18T03:00:50.354509+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTSZMCEJSMUH","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTSZMCEJSMUH7Z3F","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTSZMCEJ","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/HTSZMCEJSMUH7Z3FQCROR567AT","json":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT.json","graph_json":"https://pith.science/api/pith-number/HTSZMCEJSMUH7Z3FQCROR567AT/graph.json","events_json":"https://pith.science/api/pith-number/HTSZMCEJSMUH7Z3FQCROR567AT/events.json","paper":"https://pith.science/paper/HTSZMCEJ"},"agent_actions":{"view_html":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT","download_json":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT.json","view_paper":"https://pith.science/paper/HTSZMCEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7293&json=true","fetch_graph":"https://pith.science/api/pith-number/HTSZMCEJSMUH7Z3FQCROR567AT/graph.json","fetch_events":"https://pith.science/api/pith-number/HTSZMCEJSMUH7Z3FQCROR567AT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT/action/storage_attestation","attest_author":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT/action/author_attestation","sign_citation":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT/action/citation_signature","submit_replication":"https://pith.science/pith/HTSZMCEJSMUH7Z3FQCROR567AT/action/replication_record"}},"created_at":"2026-05-18T03:00:50.354509+00:00","updated_at":"2026-05-18T03:00:50.354509+00:00"}