{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QF3KKSSL2EBIRN7JDSKDDSKPVE","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":"3b6a0a85554d451e93f1fb7592563a55cfee24e86e6a6a6e5cf73dc5e3949ffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-09T16:27:10Z","title_canon_sha256":"89e455c3178a262fb0cabbbdd5e02fce25357bdba833c257deb159f4bf5c4a36"},"schema_version":"1.0","source":{"id":"1312.2501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2501","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2501v1","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2501","created_at":"2026-05-18T03:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"QF3KKSSL2EBI","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QF3KKSSL2EBIRN7J","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QF3KKSSL","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:6132dd3ab58b875f96818bd594cb58599edb95b4125533e872975d996fd639a9","target":"graph","created_at":"2026-05-18T03:05:10Z","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":"Many task-parallel applications can benefit from attempting to execute tasks in a specific order, as for instance indicated by priorities associated with the tasks. We present three lock-free data structures for priority scheduling with different trade-offs on scalability and ordering guarantees. First we propose a basic extension to work-stealing that provides good scalability, but cannot provide any guarantees for task-ordering in-between threads. Next, we present a centralized priority data structure based on $k$-fifo queues, which provides strong (but still relaxed with regard to a sequent","authors_text":"Daniel Cederman, Francesco Versaci, Jesper Larsson Tr\\\"aff, Martin Wimmer, Philippas Tsigas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-09T16:27:10Z","title":"Data Structures for Task-based Priority Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2501","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:5aa68fe1ec39800de882eabe779a2bb20c99cecb73900bc3ae3406b3fa9a5f7c","target":"record","created_at":"2026-05-18T03:05:10Z","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":"3b6a0a85554d451e93f1fb7592563a55cfee24e86e6a6a6e5cf73dc5e3949ffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-09T16:27:10Z","title_canon_sha256":"89e455c3178a262fb0cabbbdd5e02fce25357bdba833c257deb159f4bf5c4a36"},"schema_version":"1.0","source":{"id":"1312.2501","kind":"arxiv","version":1}},"canonical_sha256":"8176a54a4bd10288b7e91c9431c94fa9246996e7bb8721d9353db597b2528dec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8176a54a4bd10288b7e91c9431c94fa9246996e7bb8721d9353db597b2528dec","first_computed_at":"2026-05-18T03:05:10.138746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:10.138746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Ejy70tE6FLdBb/Ejie6wqpCr/l9u+t6tI7Iszz4vXMrNFX4BVBMBkEoGmgFuJTRai6BVUu7ZHyCImppAI6tDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:10.139281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5aa68fe1ec39800de882eabe779a2bb20c99cecb73900bc3ae3406b3fa9a5f7c","sha256:6132dd3ab58b875f96818bd594cb58599edb95b4125533e872975d996fd639a9"],"state_sha256":"075d2a8ac32fa1939c08998161114c1d8004fbb6e68669340525a1432d7ce8fe"}