{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RLISDHINSXZQ4I7QFAFSJ3PDQZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e24ea099431113f5d7e6ab4fe4ba015cefcc60121c0cbf4c9f03997d17674aa8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-30T01:36:20Z","title_canon_sha256":"1db77f284182d357eff39042dde24e924a78800241b33dfc3c18fbdddf27c5ad"},"schema_version":"1.0","source":{"id":"0906.5394","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.5394","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0906.5394v7","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.5394","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"RLISDHINSXZQ","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RLISDHINSXZQ4I7Q","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RLISDHIN","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:567b6ee0deac2e35a4285de7e311afa9a8a95433cfe2caad495f985b562f525b","target":"graph","created_at":"2026-05-18T00:57:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"David Tse, Salman Avestimehr, Suhas Diggavi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-30T01:36:20Z","title":"Wireless Network Information Flow: A Deterministic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.5394","kind":"arxiv","version":7},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:26f3159c410366327a0f2eb70e45674b146647fd588b1df503af2344142ede92","target":"record","created_at":"2026-05-18T00:57:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e24ea099431113f5d7e6ab4fe4ba015cefcc60121c0cbf4c9f03997d17674aa8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-30T01:36:20Z","title_canon_sha256":"1db77f284182d357eff39042dde24e924a78800241b33dfc3c18fbdddf27c5ad"},"schema_version":"1.0","source":{"id":"0906.5394","kind":"arxiv","version":7}},"canonical_sha256":"8ad1219d0d95f30e23f0280b24ede386489ebbfb953847b3af7346aa845d792b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ad1219d0d95f30e23f0280b24ede386489ebbfb953847b3af7346aa845d792b","first_computed_at":"2026-05-18T00:57:58.116041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.116041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0n6Q9M2voJwpxpNF61i0HMQ+p9vogS+P0TioW0JQRt5GPBZyFRcDRn/P3lLB7g4sPRIT+ioM57F2EEMVwjNADw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.116664Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.5394","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26f3159c410366327a0f2eb70e45674b146647fd588b1df503af2344142ede92","sha256:567b6ee0deac2e35a4285de7e311afa9a8a95433cfe2caad495f985b562f525b"],"state_sha256":"2d088abfc6049e7ef1d0e46a3b080cdcec6c9dd9158b1bd7fdaea0d29ad921bf"}