{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:I2BU22T4MHEYCAEZ5DDROG4CSO","short_pith_number":"pith:I2BU22T4","canonical_record":{"source":{"id":"2109.00657","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-02T00:36:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6347f738f133231083ec86212a1f2dca78d79e73fb6bf5302287a5ab55698cd8","abstract_canon_sha256":"8a8c70c1a3187666d43e45c387b69e863ce9e2e29702cc4332aa5f60b263ded6"},"schema_version":"1.0"},"canonical_sha256":"46834d6a7c61c9810099e8c7171b8293b132569d523337a9cc9e738c1bb0ded0","source":{"kind":"arxiv","id":"2109.00657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.00657","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"2109.00657v1","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00657","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"I2BU22T4MHEY","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"pith_short_16","alias_value":"I2BU22T4MHEYCAEZ","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"pith_short_8","alias_value":"I2BU22T4","created_at":"2026-07-05T03:10:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:I2BU22T4MHEYCAEZ5DDROG4CSO","target":"record","payload":{"canonical_record":{"source":{"id":"2109.00657","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-02T00:36:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6347f738f133231083ec86212a1f2dca78d79e73fb6bf5302287a5ab55698cd8","abstract_canon_sha256":"8a8c70c1a3187666d43e45c387b69e863ce9e2e29702cc4332aa5f60b263ded6"},"schema_version":"1.0"},"canonical_sha256":"46834d6a7c61c9810099e8c7171b8293b132569d523337a9cc9e738c1bb0ded0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:57.292620Z","signature_b64":"a6DfwIrYqHnR49q3ZdYm6seY8a4lkXOhjNe7UEFTDJTeqsZQNAkFF90Ql+AL9LVZbrjOHcVmnVizJMWH+3eJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46834d6a7c61c9810099e8c7171b8293b132569d523337a9cc9e738c1bb0ded0","last_reissued_at":"2026-07-05T03:10:57.292214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:57.292214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.00657","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-07-05T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVJPA6PrW9FClS5oXEG8Mc6sGGY1SX1aNwAnYxO4eDgmuo2U4VfqGI6q3YbmiiCXf8FHjjM1MyNOGTJf7N/PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:45:25.867421Z"},"content_sha256":"4e0e984bad9997987fdb96e703241b9b02e4de4c74f77378eab3c995e406b16e","schema_version":"1.0","event_id":"sha256:4e0e984bad9997987fdb96e703241b9b02e4de4c74f77378eab3c995e406b16e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:I2BU22T4MHEYCAEZ5DDROG4CSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Queues Can Be State-of-the-Art Priority Schedulers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anastasiia Postnikova, Dan Alistarh, Giorgi Nadiradze, Nikita Koval","submitted_at":"2021-09-02T00:36:16Z","abstract_excerpt":"Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given $n$ threads and $m\\ge n$ distinct priority queues, task insertions are performed uniformly at random, while, to delete, a thread picks two queues uniformly at random, and removes the observed task of higher priority. This approach scales well, and has probabilistic rank guarantees: roughly, the rank of each task removed, relative to remaining tasks in all other queues, is $O(m)$ in expectation. Yet, the performance of this pattern is below that o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00657","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.00657/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DT0GfpzFBzlB+rWoGzvnGQaxkWHiMhOfp4AAlvN2y+3Jr1GA884DREubnzMxR5in/wHzbNxG2a2Go+mW8KLvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:45:25.867968Z"},"content_sha256":"d2fdc03f55e139c71c023d33c9f6efebccb41ee90d6e83eda57e2abd56db5077","schema_version":"1.0","event_id":"sha256:d2fdc03f55e139c71c023d33c9f6efebccb41ee90d6e83eda57e2abd56db5077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/bundle.json","state_url":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/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-08-20T04:45:25Z","links":{"resolver":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO","bundle":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/bundle.json","state":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:I2BU22T4MHEYCAEZ5DDROG4CSO","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":"8a8c70c1a3187666d43e45c387b69e863ce9e2e29702cc4332aa5f60b263ded6","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-02T00:36:16Z","title_canon_sha256":"6347f738f133231083ec86212a1f2dca78d79e73fb6bf5302287a5ab55698cd8"},"schema_version":"1.0","source":{"id":"2109.00657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.00657","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"2109.00657v1","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00657","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"I2BU22T4MHEY","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"pith_short_16","alias_value":"I2BU22T4MHEYCAEZ","created_at":"2026-07-05T03:10:57Z"},{"alias_kind":"pith_short_8","alias_value":"I2BU22T4","created_at":"2026-07-05T03:10:57Z"}],"graph_snapshots":[{"event_id":"sha256:d2fdc03f55e139c71c023d33c9f6efebccb41ee90d6e83eda57e2abd56db5077","target":"graph","created_at":"2026-07-05T03:10: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.00657/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given $n$ threads and $m\\ge n$ distinct priority queues, task insertions are performed uniformly at random, while, to delete, a thread picks two queues uniformly at random, and removes the observed task of higher priority. This approach scales well, and has probabilistic rank guarantees: roughly, the rank of each task removed, relative to remaining tasks in all other queues, is $O(m)$ in expectation. Yet, the performance of this pattern is below that o","authors_text":"Anastasiia Postnikova, Dan Alistarh, Giorgi Nadiradze, Nikita Koval","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-02T00:36:16Z","title":"Multi-Queues Can Be State-of-the-Art Priority Schedulers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00657","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:4e0e984bad9997987fdb96e703241b9b02e4de4c74f77378eab3c995e406b16e","target":"record","created_at":"2026-07-05T03:10: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":"8a8c70c1a3187666d43e45c387b69e863ce9e2e29702cc4332aa5f60b263ded6","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-02T00:36:16Z","title_canon_sha256":"6347f738f133231083ec86212a1f2dca78d79e73fb6bf5302287a5ab55698cd8"},"schema_version":"1.0","source":{"id":"2109.00657","kind":"arxiv","version":1}},"canonical_sha256":"46834d6a7c61c9810099e8c7171b8293b132569d523337a9cc9e738c1bb0ded0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46834d6a7c61c9810099e8c7171b8293b132569d523337a9cc9e738c1bb0ded0","first_computed_at":"2026-07-05T03:10:57.292214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:10:57.292214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a6DfwIrYqHnR49q3ZdYm6seY8a4lkXOhjNe7UEFTDJTeqsZQNAkFF90Ql+AL9LVZbrjOHcVmnVizJMWH+3eJBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:10:57.292620Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.00657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e0e984bad9997987fdb96e703241b9b02e4de4c74f77378eab3c995e406b16e","sha256:d2fdc03f55e139c71c023d33c9f6efebccb41ee90d6e83eda57e2abd56db5077"],"state_sha256":"cc2c3a97b1b770784f2524e7e0d07135a91cab594fcb6784ee5526e8cd8563df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPNZLyYGSTrHya36nMxVloY6P/k7pnhF3Qiz0drYmJwvR0+QgV0B8v4roi6NoWEdFWb083lJBIRrdyZkFxXBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:45:25.872888Z","bundle_sha256":"d87ed35dae1db67d15164d9620f1e5509b87691caf7e5ac418762ff69a379ac9"}}