{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z2UVJYQSQ7L7FGLD6C2KBND3NS","short_pith_number":"pith:Z2UVJYQS","schema_version":"1.0","canonical_sha256":"cea954e21287d7f29963f0b4a0b47b6c8ac0374b4b9a540e14bb7dcaea05a14b","source":{"kind":"arxiv","id":"1901.02933","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Giuseppe Caire, Martina Cardone, Yahya H. Ezzeldin","submitted_at":"2019-01-09T21:14:53Z","abstract_excerpt":"This paper studies the 1-2-1 half-duplex network model, where two half-duplex nodes can communicate only if they point `beams' at each other; otherwise, no signal can be exchanged or interference can be generated. The main result of this paper is the design of two polynomial-time algorithms that: (i) compute the approximate capacity of the 1-2-1 half-duplex network and, (ii) find the network schedule optimal for the approximate capacity. The paper starts by expressing the approximate capacity as a linear program with an exponential number of constraints. A core technical component consists of "},"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.02933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T21:14:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"492082d6cc54703ee6b46479428e58b68fc58702a7112c4d26a1fd6b89b2fa41","abstract_canon_sha256":"f3913fc7a78f8d107b0f2728d1a2c8e3d8263085fed50f9f7ca24a9835ee6b47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.989348Z","signature_b64":"ZCJHfAEgFe47RyHNKX0mHiAn3Jvn3UsA/587gf5K1XkGNwASMgW9ONIpHBlzZej8r11l75AUqX88BtpSC3djBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea954e21287d7f29963f0b4a0b47b6c8ac0374b4b9a540e14bb7dcaea05a14b","last_reissued_at":"2026-05-17T23:56:35.988852Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.988852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Giuseppe Caire, Martina Cardone, Yahya H. Ezzeldin","submitted_at":"2019-01-09T21:14:53Z","abstract_excerpt":"This paper studies the 1-2-1 half-duplex network model, where two half-duplex nodes can communicate only if they point `beams' at each other; otherwise, no signal can be exchanged or interference can be generated. The main result of this paper is the design of two polynomial-time algorithms that: (i) compute the approximate capacity of the 1-2-1 half-duplex network and, (ii) find the network schedule optimal for the approximate capacity. The paper starts by expressing the approximate capacity as a linear program with an exponential number of constraints. A core technical component consists of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02933","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":"1901.02933","created_at":"2026-05-17T23:56:35.988934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02933v1","created_at":"2026-05-17T23:56:35.988934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02933","created_at":"2026-05-17T23:56:35.988934+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2UVJYQSQ7L7","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2UVJYQSQ7L7FGLD","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2UVJYQS","created_at":"2026-05-18T12:33:33.725879+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/Z2UVJYQSQ7L7FGLD6C2KBND3NS","json":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS.json","graph_json":"https://pith.science/api/pith-number/Z2UVJYQSQ7L7FGLD6C2KBND3NS/graph.json","events_json":"https://pith.science/api/pith-number/Z2UVJYQSQ7L7FGLD6C2KBND3NS/events.json","paper":"https://pith.science/paper/Z2UVJYQS"},"agent_actions":{"view_html":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS","download_json":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS.json","view_paper":"https://pith.science/paper/Z2UVJYQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02933&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2UVJYQSQ7L7FGLD6C2KBND3NS/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2UVJYQSQ7L7FGLD6C2KBND3NS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS/action/storage_attestation","attest_author":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS/action/author_attestation","sign_citation":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS/action/citation_signature","submit_replication":"https://pith.science/pith/Z2UVJYQSQ7L7FGLD6C2KBND3NS/action/replication_record"}},"created_at":"2026-05-17T23:56:35.988934+00:00","updated_at":"2026-05-17T23:56:35.988934+00:00"}