{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:L7PTXLIY6DSVINBRH2RJFDI4WH","short_pith_number":"pith:L7PTXLIY","schema_version":"1.0","canonical_sha256":"5fdf3bad18f0e55434313ea2928d1cb1f80be6addea11c6c9f79648e31c3f4bc","source":{"kind":"arxiv","id":"cs/0205044","version":1},"attestation_state":"computed","paper":{"title":"The K-Server Dual and Loose Competitiveness for Paging","license":"","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2002-05-18T18:16:13Z","abstract_excerpt":"This paper has two results. The first is based on the surprising observation that the well-known ``least-recently-used'' paging algorithm and the ``balance'' algorithm for weighted caching are linear-programming primal-dual algorithms. This observation leads to a strategy (called ``Greedy-Dual'') that generalizes them both and has an optimal performance guarantee for weighted caching.\n  For the second result, the paper presents empirical studies of paging algorithms, documenting that in practice, on ``typical'' cache sizes and sequences, the performance of paging strategies are much better tha"},"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/0205044","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T18:16:13Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"70edc5422f6e1d6b7a511e704e2cc16bbf33443086757dd7c41c0b1dd0b77ae2","abstract_canon_sha256":"2125aacaf693ef4c9a239ab52f0fef1ae4958ab3dcf3cf4730e771a007acd5d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.921879Z","signature_b64":"BpqeAAqeY535q9TFtVpEHSfen3CY58PR7kHqIXJyUmUqA5LL+uNeEsXQjjHdEltpimrQZfnVmnZSLJL3iqHzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fdf3bad18f0e55434313ea2928d1cb1f80be6addea11c6c9f79648e31c3f4bc","last_reissued_at":"2026-05-18T01:59:53.921360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.921360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The K-Server Dual and Loose Competitiveness for Paging","license":"","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2002-05-18T18:16:13Z","abstract_excerpt":"This paper has two results. The first is based on the surprising observation that the well-known ``least-recently-used'' paging algorithm and the ``balance'' algorithm for weighted caching are linear-programming primal-dual algorithms. This observation leads to a strategy (called ``Greedy-Dual'') that generalizes them both and has an optimal performance guarantee for weighted caching.\n  For the second result, the paper presents empirical studies of paging algorithms, documenting that in practice, on ``typical'' cache sizes and sequences, the performance of paging strategies are much better tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205044","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/0205044","created_at":"2026-05-18T01:59:53.921446+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205044v1","created_at":"2026-05-18T01:59:53.921446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205044","created_at":"2026-05-18T01:59:53.921446+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7PTXLIY6DSV","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7PTXLIY6DSVINBR","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7PTXLIY","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/L7PTXLIY6DSVINBRH2RJFDI4WH","json":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH.json","graph_json":"https://pith.science/api/pith-number/L7PTXLIY6DSVINBRH2RJFDI4WH/graph.json","events_json":"https://pith.science/api/pith-number/L7PTXLIY6DSVINBRH2RJFDI4WH/events.json","paper":"https://pith.science/paper/L7PTXLIY"},"agent_actions":{"view_html":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH","download_json":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH.json","view_paper":"https://pith.science/paper/L7PTXLIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205044&json=true","fetch_graph":"https://pith.science/api/pith-number/L7PTXLIY6DSVINBRH2RJFDI4WH/graph.json","fetch_events":"https://pith.science/api/pith-number/L7PTXLIY6DSVINBRH2RJFDI4WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH/action/storage_attestation","attest_author":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH/action/author_attestation","sign_citation":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH/action/citation_signature","submit_replication":"https://pith.science/pith/L7PTXLIY6DSVINBRH2RJFDI4WH/action/replication_record"}},"created_at":"2026-05-18T01:59:53.921446+00:00","updated_at":"2026-05-18T01:59:53.921446+00:00"}