{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BSCXTQY2JST3GQT32DIPJ4RYNL","short_pith_number":"pith:BSCXTQY2","canonical_record":{"source":{"id":"1304.6897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T12:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"c0236944f195129abc4977d30965c8eb460869d14a60e96c083be077118edc06","abstract_canon_sha256":"0f42db8ad26a635939978a7c2e95eff468e2180d76c3df59fe4e4952dbbfdc88"},"schema_version":"1.0"},"canonical_sha256":"0c8579c31a4ca7b3427bd0d0f4f2386acb1168276be0a089e21ee973b17824ea","source":{"kind":"arxiv","id":"1304.6897","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6897","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6897v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6897","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"BSCXTQY2JST3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BSCXTQY2JST3GQT3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BSCXTQY2","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BSCXTQY2JST3GQT32DIPJ4RYNL","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T12:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"c0236944f195129abc4977d30965c8eb460869d14a60e96c083be077118edc06","abstract_canon_sha256":"0f42db8ad26a635939978a7c2e95eff468e2180d76c3df59fe4e4952dbbfdc88"},"schema_version":"1.0"},"canonical_sha256":"0c8579c31a4ca7b3427bd0d0f4f2386acb1168276be0a089e21ee973b17824ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:10.847604Z","signature_b64":"wqmZLtQUQU4q8nUCjf7giKkIwb2Byi3a8HuoWoLCjlFrQVjRTBjsJesLS6D+t2dqleq2PUQ7QGrhRG4m48RXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8579c31a4ca7b3427bd0d0f4f2386acb1168276be0a089e21ee973b17824ea","last_reissued_at":"2026-05-18T03:27:10.846750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:10.846750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6897","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-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8qUigUnWhNyaeb7aoz6a1YQ8yO1Hee0CHTI+dZwx8CwIFlpMDAUw8kXrAn5QJizneZ6pDmTZvD0QNKGG892BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:00:34.040635Z"},"content_sha256":"bd80aa7e53c37e8bd477ddeab1b96c052b0b132cc9bf731f0ed19cd0fcb0bc84","schema_version":"1.0","event_id":"sha256:bd80aa7e53c37e8bd477ddeab1b96c052b0b132cc9bf731f0ed19cd0fcb0bc84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BSCXTQY2JST3GQT32DIPJ4RYNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power and Limitations of Static Binary Search Trees with Lazy Finger","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Iacono, Karim Dou\\\"ieb, Prosenjit Bose, Stefan Langerman","submitted_at":"2013-04-25T12:46:53Z","abstract_excerpt":"A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed---where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6897","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-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7R6jMyZ8ZPIVprM7/x/dcOUBnavOWkkuFP6OgSDyfaaOA+d0XkOZudd1g6OYHq4EOH3YNEhksm3bzVF2jxNwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:00:34.041288Z"},"content_sha256":"a703528961bf707884bbc86c50e536422e4dfe830f54ef04ec8585f6841b8805","schema_version":"1.0","event_id":"sha256:a703528961bf707884bbc86c50e536422e4dfe830f54ef04ec8585f6841b8805"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/bundle.json","state_url":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/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-05-25T11:00:34Z","links":{"resolver":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL","bundle":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/bundle.json","state":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BSCXTQY2JST3GQT32DIPJ4RYNL","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":"0f42db8ad26a635939978a7c2e95eff468e2180d76c3df59fe4e4952dbbfdc88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T12:46:53Z","title_canon_sha256":"c0236944f195129abc4977d30965c8eb460869d14a60e96c083be077118edc06"},"schema_version":"1.0","source":{"id":"1304.6897","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6897","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6897v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6897","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"BSCXTQY2JST3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BSCXTQY2JST3GQT3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BSCXTQY2","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:a703528961bf707884bbc86c50e536422e4dfe830f54ef04ec8585f6841b8805","target":"graph","created_at":"2026-05-18T03:27:10Z","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 static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed---where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal ","authors_text":"John Iacono, Karim Dou\\\"ieb, Prosenjit Bose, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T12:46:53Z","title":"The Power and Limitations of Static Binary Search Trees with Lazy Finger"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6897","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:bd80aa7e53c37e8bd477ddeab1b96c052b0b132cc9bf731f0ed19cd0fcb0bc84","target":"record","created_at":"2026-05-18T03:27:10Z","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":"0f42db8ad26a635939978a7c2e95eff468e2180d76c3df59fe4e4952dbbfdc88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T12:46:53Z","title_canon_sha256":"c0236944f195129abc4977d30965c8eb460869d14a60e96c083be077118edc06"},"schema_version":"1.0","source":{"id":"1304.6897","kind":"arxiv","version":1}},"canonical_sha256":"0c8579c31a4ca7b3427bd0d0f4f2386acb1168276be0a089e21ee973b17824ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c8579c31a4ca7b3427bd0d0f4f2386acb1168276be0a089e21ee973b17824ea","first_computed_at":"2026-05-18T03:27:10.846750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:10.846750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wqmZLtQUQU4q8nUCjf7giKkIwb2Byi3a8HuoWoLCjlFrQVjRTBjsJesLS6D+t2dqleq2PUQ7QGrhRG4m48RXCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:10.847604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6897","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd80aa7e53c37e8bd477ddeab1b96c052b0b132cc9bf731f0ed19cd0fcb0bc84","sha256:a703528961bf707884bbc86c50e536422e4dfe830f54ef04ec8585f6841b8805"],"state_sha256":"55088feeabdebc07609831a20c202d2851e2910b94104ac699a38c98fbd2d2a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIxwWEAnmoXeBAbUjCs4JQ+OFVs/QsLCXMCNQeX2qqD16pbe4MrSNwiyF0piKB5WRHWYwlFUVbURhJntUJ9uAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:00:34.044617Z","bundle_sha256":"b32d94d4dbc072631d291683444047cd9ad343e878f14124fe5cfa1ca7759bfe"}}