{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ABXE2M5KJFCQ2565MKAOMYKOG7","short_pith_number":"pith:ABXE2M5K","schema_version":"1.0","canonical_sha256":"006e4d33aa49450d77dd6280e6614e37d61d253b8586925a0f42657a13bcb121","source":{"kind":"arxiv","id":"1309.6610","version":3},"attestation_state":"computed","paper":{"title":"Adversarial Multiple Access Channels with Individual Injection Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Bogdan S. Chlebus, Lakshmi Anantharamu, Mariusz A. Rokicki","submitted_at":"2013-09-25T19:05:26Z","abstract_excerpt":"We study deterministic distributed broadcasting in synchronous multiple-access channels. Packets are injected into $n$ nodes by a window-type adversary that is constrained by a window $w$ and injection rates individually assigned to all nodes. We investigate what queue size and packet latency can be achieved with the maximum aggregate injection rate of one packet per round, depending on properties of channels and algorithms. We give a non-adaptive algorithm for channels with collision detection and an adaptive algorithm for channels without collision detection that achieve $O(\\min(n+w,w\\log n)"},"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":"1309.6610","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-25T19:05:26Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"938e092b279c39ad522485478356f5ceb8a39754cb3e3026458928385d990434","abstract_canon_sha256":"671507058ad057199ba1407432838949ba475e77efb7e106a973c6669ab4414a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:24.842782Z","signature_b64":"y4tfY39xqoRnHMJBl/bb6hpHs5UgzvmigDjKdOJao01Aw7QVdk+Ftd35BKkpBlL6Ln3h1qMaFnsZdpbA0G5jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006e4d33aa49450d77dd6280e6614e37d61d253b8586925a0f42657a13bcb121","last_reissued_at":"2026-05-18T00:10:24.842085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:24.842085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Multiple Access Channels with Individual Injection Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Bogdan S. Chlebus, Lakshmi Anantharamu, Mariusz A. Rokicki","submitted_at":"2013-09-25T19:05:26Z","abstract_excerpt":"We study deterministic distributed broadcasting in synchronous multiple-access channels. Packets are injected into $n$ nodes by a window-type adversary that is constrained by a window $w$ and injection rates individually assigned to all nodes. We investigate what queue size and packet latency can be achieved with the maximum aggregate injection rate of one packet per round, depending on properties of channels and algorithms. We give a non-adaptive algorithm for channels with collision detection and an adaptive algorithm for channels without collision detection that achieve $O(\\min(n+w,w\\log n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6610","kind":"arxiv","version":3},"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":"1309.6610","created_at":"2026-05-18T00:10:24.842218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6610v3","created_at":"2026-05-18T00:10:24.842218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6610","created_at":"2026-05-18T00:10:24.842218+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABXE2M5KJFCQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABXE2M5KJFCQ2565","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABXE2M5K","created_at":"2026-05-18T12:27:38.830355+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/ABXE2M5KJFCQ2565MKAOMYKOG7","json":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7.json","graph_json":"https://pith.science/api/pith-number/ABXE2M5KJFCQ2565MKAOMYKOG7/graph.json","events_json":"https://pith.science/api/pith-number/ABXE2M5KJFCQ2565MKAOMYKOG7/events.json","paper":"https://pith.science/paper/ABXE2M5K"},"agent_actions":{"view_html":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7","download_json":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7.json","view_paper":"https://pith.science/paper/ABXE2M5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6610&json=true","fetch_graph":"https://pith.science/api/pith-number/ABXE2M5KJFCQ2565MKAOMYKOG7/graph.json","fetch_events":"https://pith.science/api/pith-number/ABXE2M5KJFCQ2565MKAOMYKOG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7/action/storage_attestation","attest_author":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7/action/author_attestation","sign_citation":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7/action/citation_signature","submit_replication":"https://pith.science/pith/ABXE2M5KJFCQ2565MKAOMYKOG7/action/replication_record"}},"created_at":"2026-05-18T00:10:24.842218+00:00","updated_at":"2026-05-18T00:10:24.842218+00:00"}