{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NE44LQFZ3LZUAX7B7BF2AWRTER","short_pith_number":"pith:NE44LQFZ","schema_version":"1.0","canonical_sha256":"6939c5c0b9daf3405fe1f84ba05a3324402f8a0b1f0c81d026640cd4a15f913c","source":{"kind":"arxiv","id":"2410.21266","version":1},"attestation_state":"computed","paper":{"title":"Online Weighted Paging with Unknown Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aviv Rosenberg, Noam Touitou, Orin Levy","submitted_at":"2024-10-28T17:57:40Z","abstract_excerpt":"Online paging is a fundamental problem in the field of online algorithms, in which one maintains a cache of $k$ slots as requests for fetching pages arrive online. In the weighted variant of this problem, each page has its own fetching cost; a substantial line of work on this problem culminated in an (optimal) $O(\\log k)$-competitive randomized algorithm, due to Bansal, Buchbinder and Naor (FOCS'07).\n  Existing work for weighted paging assumes that page weights are known in advance, which is not always the case in practice. For example, in multi-level caching architectures, the expected cost o"},"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":"2410.21266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-28T17:57:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2df2564e0aa3406ce47f7e4980e4f9ad7bacd7e392e83001ae5e0585e1643797","abstract_canon_sha256":"25d570d26266b970fa2ede4187dea880aa5d563a131022e4f2a3eeaaed7fdb39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:17.585956Z","signature_b64":"4XSMt3xU5eonBOIHbmSGuPxoeriH1IDKV3HhJz1PQxBoZ/XoB1alMEptvynyIJmsuRvrfaXEyRqS4wcxf2qzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6939c5c0b9daf3405fe1f84ba05a3324402f8a0b1f0c81d026640cd4a15f913c","last_reissued_at":"2026-07-05T09:27:17.585332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:17.585332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Weighted Paging with Unknown Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aviv Rosenberg, Noam Touitou, Orin Levy","submitted_at":"2024-10-28T17:57:40Z","abstract_excerpt":"Online paging is a fundamental problem in the field of online algorithms, in which one maintains a cache of $k$ slots as requests for fetching pages arrive online. In the weighted variant of this problem, each page has its own fetching cost; a substantial line of work on this problem culminated in an (optimal) $O(\\log k)$-competitive randomized algorithm, due to Bansal, Buchbinder and Naor (FOCS'07).\n  Existing work for weighted paging assumes that page weights are known in advance, which is not always the case in practice. For example, in multi-level caching architectures, the expected cost o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21266","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/2410.21266/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.21266","created_at":"2026-07-05T09:27:17.585414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21266v1","created_at":"2026-07-05T09:27:17.585414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21266","created_at":"2026-07-05T09:27:17.585414+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE44LQFZ3LZU","created_at":"2026-07-05T09:27:17.585414+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE44LQFZ3LZUAX7B","created_at":"2026-07-05T09:27:17.585414+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE44LQFZ","created_at":"2026-07-05T09:27:17.585414+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00835","citing_title":"Online Packet Scheduling with Deadlines and Learning","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER","json":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER.json","graph_json":"https://pith.science/api/pith-number/NE44LQFZ3LZUAX7B7BF2AWRTER/graph.json","events_json":"https://pith.science/api/pith-number/NE44LQFZ3LZUAX7B7BF2AWRTER/events.json","paper":"https://pith.science/paper/NE44LQFZ"},"agent_actions":{"view_html":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER","download_json":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER.json","view_paper":"https://pith.science/paper/NE44LQFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21266&json=true","fetch_graph":"https://pith.science/api/pith-number/NE44LQFZ3LZUAX7B7BF2AWRTER/graph.json","fetch_events":"https://pith.science/api/pith-number/NE44LQFZ3LZUAX7B7BF2AWRTER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/action/storage_attestation","attest_author":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/action/author_attestation","sign_citation":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/action/citation_signature","submit_replication":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/action/replication_record"}},"created_at":"2026-07-05T09:27:17.585414+00:00","updated_at":"2026-07-05T09:27:17.585414+00:00"}