{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QF3KKSSL2EBIRN7JDSKDDSKPVE","short_pith_number":"pith:QF3KKSSL","schema_version":"1.0","canonical_sha256":"8176a54a4bd10288b7e91c9431c94fa9246996e7bb8721d9353db597b2528dec","source":{"kind":"arxiv","id":"1312.2501","version":1},"attestation_state":"computed","paper":{"title":"Data Structures for Task-based Priority Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniel Cederman, Francesco Versaci, Jesper Larsson Tr\\\"aff, Martin Wimmer, Philippas Tsigas","submitted_at":"2013-12-09T16:27:10Z","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"},"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":"1312.2501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-09T16:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"89e455c3178a262fb0cabbbdd5e02fce25357bdba833c257deb159f4bf5c4a36","abstract_canon_sha256":"3b6a0a85554d451e93f1fb7592563a55cfee24e86e6a6a6e5cf73dc5e3949ffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.139281Z","signature_b64":"4Ejy70tE6FLdBb/Ejie6wqpCr/l9u+t6tI7Iszz4vXMrNFX4BVBMBkEoGmgFuJTRai6BVUu7ZHyCImppAI6tDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8176a54a4bd10288b7e91c9431c94fa9246996e7bb8721d9353db597b2528dec","last_reissued_at":"2026-05-18T03:05:10.138746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.138746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Structures for Task-based Priority Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniel Cederman, Francesco Versaci, Jesper Larsson Tr\\\"aff, Martin Wimmer, Philippas Tsigas","submitted_at":"2013-12-09T16:27:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2501","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.2501","created_at":"2026-05-18T03:05:10.138828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2501v1","created_at":"2026-05-18T03:05:10.138828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2501","created_at":"2026-05-18T03:05:10.138828+00:00"},{"alias_kind":"pith_short_12","alias_value":"QF3KKSSL2EBI","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QF3KKSSL2EBIRN7J","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QF3KKSSL","created_at":"2026-05-18T12:27:57.521954+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/QF3KKSSL2EBIRN7JDSKDDSKPVE","json":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE.json","graph_json":"https://pith.science/api/pith-number/QF3KKSSL2EBIRN7JDSKDDSKPVE/graph.json","events_json":"https://pith.science/api/pith-number/QF3KKSSL2EBIRN7JDSKDDSKPVE/events.json","paper":"https://pith.science/paper/QF3KKSSL"},"agent_actions":{"view_html":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE","download_json":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE.json","view_paper":"https://pith.science/paper/QF3KKSSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2501&json=true","fetch_graph":"https://pith.science/api/pith-number/QF3KKSSL2EBIRN7JDSKDDSKPVE/graph.json","fetch_events":"https://pith.science/api/pith-number/QF3KKSSL2EBIRN7JDSKDDSKPVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE/action/storage_attestation","attest_author":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE/action/author_attestation","sign_citation":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE/action/citation_signature","submit_replication":"https://pith.science/pith/QF3KKSSL2EBIRN7JDSKDDSKPVE/action/replication_record"}},"created_at":"2026-05-18T03:05:10.138828+00:00","updated_at":"2026-05-18T03:05:10.138828+00:00"}