{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:66T25XNP74FAFGUC5T36HDXRK4","short_pith_number":"pith:66T25XNP","canonical_record":{"source":{"id":"1705.09642","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:31:59Z","cross_cats_sorted":[],"title_canon_sha256":"8b9c606e8b2ec7c7b70cf13bac67d0d0fc186a4f142c1fbea20f915c2d332de8","abstract_canon_sha256":"bdb02c359fb3cd4d03d57213ea8acb3dcc4930667504ac3dd79e9257777ba23a"},"schema_version":"1.0"},"canonical_sha256":"f7a7aeddafff0a029a82ecf7e38ef157305b9a48cc9c2f3e20baad62b4936c3a","source":{"kind":"arxiv","id":"1705.09642","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09642","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09642v6","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09642","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"66T25XNP74FA","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"66T25XNP74FAFGUC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"66T25XNP","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:66T25XNP74FAFGUC5T36HDXRK4","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09642","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:31:59Z","cross_cats_sorted":[],"title_canon_sha256":"8b9c606e8b2ec7c7b70cf13bac67d0d0fc186a4f142c1fbea20f915c2d332de8","abstract_canon_sha256":"bdb02c359fb3cd4d03d57213ea8acb3dcc4930667504ac3dd79e9257777ba23a"},"schema_version":"1.0"},"canonical_sha256":"f7a7aeddafff0a029a82ecf7e38ef157305b9a48cc9c2f3e20baad62b4936c3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:17.909330Z","signature_b64":"pr8JJEwGMZ+WeFbiegphfG6sdDm7PzamPHrqdSZiJUy84V7iN1ulP1koQCgaNzULFGozBfiie6qba1m+iHJ1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7a7aeddafff0a029a82ecf7e38ef157305b9a48cc9c2f3e20baad62b4936c3a","last_reissued_at":"2026-05-18T00:38:17.908536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:17.908536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09642","source_version":6,"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:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yvsYBgklmwG+O+QKP5uAgHDsfUpHVVTZqZcpTiUNFKQoeJJZ3yEVz3e3h16ufCxGWnqW5SKkBb3DB4y0B3zpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:40:42.546938Z"},"content_sha256":"f64023bf46e720132448c9ed4e56d13441cbc88dfbd985b3051a94b9172cae55","schema_version":"1.0","event_id":"sha256:f64023bf46e720132448c9ed4e56d13441cbc88dfbd985b3051a94b9172cae55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:66T25XNP74FAFGUC5T36HDXRK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiresolution Priority Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Commike, Dilip Madathil, Jeff Lucovsky, Jordi Ros-Giralt, Peter Cullen, Richard Lethin","submitted_at":"2017-05-26T16:31:59Z","abstract_excerpt":"Priority queues are container data structures essential to many high performance computing (HPC) applications. In this paper, we introduce multiresolution priority queues, a data structure that improves the performance of the standard heap based implementations by trading off a controllable amount of resolution in the space of priorities. The new data structure can reduce the worst case performance of inserting an element from O(log(n)) to O(log(r)), where n is the number of elements in the queue and r is the number of resolution groups in the priority space. The worst case cost of removing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09642","kind":"arxiv","version":6},"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:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TT1doO33yUPuW4S+n+mCYPMeQrIX5k8fsIoEss9Psb6Xeh6Q2Al4U8oRcmseiBaYTo7jXQ2sHDi1nCp83ecUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:40:42.547639Z"},"content_sha256":"81a72312f527cdde774e46f6ac82a546ce6545faddb782d43f8233a2adb160c5","schema_version":"1.0","event_id":"sha256:81a72312f527cdde774e46f6ac82a546ce6545faddb782d43f8233a2adb160c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/bundle.json","state_url":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66T25XNP74FAFGUC5T36HDXRK4/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-11T05:40:42Z","links":{"resolver":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4","bundle":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/bundle.json","state":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66T25XNP74FAFGUC5T36HDXRK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:66T25XNP74FAFGUC5T36HDXRK4","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":"bdb02c359fb3cd4d03d57213ea8acb3dcc4930667504ac3dd79e9257777ba23a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:31:59Z","title_canon_sha256":"8b9c606e8b2ec7c7b70cf13bac67d0d0fc186a4f142c1fbea20f915c2d332de8"},"schema_version":"1.0","source":{"id":"1705.09642","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09642","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09642v6","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09642","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"66T25XNP74FA","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"66T25XNP74FAFGUC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"66T25XNP","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:81a72312f527cdde774e46f6ac82a546ce6545faddb782d43f8233a2adb160c5","target":"graph","created_at":"2026-05-18T00:38: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 container data structures essential to many high performance computing (HPC) applications. In this paper, we introduce multiresolution priority queues, a data structure that improves the performance of the standard heap based implementations by trading off a controllable amount of resolution in the space of priorities. The new data structure can reduce the worst case performance of inserting an element from O(log(n)) to O(log(r)), where n is the number of elements in the queue and r is the number of resolution groups in the priority space. The worst case cost of removing th","authors_text":"Alan Commike, Dilip Madathil, Jeff Lucovsky, Jordi Ros-Giralt, Peter Cullen, Richard Lethin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:31:59Z","title":"Multiresolution Priority Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09642","kind":"arxiv","version":6},"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:f64023bf46e720132448c9ed4e56d13441cbc88dfbd985b3051a94b9172cae55","target":"record","created_at":"2026-05-18T00:38: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":"bdb02c359fb3cd4d03d57213ea8acb3dcc4930667504ac3dd79e9257777ba23a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:31:59Z","title_canon_sha256":"8b9c606e8b2ec7c7b70cf13bac67d0d0fc186a4f142c1fbea20f915c2d332de8"},"schema_version":"1.0","source":{"id":"1705.09642","kind":"arxiv","version":6}},"canonical_sha256":"f7a7aeddafff0a029a82ecf7e38ef157305b9a48cc9c2f3e20baad62b4936c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7a7aeddafff0a029a82ecf7e38ef157305b9a48cc9c2f3e20baad62b4936c3a","first_computed_at":"2026-05-18T00:38:17.908536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:17.908536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pr8JJEwGMZ+WeFbiegphfG6sdDm7PzamPHrqdSZiJUy84V7iN1ulP1koQCgaNzULFGozBfiie6qba1m+iHJ1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:17.909330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09642","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f64023bf46e720132448c9ed4e56d13441cbc88dfbd985b3051a94b9172cae55","sha256:81a72312f527cdde774e46f6ac82a546ce6545faddb782d43f8233a2adb160c5"],"state_sha256":"d9a01a2ed182b3d5a69cb085b8ea7098dd183bd8606fa74c6aadbe547733aa70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEGB/qrIyImji1TWggBOnvXdDECs0jeC/UgP6tL5m2XoYReiUnXeDVw2JHuRxHAvMKHDxY1E4J5v1e6NqT1sDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:40:42.551294Z","bundle_sha256":"cdc003aa7ab808e0949ecb75b6f723b9f4fb4fafedb8cedcc2544502f6de8c62"}}