{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3FAVK3CTLQPVKO5PQ4EFWX5XCU","short_pith_number":"pith:3FAVK3CT","canonical_record":{"source":{"id":"1510.03362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-12T16:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"f40bfada27466f8878606406a6fb98939b7e220d0824bc3c3b9d648d6a3d251c","abstract_canon_sha256":"96543a2210f0f49d8340a622ea50faf6c4f8c7b237361ded70a49f4c3d1b39d8"},"schema_version":"1.0"},"canonical_sha256":"d941556c535c1f553baf87085b5fb7151813dc46df971a79b78c82a249915b70","source":{"kind":"arxiv","id":"1510.03362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03362","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03362v1","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03362","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"3FAVK3CTLQPV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FAVK3CTLQPVKO5P","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FAVK3CT","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3FAVK3CTLQPVKO5PQ4EFWX5XCU","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-12T16:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"f40bfada27466f8878606406a6fb98939b7e220d0824bc3c3b9d648d6a3d251c","abstract_canon_sha256":"96543a2210f0f49d8340a622ea50faf6c4f8c7b237361ded70a49f4c3d1b39d8"},"schema_version":"1.0"},"canonical_sha256":"d941556c535c1f553baf87085b5fb7151813dc46df971a79b78c82a249915b70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:32.103891Z","signature_b64":"WM3KSTTXx7Ph+BzXWSXEEQ1hINxQbAQHiPyFhebmyz5RUDFJCfjoSSnTOvb03MAKD5xMc7PCRhlvemTvIYtACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d941556c535c1f553baf87085b5fb7151813dc46df971a79b78c82a249915b70","last_reissued_at":"2026-05-18T01:30:32.103133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:32.103133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03362","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:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2Mf+iLfKKnozdBEdHi77n5NyVTSTPDUHSJafWUrV0lkA9DzrpVk4C3tu9iHwYwWagXaN7lCmNJxfvq62rjxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:38:38.977720Z"},"content_sha256":"ea85593dc813a19240781f0590d031b9c3abbbd1d09ae4b87584751916ad3e2e","schema_version":"1.0","event_id":"sha256:ea85593dc813a19240781f0590d031b9c3abbbd1d09ae4b87584751916ad3e2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3FAVK3CTLQPVKO5PQ4EFWX5XCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Smoothness of Paging Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro Salinger, Jan Reineke","submitted_at":"2015-10-12T16:49:13Z","abstract_excerpt":"We study the smoothness of paging algorithms. How much can the number of page faults increase due to a perturbation of the request sequence? We call a paging algorithm smooth if the maximal increase in page faults is proportional to the number of changes in the request sequence. We also introduce quantitative smoothness notions that measure the smoothness of an algorithm. We derive lower and upper bounds on the smoothness of deterministic and randomized demand-paging and competitive algorithms. Among strongly-competitive deterministic algorithms LRU matches the lower bound, while FIFO matches "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03362","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:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDZP9sBsEURF92ORtE4eRRThnpI2OOYxcgLJRWDFMnbh4+Abvr467KZTJQFEVNYERiCsAeXK7kI/OMXTsVILCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:38:38.978090Z"},"content_sha256":"fa8f410046ce4d499c21450abda6767a31f36ef12f053d3b4439b3b5a01a072f","schema_version":"1.0","event_id":"sha256:fa8f410046ce4d499c21450abda6767a31f36ef12f053d3b4439b3b5a01a072f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FAVK3CTLQPVKO5PQ4EFWX5XCU/bundle.json","state_url":"https://pith.science/pith/3FAVK3CTLQPVKO5PQ4EFWX5XCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FAVK3CTLQPVKO5PQ4EFWX5XCU/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-08T18:38:38Z","links":{"resolver":"https://pith.science/pith/3FAVK3CTLQPVKO5PQ4EFWX5XCU","bundle":"https://pith.science/pith/3FAVK3CTLQPVKO5PQ4EFWX5XCU/bundle.json","state":"https://pith.science/pith/3FAVK3CTLQPVKO5PQ4EFWX5XCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FAVK3CTLQPVKO5PQ4EFWX5XCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3FAVK3CTLQPVKO5PQ4EFWX5XCU","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":"96543a2210f0f49d8340a622ea50faf6c4f8c7b237361ded70a49f4c3d1b39d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-12T16:49:13Z","title_canon_sha256":"f40bfada27466f8878606406a6fb98939b7e220d0824bc3c3b9d648d6a3d251c"},"schema_version":"1.0","source":{"id":"1510.03362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03362","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03362v1","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03362","created_at":"2026-05-18T01:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"3FAVK3CTLQPV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FAVK3CTLQPVKO5P","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FAVK3CT","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:fa8f410046ce4d499c21450abda6767a31f36ef12f053d3b4439b3b5a01a072f","target":"graph","created_at":"2026-05-18T01:30:32Z","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":"We study the smoothness of paging algorithms. How much can the number of page faults increase due to a perturbation of the request sequence? We call a paging algorithm smooth if the maximal increase in page faults is proportional to the number of changes in the request sequence. We also introduce quantitative smoothness notions that measure the smoothness of an algorithm. We derive lower and upper bounds on the smoothness of deterministic and randomized demand-paging and competitive algorithms. Among strongly-competitive deterministic algorithms LRU matches the lower bound, while FIFO matches ","authors_text":"Alejandro Salinger, Jan Reineke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-12T16:49:13Z","title":"On the Smoothness of Paging Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03362","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:ea85593dc813a19240781f0590d031b9c3abbbd1d09ae4b87584751916ad3e2e","target":"record","created_at":"2026-05-18T01:30:32Z","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":"96543a2210f0f49d8340a622ea50faf6c4f8c7b237361ded70a49f4c3d1b39d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-12T16:49:13Z","title_canon_sha256":"f40bfada27466f8878606406a6fb98939b7e220d0824bc3c3b9d648d6a3d251c"},"schema_version":"1.0","source":{"id":"1510.03362","kind":"arxiv","version":1}},"canonical_sha256":"d941556c535c1f553baf87085b5fb7151813dc46df971a79b78c82a249915b70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d941556c535c1f553baf87085b5fb7151813dc46df971a79b78c82a249915b70","first_computed_at":"2026-05-18T01:30:32.103133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:32.103133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WM3KSTTXx7Ph+BzXWSXEEQ1hINxQbAQHiPyFhebmyz5RUDFJCfjoSSnTOvb03MAKD5xMc7PCRhlvemTvIYtACg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:32.103891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea85593dc813a19240781f0590d031b9c3abbbd1d09ae4b87584751916ad3e2e","sha256:fa8f410046ce4d499c21450abda6767a31f36ef12f053d3b4439b3b5a01a072f"],"state_sha256":"8d54c04729d8f1e95b21f77dfed7c0fbb3ade58165d948043a96668b7a0e5590"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijSPjQFu3Z6YuGvHQR9JZ1e7TdigIGVdvFxlz2bJt/ef7Dz3p1An3+8zbnA4nRL9g/wXZzC8q4Lck5OW6pINDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:38:38.980863Z","bundle_sha256":"86291ec6e13e92664b4f9444468e1176cc4a3c5dcf442244ae612bad7464940d"}}