{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AVXVCNRPFSC4DYFUPOCDMQXBCZ","short_pith_number":"pith:AVXVCNRP","canonical_record":{"source":{"id":"2405.00154","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-30T19:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bd75024904f16c55a8c742be4209aa8d6a47da2f0ae8e789118a9ee5d9c06b0","abstract_canon_sha256":"1f1d0d6d6443dccd50f10d68b89a3239b56f9c565ea4ee8f57aeca4ae71b3c45"},"schema_version":"1.0"},"canonical_sha256":"056f51362f2c85c1e0b47b843642e1167c32b6871f5b920c165e81187863f2fd","source":{"kind":"arxiv","id":"2405.00154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.00154","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"2405.00154v1","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00154","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"AVXVCNRPFSC4","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"pith_short_16","alias_value":"AVXVCNRPFSC4DYFU","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"pith_short_8","alias_value":"AVXVCNRP","created_at":"2026-07-05T08:14:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AVXVCNRPFSC4DYFUPOCDMQXBCZ","target":"record","payload":{"canonical_record":{"source":{"id":"2405.00154","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-30T19:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bd75024904f16c55a8c742be4209aa8d6a47da2f0ae8e789118a9ee5d9c06b0","abstract_canon_sha256":"1f1d0d6d6443dccd50f10d68b89a3239b56f9c565ea4ee8f57aeca4ae71b3c45"},"schema_version":"1.0"},"canonical_sha256":"056f51362f2c85c1e0b47b843642e1167c32b6871f5b920c165e81187863f2fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:09.362616Z","signature_b64":"+ATDYCw8ldWWL9Wf5gy0kWxCT8KmZBO5bH2YdMIR+knQRjTS1M64vQ8KkKj9TExaVp6/q5gNFLGV0Lj+o2FpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"056f51362f2c85c1e0b47b843642e1167c32b6871f5b920c165e81187863f2fd","last_reissued_at":"2026-07-05T08:14:09.362163Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:09.362163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.00154","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-05T08:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pnHuo2FfRixbAjwsE+ald26tr/HVuqSp5Oob9XIBkOSFVw8Zx+Mg9LigqynWUx3lwFCAC7aDLgUh959mQKkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T21:44:02.407555Z"},"content_sha256":"e03857849af9effecc2e7b17b1dc382f708f3e4b3a699d424739db4e9b696dba","schema_version":"1.0","event_id":"sha256:e03857849af9effecc2e7b17b1dc382f708f3e4b3a699d424739db4e9b696dba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AVXVCNRPFSC4DYFUPOCDMQXBCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aleksandr Katrutsa, Alexander Demin, Daniil Kazantsev, Denis Ponomaryov, Ilgam Latypov, Yulia Maximlyuk, Yuriy Dorn","submitted_at":"2024-04-30T19:04:53Z","abstract_excerpt":"Optimal page replacement is an important problem in efficient buffer management. The range of replacement strategies known in the literature varies from simple but efficient FIFO-based algorithms to more accurate but potentially costly methods tailored to specific data access patterns. The principal issue in adopting a pattern-specific replacement logic in a DB buffer manager is to guarantee non-degradation in general high-load regimes. In this paper, we propose a new family of page replacement algorithms for DB buffer manager which demonstrate a superior performance wrt competitors on custom "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00154","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/2405.00154/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-05T08:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SYvm1QMYqhx4c6SKU/Y6jxne7o8Bd8dv4WKoXrd6xzHk0AthCKimBaTeKP3NYif9BuTePSx7mqBpbcqULIhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T21:44:02.407929Z"},"content_sha256":"f7cee25a2d8e25b1437b10ca425fb36fcbfe9d8dba93c3d499ae304d9e10c370","schema_version":"1.0","event_id":"sha256:f7cee25a2d8e25b1437b10ca425fb36fcbfe9d8dba93c3d499ae304d9e10c370"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVXVCNRPFSC4DYFUPOCDMQXBCZ/bundle.json","state_url":"https://pith.science/pith/AVXVCNRPFSC4DYFUPOCDMQXBCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVXVCNRPFSC4DYFUPOCDMQXBCZ/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-07-08T21:44:02Z","links":{"resolver":"https://pith.science/pith/AVXVCNRPFSC4DYFUPOCDMQXBCZ","bundle":"https://pith.science/pith/AVXVCNRPFSC4DYFUPOCDMQXBCZ/bundle.json","state":"https://pith.science/pith/AVXVCNRPFSC4DYFUPOCDMQXBCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVXVCNRPFSC4DYFUPOCDMQXBCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AVXVCNRPFSC4DYFUPOCDMQXBCZ","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":"1f1d0d6d6443dccd50f10d68b89a3239b56f9c565ea4ee8f57aeca4ae71b3c45","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-30T19:04:53Z","title_canon_sha256":"0bd75024904f16c55a8c742be4209aa8d6a47da2f0ae8e789118a9ee5d9c06b0"},"schema_version":"1.0","source":{"id":"2405.00154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.00154","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"2405.00154v1","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00154","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"AVXVCNRPFSC4","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"pith_short_16","alias_value":"AVXVCNRPFSC4DYFU","created_at":"2026-07-05T08:14:09Z"},{"alias_kind":"pith_short_8","alias_value":"AVXVCNRP","created_at":"2026-07-05T08:14:09Z"}],"graph_snapshots":[{"event_id":"sha256:f7cee25a2d8e25b1437b10ca425fb36fcbfe9d8dba93c3d499ae304d9e10c370","target":"graph","created_at":"2026-07-05T08:14: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.00154/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal page replacement is an important problem in efficient buffer management. The range of replacement strategies known in the literature varies from simple but efficient FIFO-based algorithms to more accurate but potentially costly methods tailored to specific data access patterns. The principal issue in adopting a pattern-specific replacement logic in a DB buffer manager is to guarantee non-degradation in general high-load regimes. In this paper, we propose a new family of page replacement algorithms for DB buffer manager which demonstrate a superior performance wrt competitors on custom ","authors_text":"Aleksandr Katrutsa, Alexander Demin, Daniil Kazantsev, Denis Ponomaryov, Ilgam Latypov, Yulia Maximlyuk, Yuriy Dorn","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-30T19:04:53Z","title":"EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00154","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:e03857849af9effecc2e7b17b1dc382f708f3e4b3a699d424739db4e9b696dba","target":"record","created_at":"2026-07-05T08:14: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":"1f1d0d6d6443dccd50f10d68b89a3239b56f9c565ea4ee8f57aeca4ae71b3c45","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-04-30T19:04:53Z","title_canon_sha256":"0bd75024904f16c55a8c742be4209aa8d6a47da2f0ae8e789118a9ee5d9c06b0"},"schema_version":"1.0","source":{"id":"2405.00154","kind":"arxiv","version":1}},"canonical_sha256":"056f51362f2c85c1e0b47b843642e1167c32b6871f5b920c165e81187863f2fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"056f51362f2c85c1e0b47b843642e1167c32b6871f5b920c165e81187863f2fd","first_computed_at":"2026-07-05T08:14:09.362163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:14:09.362163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ATDYCw8ldWWL9Wf5gy0kWxCT8KmZBO5bH2YdMIR+knQRjTS1M64vQ8KkKj9TExaVp6/q5gNFLGV0Lj+o2FpDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:14:09.362616Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.00154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e03857849af9effecc2e7b17b1dc382f708f3e4b3a699d424739db4e9b696dba","sha256:f7cee25a2d8e25b1437b10ca425fb36fcbfe9d8dba93c3d499ae304d9e10c370"],"state_sha256":"ead8735a8164682ddcd32f6d1aeae17155ebefa1ebdde34452cd6d4f150f20c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gy6fzQMwbdlLHPnhgmZSJXc9DGFcbucGI4Id0Muw/8Tgkh51Hg6NLhXNv1NoHJ9QH0FrTqAy72LNiuzRDYljBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T21:44:02.409908Z","bundle_sha256":"724f13c625b5df597d1c188cdd42f1f851794cd184d7b8d2717792f95e90c634"}}