{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OUUU27MFZJWKDWO3DJ5LODR7IV","short_pith_number":"pith:OUUU27MF","canonical_record":{"source":{"id":"1801.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-30T21:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"e4aa0a50c697c421677ab766422cffc4a11f3e35db55a7a3b61ee551a331b9e0","abstract_canon_sha256":"9beaaae64877f4003a595e59e9a899ee0be8295bfb3ff06e6ba5b0e5e87e1c98"},"schema_version":"1.0"},"canonical_sha256":"75294d7d85ca6ca1d9db1a7ab70e3f457bf796ec702e08a8daff364a29db37a4","source":{"kind":"arxiv","id":"1801.00194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00194","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00194v1","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00194","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"OUUU27MFZJWK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUUU27MFZJWKDWO3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUUU27MF","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OUUU27MFZJWKDWO3DJ5LODR7IV","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-30T21:14:25Z","cross_cats_sorted":[],"title_canon_sha256":"e4aa0a50c697c421677ab766422cffc4a11f3e35db55a7a3b61ee551a331b9e0","abstract_canon_sha256":"9beaaae64877f4003a595e59e9a899ee0be8295bfb3ff06e6ba5b0e5e87e1c98"},"schema_version":"1.0"},"canonical_sha256":"75294d7d85ca6ca1d9db1a7ab70e3f457bf796ec702e08a8daff364a29db37a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:59.117564Z","signature_b64":"xf40WpLmVB1hLcrwy2s+2d5OM3fOb2MQY/ti23bj6Kv5XktaGB6GWLt8raOjakxuhp8NhvNrxxgI+G0PK6rSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75294d7d85ca6ca1d9db1a7ab70e3f457bf796ec702e08a8daff364a29db37a4","last_reissued_at":"2026-05-18T00:26:59.116865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:59.116865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00194","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-18T00:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwKJ7OAgA2Z7ofi78+nh4zPUdoyLovG4gkugVe5UU6TKiXVIbOz96uyG7S8vfQsHaA6t08uDBFc2THkRykHoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:27:02.194358Z"},"content_sha256":"5d467c1c88bcdea4aee9f2dfc47e97dc75e20ee1a587ad0915d82a25a0938cf5","schema_version":"1.0","event_id":"sha256:5d467c1c88bcdea4aee9f2dfc47e97dc75e20ee1a587ad0915d82a25a0938cf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OUUU27MFZJWKDWO3DJ5LODR7IV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Throughput of Multiple Access Channels in Adversarial Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki","submitted_at":"2017-12-30T21:14:25Z","abstract_excerpt":"We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. The maximum injection rate that an algorithm can handle in a stable manner is called the throughput of the algorithm. We develop an algorithm that achieves throughput $1$ for any number of stations against leaky-bucket adversaries. The algorithm has $O(n^2+\\text{burstiness})$ packets queued sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00194","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-18T00:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4WHMG1okrRJfcVj4TZzjvYPZOC9wMEcLJtL99xXyzvKZkOXlM7XZQC6j2+r8qxo52w2/L2xyjSu4rao3z1IBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:27:02.194720Z"},"content_sha256":"27bfcf3435e84e9bc0163d0b922e0cc082f9e6ba7673af3c1fcd450c40349f65","schema_version":"1.0","event_id":"sha256:27bfcf3435e84e9bc0163d0b922e0cc082f9e6ba7673af3c1fcd450c40349f65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUUU27MFZJWKDWO3DJ5LODR7IV/bundle.json","state_url":"https://pith.science/pith/OUUU27MFZJWKDWO3DJ5LODR7IV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUUU27MFZJWKDWO3DJ5LODR7IV/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-06-23T12:27:02Z","links":{"resolver":"https://pith.science/pith/OUUU27MFZJWKDWO3DJ5LODR7IV","bundle":"https://pith.science/pith/OUUU27MFZJWKDWO3DJ5LODR7IV/bundle.json","state":"https://pith.science/pith/OUUU27MFZJWKDWO3DJ5LODR7IV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUUU27MFZJWKDWO3DJ5LODR7IV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OUUU27MFZJWKDWO3DJ5LODR7IV","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":"9beaaae64877f4003a595e59e9a899ee0be8295bfb3ff06e6ba5b0e5e87e1c98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-30T21:14:25Z","title_canon_sha256":"e4aa0a50c697c421677ab766422cffc4a11f3e35db55a7a3b61ee551a331b9e0"},"schema_version":"1.0","source":{"id":"1801.00194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00194","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00194v1","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00194","created_at":"2026-05-18T00:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"OUUU27MFZJWK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUUU27MFZJWKDWO3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUUU27MF","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:27bfcf3435e84e9bc0163d0b922e0cc082f9e6ba7673af3c1fcd450c40349f65","target":"graph","created_at":"2026-05-18T00:26:59Z","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 deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. The maximum injection rate that an algorithm can handle in a stable manner is called the throughput of the algorithm. We develop an algorithm that achieves throughput $1$ for any number of stations against leaky-bucket adversaries. The algorithm has $O(n^2+\\text{burstiness})$ packets queued sim","authors_text":"Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-30T21:14:25Z","title":"Maximum Throughput of Multiple Access Channels in Adversarial Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00194","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:5d467c1c88bcdea4aee9f2dfc47e97dc75e20ee1a587ad0915d82a25a0938cf5","target":"record","created_at":"2026-05-18T00:26:59Z","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":"9beaaae64877f4003a595e59e9a899ee0be8295bfb3ff06e6ba5b0e5e87e1c98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-30T21:14:25Z","title_canon_sha256":"e4aa0a50c697c421677ab766422cffc4a11f3e35db55a7a3b61ee551a331b9e0"},"schema_version":"1.0","source":{"id":"1801.00194","kind":"arxiv","version":1}},"canonical_sha256":"75294d7d85ca6ca1d9db1a7ab70e3f457bf796ec702e08a8daff364a29db37a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75294d7d85ca6ca1d9db1a7ab70e3f457bf796ec702e08a8daff364a29db37a4","first_computed_at":"2026-05-18T00:26:59.116865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:59.116865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xf40WpLmVB1hLcrwy2s+2d5OM3fOb2MQY/ti23bj6Kv5XktaGB6GWLt8raOjakxuhp8NhvNrxxgI+G0PK6rSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:59.117564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d467c1c88bcdea4aee9f2dfc47e97dc75e20ee1a587ad0915d82a25a0938cf5","sha256:27bfcf3435e84e9bc0163d0b922e0cc082f9e6ba7673af3c1fcd450c40349f65"],"state_sha256":"b146d5b036ec0ed454349047358d7525dccbb1c699b2c0f8242115f2481d3174"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0+/NMXypxyJEK1NRed2Vftf9m3X7eaaBYVhTQIiKwlZrRDms16vCu93adruEr6/kgASfX1g7eI7t1QzO73SAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:27:02.196555Z","bundle_sha256":"5b5cf357b0226fb95505949d9baa2ae245ba462238c744d3dafcd53ebadc922c"}}