{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:3SYLAC4ATBZPDREBY7OE5EFAGP","short_pith_number":"pith:3SYLAC4A","canonical_record":{"source":{"id":"0802.4282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-28T20:36:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"958b329dad2d2ee178d6c31503a7ffb482cc7dc986d036acc00847303f9c1287","abstract_canon_sha256":"cca037396ded709fe679f7c85da000be126ceefbc5f0c17b99be971f736c75c4"},"schema_version":"1.0"},"canonical_sha256":"dcb0b00b809872f1c481c7dc4e90a033f23211e1084c56a7f548e7b2a43873eb","source":{"kind":"arxiv","id":"0802.4282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.4282","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0802.4282v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.4282","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"3SYLAC4ATBZP","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"3SYLAC4ATBZPDREB","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"3SYLAC4A","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:3SYLAC4ATBZPDREBY7OE5EFAGP","target":"record","payload":{"canonical_record":{"source":{"id":"0802.4282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-28T20:36:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"958b329dad2d2ee178d6c31503a7ffb482cc7dc986d036acc00847303f9c1287","abstract_canon_sha256":"cca037396ded709fe679f7c85da000be126ceefbc5f0c17b99be971f736c75c4"},"schema_version":"1.0"},"canonical_sha256":"dcb0b00b809872f1c481c7dc4e90a033f23211e1084c56a7f548e7b2a43873eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.743188Z","signature_b64":"AlyBzTxIkqOx2BzPnTlxQVts9BK2cE2PpK2ZXTnV2/CJlrUx9AGHvxADJOtoSraulKXKbz7a9sqTVBGphL/7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcb0b00b809872f1c481c7dc4e90a033f23211e1084c56a7f548e7b2a43873eb","last_reissued_at":"2026-05-18T00:58:25.742504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.742504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.4282","source_version":1,"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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOa9c8Jjm4DuULMyVXxRxRNJ+1Fr8QiuH9bpvC2NSF8XEXvGa7enNjBmbLy/ts3HuLugk/x9GlrHdPu4RykpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:43.958281Z"},"content_sha256":"d486c83b8c3dbf874456e308cde0a7f2431cd469e90296f398e541e972f8126c","schema_version":"1.0","event_id":"sha256:d486c83b8c3dbf874456e308cde0a7f2431cd469e90296f398e541e972f8126c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:3SYLAC4ATBZPDREBY7OE5EFAGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Opportunistic Scheduling For Ad-Hoc Communications Under Noisy Channel Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Zheng, H. Vincent Poor, Junshan Zhang, Man-On Pun, Weiyan Ge","submitted_at":"2008-02-28T20:36:43Z","abstract_excerpt":"Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel probing and distributed scheduling. It has been shown that under perfect channel estimation, the optimal DOS for maximizing the network throughput is a pure threshold policy. In this paper, this formalism is generalized to explore DOS under noisy channel estimation, where the transmission rate needs to be backed off from the estimated rate to reduce the outage."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.4282","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"},"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-18T00:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vThESPKwJMPeEJn8hbbOOCydom2F2BqLs4/m6/3iaA3terTkgK3mz46RnJNuSrDnnmobXtC/EWj+GDxdL/pnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:43.959479Z"},"content_sha256":"818943f039e0db8b551b019a2c3aa06793977f022d99f95dc1f803035a5a2948","schema_version":"1.0","event_id":"sha256:818943f039e0db8b551b019a2c3aa06793977f022d99f95dc1f803035a5a2948"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SYLAC4ATBZPDREBY7OE5EFAGP/bundle.json","state_url":"https://pith.science/pith/3SYLAC4ATBZPDREBY7OE5EFAGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SYLAC4ATBZPDREBY7OE5EFAGP/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-05-26T19:06:43Z","links":{"resolver":"https://pith.science/pith/3SYLAC4ATBZPDREBY7OE5EFAGP","bundle":"https://pith.science/pith/3SYLAC4ATBZPDREBY7OE5EFAGP/bundle.json","state":"https://pith.science/pith/3SYLAC4ATBZPDREBY7OE5EFAGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SYLAC4ATBZPDREBY7OE5EFAGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:3SYLAC4ATBZPDREBY7OE5EFAGP","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":"cca037396ded709fe679f7c85da000be126ceefbc5f0c17b99be971f736c75c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-28T20:36:43Z","title_canon_sha256":"958b329dad2d2ee178d6c31503a7ffb482cc7dc986d036acc00847303f9c1287"},"schema_version":"1.0","source":{"id":"0802.4282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.4282","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0802.4282v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.4282","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"3SYLAC4ATBZP","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"3SYLAC4ATBZPDREB","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"3SYLAC4A","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:818943f039e0db8b551b019a2c3aa06793977f022d99f95dc1f803035a5a2948","target":"graph","created_at":"2026-05-18T00:58:25Z","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":"Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel probing and distributed scheduling. It has been shown that under perfect channel estimation, the optimal DOS for maximizing the network throughput is a pure threshold policy. In this paper, this formalism is generalized to explore DOS under noisy channel estimation, where the transmission rate needs to be backed off from the estimated rate to reduce the outage.","authors_text":"Dong Zheng, H. Vincent Poor, Junshan Zhang, Man-On Pun, Weiyan Ge","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-28T20:36:43Z","title":"Distributed Opportunistic Scheduling For Ad-Hoc Communications Under Noisy Channel Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.4282","kind":"arxiv","version":1},"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:d486c83b8c3dbf874456e308cde0a7f2431cd469e90296f398e541e972f8126c","target":"record","created_at":"2026-05-18T00:58:25Z","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":"cca037396ded709fe679f7c85da000be126ceefbc5f0c17b99be971f736c75c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-02-28T20:36:43Z","title_canon_sha256":"958b329dad2d2ee178d6c31503a7ffb482cc7dc986d036acc00847303f9c1287"},"schema_version":"1.0","source":{"id":"0802.4282","kind":"arxiv","version":1}},"canonical_sha256":"dcb0b00b809872f1c481c7dc4e90a033f23211e1084c56a7f548e7b2a43873eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcb0b00b809872f1c481c7dc4e90a033f23211e1084c56a7f548e7b2a43873eb","first_computed_at":"2026-05-18T00:58:25.742504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.742504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AlyBzTxIkqOx2BzPnTlxQVts9BK2cE2PpK2ZXTnV2/CJlrUx9AGHvxADJOtoSraulKXKbz7a9sqTVBGphL/7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.743188Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.4282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d486c83b8c3dbf874456e308cde0a7f2431cd469e90296f398e541e972f8126c","sha256:818943f039e0db8b551b019a2c3aa06793977f022d99f95dc1f803035a5a2948"],"state_sha256":"e76e8fa4bb213152bbbb61c7e0bc528edcd012a4f02ae004b546a6f68d622519"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQhTovIeiH1tLm/anIruY9wIMBvhiNrmD4YY8IGcv/lHDa+SDI3kCVB9CVnNpIwYF9gct/Z1XN1mbTjpIuciAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:06:43.963252Z","bundle_sha256":"9d0e7d2c95a2f2f980c559e30c7da96366355e324317f6f302442306f46031db"}}