{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6NG64A6UC7LYWQ7L6EGM3FU3JD","short_pith_number":"pith:6NG64A6U","canonical_record":{"source":{"id":"1011.3594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-16T07:15:16Z","cross_cats_sorted":[],"title_canon_sha256":"6bc31c2f5ed25e9d65aa4a26ecb125a626b828c0c10565d2048c3ff9c8f89720","abstract_canon_sha256":"9fe61c6642e0d42dc967d4d08086d87de2daeff51daa0e9f436a1d85e6a72161"},"schema_version":"1.0"},"canonical_sha256":"f34dee03d417d78b43ebf10ccd969b48f83f8b6ec9330f43a78d2e53acc1bcbd","source":{"kind":"arxiv","id":"1011.3594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3594","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3594v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3594","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"6NG64A6UC7LY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6NG64A6UC7LYWQ7L","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6NG64A6U","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6NG64A6UC7LYWQ7L6EGM3FU3JD","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-16T07:15:16Z","cross_cats_sorted":[],"title_canon_sha256":"6bc31c2f5ed25e9d65aa4a26ecb125a626b828c0c10565d2048c3ff9c8f89720","abstract_canon_sha256":"9fe61c6642e0d42dc967d4d08086d87de2daeff51daa0e9f436a1d85e6a72161"},"schema_version":"1.0"},"canonical_sha256":"f34dee03d417d78b43ebf10ccd969b48f83f8b6ec9330f43a78d2e53acc1bcbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.562671Z","signature_b64":"gVGGtbWQ+OSYKQJE+PTfa9AV1oyHPBvkEmXvDovg8UQCmiqB+g4qfKHneuXv00ON0gBwQpXtfU1oiCyI4R8cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f34dee03d417d78b43ebf10ccd969b48f83f8b6ec9330f43a78d2e53acc1bcbd","last_reissued_at":"2026-05-18T00:57:57.562143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.562143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3594","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:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9oQaTHl5wXG0h7mBHvVgZfmDvTBZ+igtb6ef4C7laK9WAQTyxtwDHL1RlRQpNdLAYXdIsTXcPZtnmEsi5ZJEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:38:32.705224Z"},"content_sha256":"b0b699fd59c0cb31220b0854640a11310dc70543061f25d90614ef69347bad24","schema_version":"1.0","event_id":"sha256:b0b699fd59c0cb31220b0854640a11310dc70543061f25d90614ef69347bad24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6NG64A6UC7LYWQ7L6EGM3FU3JD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jean Walrand, Libin Jiang","submitted_at":"2010-11-16T07:15:16Z","abstract_excerpt":"It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important, but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula which takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3594","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:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iioAFNPZl8rptex71q9E8igCuVOCpbD8Nur4sfROIPUVX6YwrpywT260zfU+YUFjH+ugVVe9jcMaWXHDWUbXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:38:32.705586Z"},"content_sha256":"5306f3fcb952557c3af5971e06d2d754de5d394f606fe43cc0d26c56d8a03155","schema_version":"1.0","event_id":"sha256:5306f3fcb952557c3af5971e06d2d754de5d394f606fe43cc0d26c56d8a03155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NG64A6UC7LYWQ7L6EGM3FU3JD/bundle.json","state_url":"https://pith.science/pith/6NG64A6UC7LYWQ7L6EGM3FU3JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NG64A6UC7LYWQ7L6EGM3FU3JD/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-03T19:38:32Z","links":{"resolver":"https://pith.science/pith/6NG64A6UC7LYWQ7L6EGM3FU3JD","bundle":"https://pith.science/pith/6NG64A6UC7LYWQ7L6EGM3FU3JD/bundle.json","state":"https://pith.science/pith/6NG64A6UC7LYWQ7L6EGM3FU3JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NG64A6UC7LYWQ7L6EGM3FU3JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6NG64A6UC7LYWQ7L6EGM3FU3JD","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":"9fe61c6642e0d42dc967d4d08086d87de2daeff51daa0e9f436a1d85e6a72161","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-16T07:15:16Z","title_canon_sha256":"6bc31c2f5ed25e9d65aa4a26ecb125a626b828c0c10565d2048c3ff9c8f89720"},"schema_version":"1.0","source":{"id":"1011.3594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3594","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3594v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3594","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"6NG64A6UC7LY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6NG64A6UC7LYWQ7L","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6NG64A6U","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:5306f3fcb952557c3af5971e06d2d754de5d394f606fe43cc0d26c56d8a03155","target":"graph","created_at":"2026-05-18T00:57:57Z","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":"It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important, but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula which takes into account the cost of collisions and overhead. The formula has a simple form since the Markov chain ","authors_text":"Jean Walrand, Libin Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-16T07:15:16Z","title":"Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3594","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:b0b699fd59c0cb31220b0854640a11310dc70543061f25d90614ef69347bad24","target":"record","created_at":"2026-05-18T00:57:57Z","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":"9fe61c6642e0d42dc967d4d08086d87de2daeff51daa0e9f436a1d85e6a72161","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-16T07:15:16Z","title_canon_sha256":"6bc31c2f5ed25e9d65aa4a26ecb125a626b828c0c10565d2048c3ff9c8f89720"},"schema_version":"1.0","source":{"id":"1011.3594","kind":"arxiv","version":1}},"canonical_sha256":"f34dee03d417d78b43ebf10ccd969b48f83f8b6ec9330f43a78d2e53acc1bcbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f34dee03d417d78b43ebf10ccd969b48f83f8b6ec9330f43a78d2e53acc1bcbd","first_computed_at":"2026-05-18T00:57:57.562143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.562143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gVGGtbWQ+OSYKQJE+PTfa9AV1oyHPBvkEmXvDovg8UQCmiqB+g4qfKHneuXv00ON0gBwQpXtfU1oiCyI4R8cDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.562671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0b699fd59c0cb31220b0854640a11310dc70543061f25d90614ef69347bad24","sha256:5306f3fcb952557c3af5971e06d2d754de5d394f606fe43cc0d26c56d8a03155"],"state_sha256":"e8f98c60dc45abb61b6848c7f22d37d832182cf83078db50a588dd1f229c1142"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9hll4oTr01E0/qBpBoayQrMlXyh0HANOKy/OeOuDLiX/AF3NElPRQ5ElEShaBmB7XcsVQPIKdVlKmf0oYPFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:38:32.707617Z","bundle_sha256":"b137ea712893f2ff0bb04e8a1466134d001969d64b459723e41ceccbed0b88a4"}}