{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:O2QMIMGVJ3BNUFQCQO4G6EAZ5K","short_pith_number":"pith:O2QMIMGV","schema_version":"1.0","canonical_sha256":"76a0c430d54ec2da160283b86f1019eaa175a66f1fedf0268e1f62f14dfedb1f","source":{"kind":"arxiv","id":"1006.1673","version":1},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.NI","authors_text":"Ananthram Swami, Animashree Anandkumar, Ao Kevin Tang, Nithin Michael","submitted_at":"2010-06-08T23:24:13Z","abstract_excerpt":"The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially unknown to the secondary users and are estimated using sensing decisions. There is no explicit information exchange or prior agreement among the secondary users. We propose policies for distributed learning and access which achieve order-optimal cognitive system throughput (number of successful secondary transmissions) under self play, i.e., when implemented at all the secondary users. Equivalently, our policies min"},"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":"1006.1673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-06-08T23:24:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"673d2a357ae9af885cc4f9604e58c1f8a25aa2a9584fb0c16b74525a91db7373","abstract_canon_sha256":"762f1cb6f96097a769fe5a325bb23cb31cc5930e0861968170c4dc1ee1d7ef5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:44.091017Z","signature_b64":"LtITAPSXOKqigfVx43nB4bshESukqzbd+etojXvr4Em6bPPogSzGFGsWW5P0m8rC0VK+MQPtjA9zp8Z06sOGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a0c430d54ec2da160283b86f1019eaa175a66f1fedf0268e1f62f14dfedb1f","last_reissued_at":"2026-05-18T00:58:44.090528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:44.090528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.NI","authors_text":"Ananthram Swami, Animashree Anandkumar, Ao Kevin Tang, Nithin Michael","submitted_at":"2010-06-08T23:24:13Z","abstract_excerpt":"The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially unknown to the secondary users and are estimated using sensing decisions. There is no explicit information exchange or prior agreement among the secondary users. We propose policies for distributed learning and access which achieve order-optimal cognitive system throughput (number of successful secondary transmissions) under self play, i.e., when implemented at all the secondary users. Equivalently, our policies min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1673","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":"1006.1673","created_at":"2026-05-18T00:58:44.090604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1673v1","created_at":"2026-05-18T00:58:44.090604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1673","created_at":"2026-05-18T00:58:44.090604+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2QMIMGVJ3BN","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2QMIMGVJ3BNUFQC","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2QMIMGV","created_at":"2026-05-18T12:26:12.377268+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/O2QMIMGVJ3BNUFQCQO4G6EAZ5K","json":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K.json","graph_json":"https://pith.science/api/pith-number/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/graph.json","events_json":"https://pith.science/api/pith-number/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/events.json","paper":"https://pith.science/paper/O2QMIMGV"},"agent_actions":{"view_html":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K","download_json":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K.json","view_paper":"https://pith.science/paper/O2QMIMGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1673&json=true","fetch_graph":"https://pith.science/api/pith-number/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/graph.json","fetch_events":"https://pith.science/api/pith-number/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/action/storage_attestation","attest_author":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/action/author_attestation","sign_citation":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/action/citation_signature","submit_replication":"https://pith.science/pith/O2QMIMGVJ3BNUFQCQO4G6EAZ5K/action/replication_record"}},"created_at":"2026-05-18T00:58:44.090604+00:00","updated_at":"2026-05-18T00:58:44.090604+00:00"}