{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:S73RBHIYJGADJEWHZQSG53GBBE","short_pith_number":"pith:S73RBHIY","canonical_record":{"source":{"id":"1010.1060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T04:37:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f8010539fc86f8faf6fdf02f302eeb83c915022abc4399a507fb238c27208907","abstract_canon_sha256":"230b927b085eaf3d35d2fd5f260c832fd631672a69bc6fc4d7c3389eed67d8cf"},"schema_version":"1.0"},"canonical_sha256":"97f7109d1849803492c7cc246eecc10902cfbb08c6554f738ce1fe396b35c579","source":{"kind":"arxiv","id":"1010.1060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1060","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1060v2","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1060","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"S73RBHIYJGAD","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S73RBHIYJGADJEWH","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S73RBHIY","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:S73RBHIYJGADJEWHZQSG53GBBE","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T04:37:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f8010539fc86f8faf6fdf02f302eeb83c915022abc4399a507fb238c27208907","abstract_canon_sha256":"230b927b085eaf3d35d2fd5f260c832fd631672a69bc6fc4d7c3389eed67d8cf"},"schema_version":"1.0"},"canonical_sha256":"97f7109d1849803492c7cc246eecc10902cfbb08c6554f738ce1fe396b35c579","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:46.476714Z","signature_b64":"oVcRVTpcY8tHtSKihDr7leX2wf8jquilqaqsdRI/IRC+qFlxXKJesku66M2+0ZiZ013o4QZSpyMlMffiSJF0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97f7109d1849803492c7cc246eecc10902cfbb08c6554f738ce1fe396b35c579","last_reissued_at":"2026-05-18T02:23:46.476071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:46.476071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1060","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmGWjs1D0vI32sObjzDS1dK6T1kRcHzujf3eXpD2AW7gZdYtpjpA+U6gxFlUBlgSLrH3j6CpfM7fd3j+F5xkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:38:13.707336Z"},"content_sha256":"b406b2bf778df45734f7b527bbb270b50bc88dc1e0206653f1eb15668924e363","schema_version":"1.0","event_id":"sha256:b406b2bf778df45734f7b527bbb270b50bc88dc1e0206653f1eb15668924e363"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:S73RBHIYJGADJEWHZQSG53GBBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Multi-Hop Wireless Networks with Partial Network Knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Vahid, Amir Salman Avestimehr, Ashutosh Sabharwal, Vaneet Aggarwal","submitted_at":"2010-10-06T04:37:20Z","abstract_excerpt":"In large wireless networks, acquiring full network state information is typically infeasible. Hence, nodes need to flow the information and manage the interference based on partial information about the network. In this paper, we consider multi-hop wireless networks and assume that each source only knows the channel gains that are on the routes from itself to other destinations in the network. We develop several distributed strategies to manage the interference among the users and prove their optimality in maximizing the achievable normalized sum-rate for some classes of networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1060","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONvbtWpy3UJr1DducjLw7OJi37k+0+SahWKfqlG9iBA/axw2jMBCFOP+FjHz5rF2jMHYAwKji2/JhuaJMrNbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:38:13.707686Z"},"content_sha256":"0f2c0ffde75b3afddaf8ece982d1695499cede0abe5765a21281c3fac8d6526b","schema_version":"1.0","event_id":"sha256:0f2c0ffde75b3afddaf8ece982d1695499cede0abe5765a21281c3fac8d6526b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S73RBHIYJGADJEWHZQSG53GBBE/bundle.json","state_url":"https://pith.science/pith/S73RBHIYJGADJEWHZQSG53GBBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S73RBHIYJGADJEWHZQSG53GBBE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T14:38:13Z","links":{"resolver":"https://pith.science/pith/S73RBHIYJGADJEWHZQSG53GBBE","bundle":"https://pith.science/pith/S73RBHIYJGADJEWHZQSG53GBBE/bundle.json","state":"https://pith.science/pith/S73RBHIYJGADJEWHZQSG53GBBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S73RBHIYJGADJEWHZQSG53GBBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:S73RBHIYJGADJEWHZQSG53GBBE","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":"230b927b085eaf3d35d2fd5f260c832fd631672a69bc6fc4d7c3389eed67d8cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T04:37:20Z","title_canon_sha256":"f8010539fc86f8faf6fdf02f302eeb83c915022abc4399a507fb238c27208907"},"schema_version":"1.0","source":{"id":"1010.1060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1060","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1060v2","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1060","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"S73RBHIYJGAD","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S73RBHIYJGADJEWH","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S73RBHIY","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:0f2c0ffde75b3afddaf8ece982d1695499cede0abe5765a21281c3fac8d6526b","target":"graph","created_at":"2026-05-18T02:23:46Z","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 large wireless networks, acquiring full network state information is typically infeasible. Hence, nodes need to flow the information and manage the interference based on partial information about the network. In this paper, we consider multi-hop wireless networks and assume that each source only knows the channel gains that are on the routes from itself to other destinations in the network. We develop several distributed strategies to manage the interference among the users and prove their optimality in maximizing the achievable normalized sum-rate for some classes of networks.","authors_text":"Alireza Vahid, Amir Salman Avestimehr, Ashutosh Sabharwal, Vaneet Aggarwal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T04:37:20Z","title":"On the Capacity of Multi-Hop Wireless Networks with Partial Network Knowledge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1060","kind":"arxiv","version":2},"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:b406b2bf778df45734f7b527bbb270b50bc88dc1e0206653f1eb15668924e363","target":"record","created_at":"2026-05-18T02:23:46Z","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":"230b927b085eaf3d35d2fd5f260c832fd631672a69bc6fc4d7c3389eed67d8cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T04:37:20Z","title_canon_sha256":"f8010539fc86f8faf6fdf02f302eeb83c915022abc4399a507fb238c27208907"},"schema_version":"1.0","source":{"id":"1010.1060","kind":"arxiv","version":2}},"canonical_sha256":"97f7109d1849803492c7cc246eecc10902cfbb08c6554f738ce1fe396b35c579","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97f7109d1849803492c7cc246eecc10902cfbb08c6554f738ce1fe396b35c579","first_computed_at":"2026-05-18T02:23:46.476071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:46.476071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oVcRVTpcY8tHtSKihDr7leX2wf8jquilqaqsdRI/IRC+qFlxXKJesku66M2+0ZiZ013o4QZSpyMlMffiSJF0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:46.476714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b406b2bf778df45734f7b527bbb270b50bc88dc1e0206653f1eb15668924e363","sha256:0f2c0ffde75b3afddaf8ece982d1695499cede0abe5765a21281c3fac8d6526b"],"state_sha256":"c1c8d053368e2a17cc16477f4b089f0b7fcfbaa42e61f85c768268476976fbce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Id1Oky0DE5v2PdI2dr1/WpnmI+3b3uN9AM+2kQRCec+04tbtdQVhhW/5bLKTJgtbr40a2wFWmxcG3rL1d1fAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T14:38:13.711859Z","bundle_sha256":"49dd350da57c55184d72b4fb846e40e61bb1a676a3dfeefa331340552a55bacc"}}