{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AMSOUFUTRNHJKY4MMSO6SBS4EO","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":"ee45a8f431598a386a72bb6af49e9d8a46ca055a3697b45baeefe805992e02c7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-23T16:35:38Z","title_canon_sha256":"ffe0e6a2c2ac865d7d2c4bd7164095bf7d2b3e881e9a7b671541ce9c3f5b2c7d"},"schema_version":"1.0","source":{"id":"1509.07053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07053","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07053v1","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07053","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"AMSOUFUTRNHJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AMSOUFUTRNHJKY4M","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AMSOUFUT","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:d9997ac991045fb3bfaf411d86532295a900108070a5fefd735078baf46b93cd","target":"graph","created_at":"2026-05-18T01:32:17Z","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 abstract data structures which store a set of key/value pairs and allow efficient access to the item with the minimal (maximal) key. Such queues are an important element in various areas of computer science such as algorithmics (i.e. Dijkstra's shortest path algorithm) and operating system (i.e. priority schedulers).\n  The recent trend towards multiprocessor computing requires new implementations of basic data structures which are able to be used concurrently and scale well to a large number of threads. In particular, lock-free structures promise superior scalability by avo","authors_text":"Jakob Gruber","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-23T16:35:38Z","title":"Practical Concurrent Priority Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07053","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:1ba88b4908ce7fabff507fd0b85f4a612288de71bf78022a8035e6501ac2b1b6","target":"record","created_at":"2026-05-18T01:32:17Z","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":"ee45a8f431598a386a72bb6af49e9d8a46ca055a3697b45baeefe805992e02c7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-23T16:35:38Z","title_canon_sha256":"ffe0e6a2c2ac865d7d2c4bd7164095bf7d2b3e881e9a7b671541ce9c3f5b2c7d"},"schema_version":"1.0","source":{"id":"1509.07053","kind":"arxiv","version":1}},"canonical_sha256":"0324ea16938b4e95638c649de9065c23956843106c7b5f8ee061676aeaa83a65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0324ea16938b4e95638c649de9065c23956843106c7b5f8ee061676aeaa83a65","first_computed_at":"2026-05-18T01:32:17.057736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:17.057736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9vwBauVa/3GbBjJxh860qOE+f4nEJcy59uiHDRlus34Qp+Msbs6oRgXMUK6RurQeQ+TfJEnc6kMj8pTROnsmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:17.058422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ba88b4908ce7fabff507fd0b85f4a612288de71bf78022a8035e6501ac2b1b6","sha256:d9997ac991045fb3bfaf411d86532295a900108070a5fefd735078baf46b93cd"],"state_sha256":"86c421564e11627ce7cc4700589658de9121d21f89b1c6a4f9e971083fcf5461"}