{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XSW6W6VBW72IB3SC5HB7ELL5HC","short_pith_number":"pith:XSW6W6VB","schema_version":"1.0","canonical_sha256":"bcadeb7aa1b7f480ee42e9c3f22d7d3883df08263436133e2ce2aab51c603609","source":{"kind":"arxiv","id":"1503.05698","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.05698","created_at":"2026-05-18T02:20:58.349439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05698v1","created_at":"2026-05-18T02:20:58.349439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05698","created_at":"2026-05-18T02:20:58.349439+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSW6W6VBW72I","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSW6W6VBW72IB3SC","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSW6W6VB","created_at":"2026-05-18T12:29:50.041715+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/XSW6W6VBW72IB3SC5HB7ELL5HC","json":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC.json","graph_json":"https://pith.science/api/pith-number/XSW6W6VBW72IB3SC5HB7ELL5HC/graph.json","events_json":"https://pith.science/api/pith-number/XSW6W6VBW72IB3SC5HB7ELL5HC/events.json","paper":"https://pith.science/paper/XSW6W6VB"},"agent_actions":{"view_html":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC","download_json":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC.json","view_paper":"https://pith.science/paper/XSW6W6VB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05698&json=true","fetch_graph":"https://pith.science/api/pith-number/XSW6W6VBW72IB3SC5HB7ELL5HC/graph.json","fetch_events":"https://pith.science/api/pith-number/XSW6W6VBW72IB3SC5HB7ELL5HC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/action/storage_attestation","attest_author":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/action/author_attestation","sign_citation":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/action/citation_signature","submit_replication":"https://pith.science/pith/XSW6W6VBW72IB3SC5HB7ELL5HC/action/replication_record"}},"created_at":"2026-05-18T02:20:58.349439+00:00","updated_at":"2026-05-18T02:20:58.349439+00:00"}