{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:44GNIITO2GAPFQZ2THHC3NS3UF","short_pith_number":"pith:44GNIITO","schema_version":"1.0","canonical_sha256":"e70cd4226ed180f2c33a99ce2db65ba157c7d7405ff1430d431f9378f6bda4de","source":{"kind":"arxiv","id":"1203.1097","version":1},"attestation_state":"computed","paper":{"title":"Opportunistic Routing with Congestion Diversity in Wireless Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhijeet Bhorkar, Mohammad Naghshwar, Tara Javidi","submitted_at":"2012-03-06T04:30:05Z","abstract_excerpt":"We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of receiver nodes among which the next relay is selected opportunistically.\n  The main challenge in the design of minimum-delay routing policies is balancing the trade-off between routing the packets along the shortest paths to the destination and distributing traffic according to the maximum backpressure. Combining important aspects of shortest path and backpressure"},"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":"1203.1097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-06T04:30:05Z","cross_cats_sorted":[],"title_canon_sha256":"6278941387be65920d01e7a54002c97852facad1f9f6ed13c7780cc943f005f1","abstract_canon_sha256":"aefc46fa9f3ad9a67102f9140dba9c05a6f77b5524f50db4c0f2cb53159561bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:48.817255Z","signature_b64":"eN0QikEAXlyS3IZ7NwzDUKFDwU0EfdmfLhenzxJ/QUS/EGZs8DBmKfQZwnpPShBJnuiD9FRGrlYFVfHgBr5ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e70cd4226ed180f2c33a99ce2db65ba157c7d7405ff1430d431f9378f6bda4de","last_reissued_at":"2026-05-18T04:00:48.816817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:48.816817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opportunistic Routing with Congestion Diversity in Wireless Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhijeet Bhorkar, Mohammad Naghshwar, Tara Javidi","submitted_at":"2012-03-06T04:30:05Z","abstract_excerpt":"We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of receiver nodes among which the next relay is selected opportunistically.\n  The main challenge in the design of minimum-delay routing policies is balancing the trade-off between routing the packets along the shortest paths to the destination and distributing traffic according to the maximum backpressure. Combining important aspects of shortest path and backpressure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1097","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":"1203.1097","created_at":"2026-05-18T04:00:48.816877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1097v1","created_at":"2026-05-18T04:00:48.816877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1097","created_at":"2026-05-18T04:00:48.816877+00:00"},{"alias_kind":"pith_short_12","alias_value":"44GNIITO2GAP","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"44GNIITO2GAPFQZ2","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"44GNIITO","created_at":"2026-05-18T12:26:53.410803+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/44GNIITO2GAPFQZ2THHC3NS3UF","json":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF.json","graph_json":"https://pith.science/api/pith-number/44GNIITO2GAPFQZ2THHC3NS3UF/graph.json","events_json":"https://pith.science/api/pith-number/44GNIITO2GAPFQZ2THHC3NS3UF/events.json","paper":"https://pith.science/paper/44GNIITO"},"agent_actions":{"view_html":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF","download_json":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF.json","view_paper":"https://pith.science/paper/44GNIITO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1097&json=true","fetch_graph":"https://pith.science/api/pith-number/44GNIITO2GAPFQZ2THHC3NS3UF/graph.json","fetch_events":"https://pith.science/api/pith-number/44GNIITO2GAPFQZ2THHC3NS3UF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF/action/storage_attestation","attest_author":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF/action/author_attestation","sign_citation":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF/action/citation_signature","submit_replication":"https://pith.science/pith/44GNIITO2GAPFQZ2THHC3NS3UF/action/replication_record"}},"created_at":"2026-05-18T04:00:48.816877+00:00","updated_at":"2026-05-18T04:00:48.816877+00:00"}