{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KNIK5JDYAIUFXXRXKGIUGV5FGF","short_pith_number":"pith:KNIK5JDY","schema_version":"1.0","canonical_sha256":"5350aea47802285bde3751914357a5315d57ef71d5e471a41e108be11ceabcf7","source":{"kind":"arxiv","id":"1901.09885","version":2},"attestation_state":"computed","paper":{"title":"Towards an Extremal Network Theory -- Robust GDoF Gain of Transmitter Cooperation over TIN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junge Wang, Syed A. Jafar, Yao-Chia Chan","submitted_at":"2019-01-28T18:58:34Z","abstract_excerpt":"Significant progress has been made recently in Generalized Degrees of Freedom (GDoF) characterizations of wireless interference channels (IC) and broadcast channels (BC) under the assumption of finite precision channel state information at the transmitters (CSIT), especially for smaller or highly symmetric network settings. A critical barrier in extending these results to larger and asymmetric networks is the inherent combinatorial complexity of such networks. Motivated by other fields such as extremal combinatorics and extremal graph theory, we explore the possibility of an extremal network t"},"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":"1901.09885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-28T18:58:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae0f67b35284c47f0e2a0c2e49cf4ed29bd3cdc13245cbebb0bb8dafa202b287","abstract_canon_sha256":"f9670a8bf13d81963fc78336fa459ec20174f0be2df513d2533e6da8e415bf8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:14:43.726347Z","signature_b64":"0wUPGSLMIrIMJiKek9QbY09eD8kj/iNtDNRw+OXdsR2eQWPhXda/zYXY4WYEa1TRLs3aUKbCTEGN1njVjfn4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5350aea47802285bde3751914357a5315d57ef71d5e471a41e108be11ceabcf7","last_reissued_at":"2026-07-05T00:14:43.725929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:14:43.725929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards an Extremal Network Theory -- Robust GDoF Gain of Transmitter Cooperation over TIN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junge Wang, Syed A. Jafar, Yao-Chia Chan","submitted_at":"2019-01-28T18:58:34Z","abstract_excerpt":"Significant progress has been made recently in Generalized Degrees of Freedom (GDoF) characterizations of wireless interference channels (IC) and broadcast channels (BC) under the assumption of finite precision channel state information at the transmitters (CSIT), especially for smaller or highly symmetric network settings. A critical barrier in extending these results to larger and asymmetric networks is the inherent combinatorial complexity of such networks. Motivated by other fields such as extremal combinatorics and extremal graph theory, we explore the possibility of an extremal network t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09885","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.09885/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1901.09885","created_at":"2026-07-05T00:14:43.725984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09885v2","created_at":"2026-07-05T00:14:43.725984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09885","created_at":"2026-07-05T00:14:43.725984+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNIK5JDYAIUF","created_at":"2026-07-05T00:14:43.725984+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNIK5JDYAIUFXXRX","created_at":"2026-07-05T00:14:43.725984+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNIK5JDY","created_at":"2026-07-05T00:14:43.725984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.00703","citing_title":"GDoF of Interference Channel with Limited Cooperation under Finite Precision CSIT","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF","json":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF.json","graph_json":"https://pith.science/api/pith-number/KNIK5JDYAIUFXXRXKGIUGV5FGF/graph.json","events_json":"https://pith.science/api/pith-number/KNIK5JDYAIUFXXRXKGIUGV5FGF/events.json","paper":"https://pith.science/paper/KNIK5JDY"},"agent_actions":{"view_html":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF","download_json":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF.json","view_paper":"https://pith.science/paper/KNIK5JDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09885&json=true","fetch_graph":"https://pith.science/api/pith-number/KNIK5JDYAIUFXXRXKGIUGV5FGF/graph.json","fetch_events":"https://pith.science/api/pith-number/KNIK5JDYAIUFXXRXKGIUGV5FGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF/action/storage_attestation","attest_author":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF/action/author_attestation","sign_citation":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF/action/citation_signature","submit_replication":"https://pith.science/pith/KNIK5JDYAIUFXXRXKGIUGV5FGF/action/replication_record"}},"created_at":"2026-07-05T00:14:43.725984+00:00","updated_at":"2026-07-05T00:14:43.725984+00:00"}