{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YEDFU6T6HJKDKNRG657VIZNVGB","short_pith_number":"pith:YEDFU6T6","canonical_record":{"source":{"id":"1302.2824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-12T15:41:25Z","cross_cats_sorted":[],"title_canon_sha256":"13e3d7403c1009149de0f9a98fa07636f3e2c55163d0276e7b5ba2f69bc44e04","abstract_canon_sha256":"f2d3c6a7f5ca4d669e3f193fe49ff4e186fb2d4a3ea3811154f5d7d2ab6439c4"},"schema_version":"1.0"},"canonical_sha256":"c1065a7a7e3a54353626f77f5465b5306b955de02b793fbb5601c5bc10880aff","source":{"kind":"arxiv","id":"1302.2824","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2824","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2824v2","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2824","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"YEDFU6T6HJKD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YEDFU6T6HJKDKNRG","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YEDFU6T6","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YEDFU6T6HJKDKNRG657VIZNVGB","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-12T15:41:25Z","cross_cats_sorted":[],"title_canon_sha256":"13e3d7403c1009149de0f9a98fa07636f3e2c55163d0276e7b5ba2f69bc44e04","abstract_canon_sha256":"f2d3c6a7f5ca4d669e3f193fe49ff4e186fb2d4a3ea3811154f5d7d2ab6439c4"},"schema_version":"1.0"},"canonical_sha256":"c1065a7a7e3a54353626f77f5465b5306b955de02b793fbb5601c5bc10880aff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:05.662554Z","signature_b64":"Si/Afu9RMaeFATDTi/F86Ksa7Z7kkf09iM7VYV5kFaMRM3K4Z59Y8RUwt0ab3exImuCDgzWPDpwVRVhbkJsrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1065a7a7e3a54353626f77f5465b5306b955de02b793fbb5601c5bc10880aff","last_reissued_at":"2026-05-18T03:25:05.661821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:05.661821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2824","source_version":2,"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-18T03:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2q865i5/nZURFdwaMse8xUSuPD1X/nXGj4qE139irJGUy5kZTkRs/JEHyZnDTOjqgFqt40zA+Pqom+z6XVwqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:53:20.562914Z"},"content_sha256":"16e166b6b67a258c391f3900f34be852776dc18b499ae228426531fbb94a28fa","schema_version":"1.0","event_id":"sha256:16e166b6b67a258c391f3900f34be852776dc18b499ae228426531fbb94a28fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YEDFU6T6HJKDKNRG657VIZNVGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lingering Issues in Distributed Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Florian Simatos, Niek Bouman, Sem Borst","submitted_at":"2013-02-12T15:41:25Z","abstract_excerpt":"Recent advances have resulted in queue-based algorithms for medium access control which operate in a distributed fashion, and yet achieve the optimal throughput performance of centralized scheduling algorithms. However, fundamental performance bounds reveal that the \"cautious\" activation rules involved in establishing throughput optimality tend to produce extremely large delays, typically growing exponentially in 1/(1-r), with r the load of the system, in contrast to the usual linear growth.\n  Motivated by that issue, we explore to what extent more \"aggressive\" schemes can improve the delay pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2824","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"},"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-18T03:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAp9nkAv7+4pwZJyemLB0VgawtuIUFA/svsf+XpIILCxwwaBnZ6D0/tzoMkRsdonr+BvacYngb0PzeasuUxABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:53:20.563242Z"},"content_sha256":"3d5c411be71449a2d95b7329fad39b95e28e039fd5c00d6a9101276d2122a1c8","schema_version":"1.0","event_id":"sha256:3d5c411be71449a2d95b7329fad39b95e28e039fd5c00d6a9101276d2122a1c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEDFU6T6HJKDKNRG657VIZNVGB/bundle.json","state_url":"https://pith.science/pith/YEDFU6T6HJKDKNRG657VIZNVGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEDFU6T6HJKDKNRG657VIZNVGB/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-30T10:53:20Z","links":{"resolver":"https://pith.science/pith/YEDFU6T6HJKDKNRG657VIZNVGB","bundle":"https://pith.science/pith/YEDFU6T6HJKDKNRG657VIZNVGB/bundle.json","state":"https://pith.science/pith/YEDFU6T6HJKDKNRG657VIZNVGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEDFU6T6HJKDKNRG657VIZNVGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YEDFU6T6HJKDKNRG657VIZNVGB","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":"f2d3c6a7f5ca4d669e3f193fe49ff4e186fb2d4a3ea3811154f5d7d2ab6439c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-12T15:41:25Z","title_canon_sha256":"13e3d7403c1009149de0f9a98fa07636f3e2c55163d0276e7b5ba2f69bc44e04"},"schema_version":"1.0","source":{"id":"1302.2824","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2824","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2824v2","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2824","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"YEDFU6T6HJKD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YEDFU6T6HJKDKNRG","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YEDFU6T6","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:3d5c411be71449a2d95b7329fad39b95e28e039fd5c00d6a9101276d2122a1c8","target":"graph","created_at":"2026-05-18T03:25:05Z","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":"Recent advances have resulted in queue-based algorithms for medium access control which operate in a distributed fashion, and yet achieve the optimal throughput performance of centralized scheduling algorithms. However, fundamental performance bounds reveal that the \"cautious\" activation rules involved in establishing throughput optimality tend to produce extremely large delays, typically growing exponentially in 1/(1-r), with r the load of the system, in contrast to the usual linear growth.\n  Motivated by that issue, we explore to what extent more \"aggressive\" schemes can improve the delay pe","authors_text":"Florian Simatos, Niek Bouman, Sem Borst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-12T15:41:25Z","title":"Lingering Issues in Distributed Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2824","kind":"arxiv","version":2},"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:16e166b6b67a258c391f3900f34be852776dc18b499ae228426531fbb94a28fa","target":"record","created_at":"2026-05-18T03:25:05Z","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":"f2d3c6a7f5ca4d669e3f193fe49ff4e186fb2d4a3ea3811154f5d7d2ab6439c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-12T15:41:25Z","title_canon_sha256":"13e3d7403c1009149de0f9a98fa07636f3e2c55163d0276e7b5ba2f69bc44e04"},"schema_version":"1.0","source":{"id":"1302.2824","kind":"arxiv","version":2}},"canonical_sha256":"c1065a7a7e3a54353626f77f5465b5306b955de02b793fbb5601c5bc10880aff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1065a7a7e3a54353626f77f5465b5306b955de02b793fbb5601c5bc10880aff","first_computed_at":"2026-05-18T03:25:05.661821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:05.661821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Si/Afu9RMaeFATDTi/F86Ksa7Z7kkf09iM7VYV5kFaMRM3K4Z59Y8RUwt0ab3exImuCDgzWPDpwVRVhbkJsrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:05.662554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2824","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e166b6b67a258c391f3900f34be852776dc18b499ae228426531fbb94a28fa","sha256:3d5c411be71449a2d95b7329fad39b95e28e039fd5c00d6a9101276d2122a1c8"],"state_sha256":"5052bda63fd9f357d9040856a9278cb1f5ee9705b16da1678e845c5b5944c3ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XY7xxHjK72qE/wteyOOXlWZopiGAZQPFyOVohsdWLp9uC5HY9BXD3j7C8kDvj3Z24ehRclMPfBZVcpuv3MqVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T10:53:20.565167Z","bundle_sha256":"9136e889984fdd94001a69e96d5151ca37ca15ba5a4c9dc4d11b9dc44d3d7a66"}}