{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4IMBJKWPSHYYXXPJAGVAI7RSGY","short_pith_number":"pith:4IMBJKWP","canonical_record":{"source":{"id":"2312.15426","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-24T07:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"251cdd66261220bc186653ce245c8187741135b77944a4d2fa862105af7055e2","abstract_canon_sha256":"4b63610de94b79bdb52df68ff3015aab43ced097987508132b033f13cb6cd1c5"},"schema_version":"1.0"},"canonical_sha256":"e21814aacf91f18bdde901aa047e32362de735076b3e3fceb9bae95d28da5716","source":{"kind":"arxiv","id":"2312.15426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15426","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15426v1","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15426","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"4IMBJKWPSHYY","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"pith_short_16","alias_value":"4IMBJKWPSHYYXXPJ","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"pith_short_8","alias_value":"4IMBJKWP","created_at":"2026-07-05T07:27:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4IMBJKWPSHYYXXPJAGVAI7RSGY","target":"record","payload":{"canonical_record":{"source":{"id":"2312.15426","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-24T07:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"251cdd66261220bc186653ce245c8187741135b77944a4d2fa862105af7055e2","abstract_canon_sha256":"4b63610de94b79bdb52df68ff3015aab43ced097987508132b033f13cb6cd1c5"},"schema_version":"1.0"},"canonical_sha256":"e21814aacf91f18bdde901aa047e32362de735076b3e3fceb9bae95d28da5716","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:56.340789Z","signature_b64":"KIw3czm3+Psgfr3KMQR7N4KVmbzJT1WE+d0w7QWhjjIYcQRqPGrLWzcwlSs5hvJbtiNIV7X9iTuLAjpOzC3ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21814aacf91f18bdde901aa047e32362de735076b3e3fceb9bae95d28da5716","last_reissued_at":"2026-07-05T07:27:56.340173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:56.340173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.15426","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-07-05T07:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2w6PrPqKO1ph2ZHb2eLY7jKFWZUinye/eAJRyBUZggGFOvh5xdTmc5MmkWVO0N85Uo7GEkcDKf1A74As6MnhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:17:22.922120Z"},"content_sha256":"1c6d59e9d47ebbb32c84776a8c67045ec15aac78254235e88ab92e8a6ce7114b","schema_version":"1.0","event_id":"sha256:1c6d59e9d47ebbb32c84776a8c67045ec15aac78254235e88ab92e8a6ce7114b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4IMBJKWPSHYYXXPJAGVAI7RSGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Group Access Bounds for Binary Search Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akash Pareek, Manoj Gupta, Parinya Chalermsook, Sorrachai Yingchareonthawornchai, Wanchote Jiamjitrak","submitted_at":"2023-12-24T07:38:14Z","abstract_excerpt":"The access lemma (Sleator and Tarjan, JACM 1985) is a property of binary search trees that implies interesting consequences such as static optimality, static finger, and working set property. However, there are known corollaries of the dynamic optimality that cannot be derived via the access lemma, such as the dynamic finger, and any $o(\\log n)$-competitive ratio to the optimal BST where $n$ is the number of keys.\n  In this paper, we introduce the group access bound that can be defined with respect to a reference group access tree. Group access bounds generalize the access lemma and imply prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15426","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.15426/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VTWDejYN9WS7NuFYK9hQ+57TKViYgNaxD1bAR+30TUvl64QHOKaF4qyLgZkPJpYPOWmQZA+Cm0uFC97z3vLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:17:22.923040Z"},"content_sha256":"7669bd59db36b5f7b16959d076ef5a366de672266a3ee89835770cb672d4acc4","schema_version":"1.0","event_id":"sha256:7669bd59db36b5f7b16959d076ef5a366de672266a3ee89835770cb672d4acc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IMBJKWPSHYYXXPJAGVAI7RSGY/bundle.json","state_url":"https://pith.science/pith/4IMBJKWPSHYYXXPJAGVAI7RSGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IMBJKWPSHYYXXPJAGVAI7RSGY/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-08-13T10:17:22Z","links":{"resolver":"https://pith.science/pith/4IMBJKWPSHYYXXPJAGVAI7RSGY","bundle":"https://pith.science/pith/4IMBJKWPSHYYXXPJAGVAI7RSGY/bundle.json","state":"https://pith.science/pith/4IMBJKWPSHYYXXPJAGVAI7RSGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IMBJKWPSHYYXXPJAGVAI7RSGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4IMBJKWPSHYYXXPJAGVAI7RSGY","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":"4b63610de94b79bdb52df68ff3015aab43ced097987508132b033f13cb6cd1c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-24T07:38:14Z","title_canon_sha256":"251cdd66261220bc186653ce245c8187741135b77944a4d2fa862105af7055e2"},"schema_version":"1.0","source":{"id":"2312.15426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15426","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15426v1","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15426","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"4IMBJKWPSHYY","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"pith_short_16","alias_value":"4IMBJKWPSHYYXXPJ","created_at":"2026-07-05T07:27:56Z"},{"alias_kind":"pith_short_8","alias_value":"4IMBJKWP","created_at":"2026-07-05T07:27:56Z"}],"graph_snapshots":[{"event_id":"sha256:7669bd59db36b5f7b16959d076ef5a366de672266a3ee89835770cb672d4acc4","target":"graph","created_at":"2026-07-05T07:27:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.15426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The access lemma (Sleator and Tarjan, JACM 1985) is a property of binary search trees that implies interesting consequences such as static optimality, static finger, and working set property. However, there are known corollaries of the dynamic optimality that cannot be derived via the access lemma, such as the dynamic finger, and any $o(\\log n)$-competitive ratio to the optimal BST where $n$ is the number of keys.\n  In this paper, we introduce the group access bound that can be defined with respect to a reference group access tree. Group access bounds generalize the access lemma and imply prop","authors_text":"Akash Pareek, Manoj Gupta, Parinya Chalermsook, Sorrachai Yingchareonthawornchai, Wanchote Jiamjitrak","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-24T07:38:14Z","title":"The Group Access Bounds for Binary Search Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15426","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:1c6d59e9d47ebbb32c84776a8c67045ec15aac78254235e88ab92e8a6ce7114b","target":"record","created_at":"2026-07-05T07:27:56Z","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":"4b63610de94b79bdb52df68ff3015aab43ced097987508132b033f13cb6cd1c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-24T07:38:14Z","title_canon_sha256":"251cdd66261220bc186653ce245c8187741135b77944a4d2fa862105af7055e2"},"schema_version":"1.0","source":{"id":"2312.15426","kind":"arxiv","version":1}},"canonical_sha256":"e21814aacf91f18bdde901aa047e32362de735076b3e3fceb9bae95d28da5716","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e21814aacf91f18bdde901aa047e32362de735076b3e3fceb9bae95d28da5716","first_computed_at":"2026-07-05T07:27:56.340173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:27:56.340173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KIw3czm3+Psgfr3KMQR7N4KVmbzJT1WE+d0w7QWhjjIYcQRqPGrLWzcwlSs5hvJbtiNIV7X9iTuLAjpOzC3ECA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:27:56.340789Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.15426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c6d59e9d47ebbb32c84776a8c67045ec15aac78254235e88ab92e8a6ce7114b","sha256:7669bd59db36b5f7b16959d076ef5a366de672266a3ee89835770cb672d4acc4"],"state_sha256":"6d5c49f86e47d0324792578909d9c334a2b3195d308a03d53a343752d5ab8cc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FsjL0sl4jndl6Cx2erItSRbQlESbrpLDjP4Ha2PbD7MV+Bp8GsNkm/8KsJxwt3vQ1cYVmZXPRO/8n8IFL+cAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:17:22.956859Z","bundle_sha256":"d7e265da8e45858c59e03e45cbabf6dbacfac4da56824cfe287cf356d9d9321a"}}