{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RAII7AL5WIZZPHQ642LHGYA4LK","short_pith_number":"pith:RAII7AL5","canonical_record":{"source":{"id":"1604.06997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-24T08:48:26Z","cross_cats_sorted":[],"title_canon_sha256":"4ad7b7b01cc601f9f54d55c353c1a527acb4f2f0e161f5043d2afad921217a82","abstract_canon_sha256":"12a603a083642474e4ab334f451bf0614d7c0ce6fed4192403c17b267344ddd3"},"schema_version":"1.0"},"canonical_sha256":"88108f817db233979e1ee69673601c5aaf6e91a7b7eea3b58b18da21488f6bd5","source":{"kind":"arxiv","id":"1604.06997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06997","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06997v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06997","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"RAII7AL5WIZZ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RAII7AL5WIZZPHQ6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RAII7AL5","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RAII7AL5WIZZPHQ642LHGYA4LK","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-24T08:48:26Z","cross_cats_sorted":[],"title_canon_sha256":"4ad7b7b01cc601f9f54d55c353c1a527acb4f2f0e161f5043d2afad921217a82","abstract_canon_sha256":"12a603a083642474e4ab334f451bf0614d7c0ce6fed4192403c17b267344ddd3"},"schema_version":"1.0"},"canonical_sha256":"88108f817db233979e1ee69673601c5aaf6e91a7b7eea3b58b18da21488f6bd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.355867Z","signature_b64":"O1S0fw0qIMW85O9vEunGmIEzY7beEiDZ8brL4wahaBjLr3skD2k/mkk5Pp1MdPnlEzTjuvuvvo8njaFIPaCKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88108f817db233979e1ee69673601c5aaf6e91a7b7eea3b58b18da21488f6bd5","last_reissued_at":"2026-05-18T01:16:23.355058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.355058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06997","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-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wia6vrOufd4YaD8nbzp8KuQUHETH2svO566DkVw4Kkv2WoVXN2emhVW1xw0uWCF4S0ZRn5CxQhm+uRVT/PsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:00:32.199122Z"},"content_sha256":"2fb1762cb00544231efb8896645929ef4d8ee5b3c00fa50ec03e9abd0b9a2fac","schema_version":"1.0","event_id":"sha256:2fb1762cb00544231efb8896645929ef4d8ee5b3c00fa50ec03e9abd0b9a2fac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RAII7AL5WIZZPHQ642LHGYA4LK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta, Navin Goyal","submitted_at":"2016-04-24T08:48:26Z","abstract_excerpt":"In their seminal paper [Sleator and Tarjan, J.ACM, 1985], the authors conjectured that the splay tree is dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. Perhaps a more basic question, which has also attracted much attention, is if there exists any dynamically optimal BST algorithm. One such candidate is GREEDY which is a simple and intuitive BST algorithm [Lucas, Rutgers Tech. Report, 1988; Munro, ESA, 2000; Demaine, Harmon, Iacono, Kane and Patrascu, SODA, 2009]. [Demaine et al., SODA, 2009] showed a novel connection between a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06997","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-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfnB+hgMhbNnr2sl2MCHXXEut5NkYT3+Wj6PALtPj+uSiphK+COeYze8kKcPN0YlrJX/StZUxyDax0KVemUIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:00:32.199481Z"},"content_sha256":"36e958c360355cee6a53ff7a2675b756aa5411409abfcda34f7daa1b0dc1cf21","schema_version":"1.0","event_id":"sha256:36e958c360355cee6a53ff7a2675b756aa5411409abfcda34f7daa1b0dc1cf21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAII7AL5WIZZPHQ642LHGYA4LK/bundle.json","state_url":"https://pith.science/pith/RAII7AL5WIZZPHQ642LHGYA4LK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAII7AL5WIZZPHQ642LHGYA4LK/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-30T07:00:32Z","links":{"resolver":"https://pith.science/pith/RAII7AL5WIZZPHQ642LHGYA4LK","bundle":"https://pith.science/pith/RAII7AL5WIZZPHQ642LHGYA4LK/bundle.json","state":"https://pith.science/pith/RAII7AL5WIZZPHQ642LHGYA4LK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAII7AL5WIZZPHQ642LHGYA4LK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RAII7AL5WIZZPHQ642LHGYA4LK","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":"12a603a083642474e4ab334f451bf0614d7c0ce6fed4192403c17b267344ddd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-24T08:48:26Z","title_canon_sha256":"4ad7b7b01cc601f9f54d55c353c1a527acb4f2f0e161f5043d2afad921217a82"},"schema_version":"1.0","source":{"id":"1604.06997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06997","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06997v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06997","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"RAII7AL5WIZZ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RAII7AL5WIZZPHQ6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RAII7AL5","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:36e958c360355cee6a53ff7a2675b756aa5411409abfcda34f7daa1b0dc1cf21","target":"graph","created_at":"2026-05-18T01:16:23Z","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":"In their seminal paper [Sleator and Tarjan, J.ACM, 1985], the authors conjectured that the splay tree is dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. Perhaps a more basic question, which has also attracted much attention, is if there exists any dynamically optimal BST algorithm. One such candidate is GREEDY which is a simple and intuitive BST algorithm [Lucas, Rutgers Tech. Report, 1988; Munro, ESA, 2000; Demaine, Harmon, Iacono, Kane and Patrascu, SODA, 2009]. [Demaine et al., SODA, 2009] showed a novel connection between a","authors_text":"Manoj Gupta, Navin Goyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-24T08:48:26Z","title":"Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06997","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:2fb1762cb00544231efb8896645929ef4d8ee5b3c00fa50ec03e9abd0b9a2fac","target":"record","created_at":"2026-05-18T01:16:23Z","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":"12a603a083642474e4ab334f451bf0614d7c0ce6fed4192403c17b267344ddd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-24T08:48:26Z","title_canon_sha256":"4ad7b7b01cc601f9f54d55c353c1a527acb4f2f0e161f5043d2afad921217a82"},"schema_version":"1.0","source":{"id":"1604.06997","kind":"arxiv","version":1}},"canonical_sha256":"88108f817db233979e1ee69673601c5aaf6e91a7b7eea3b58b18da21488f6bd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88108f817db233979e1ee69673601c5aaf6e91a7b7eea3b58b18da21488f6bd5","first_computed_at":"2026-05-18T01:16:23.355058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:23.355058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1S0fw0qIMW85O9vEunGmIEzY7beEiDZ8brL4wahaBjLr3skD2k/mkk5Pp1MdPnlEzTjuvuvvo8njaFIPaCKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:23.355867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fb1762cb00544231efb8896645929ef4d8ee5b3c00fa50ec03e9abd0b9a2fac","sha256:36e958c360355cee6a53ff7a2675b756aa5411409abfcda34f7daa1b0dc1cf21"],"state_sha256":"0fd9cf2b87d21a9d81f1d334914efe2b6c0fdbe5eb1f7314109517ffb02a3d3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYf/fxEFG7UuE0VAVuEmxDS+OiK3himzQvVuZxnDpJICJMlPkNHiT3EqUjdV5E+8OqCLETcQxGk8Lw6pQuMECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:00:32.201508Z","bundle_sha256":"0e244dab9e75b869fa282921eeff010bc0c6b8fe99e5d4f0af26f8579da32a4c"}}