{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CLCRUB4VL7ZWLLOUW3L3RN4MJL","short_pith_number":"pith:CLCRUB4V","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"},"canonical_sha256":"12c51a07955ff365add4b6d7b8b78c4af03c91f20f2d4bff65e97efd81fb0093","source":{"kind":"arxiv","id":"1009.5538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5538","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5538v1","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5538","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"CLCRUB4VL7ZW","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CLCRUB4VL7ZWLLOU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CLCRUB4V","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CLCRUB4VL7ZWLLOUW3L3RN4MJL","target":"record","payload":{"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"},"canonical_sha256":"12c51a07955ff365add4b6d7b8b78c4af03c91f20f2d4bff65e97efd81fb0093","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"},"source_kind":"arxiv","source_id":"1009.5538","source_version":1,"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-18T04:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wj1a7WmGPbLtwHhdwBeuSE0UICyB2FNFf/KqFFmyvLhTmhKlFa9pJD79YjXS0avHFd/3ouizvWHTVcOpFqLYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:27:09.195925Z"},"content_sha256":"1c8ea3b5f20ab3b42b7592b7a0c867a089fb99dcedb70ef40c3ec5bdf28c02ff","schema_version":"1.0","event_id":"sha256:1c8ea3b5f20ab3b42b7592b7a0c867a089fb99dcedb70ef40c3ec5bdf28c02ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CLCRUB4VL7ZWLLOUW3L3RN4MJL","target":"graph","payload":{"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"},"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-18T04:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4aRnrIbtHBihPimELLGI2lpFpNwbg/17B/PPk6RR9BKO4ocxnYbKEqHNxbv7ONq3GaMmVfYkaHyWPFEGOgQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:27:09.196271Z"},"content_sha256":"4c224c9bad20f86802ddf106583e4a757bc4798ba05e2e4dc7c08796f54db6f2","schema_version":"1.0","event_id":"sha256:4c224c9bad20f86802ddf106583e4a757bc4798ba05e2e4dc7c08796f54db6f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/bundle.json","state_url":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/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-23T05:27:09Z","links":{"resolver":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL","bundle":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/bundle.json","state":"https://pith.science/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLCRUB4VL7ZWLLOUW3L3RN4MJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CLCRUB4VL7ZWLLOUW3L3RN4MJL","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":"c0ff44270e9a55f677e6856a4922e809a345317a41083b7d5c2ed0834bb69b00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-28T11:48:57Z","title_canon_sha256":"8e0efe9881bbaf1b232fee29b174f1d1d1f79853f92ff47df67505b867512c54"},"schema_version":"1.0","source":{"id":"1009.5538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5538","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5538v1","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5538","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"CLCRUB4VL7ZW","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CLCRUB4VL7ZWLLOU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CLCRUB4V","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:4c224c9bad20f86802ddf106583e4a757bc4798ba05e2e4dc7c08796f54db6f2","target":"graph","created_at":"2026-05-18T04:40:09Z","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":"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","authors_text":"Amr Elmasry, Arash Farzan, John Iacono","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-28T11:48:57Z","title":"Priority Queues with Multiple Time Fingers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5538","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:1c8ea3b5f20ab3b42b7592b7a0c867a089fb99dcedb70ef40c3ec5bdf28c02ff","target":"record","created_at":"2026-05-18T04:40:09Z","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":"c0ff44270e9a55f677e6856a4922e809a345317a41083b7d5c2ed0834bb69b00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-28T11:48:57Z","title_canon_sha256":"8e0efe9881bbaf1b232fee29b174f1d1d1f79853f92ff47df67505b867512c54"},"schema_version":"1.0","source":{"id":"1009.5538","kind":"arxiv","version":1}},"canonical_sha256":"12c51a07955ff365add4b6d7b8b78c4af03c91f20f2d4bff65e97efd81fb0093","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12c51a07955ff365add4b6d7b8b78c4af03c91f20f2d4bff65e97efd81fb0093","first_computed_at":"2026-05-18T04:40:09.884182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:09.884182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sJwY2Sy1A5gmDnKgAPBTFLuoOj4LSXyg1srKfdhVhrlQL41QuLik0v9y5PTZ+sELq7GciCp7L4KmacQJ3GlIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:09.884675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c8ea3b5f20ab3b42b7592b7a0c867a089fb99dcedb70ef40c3ec5bdf28c02ff","sha256:4c224c9bad20f86802ddf106583e4a757bc4798ba05e2e4dc7c08796f54db6f2"],"state_sha256":"329c0350913e1cc010885d3577d29265156e51001743e2fa7a10db717878b14f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5N0VzRCLM1hbfkbJ1H9UTyioNFZULjKFEW0YxUa9P8fs+KKVVWU3x0qUv72eXQUZ8UKLX0Ghmv4FEdbjWeyiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:27:09.198245Z","bundle_sha256":"30604e4dc97c51b31d5845b1339298fa9c36573f8fe2852959ab0f9ff345d22a"}}