{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RLISDHINSXZQ4I7QFAFSJ3PDQZ","short_pith_number":"pith:RLISDHIN","schema_version":"1.0","canonical_sha256":"8ad1219d0d95f30e23f0280b24ede386489ebbfb953847b3af7346aa845d792b","source":{"kind":"arxiv","id":"0906.5394","version":7},"attestation_state":"computed","paper":{"title":"Wireless Network Information Flow: A Deterministic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Tse, Salman Avestimehr, Suhas Diggavi","submitted_at":"2009-06-30T01:36:20Z","abstract_excerpt":"In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach. First we propose a deterministic channel model which captures the key wireless properties of signal strength, broadcast and superposition. We obtain an exact characterization of the capacity of a network with nodes connected by such deterministic channels. This result is a natural generalization of the celebrated max-flow min-cut theorem for wired 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":"0906.5394","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-30T01:36:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1db77f284182d357eff39042dde24e924a78800241b33dfc3c18fbdddf27c5ad","abstract_canon_sha256":"e24ea099431113f5d7e6ab4fe4ba015cefcc60121c0cbf4c9f03997d17674aa8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.116664Z","signature_b64":"0n6Q9M2voJwpxpNF61i0HMQ+p9vogS+P0TioW0JQRt5GPBZyFRcDRn/P3lLB7g4sPRIT+ioM57F2EEMVwjNADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad1219d0d95f30e23f0280b24ede386489ebbfb953847b3af7346aa845d792b","last_reissued_at":"2026-05-18T00:57:58.116041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.116041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wireless Network Information Flow: A Deterministic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Tse, Salman Avestimehr, Suhas Diggavi","submitted_at":"2009-06-30T01:36:20Z","abstract_excerpt":"In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach. First we propose a deterministic channel model which captures the key wireless properties of signal strength, broadcast and superposition. We obtain an exact characterization of the capacity of a network with nodes connected by such deterministic channels. This result is a natural generalization of the celebrated max-flow min-cut theorem for wired networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.5394","kind":"arxiv","version":7},"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":"0906.5394","created_at":"2026-05-18T00:57:58.116137+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.5394v7","created_at":"2026-05-18T00:57:58.116137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.5394","created_at":"2026-05-18T00:57:58.116137+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLISDHINSXZQ","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLISDHINSXZQ4I7Q","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLISDHIN","created_at":"2026-05-18T12:26:01.383474+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/RLISDHINSXZQ4I7QFAFSJ3PDQZ","json":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ.json","graph_json":"https://pith.science/api/pith-number/RLISDHINSXZQ4I7QFAFSJ3PDQZ/graph.json","events_json":"https://pith.science/api/pith-number/RLISDHINSXZQ4I7QFAFSJ3PDQZ/events.json","paper":"https://pith.science/paper/RLISDHIN"},"agent_actions":{"view_html":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ","download_json":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ.json","view_paper":"https://pith.science/paper/RLISDHIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.5394&json=true","fetch_graph":"https://pith.science/api/pith-number/RLISDHINSXZQ4I7QFAFSJ3PDQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RLISDHINSXZQ4I7QFAFSJ3PDQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ/action/storage_attestation","attest_author":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ/action/author_attestation","sign_citation":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ/action/citation_signature","submit_replication":"https://pith.science/pith/RLISDHINSXZQ4I7QFAFSJ3PDQZ/action/replication_record"}},"created_at":"2026-05-18T00:57:58.116137+00:00","updated_at":"2026-05-18T00:57:58.116137+00:00"}