{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:LV4QB6SIEWMJQ4XOXAJ4WFLDJU","short_pith_number":"pith:LV4QB6SI","schema_version":"1.0","canonical_sha256":"5d7900fa4825989872eeb813cb15634d3b0933e08ab99def921c2b8db8052549","source":{"kind":"arxiv","id":"cs/0205038","version":1},"attestation_state":"computed","paper":{"title":"Competitive Paging Algorithms","license":"","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Amos Fiat, Daniel Sleator, Lyle McGeoch, Mike Luby, Neal E. Young, Richard Karp","submitted_at":"2002-05-18T13:49:31Z","abstract_excerpt":"The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a simple randomized on-line algorithm for the paging problem, and gives a proof that its performance guarantee (competitive ratio) is O(log k). In contrast, no deterministic on-line algorithm can have a performance guarantee better than k."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"cs/0205038","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T13:49:31Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a40f620b2712334b8cd33f5937a5109a5b1f7891809e1018547bdd061e5ad2d0","abstract_canon_sha256":"9585a0161d2fe310c509142f87db2fd759b248fead49a7d70c9adaea5fa76053"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.957221Z","signature_b64":"sOnw09kQPT8PY4YdQhVQSw8WeEo0ntlN9iFmlKaAOL6CFWJtbW4U3WwMmrd31WhT+LSIvLqXCILj7vDi1FQDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d7900fa4825989872eeb813cb15634d3b0933e08ab99def921c2b8db8052549","last_reissued_at":"2026-05-18T01:59:53.956640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.956640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Paging Algorithms","license":"","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Amos Fiat, Daniel Sleator, Lyle McGeoch, Mike Luby, Neal E. Young, Richard Karp","submitted_at":"2002-05-18T13:49:31Z","abstract_excerpt":"The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a simple randomized on-line algorithm for the paging problem, and gives a proof that its performance guarantee (competitive ratio) is O(log k). In contrast, no deterministic on-line algorithm can have a performance guarantee better than k."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205038","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205038","created_at":"2026-05-18T01:59:53.956763+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205038v1","created_at":"2026-05-18T01:59:53.956763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205038","created_at":"2026-05-18T01:59:53.956763+00:00"},{"alias_kind":"pith_short_12","alias_value":"LV4QB6SIEWMJ","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"LV4QB6SIEWMJQ4XO","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"LV4QB6SI","created_at":"2026-05-18T12:25:51.375804+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU","json":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU.json","graph_json":"https://pith.science/api/pith-number/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/graph.json","events_json":"https://pith.science/api/pith-number/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/events.json","paper":"https://pith.science/paper/LV4QB6SI"},"agent_actions":{"view_html":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU","download_json":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU.json","view_paper":"https://pith.science/paper/LV4QB6SI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205038&json=true","fetch_graph":"https://pith.science/api/pith-number/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/graph.json","fetch_events":"https://pith.science/api/pith-number/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/action/storage_attestation","attest_author":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/action/author_attestation","sign_citation":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/action/citation_signature","submit_replication":"https://pith.science/pith/LV4QB6SIEWMJQ4XOXAJ4WFLDJU/action/replication_record"}},"created_at":"2026-05-18T01:59:53.956763+00:00","updated_at":"2026-05-18T01:59:53.956763+00:00"}