{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CLCRUB4VL7ZWLLOUW3L3RN4MJL","short_pith_number":"pith:CLCRUB4V","schema_version":"1.0","canonical_sha256":"12c51a07955ff365add4b6d7b8b78c4af03c91f20f2d4bff65e97efd81fb0093","source":{"kind":"arxiv","id":"1009.5538","version":1},"attestation_state":"computed","paper":{"title":"Priority Queues with Multiple Time Fingers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Arash Farzan, John Iacono","submitted_at":"2010-09-28T11:48:57Z","abstract_excerpt":"A priority queue is presented that supports the operations insert and find-min in worst-case constant time, and delete and delete-min on element x in worst-case O(lg(min{w_x, q_x}+2)) time, where w_x (respectively q_x) is the number of elements inserted after x (respectively before x) and are still present at the time of the deletion of x. Our priority queue then has both the working-set and the queueish properties, and more strongly it satisfies these properties in the worst-case sense. We also define a new distribution-sensitive property---the time-finger property, which encapsulates and gen"},"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":"1009.5538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-28T11:48:57Z","cross_cats_sorted":[],"title_canon_sha256":"8e0efe9881bbaf1b232fee29b174f1d1d1f79853f92ff47df67505b867512c54","abstract_canon_sha256":"c0ff44270e9a55f677e6856a4922e809a345317a41083b7d5c2ed0834bb69b00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:09.884675Z","signature_b64":"sJwY2Sy1A5gmDnKgAPBTFLuoOj4LSXyg1srKfdhVhrlQL41QuLik0v9y5PTZ+sELq7GciCp7L4KmacQJ3GlIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12c51a07955ff365add4b6d7b8b78c4af03c91f20f2d4bff65e97efd81fb0093","last_reissued_at":"2026-05-18T04:40:09.884182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:09.884182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Priority Queues with Multiple Time Fingers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Arash Farzan, John Iacono","submitted_at":"2010-09-28T11:48:57Z","abstract_excerpt":"A priority queue is presented that supports the operations insert and find-min in worst-case constant time, and delete and delete-min on element x in worst-case O(lg(min{w_x, q_x}+2)) time, where w_x (respectively q_x) is the number of elements inserted after x (respectively before x) and are still present at the time of the deletion of x. Our priority queue then has both the working-set and the queueish properties, and more strongly it satisfies these properties in the worst-case sense. We also define a new distribution-sensitive property---the time-finger property, which encapsulates and gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5538","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":"1009.5538","created_at":"2026-05-18T04:40:09.884262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5538v1","created_at":"2026-05-18T04:40:09.884262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5538","created_at":"2026-05-18T04:40:09.884262+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLCRUB4VL7ZW","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLCRUB4VL7ZWLLOU","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLCRUB4V","created_at":"2026-05-18T12:26:06.534383+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/CLCRUB4VL7ZWLLOUW3L3RN4MJL","json":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL.json","graph_json":"https://pith.science/api/pith-number/CLCRUB4VL7ZWLLOUW3L3RN4MJL/graph.json","events_json":"https://pith.science/api/pith-number/CLCRUB4VL7ZWLLOUW3L3RN4MJL/events.json","paper":"https://pith.science/paper/CLCRUB4V"},"agent_actions":{"view_html":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL","download_json":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL.json","view_paper":"https://pith.science/paper/CLCRUB4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5538&json=true","fetch_graph":"https://pith.science/api/pith-number/CLCRUB4VL7ZWLLOUW3L3RN4MJL/graph.json","fetch_events":"https://pith.science/api/pith-number/CLCRUB4VL7ZWLLOUW3L3RN4MJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/action/storage_attestation","attest_author":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/action/author_attestation","sign_citation":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/action/citation_signature","submit_replication":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/action/replication_record"}},"created_at":"2026-05-18T04:40:09.884262+00:00","updated_at":"2026-05-18T04:40:09.884262+00:00"}