{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NMIX6A5534XZPHGOVVJJ2XJ7CN","short_pith_number":"pith:NMIX6A55","canonical_record":{"source":{"id":"2607.09248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T09:52:11Z","cross_cats_sorted":[],"title_canon_sha256":"20b15e75698b06260fc961268d004a4246e936e9acb62787472a98874696b766","abstract_canon_sha256":"ec404ba8097ad60f45e622af0986051674c24e53a374aea5b12054274b28d323"},"schema_version":"1.0"},"canonical_sha256":"6b117f03bddf2f979ccead529d5d3f1360780d9fc98b76e04267d755b9a81608","source":{"kind":"arxiv","id":"2607.09248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09248","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09248v1","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09248","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"pith_short_12","alias_value":"NMIX6A5534XZ","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"pith_short_16","alias_value":"NMIX6A5534XZPHGO","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"pith_short_8","alias_value":"NMIX6A55","created_at":"2026-07-13T01:18:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NMIX6A5534XZPHGOVVJJ2XJ7CN","target":"record","payload":{"canonical_record":{"source":{"id":"2607.09248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T09:52:11Z","cross_cats_sorted":[],"title_canon_sha256":"20b15e75698b06260fc961268d004a4246e936e9acb62787472a98874696b766","abstract_canon_sha256":"ec404ba8097ad60f45e622af0986051674c24e53a374aea5b12054274b28d323"},"schema_version":"1.0"},"canonical_sha256":"6b117f03bddf2f979ccead529d5d3f1360780d9fc98b76e04267d755b9a81608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:18:55.555505Z","signature_b64":"L+SUSYGMQ0MRCYHsuFOIb1B4qnIkIcRznrJ0UDig9FHMFX8eXZ6+xcfG8FQq6PwGfZ1Vy+RxaBpsHjv60w8HAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b117f03bddf2f979ccead529d5d3f1360780d9fc98b76e04267d755b9a81608","last_reissued_at":"2026-07-13T01:18:55.554200Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:18:55.554200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.09248","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-13T01:18:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us8YrGSVuN0mBPARRnSp0YLb6hMXe5olfkAcx+PrnHkq7vYjdkatNe1MSzB0RLu0esWzFxavaBDOcq6EsrkhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T12:30:59.999061Z"},"content_sha256":"bc9abfce6cb51c08221c6260199dee1b76ce31e356de9338580c124c79b65dd0","schema_version":"1.0","event_id":"sha256:bc9abfce6cb51c08221c6260199dee1b76ce31e356de9338580c124c79b65dd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NMIX6A5534XZPHGOVVJJ2XJ7CN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Siyu Liu, Yiding Feng, Yuhao Zhang, Zonghan Yang","submitted_at":"2026-07-10T09:52:11Z","abstract_excerpt":"We study non-clairvoyant scheduling for batched Large Language Model (LLM) inference under a hard Key-Value (KV) cache memory budget. Each request has a known prompt length but an unknown response length, and its memory footprint comprises a fixed prompt component together with a response component that grows with each decoded token. At each decoding round, the scheduler chooses a feasible batch of active requests; evicting a request discards its accumulated cache states, wasting prior computation. The goal is to minimize total completion time against the optimal clairvoyant schedule that know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09248","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/2607.09248/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-13T01:18:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BNECtoudV3cn3g13p21rxDvY50QDn2rIGJXi0YLkhJB1nm34M6CZrF8E20MRE+UJMTwVbhqpN/MtnT4cvhbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T12:30:59.999583Z"},"content_sha256":"2d557f838f3a95d04a6cf45e617de474de3870376c6ba35a3fd4d1b67e1e9652","schema_version":"1.0","event_id":"sha256:2d557f838f3a95d04a6cf45e617de474de3870376c6ba35a3fd4d1b67e1e9652"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NMIX6A5534XZPHGOVVJJ2XJ7CN/bundle.json","state_url":"https://pith.science/pith/NMIX6A5534XZPHGOVVJJ2XJ7CN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NMIX6A5534XZPHGOVVJJ2XJ7CN/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-08-22T12:31:00Z","links":{"resolver":"https://pith.science/pith/NMIX6A5534XZPHGOVVJJ2XJ7CN","bundle":"https://pith.science/pith/NMIX6A5534XZPHGOVVJJ2XJ7CN/bundle.json","state":"https://pith.science/pith/NMIX6A5534XZPHGOVVJJ2XJ7CN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NMIX6A5534XZPHGOVVJJ2XJ7CN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NMIX6A5534XZPHGOVVJJ2XJ7CN","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":"ec404ba8097ad60f45e622af0986051674c24e53a374aea5b12054274b28d323","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T09:52:11Z","title_canon_sha256":"20b15e75698b06260fc961268d004a4246e936e9acb62787472a98874696b766"},"schema_version":"1.0","source":{"id":"2607.09248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09248","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09248v1","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09248","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"pith_short_12","alias_value":"NMIX6A5534XZ","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"pith_short_16","alias_value":"NMIX6A5534XZPHGO","created_at":"2026-07-13T01:18:55Z"},{"alias_kind":"pith_short_8","alias_value":"NMIX6A55","created_at":"2026-07-13T01:18:55Z"}],"graph_snapshots":[{"event_id":"sha256:2d557f838f3a95d04a6cf45e617de474de3870376c6ba35a3fd4d1b67e1e9652","target":"graph","created_at":"2026-07-13T01:18:55Z","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/2607.09248/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study non-clairvoyant scheduling for batched Large Language Model (LLM) inference under a hard Key-Value (KV) cache memory budget. Each request has a known prompt length but an unknown response length, and its memory footprint comprises a fixed prompt component together with a response component that grows with each decoded token. At each decoding round, the scheduler chooses a feasible batch of active requests; evicting a request discards its accumulated cache states, wasting prior computation. The goal is to minimize total completion time against the optimal clairvoyant schedule that know","authors_text":"Siyu Liu, Yiding Feng, Yuhao Zhang, Zonghan Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09248","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:bc9abfce6cb51c08221c6260199dee1b76ce31e356de9338580c124c79b65dd0","target":"record","created_at":"2026-07-13T01:18:55Z","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":"ec404ba8097ad60f45e622af0986051674c24e53a374aea5b12054274b28d323","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-10T09:52:11Z","title_canon_sha256":"20b15e75698b06260fc961268d004a4246e936e9acb62787472a98874696b766"},"schema_version":"1.0","source":{"id":"2607.09248","kind":"arxiv","version":1}},"canonical_sha256":"6b117f03bddf2f979ccead529d5d3f1360780d9fc98b76e04267d755b9a81608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b117f03bddf2f979ccead529d5d3f1360780d9fc98b76e04267d755b9a81608","first_computed_at":"2026-07-13T01:18:55.554200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T01:18:55.554200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L+SUSYGMQ0MRCYHsuFOIb1B4qnIkIcRznrJ0UDig9FHMFX8eXZ6+xcfG8FQq6PwGfZ1Vy+RxaBpsHjv60w8HAw==","signature_status":"signed_v1","signed_at":"2026-07-13T01:18:55.555505Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.09248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc9abfce6cb51c08221c6260199dee1b76ce31e356de9338580c124c79b65dd0","sha256:2d557f838f3a95d04a6cf45e617de474de3870376c6ba35a3fd4d1b67e1e9652"],"state_sha256":"fd22e6c4f935d948d938e9a665adffcc13f0281a6deb43493724ea9157403065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcmCOonHbZwhgsgdJGmuEtqWQlSS6CtDIpk6PumCrLD0/YBf41WLvDJ9BYA+fbK040Q4gxxahfXdc43wR7jfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T12:31:00.013190Z","bundle_sha256":"7cda1c42b50c83c82d6e93785c6bb5abd416221e34417eebfb68836bff6ff04a"}}