{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UXC7OWVW46GNZXHIHRMQDCBMRN","short_pith_number":"pith:UXC7OWVW","schema_version":"1.0","canonical_sha256":"a5c5f75ab6e78cdcdce83c5901882c8b7864b9e2ce5d60d8b9e06a6eb78d0de9","source":{"kind":"arxiv","id":"1306.6109","version":3},"attestation_state":"computed","paper":{"title":"Broadcasting in Ad Hoc Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bogdan S. Chlebus, Lakshmi Anantharamu","submitted_at":"2013-06-26T00:10:56Z","abstract_excerpt":"We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by injection rate, burstiness, and by how many passive stations can be simultaneously activated by providing them with packets. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet l"},"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":"1306.6109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-26T00:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"f7911e43a2168ad798a50e71c657b71233351377cdd7427d4a09778134f2df00","abstract_canon_sha256":"da8f4c422d35b7af6722dcb810fb71b7319bf9ea4e5d1ed2eb9cdbfe2e12d806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:31.067067Z","signature_b64":"9gOl0NQEeyB0ceHqY9EqBZi39HiF3jjLdEomPu22gSXcczSWAR0OyhdEzicG+tryskjwSnkgu0kpa8aBWnkwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5c5f75ab6e78cdcdce83c5901882c8b7864b9e2ce5d60d8b9e06a6eb78d0de9","last_reissued_at":"2026-05-18T00:10:31.066334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:31.066334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Broadcasting in Ad Hoc Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bogdan S. Chlebus, Lakshmi Anantharamu","submitted_at":"2013-06-26T00:10:56Z","abstract_excerpt":"We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by injection rate, burstiness, and by how many passive stations can be simultaneously activated by providing them with packets. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6109","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":"1306.6109","created_at":"2026-05-18T00:10:31.066472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6109v3","created_at":"2026-05-18T00:10:31.066472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6109","created_at":"2026-05-18T00:10:31.066472+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXC7OWVW46GN","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXC7OWVW46GNZXHI","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXC7OWVW","created_at":"2026-05-18T12:28:02.375192+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/UXC7OWVW46GNZXHIHRMQDCBMRN","json":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN.json","graph_json":"https://pith.science/api/pith-number/UXC7OWVW46GNZXHIHRMQDCBMRN/graph.json","events_json":"https://pith.science/api/pith-number/UXC7OWVW46GNZXHIHRMQDCBMRN/events.json","paper":"https://pith.science/paper/UXC7OWVW"},"agent_actions":{"view_html":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN","download_json":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN.json","view_paper":"https://pith.science/paper/UXC7OWVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6109&json=true","fetch_graph":"https://pith.science/api/pith-number/UXC7OWVW46GNZXHIHRMQDCBMRN/graph.json","fetch_events":"https://pith.science/api/pith-number/UXC7OWVW46GNZXHIHRMQDCBMRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN/action/storage_attestation","attest_author":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN/action/author_attestation","sign_citation":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN/action/citation_signature","submit_replication":"https://pith.science/pith/UXC7OWVW46GNZXHIHRMQDCBMRN/action/replication_record"}},"created_at":"2026-05-18T00:10:31.066472+00:00","updated_at":"2026-05-18T00:10:31.066472+00:00"}