{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HTHBL5KMSSE2C5NEPOIDSGDGJE","short_pith_number":"pith:HTHBL5KM","canonical_record":{"source":{"id":"2611.17083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T16:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"bc5928fc6dbd3dc8d117f14c28edee5810716fe653e8aec443d1e9b42ad55da0","abstract_canon_sha256":"45f5f4c9f570cf578058c6f7799585fc738919f9ddc476fb31630bec4a4b02d7"},"schema_version":"1.0"},"canonical_sha256":"3cce15f54c9489a175a47b903918664929400c4ad7e314a91f42c96351054dd0","source":{"kind":"arxiv","id":"2611.17083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.17083","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"arxiv_version","alias_value":"2611.17083v1","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.17083","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"pith_short_12","alias_value":"HTHBL5KMSSE2","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTHBL5KMSSE2C5NE","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTHBL5KM","created_at":"2026-11-13T06:32:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HTHBL5KMSSE2C5NEPOIDSGDGJE","target":"record","payload":{"canonical_record":{"source":{"id":"2611.17083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T16:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"bc5928fc6dbd3dc8d117f14c28edee5810716fe653e8aec443d1e9b42ad55da0","abstract_canon_sha256":"45f5f4c9f570cf578058c6f7799585fc738919f9ddc476fb31630bec4a4b02d7"},"schema_version":"1.0"},"canonical_sha256":"3cce15f54c9489a175a47b903918664929400c4ad7e314a91f42c96351054dd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-11-13T06:32:18.878554Z","signature_b64":"B8aDXOLW6ZSK3fpd+6y66qBJTxJBvWtjO4TKdg18QdvFaaZtcKXsMsZW8vvbSxmt3EZgwoPwQE39PcnIWW1wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cce15f54c9489a175a47b903918664929400c4ad7e314a91f42c96351054dd0","last_reissued_at":"2026-11-13T06:32:18.876173Z","signature_status":"signed_v1","first_computed_at":"2026-11-13T06:32:18.876173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2611.17083","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-11-13T06:32:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miPnjJztrO+x+toAFRWEOgaP8FO0pkRYLWPFhRgha9/AIbK2gc66j1zZyPBco/cz9GvERfRb/EgCcgUeHu8kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:38:29.179272Z"},"content_sha256":"3652b3b94f4863bbd277f3620935892a63f65762f7ed7fc83fc9086dbd3604cc","schema_version":"1.0","event_id":"sha256:3652b3b94f4863bbd277f3620935892a63f65762f7ed7fc83fc9086dbd3604cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HTHBL5KMSSE2C5NEPOIDSGDGJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List Update with Time Windows and Delays without Batch-Serving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Clifford Stein, Icey Siyi Ai, Jingwei Li","submitted_at":"2026-11-12T16:50:12Z","abstract_excerpt":"We study list update with time windows and delays when every request requires a separate access. Unlike batch-serving models, serving several requests to one element still incurs one access per request, and each access may change the list for subsequent requests. For time windows of overlap at most $k\\ge2$, our deterministic First-Element Removal algorithm is $(3-2/k)$-competitive, hence $3$-competitive in general. Against an oblivious adversary, a randomized adaptation of BIT is $7/4$-competitive on arbitrary $2$-overlap inputs. More generally, on inputs without self-overlap, it is $\\left(13/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.17083","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/2611.17083/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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-11-13T06:32:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YestMxS/klO7A5ZNA2krHQra9LaU6T4dcd5fXYt0m+ekLwbKmGJHrhL+LDRFz3gvVRTcmgi1KgWjIYrN8PyCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:38:29.180708Z"},"content_sha256":"31f2e469c361455ead09e6a76695b843e991139b1a16b47f34c31ec4be360fd4","schema_version":"1.0","event_id":"sha256:31f2e469c361455ead09e6a76695b843e991139b1a16b47f34c31ec4be360fd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTHBL5KMSSE2C5NEPOIDSGDGJE/bundle.json","state_url":"https://pith.science/pith/HTHBL5KMSSE2C5NEPOIDSGDGJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTHBL5KMSSE2C5NEPOIDSGDGJE/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-11-16T03:38:29Z","links":{"resolver":"https://pith.science/pith/HTHBL5KMSSE2C5NEPOIDSGDGJE","bundle":"https://pith.science/pith/HTHBL5KMSSE2C5NEPOIDSGDGJE/bundle.json","state":"https://pith.science/pith/HTHBL5KMSSE2C5NEPOIDSGDGJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTHBL5KMSSE2C5NEPOIDSGDGJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HTHBL5KMSSE2C5NEPOIDSGDGJE","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":"45f5f4c9f570cf578058c6f7799585fc738919f9ddc476fb31630bec4a4b02d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T16:50:12Z","title_canon_sha256":"bc5928fc6dbd3dc8d117f14c28edee5810716fe653e8aec443d1e9b42ad55da0"},"schema_version":"1.0","source":{"id":"2611.17083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2611.17083","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"arxiv_version","alias_value":"2611.17083v1","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2611.17083","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"pith_short_12","alias_value":"HTHBL5KMSSE2","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTHBL5KMSSE2C5NE","created_at":"2026-11-13T06:32:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTHBL5KM","created_at":"2026-11-13T06:32:18Z"}],"graph_snapshots":[{"event_id":"sha256:31f2e469c361455ead09e6a76695b843e991139b1a16b47f34c31ec4be360fd4","target":"graph","created_at":"2026-11-13T06:32:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2611.17083/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study list update with time windows and delays when every request requires a separate access. Unlike batch-serving models, serving several requests to one element still incurs one access per request, and each access may change the list for subsequent requests. For time windows of overlap at most $k\\ge2$, our deterministic First-Element Removal algorithm is $(3-2/k)$-competitive, hence $3$-competitive in general. Against an oblivious adversary, a randomized adaptation of BIT is $7/4$-competitive on arbitrary $2$-overlap inputs. More generally, on inputs without self-overlap, it is $\\left(13/","authors_text":"Clifford Stein, Icey Siyi Ai, Jingwei Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T16:50:12Z","title":"List Update with Time Windows and Delays without Batch-Serving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2611.17083","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:3652b3b94f4863bbd277f3620935892a63f65762f7ed7fc83fc9086dbd3604cc","target":"record","created_at":"2026-11-13T06:32:18Z","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":"45f5f4c9f570cf578058c6f7799585fc738919f9ddc476fb31630bec4a4b02d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-11-12T16:50:12Z","title_canon_sha256":"bc5928fc6dbd3dc8d117f14c28edee5810716fe653e8aec443d1e9b42ad55da0"},"schema_version":"1.0","source":{"id":"2611.17083","kind":"arxiv","version":1}},"canonical_sha256":"3cce15f54c9489a175a47b903918664929400c4ad7e314a91f42c96351054dd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cce15f54c9489a175a47b903918664929400c4ad7e314a91f42c96351054dd0","first_computed_at":"2026-11-13T06:32:18.876173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-11-13T06:32:18.876173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B8aDXOLW6ZSK3fpd+6y66qBJTxJBvWtjO4TKdg18QdvFaaZtcKXsMsZW8vvbSxmt3EZgwoPwQE39PcnIWW1wCg==","signature_status":"signed_v1","signed_at":"2026-11-13T06:32:18.878554Z","signed_message":"canonical_sha256_bytes"},"source_id":"2611.17083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3652b3b94f4863bbd277f3620935892a63f65762f7ed7fc83fc9086dbd3604cc","sha256:31f2e469c361455ead09e6a76695b843e991139b1a16b47f34c31ec4be360fd4"],"state_sha256":"5442467f42f9d1c46ef1eff6a3435947025b5290f0df2f6ff947a30a89309770"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HXFj0BPj7FBKoWgldcZbO8OutVVmkq+7JWZEnaOVF8mc00e54/jqeGyLxrs1zuCIAzIgZOE4G3NLe2b5TlSlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-11-16T03:38:29.198647Z","bundle_sha256":"d9d2ca082210609bacd0df5ee5366b2dba0d6bb4228ecb7f726fc1590d19b6ab"}}