{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RCDOQKURORH6I7V3WTFC732FFG","short_pith_number":"pith:RCDOQKUR","schema_version":"1.0","canonical_sha256":"8886e82a91744fe47ebbb4ca2fef452988a353db9aeb51c56217667d07c4d7e9","source":{"kind":"arxiv","id":"1412.4535","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Mechanism for Distributed Opportunistic Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.NI","authors_text":"Albert Banchs, Andres Garcia-Saavedra, Joerg Widmer, Pablo Serrano","submitted_at":"2014-12-15T11:05:46Z","abstract_excerpt":"Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention is successful, the station measures the channel conditions and transmits in case the channel quality is above a certain threshold. Otherwise, the station does not use the transmission opportunity, allowing all stations to recontend. A key challenge with DOS is to design a distributed algorithm that optimally adjusts the access probability and the threshold "},"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":"1412.4535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-15T11:05:46Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"9144ce26bd84135afbd51690294f8df13ffc008ed5991a17ba0b8318454aea27","abstract_canon_sha256":"aa7e52aeae0dc81a1d399b787814db387dca0c58b85a7ac4bba16e3894fc606a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:18.925084Z","signature_b64":"HVgbSmEu/Wki1bWkslI0jEnMNWu2ApIzyCHaRrP4kso1MM8bSj2RgCl+bBSart/OmyE2ucwLgQNBziGfmi3wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8886e82a91744fe47ebbb4ca2fef452988a353db9aeb51c56217667d07c4d7e9","last_reissued_at":"2026-05-18T02:31:18.924561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:18.924561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Mechanism for Distributed Opportunistic Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.NI","authors_text":"Albert Banchs, Andres Garcia-Saavedra, Joerg Widmer, Pablo Serrano","submitted_at":"2014-12-15T11:05:46Z","abstract_excerpt":"Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention is successful, the station measures the channel conditions and transmits in case the channel quality is above a certain threshold. Otherwise, the station does not use the transmission opportunity, allowing all stations to recontend. A key challenge with DOS is to design a distributed algorithm that optimally adjusts the access probability and the threshold "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4535","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":"1412.4535","created_at":"2026-05-18T02:31:18.924638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4535v1","created_at":"2026-05-18T02:31:18.924638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4535","created_at":"2026-05-18T02:31:18.924638+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCDOQKURORH6","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCDOQKURORH6I7V3","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCDOQKUR","created_at":"2026-05-18T12:28:46.137349+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/RCDOQKURORH6I7V3WTFC732FFG","json":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG.json","graph_json":"https://pith.science/api/pith-number/RCDOQKURORH6I7V3WTFC732FFG/graph.json","events_json":"https://pith.science/api/pith-number/RCDOQKURORH6I7V3WTFC732FFG/events.json","paper":"https://pith.science/paper/RCDOQKUR"},"agent_actions":{"view_html":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG","download_json":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG.json","view_paper":"https://pith.science/paper/RCDOQKUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4535&json=true","fetch_graph":"https://pith.science/api/pith-number/RCDOQKURORH6I7V3WTFC732FFG/graph.json","fetch_events":"https://pith.science/api/pith-number/RCDOQKURORH6I7V3WTFC732FFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG/action/storage_attestation","attest_author":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG/action/author_attestation","sign_citation":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG/action/citation_signature","submit_replication":"https://pith.science/pith/RCDOQKURORH6I7V3WTFC732FFG/action/replication_record"}},"created_at":"2026-05-18T02:31:18.924638+00:00","updated_at":"2026-05-18T02:31:18.924638+00:00"}