{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XSW6W6VBW72IB3SC5HB7ELL5HC","short_pith_number":"pith:XSW6W6VB","canonical_record":{"source":{"id":"1503.05698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T10:34:38Z","cross_cats_sorted":[],"title_canon_sha256":"7e3c4618a20ceae643d58ac3b19337157da5d13c50c3608a22b5dd45bd6fc9ba","abstract_canon_sha256":"700d519370cf45bcb4f186ff6feeaaf289798f084ae24853e5429ef1e61889c3"},"schema_version":"1.0"},"canonical_sha256":"bcadeb7aa1b7f480ee42e9c3f22d7d3883df08263436133e2ce2aab51c603609","source":{"kind":"arxiv","id":"1503.05698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05698","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05698v1","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05698","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"XSW6W6VBW72I","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XSW6W6VBW72IB3SC","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XSW6W6VB","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XSW6W6VBW72IB3SC5HB7ELL5HC","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T10:34:38Z","cross_cats_sorted":[],"title_canon_sha256":"7e3c4618a20ceae643d58ac3b19337157da5d13c50c3608a22b5dd45bd6fc9ba","abstract_canon_sha256":"700d519370cf45bcb4f186ff6feeaaf289798f084ae24853e5429ef1e61889c3"},"schema_version":"1.0"},"canonical_sha256":"bcadeb7aa1b7f480ee42e9c3f22d7d3883df08263436133e2ce2aab51c603609","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:58.349936Z","signature_b64":"stRdurFvbC2ZG0JrfDwsPQ6I6cS/ikfHepLXw+KzbeQQl+mgDF6W8m3Qc2GJSp1I6mu4EZgx5VoGJ683IM7bDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcadeb7aa1b7f480ee42e9c3f22d7d3883df08263436133e2ce2aab51c603609","last_reissued_at":"2026-05-18T02:20:58.349335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:58.349335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05698","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-18T02:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTkGn+OsXTOydPVzxrdjQJreBlvQVDR04Ttfsp/dy8fngFvXWxyKVJXIYSq2G2ZNIRKuNfNvZhBuL11u/QzcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:05:04.410494Z"},"content_sha256":"1c48d931e921026cee858ef6d37e49046c54f5d53e85e6bade90ba7e1b190488","schema_version":"1.0","event_id":"sha256:1c48d931e921026cee858ef6d37e49046c54f5d53e85e6bade90ba7e1b190488"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XSW6W6VBW72IB3SC5HB7ELL5HC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Lock-free $k$-LSM Relaxed Priority Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakob Gruber, Jesper Larsson Tr\\\"aff, Martin Wimmer, Philippas Tsigas","submitted_at":"2015-03-19T10:34:38Z","abstract_excerpt":"Priority queues are data structures which store keys in an ordered fashion to allow efficient access to the minimal (maximal) key. Priority queues are essential for many applications, e.g., Dijkstra's single-source shortest path algorithm, branch-and-bound algorithms, and prioritized schedulers.\n  Efficient multiprocessor computing requires implementations of basic data structures that can be used concurrently and scale to large numbers of threads and cores. Lock-free data structures promise superior scalability by avoiding blocking synchronization primitives, but the \\emph{delete-min} operati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05698","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-18T02:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Veb62R3L87fgCYNvGHu51QCWnqfozGXccW/7GzE1098Z3N+390tfIoijzM0n/63X/0su/f6ph3ICHfQOxZBdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:05:04.411246Z"},"content_sha256":"2ad555f284936febc4ff01f15fa92bcb16734d1c31ba74e8b6b926f0cb475e61","schema_version":"1.0","event_id":"sha256:2ad555f284936febc4ff01f15fa92bcb16734d1c31ba74e8b6b926f0cb475e61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/bundle.json","state_url":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/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-09T17:05:04Z","links":{"resolver":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC","bundle":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/bundle.json","state":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XSW6W6VBW72IB3SC5HB7ELL5HC","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":"700d519370cf45bcb4f186ff6feeaaf289798f084ae24853e5429ef1e61889c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T10:34:38Z","title_canon_sha256":"7e3c4618a20ceae643d58ac3b19337157da5d13c50c3608a22b5dd45bd6fc9ba"},"schema_version":"1.0","source":{"id":"1503.05698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05698","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05698v1","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05698","created_at":"2026-05-18T02:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"XSW6W6VBW72I","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XSW6W6VBW72IB3SC","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XSW6W6VB","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:2ad555f284936febc4ff01f15fa92bcb16734d1c31ba74e8b6b926f0cb475e61","target":"graph","created_at":"2026-05-18T02:20:58Z","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":"Priority queues are data structures which store keys in an ordered fashion to allow efficient access to the minimal (maximal) key. Priority queues are essential for many applications, e.g., Dijkstra's single-source shortest path algorithm, branch-and-bound algorithms, and prioritized schedulers.\n  Efficient multiprocessor computing requires implementations of basic data structures that can be used concurrently and scale to large numbers of threads and cores. Lock-free data structures promise superior scalability by avoiding blocking synchronization primitives, but the \\emph{delete-min} operati","authors_text":"Jakob Gruber, Jesper Larsson Tr\\\"aff, Martin Wimmer, Philippas Tsigas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T10:34:38Z","title":"The Lock-free $k$-LSM Relaxed Priority Queue"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05698","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:1c48d931e921026cee858ef6d37e49046c54f5d53e85e6bade90ba7e1b190488","target":"record","created_at":"2026-05-18T02:20:58Z","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":"700d519370cf45bcb4f186ff6feeaaf289798f084ae24853e5429ef1e61889c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T10:34:38Z","title_canon_sha256":"7e3c4618a20ceae643d58ac3b19337157da5d13c50c3608a22b5dd45bd6fc9ba"},"schema_version":"1.0","source":{"id":"1503.05698","kind":"arxiv","version":1}},"canonical_sha256":"bcadeb7aa1b7f480ee42e9c3f22d7d3883df08263436133e2ce2aab51c603609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcadeb7aa1b7f480ee42e9c3f22d7d3883df08263436133e2ce2aab51c603609","first_computed_at":"2026-05-18T02:20:58.349335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:58.349335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"stRdurFvbC2ZG0JrfDwsPQ6I6cS/ikfHepLXw+KzbeQQl+mgDF6W8m3Qc2GJSp1I6mu4EZgx5VoGJ683IM7bDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:58.349936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c48d931e921026cee858ef6d37e49046c54f5d53e85e6bade90ba7e1b190488","sha256:2ad555f284936febc4ff01f15fa92bcb16734d1c31ba74e8b6b926f0cb475e61"],"state_sha256":"f2b3f5b16a262259cda21d7f0a27e5e058cb29c4025a446dcd50cf09588a941b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+2LJA8yjqnja0/VVi/GYJycdVd9GKXpTmaOPgBfjCURYAd44eVjdia3bLwetr7K7eB5LIGFvXZCrhUtWtJYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:05:04.415253Z","bundle_sha256":"2d119532d689ac75296246a34c110532b482a2886d9c526b46955d72022477ca"}}