{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:66T25XNP74FAFGUC5T36HDXRK4","short_pith_number":"pith:66T25XNP","schema_version":"1.0","canonical_sha256":"f7a7aeddafff0a029a82ecf7e38ef157305b9a48cc9c2f3e20baad62b4936c3a","source":{"kind":"arxiv","id":"1705.09642","version":6},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.09642","created_at":"2026-05-18T00:38:17.908676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09642v6","created_at":"2026-05-18T00:38:17.908676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09642","created_at":"2026-05-18T00:38:17.908676+00:00"},{"alias_kind":"pith_short_12","alias_value":"66T25XNP74FA","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"66T25XNP74FAFGUC","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"66T25XNP","created_at":"2026-05-18T12:31:03.183658+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/66T25XNP74FAFGUC5T36HDXRK4","json":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4.json","graph_json":"https://pith.science/api/pith-number/66T25XNP74FAFGUC5T36HDXRK4/graph.json","events_json":"https://pith.science/api/pith-number/66T25XNP74FAFGUC5T36HDXRK4/events.json","paper":"https://pith.science/paper/66T25XNP"},"agent_actions":{"view_html":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4","download_json":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4.json","view_paper":"https://pith.science/paper/66T25XNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09642&json=true","fetch_graph":"https://pith.science/api/pith-number/66T25XNP74FAFGUC5T36HDXRK4/graph.json","fetch_events":"https://pith.science/api/pith-number/66T25XNP74FAFGUC5T36HDXRK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/action/storage_attestation","attest_author":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/action/author_attestation","sign_citation":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/action/citation_signature","submit_replication":"https://pith.science/pith/66T25XNP74FAFGUC5T36HDXRK4/action/replication_record"}},"created_at":"2026-05-18T00:38:17.908676+00:00","updated_at":"2026-05-18T00:38:17.908676+00:00"}