{"as_of":"2026-08-10T12:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:424a2b9d27feb575afcd3a6cbd60a7aba8207e0109d5cb85624299eab81b966b","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T15:30:19.741437Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.04668/citation-record","integrity":"/paper/2607.04668/integrity","json":"/paper/2607.04668/citation-record.json","paper":"/paper/2607.04668"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Scheduling Techniques for Con- current Systems,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:115d60acc41c1439930ae5690a0c22972d3d074eb578c5a1d59359500da2205d","observation_id":"af3f9023-4cba-4612-9505-8f9f0e6407d9","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Gang Scheduling Performance Benefits for Fine-Grain Synchroniza- tion,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:73567d6ed95c5d7c44ca7f7700ef5a2d03907d096ac376cc5ea0f70dd91ce407","observation_id":"55366136-3bc0-42cd-ad49-19a73ebdcc14","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Demand- Based Coscheduling of Parallel Jobs on Multipro- grammed Multiprocessors,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:967e9639d7e33ac3b9ed3541f1ce2bbbc62ea67862f5c91d786240ddb18bad55","observation_id":"7216b0b7-b4bf-41da-8a9e-30185c4ceaef","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Het- erogeneous Resources,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:d73f9bc31192ec68b1805a3802b98dcc12358b25e775672f9c83366571059103","observation_id":"3dc13369-a784-4ff2-b858-51f5147c57ec","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Paired Gang Scheduling,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:aebbc5afa5f05f788907f2761cd784c11c75c01b0d22d737d0362a61ee3eefdd","observation_id":"431e5ce1-37a2-46e9-a4c6-4f3d880945e5","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Process Control and Scheduling Issues for Multiprogrammed Shared- Memory Multiprocessors,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:260b1ec3f9cb294939f5adbf05a55798bbd6c9d524b515fe59eb7bd551a869f9","observation_id":"1ad4a9ff-dd5b-4ac6-959c-e9c4bb142b1a","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"A Dy- namic Processor Allocation Policy for Multipro- grammed Shared-Memory Multiprocessors,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:cd7e7fa4a4b9856f29c30a8567d1edbebcb41c88349c2b05e75824a2808a6fd7","observation_id":"dcb2e412-4639-41c0-9ae0-2ec34b735b42","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:ee5f07e87edfb6c03e88b76ea51ba386795b549f34dc021dcd19607e33e1b2a3","observation_id":"42988eaa-7b4d-4f54-a9bf-3d4c3357f808","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Composing Parallel Software Efficiently with Lithe,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:a673a8247571d1ac156eb9908b5d0b442c52d681ddce01ec7d59baab4080bcbb","observation_id":"aa10733a-51f1-4260-b042-63ab9557d21b","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Cal- listo: Co-Scheduling Parallel Runtime Systems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:44257c6d4cfdbb8baf23205208860cda27ddc89086ba20631c27d063b3042325","observation_id":"adce59a4-49f6-4954-b017-4ca7e7ddec69","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Greedy Reclama- tion of Unused Bandwidth in Constant-Bandwidth Servers,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:fc61ee4799899b3bd47ca72d509a6ce618831e11076c6d93f5bc55ab2e22bc82","observation_id":"1914b93a-c06b-4225-a1df-48c4e5ab1e2d","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Deadline Scheduling in the Linux Kernel,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:31dfbb6df822319299f6e2c61e898167a1e6bdb00d7bf540aae599e4af475e3d","observation_id":"9b80df22-7372-412b-9681-615307e22b70","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Heracles: Improving Resource Efficiency at Scale,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:cdad976cfe2cbfb148734b907b688db677bec050cd68d396594433608c76051e","observation_id":"684ca33a-315e-4e35-bd7b-20c3ca7e3433","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"PAR- TIES: QoS-Aware Resource Partitioning for Mul- tiple Interactive Services,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:6af0fd9ddc460ddcf6282486bd9b2dfc52549207e8cbd0672c5f329da386b9d7","observation_id":"22ebde5f-d7dd-4139-9245-587c52f9e4dc","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Shenango: Achieving High CPU Efficiency for Latency-sensitive Datacenter Work- loads,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:f0f2a4980a7dfd0ff39a400fd509de55dac5b97ada992ddfc5f00f71254be1b0","observation_id":"8aa70720-0da7-474f-adab-0709c5f01cb8","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Caladan: Mitigating Interference at Microsecond Timescales,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:d707897b961f911837f3b7b7c6912ea9c064113c4f1e93c77ecffb5c760e2df8","observation_id":"eaac4e57-5584-402e-b022-26ed90890349","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"IX: A Protected Dataplane Operating System for High Throughput and Low Latency,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:41861e87fea160706228f3e7873fa9051c3b159198acee19ed3782000d2a100c","observation_id":"04b09d94-6ef6-4f5b-8f2b-ce734ce6a5ab","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"The CPU Scheduler in VMware vSphere 5.1,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:ff6a84a1fb19e9a0531897489c02110f1a9744ee0a2a6b1319ef5a26f8f16249","observation_id":"914f6320-5b30-403d-87b6-4bcd3071cf0f","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Orca: A Distributed Serving Sys- tem for Transformer-Based Generative Models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:33c23a6bd36da93db89721dfbf444ebf180dc3064ab32fdc45305fdd20ade6ab","observation_id":"207dd378-4fcc-4fef-92ae-f31af22267d6","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02310","last_updated":"2024-06-17T21:10:46Z","snapshot_observed_at":"2026-08-10T00:28:16.043657Z","submitted_at":"2024-03-04T18:47:08Z","title":"Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Serve","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02310","snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Serve,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"cited_paper":"/paper/2403.02310","citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:2ef45f3df924a3378946c1592b619784c5fa8cd9264642792b291354c14fcf28","observation_id":"fbfecaf3-58cc-4976-a941-5373c19bff38","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02015","last_updated":"2024-06-13T02:53:29Z","snapshot_observed_at":"2026-08-05T03:20:40.748106Z","submitted_at":"2024-04-02T14:56:43Z","title":"MuxServe: Flexible Spatial-Temporal Multiplexing for Multiple LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02015","snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"MuxServe: Flexible Spatial- Temporal Multiplexing for Multiple LLM Serving,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"cited_paper":"/paper/2404.02015","citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:609b0d5dde34ecb2cb8f71c49495bf8b2eaf25c09f54b8a4fd5eb55e271f51f2","observation_id":"2e6b1496-194d-45c3-ae86-760a0d168a68","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"GitHub repository (unpublished), 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:59f009384e6f0733f8acfe2f2f7244bdc0adca84ebecc87d472a9bdb60f976d6","observation_id":"45d85704-8971-44b5-8674-1241a820da19","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Efficient Memory Management for Large Language Model Serving with PagedAtten- tion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:1584fe40160c67e315170af6a8e5dee581a80859d0127e8fec2451122d960cf6","observation_id":"84d1d0c3-9d49-4e2e-8fff-bf7eac6e4fac","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"AIOS: LLM Agent Operating Sys- tem,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:93edb47af5c68ea86d67870c3848588335b095ecd3e91902497f2e9c0fd627d6","observation_id":"c474b439-4243-487d-8f7a-f00ffea53c15","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"llama.cpp: LLM inference in C/C++,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:124af1ba80f004e266e0feff4e799feed26af41a6457f6b58f8bb25dfe5e1c77","observation_id":"4bda36c9-2a4e-4a11-9c4e-4bb309b3a369","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"The- seus: An Experiment in Operating System Struc- ture and State Management,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:43588fd29e22a435006b31af58405e5590cfffa8b19522e01e060b1ca0dab38e","observation_id":"dffc0b6e-2de5-4280-bc0b-9522fc2c36bc","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.11943","last_updated":"2026-07-06T04:35:13Z","snapshot_observed_at":"2026-07-12T21:41:19.909380Z","submitted_at":"2026-04-13T18:32:02Z","title":"ProbeLogits: Kernel-Level LLM Inference Primitives for AI-Native Operating Systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.11943","snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"ProbeLogits: Kernel-Level LLM Infer- ence Primitives for AI-Native Operating Systems,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"cited_paper":"/paper/2604.11943","citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:0ed21b4bb3fc182f4ab029fd8667604e7780e29fdefb4e5fa7ef421ca3b809a3","observation_id":"58288501-aee9-43cc-9921-90908cab671a","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.16870","last_updated":"2026-07-06T04:39:46Z","snapshot_observed_at":"2026-08-01T06:37:52.799607Z","submitted_at":"2026-04-18T06:40:20Z","title":"Governed MCP: Kernel-Level Tool Governance for AI Agents via Logit-Based Safety Primitives","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.16870","snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Governed MCP: Kernel-Level Tool Gover- nance for AI Agents via Logit-Based Safety Prim- itives,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"cited_paper":"/paper/2604.16870","citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:cb33d22b681eec194f55dd8030a22bc02e342769a49cc134c5eabd3ba579e780","observation_id":"82c65e4c-241e-4b2d-83b6-94d5367c8db0","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T15:30:19.741437Z","title":"Lottery Scheduling: Flexible Proportional-Share Resource Management,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T15:30:19.741437Z"},"links":{"citing_paper":"/paper/2607.04668"},"observation_digest":"sha256:3878629f6997cfebb39f33665bccb60828c4f86eb50cafe7123382d993c645a4","observation_id":"54662850-b99c-48c7-b2b1-f6666f8e1d32","resolution":{"observed_at":"2026-07-11T15:30:19.741437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04668","last_updated":"2026-07-06T04:50:32Z","latest_version":1,"primary_category":"cs.OS","snapshot_observed_at":"2026-08-02T05:19:19.975540Z","submitted_at":"2026-07-06T04:50:32Z","title":"Elastic Gang: Per-Token Membership Change for a Hard-Barriered LLM Inference Gang Co-Scheduled with OS Processes"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":29},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.04668."}