{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NE44LQFZ3LZUAX7B7BF2AWRTER","short_pith_number":"pith:NE44LQFZ","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"},"canonical_sha256":"6939c5c0b9daf3405fe1f84ba05a3324402f8a0b1f0c81d026640cd4a15f913c","source":{"kind":"arxiv","id":"2410.21266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.21266","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"2410.21266v1","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21266","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"NE44LQFZ3LZU","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"pith_short_16","alias_value":"NE44LQFZ3LZUAX7B","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"pith_short_8","alias_value":"NE44LQFZ","created_at":"2026-07-05T09:27:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NE44LQFZ3LZUAX7B7BF2AWRTER","target":"record","payload":{"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"},"canonical_sha256":"6939c5c0b9daf3405fe1f84ba05a3324402f8a0b1f0c81d026640cd4a15f913c","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"},"source_kind":"arxiv","source_id":"2410.21266","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-05T09:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffEF4L+6JuqZGL6ywDOenTlICRDS563gCzx1OmIdPdJIXf/GJGrUFon3HYIS3GOjaPne1iOdkAXX9eTAhZzYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:16:43.948867Z"},"content_sha256":"dbce7ad9d252ef90f5abd73b0a02c4f23047a7f42c633fbc2dba10a38b5688f2","schema_version":"1.0","event_id":"sha256:dbce7ad9d252ef90f5abd73b0a02c4f23047a7f42c633fbc2dba10a38b5688f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NE44LQFZ3LZUAX7B7BF2AWRTER","target":"graph","payload":{"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"},"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-05T09:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7W6afvTf5dDHVQcAdVnJiSNcI1zLwFbxBWnxg82g4WcjAwmgCXbOOTa1MICmPzVOWAKfqNaj5k6XAFuI5yUuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:16:43.949241Z"},"content_sha256":"04dd09cca6a81786267da7985120a0f59209ba3de2944b8742bad14aaad71ee5","schema_version":"1.0","event_id":"sha256:04dd09cca6a81786267da7985120a0f59209ba3de2944b8742bad14aaad71ee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/bundle.json","state_url":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/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-06T16:16:43Z","links":{"resolver":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER","bundle":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/bundle.json","state":"https://pith.science/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NE44LQFZ3LZUAX7B7BF2AWRTER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NE44LQFZ3LZUAX7B7BF2AWRTER","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":"25d570d26266b970fa2ede4187dea880aa5d563a131022e4f2a3eeaaed7fdb39","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-28T17:57:40Z","title_canon_sha256":"2df2564e0aa3406ce47f7e4980e4f9ad7bacd7e392e83001ae5e0585e1643797"},"schema_version":"1.0","source":{"id":"2410.21266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.21266","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"2410.21266v1","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21266","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"NE44LQFZ3LZU","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"pith_short_16","alias_value":"NE44LQFZ3LZUAX7B","created_at":"2026-07-05T09:27:17Z"},{"alias_kind":"pith_short_8","alias_value":"NE44LQFZ","created_at":"2026-07-05T09:27:17Z"}],"graph_snapshots":[{"event_id":"sha256:04dd09cca6a81786267da7985120a0f59209ba3de2944b8742bad14aaad71ee5","target":"graph","created_at":"2026-07-05T09:27:17Z","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/2410.21266/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aviv Rosenberg, Noam Touitou, Orin Levy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-28T17:57:40Z","title":"Online Weighted Paging with Unknown Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21266","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:dbce7ad9d252ef90f5abd73b0a02c4f23047a7f42c633fbc2dba10a38b5688f2","target":"record","created_at":"2026-07-05T09:27:17Z","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":"25d570d26266b970fa2ede4187dea880aa5d563a131022e4f2a3eeaaed7fdb39","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-28T17:57:40Z","title_canon_sha256":"2df2564e0aa3406ce47f7e4980e4f9ad7bacd7e392e83001ae5e0585e1643797"},"schema_version":"1.0","source":{"id":"2410.21266","kind":"arxiv","version":1}},"canonical_sha256":"6939c5c0b9daf3405fe1f84ba05a3324402f8a0b1f0c81d026640cd4a15f913c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6939c5c0b9daf3405fe1f84ba05a3324402f8a0b1f0c81d026640cd4a15f913c","first_computed_at":"2026-07-05T09:27:17.585332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:27:17.585332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4XSMt3xU5eonBOIHbmSGuPxoeriH1IDKV3HhJz1PQxBoZ/XoB1alMEptvynyIJmsuRvrfaXEyRqS4wcxf2qzAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:27:17.585956Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.21266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbce7ad9d252ef90f5abd73b0a02c4f23047a7f42c633fbc2dba10a38b5688f2","sha256:04dd09cca6a81786267da7985120a0f59209ba3de2944b8742bad14aaad71ee5"],"state_sha256":"adf66b883a642050fafe9bbde21077a3f4daee9d342eea51d2f19f3a9e1bf4bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luNtu9sda+hRDFBErShkusrRmMtxKs/T0xhjY2qrp5sMAIxihqdy1Pk3Bmhui2oA2FRA1IGLmf9et9CA2RAEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:16:43.951229Z","bundle_sha256":"5db4348d42c7595f2ea1281102a38b1a774bc19d1b2ff47ea7f8138608b8f0ad"}}