{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q4ESKYYCYNS335OUGF35CONCWQ","short_pith_number":"pith:Q4ESKYYC","schema_version":"1.0","canonical_sha256":"8709256302c365bdf5d43177d139a2b42cdbb2b2d6ac4bc75c522064f0b3a149","source":{"kind":"arxiv","id":"1312.7513","version":2},"attestation_state":"computed","paper":{"title":"Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Amir Leshem, Kobi Cohen","submitted_at":"2013-12-29T09:39:35Z","abstract_excerpt":"The problem of distributed rate maximization in multi-channel ALOHA networks is considered. First, we study the problem of constrained distributed rate maximization, where user rates are subject to total transmission probability constraints. We propose a best-response algorithm, where each user updates its strategy to increase its rate according to the channel state information and the current channel utilization. We prove the convergence of the algorithm to a Nash equilibrium in both homogeneous and heterogeneous networks using the theory of potential games. The performance of the best-respon"},"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":"1312.7513","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-29T09:39:35Z","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"title_canon_sha256":"cb2eb7b3dd3d75d32b48f924330d22192254aaec5985fab085cf6b384668a822","abstract_canon_sha256":"e1bcd80e27dd9253312859b4834ff8484c3d436ccff5821fc48b07a60c4a7976"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:52.996226Z","signature_b64":"uzzaNZJ3AWU/CIvGBqfXJIZYVqtye261pUR0HK4fPwSjg+30tX5HfJSYKpfDPjMHOUoGPhml1iogNQyUXF3VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8709256302c365bdf5d43177d139a2b42cdbb2b2d6ac4bc75c522064f0b3a149","last_reissued_at":"2026-05-18T02:03:52.995475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:52.995475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Amir Leshem, Kobi Cohen","submitted_at":"2013-12-29T09:39:35Z","abstract_excerpt":"The problem of distributed rate maximization in multi-channel ALOHA networks is considered. First, we study the problem of constrained distributed rate maximization, where user rates are subject to total transmission probability constraints. We propose a best-response algorithm, where each user updates its strategy to increase its rate according to the channel state information and the current channel utilization. We prove the convergence of the algorithm to a Nash equilibrium in both homogeneous and heterogeneous networks using the theory of potential games. The performance of the best-respon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7513","kind":"arxiv","version":2},"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":"1312.7513","created_at":"2026-05-18T02:03:52.995591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7513v2","created_at":"2026-05-18T02:03:52.995591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7513","created_at":"2026-05-18T02:03:52.995591+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4ESKYYCYNS3","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4ESKYYCYNS335OU","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4ESKYYC","created_at":"2026-05-18T12:27:57.521954+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/Q4ESKYYCYNS335OUGF35CONCWQ","json":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ.json","graph_json":"https://pith.science/api/pith-number/Q4ESKYYCYNS335OUGF35CONCWQ/graph.json","events_json":"https://pith.science/api/pith-number/Q4ESKYYCYNS335OUGF35CONCWQ/events.json","paper":"https://pith.science/paper/Q4ESKYYC"},"agent_actions":{"view_html":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ","download_json":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ.json","view_paper":"https://pith.science/paper/Q4ESKYYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7513&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4ESKYYCYNS335OUGF35CONCWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4ESKYYCYNS335OUGF35CONCWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ/action/storage_attestation","attest_author":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ/action/author_attestation","sign_citation":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ/action/citation_signature","submit_replication":"https://pith.science/pith/Q4ESKYYCYNS335OUGF35CONCWQ/action/replication_record"}},"created_at":"2026-05-18T02:03:52.995591+00:00","updated_at":"2026-05-18T02:03:52.995591+00:00"}