{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XLO654RAWJ7E6FGKC2LDUJVRVD","short_pith_number":"pith:XLO654RA","schema_version":"1.0","canonical_sha256":"baddeef220b27e4f14ca16963a26b1a8c591b4289d41cddba588b200b05b0195","source":{"kind":"arxiv","id":"1308.4751","version":1},"attestation_state":"computed","paper":{"title":"Almost Optimal Channel Access in Multi-Hop Networks With Unknown Channel Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fan Li, Min Liu, Xiang-Yang Li, Yaqin Zhou, Zhiyuan Yin, Zhongcheng Li","submitted_at":"2013-08-22T02:28:02Z","abstract_excerpt":"We consider distributed channel access in multi-hop cognitive radio networks. Previous works on opportunistic channel access using multi-armed bandits (MAB) mainly focus on single-hop networks that assume complete conflicts among all secondary users. In the multi-hop multi-channel network settings studied here, there is more general competition among different communication pairs. We formulate the problem as a linearly combinatorial MAB problem that involves a maximum weighted independent set (MWIS) problem with unknown weights which need to learn. Existing methods for MAB where each of $N$ no"},"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":"1308.4751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-22T02:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"97339f41479817acd5d3dea92c3337844e6f1e127b289bf8ba8132a643205f2a","abstract_canon_sha256":"4f2b91709ce5c85d7f8040522d8b720fbdde12a9e00b4dae6ab1f78887e17976"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:19.884348Z","signature_b64":"ewK271PstHVywfnG+JmlDpq3paQG44GBWZ8rIwollXHn+g1F1I822mPPYW0PoZE+fKi7dNfBr/te5q/QEj5ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baddeef220b27e4f14ca16963a26b1a8c591b4289d41cddba588b200b05b0195","last_reissued_at":"2026-05-18T03:15:19.883469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:19.883469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Optimal Channel Access in Multi-Hop Networks With Unknown Channel Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fan Li, Min Liu, Xiang-Yang Li, Yaqin Zhou, Zhiyuan Yin, Zhongcheng Li","submitted_at":"2013-08-22T02:28:02Z","abstract_excerpt":"We consider distributed channel access in multi-hop cognitive radio networks. Previous works on opportunistic channel access using multi-armed bandits (MAB) mainly focus on single-hop networks that assume complete conflicts among all secondary users. In the multi-hop multi-channel network settings studied here, there is more general competition among different communication pairs. We formulate the problem as a linearly combinatorial MAB problem that involves a maximum weighted independent set (MWIS) problem with unknown weights which need to learn. Existing methods for MAB where each of $N$ no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4751","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":"1308.4751","created_at":"2026-05-18T03:15:19.883634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4751v1","created_at":"2026-05-18T03:15:19.883634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4751","created_at":"2026-05-18T03:15:19.883634+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLO654RAWJ7E","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLO654RAWJ7E6FGK","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLO654RA","created_at":"2026-05-18T12:28:06.772260+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/XLO654RAWJ7E6FGKC2LDUJVRVD","json":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD.json","graph_json":"https://pith.science/api/pith-number/XLO654RAWJ7E6FGKC2LDUJVRVD/graph.json","events_json":"https://pith.science/api/pith-number/XLO654RAWJ7E6FGKC2LDUJVRVD/events.json","paper":"https://pith.science/paper/XLO654RA"},"agent_actions":{"view_html":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD","download_json":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD.json","view_paper":"https://pith.science/paper/XLO654RA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4751&json=true","fetch_graph":"https://pith.science/api/pith-number/XLO654RAWJ7E6FGKC2LDUJVRVD/graph.json","fetch_events":"https://pith.science/api/pith-number/XLO654RAWJ7E6FGKC2LDUJVRVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/action/storage_attestation","attest_author":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/action/author_attestation","sign_citation":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/action/citation_signature","submit_replication":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/action/replication_record"}},"created_at":"2026-05-18T03:15:19.883634+00:00","updated_at":"2026-05-18T03:15:19.883634+00:00"}