{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JL44LBUMUXLQ4JAZXEV5I3BFKI","short_pith_number":"pith:JL44LBUM","canonical_record":{"source":{"id":"1706.04178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-13T17:45:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"bc0c382d0d35c0aeb4ab37969aa60ceec19a26ae4209c295dbca63e74c7a4635","abstract_canon_sha256":"d937c6a64163aaadc32d632484acd57ffc48fa07811664f412666d68e0cc9184"},"schema_version":"1.0"},"canonical_sha256":"4af9c5868ca5d70e2419b92bd46c255205e3635e4837a41436ff79ee7238ec41","source":{"kind":"arxiv","id":"1706.04178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04178","created_at":"2026-05-18T00:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04178v1","created_at":"2026-05-18T00:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04178","created_at":"2026-05-18T00:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"JL44LBUMUXLQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JL44LBUMUXLQ4JAZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JL44LBUM","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JL44LBUMUXLQ4JAZXEV5I3BFKI","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-13T17:45:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"bc0c382d0d35c0aeb4ab37969aa60ceec19a26ae4209c295dbca63e74c7a4635","abstract_canon_sha256":"d937c6a64163aaadc32d632484acd57ffc48fa07811664f412666d68e0cc9184"},"schema_version":"1.0"},"canonical_sha256":"4af9c5868ca5d70e2419b92bd46c255205e3635e4837a41436ff79ee7238ec41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:24.333991Z","signature_b64":"IFAUQ6yhMA9/0KO5i5ECjac845CS3Xhtx8RpYA4C3citrbE8r3J+F9pr+mwyTzsfuUpldJ1qTmG6dohA2fquCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4af9c5868ca5d70e2419b92bd46c255205e3635e4837a41436ff79ee7238ec41","last_reissued_at":"2026-05-18T00:42:24.333291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:24.333291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04178","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:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNWfkHl9qXm25jGAlULogm+loDzRDpmpZgbqjT8eRPDe2wctuQzS5SsmsR2T2kwc4GehxIbrxqhFBxtZro1tBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:37:21.695269Z"},"content_sha256":"1b365169fb1860793c004f1ddeb50832dbff029000e7f000354a88828f1b46e5","schema_version":"1.0","event_id":"sha256:1b365169fb1860793c004f1ddeb50832dbff029000e7f000354a88828f1b46e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JL44LBUMUXLQ4JAZXEV5I3BFKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Choice in Priority Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Dan Alistarh, Giorgi Nadiradze, Jerry Li, Justin Kopinsky","submitted_at":"2017-06-13T17:45:20Z","abstract_excerpt":"Consider the following random process: we are given $n$ queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04178","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:42:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TElBTSfH3uD35Ej6+VMOOyKuF8k1qBbnH2z5BOksGIjd5lRNGZAZpqPRNG0jU0jf3EmABKpfMjnQkFm3O//tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:37:21.695937Z"},"content_sha256":"50000fb7b0506f8d9479a1855af9c9e5e82c4a6c7d6b844f2e66da8d722d075f","schema_version":"1.0","event_id":"sha256:50000fb7b0506f8d9479a1855af9c9e5e82c4a6c7d6b844f2e66da8d722d075f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JL44LBUMUXLQ4JAZXEV5I3BFKI/bundle.json","state_url":"https://pith.science/pith/JL44LBUMUXLQ4JAZXEV5I3BFKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JL44LBUMUXLQ4JAZXEV5I3BFKI/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-05-27T00:37:21Z","links":{"resolver":"https://pith.science/pith/JL44LBUMUXLQ4JAZXEV5I3BFKI","bundle":"https://pith.science/pith/JL44LBUMUXLQ4JAZXEV5I3BFKI/bundle.json","state":"https://pith.science/pith/JL44LBUMUXLQ4JAZXEV5I3BFKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JL44LBUMUXLQ4JAZXEV5I3BFKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JL44LBUMUXLQ4JAZXEV5I3BFKI","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":"d937c6a64163aaadc32d632484acd57ffc48fa07811664f412666d68e0cc9184","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-13T17:45:20Z","title_canon_sha256":"bc0c382d0d35c0aeb4ab37969aa60ceec19a26ae4209c295dbca63e74c7a4635"},"schema_version":"1.0","source":{"id":"1706.04178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04178","created_at":"2026-05-18T00:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04178v1","created_at":"2026-05-18T00:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04178","created_at":"2026-05-18T00:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"JL44LBUMUXLQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JL44LBUMUXLQ4JAZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JL44LBUM","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:50000fb7b0506f8d9479a1855af9c9e5e82c4a6c7d6b844f2e66da8d722d075f","target":"graph","created_at":"2026-05-18T00:42:24Z","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":"Consider the following random process: we are given $n$ queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any ","authors_text":"Dan Alistarh, Giorgi Nadiradze, Jerry Li, Justin Kopinsky","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-13T17:45:20Z","title":"The Power of Choice in Priority Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04178","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:1b365169fb1860793c004f1ddeb50832dbff029000e7f000354a88828f1b46e5","target":"record","created_at":"2026-05-18T00:42:24Z","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":"d937c6a64163aaadc32d632484acd57ffc48fa07811664f412666d68e0cc9184","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-13T17:45:20Z","title_canon_sha256":"bc0c382d0d35c0aeb4ab37969aa60ceec19a26ae4209c295dbca63e74c7a4635"},"schema_version":"1.0","source":{"id":"1706.04178","kind":"arxiv","version":1}},"canonical_sha256":"4af9c5868ca5d70e2419b92bd46c255205e3635e4837a41436ff79ee7238ec41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4af9c5868ca5d70e2419b92bd46c255205e3635e4837a41436ff79ee7238ec41","first_computed_at":"2026-05-18T00:42:24.333291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:24.333291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IFAUQ6yhMA9/0KO5i5ECjac845CS3Xhtx8RpYA4C3citrbE8r3J+F9pr+mwyTzsfuUpldJ1qTmG6dohA2fquCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:24.333991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b365169fb1860793c004f1ddeb50832dbff029000e7f000354a88828f1b46e5","sha256:50000fb7b0506f8d9479a1855af9c9e5e82c4a6c7d6b844f2e66da8d722d075f"],"state_sha256":"da3188fad27f1f32d2de4289d4672178a5f107980c20d618caa878f8e88921e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2rsSc5MIJnHJ/wZveXqltLhrJHeNOwinLgAHPnbTwLd7zgciLEJw3kWchTxysyhVb3KPCI6Twoyciig109MBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:37:21.698741Z","bundle_sha256":"193a4f43bc0dd583efbb982fa5e1ae0314e107480633442f73b93982f54e48f7"}}