{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XLO654RAWJ7E6FGKC2LDUJVRVD","short_pith_number":"pith:XLO654RA","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"},"canonical_sha256":"baddeef220b27e4f14ca16963a26b1a8c591b4289d41cddba588b200b05b0195","source":{"kind":"arxiv","id":"1308.4751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4751","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4751v1","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4751","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"pith_short_12","alias_value":"XLO654RAWJ7E","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XLO654RAWJ7E6FGK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XLO654RA","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XLO654RAWJ7E6FGKC2LDUJVRVD","target":"record","payload":{"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"},"canonical_sha256":"baddeef220b27e4f14ca16963a26b1a8c591b4289d41cddba588b200b05b0195","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"},"source_kind":"arxiv","source_id":"1308.4751","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-18T03:15:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smfnjZQHujsCv3mg4IBbwk1nFWcrJNDjdkye6G5AeX4VcywkDVD28IQE3bQDjTZKj/T7vVxhUlntBlVsEuPKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:24:13.000471Z"},"content_sha256":"4b0e7a59afcfecf0f088debf9c6ca5ff613c97ae8c2981e194edf6552920f8af","schema_version":"1.0","event_id":"sha256:4b0e7a59afcfecf0f088debf9c6ca5ff613c97ae8c2981e194edf6552920f8af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XLO654RAWJ7E6FGKC2LDUJVRVD","target":"graph","payload":{"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"},"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-18T03:15:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3I24Z5eYE1tep/hCc+pSbPG26TFRgg2LAWOTIn3Ns55Z8qUFP6kDQz2e2m3CpyDUBhpuZX/SreEch2hITRkxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:24:13.000927Z"},"content_sha256":"00bfc13dadfe676aeb5612e06ebce363709a7e421a1449f7f3798a5f72df4646","schema_version":"1.0","event_id":"sha256:00bfc13dadfe676aeb5612e06ebce363709a7e421a1449f7f3798a5f72df4646"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/bundle.json","state_url":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/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-31T20:24:13Z","links":{"resolver":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD","bundle":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/bundle.json","state":"https://pith.science/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLO654RAWJ7E6FGKC2LDUJVRVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XLO654RAWJ7E6FGKC2LDUJVRVD","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":"4f2b91709ce5c85d7f8040522d8b720fbdde12a9e00b4dae6ab1f78887e17976","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-22T02:28:02Z","title_canon_sha256":"97339f41479817acd5d3dea92c3337844e6f1e127b289bf8ba8132a643205f2a"},"schema_version":"1.0","source":{"id":"1308.4751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4751","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4751v1","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4751","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"pith_short_12","alias_value":"XLO654RAWJ7E","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XLO654RAWJ7E6FGK","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XLO654RA","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:00bfc13dadfe676aeb5612e06ebce363709a7e421a1449f7f3798a5f72df4646","target":"graph","created_at":"2026-05-18T03:15:19Z","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":"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","authors_text":"Fan Li, Min Liu, Xiang-Yang Li, Yaqin Zhou, Zhiyuan Yin, Zhongcheng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-22T02:28:02Z","title":"Almost Optimal Channel Access in Multi-Hop Networks With Unknown Channel Variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4751","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:4b0e7a59afcfecf0f088debf9c6ca5ff613c97ae8c2981e194edf6552920f8af","target":"record","created_at":"2026-05-18T03:15:19Z","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":"4f2b91709ce5c85d7f8040522d8b720fbdde12a9e00b4dae6ab1f78887e17976","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-22T02:28:02Z","title_canon_sha256":"97339f41479817acd5d3dea92c3337844e6f1e127b289bf8ba8132a643205f2a"},"schema_version":"1.0","source":{"id":"1308.4751","kind":"arxiv","version":1}},"canonical_sha256":"baddeef220b27e4f14ca16963a26b1a8c591b4289d41cddba588b200b05b0195","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baddeef220b27e4f14ca16963a26b1a8c591b4289d41cddba588b200b05b0195","first_computed_at":"2026-05-18T03:15:19.883469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:19.883469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ewK271PstHVywfnG+JmlDpq3paQG44GBWZ8rIwollXHn+g1F1I822mPPYW0PoZE+fKi7dNfBr/te5q/QEj5ECA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:19.884348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b0e7a59afcfecf0f088debf9c6ca5ff613c97ae8c2981e194edf6552920f8af","sha256:00bfc13dadfe676aeb5612e06ebce363709a7e421a1449f7f3798a5f72df4646"],"state_sha256":"7c89983ed033fc7d9785b2a0694da314886fe39f01a3751512c0a17915efd422"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Wr3RPhQNl74xw0bLrIuWCBC9eLdF/4uE3eeODyAfSptnu4nima9LHUjfo6NOxNge7ZUehqEcUS8LXEGh/h5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:24:13.004031Z","bundle_sha256":"1760038b98bf6e936c70ef4720006c7f1ed316681dc573f1ef0773e312ffb77b"}}