{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YRFLVZZQA6O24A5FCEUUH6BAZG","short_pith_number":"pith:YRFLVZZQ","schema_version":"1.0","canonical_sha256":"c44abae730079dae03a5112943f820c99df175065ad5b9dcf8a81596ba323611","source":{"kind":"arxiv","id":"2608.12123","version":1},"attestation_state":"computed","paper":{"title":"Ready Cohorts: Bounding GPU Opportunity and Avoiding Host Round Trips in LLM-Agent Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.OS"],"primary_cat":"cs.DC","authors_text":"Josef Liyanjun Chen","submitted_at":"2026-08-12T14:42:15Z","abstract_excerpt":"LLM-agent services repeatedly execute small deterministic transitions between model and tool calls: route an outcome, update state, and emit the next effect. We ask when this control path exposes enough concurrent work for GPU execution, and what changes when a GPU-computed route decision remains on device. We formalize the ready-cohort boundary using fixed-partition share F, exact offline share P*, local upper bound U, and online achieved share A. Under zero service time, unlimited capacity, and equal relative launch deadlines, a specialized dynamic program computes P* exactly. In a stationar"},"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":"2608.12123","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-08-12T14:42:15Z","cross_cats_sorted":["cs.AI","cs.OS"],"title_canon_sha256":"bb90c26eacd9a26ac2cc0f424626871f7a298d4f3f2bcc08b999f3ddb2a0f9ad","abstract_canon_sha256":"b845697076f8390be1e1dd3abaff334aafdd70d7bbacd97c789f7bccd1112f9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:30:08.467485Z","signature_b64":"HCd8pIqVn2ot5tJzh0rRA3YoI8LPT+Fb405GRlHbzlruHfHZLQVaOz6qs+KwCTO3KBujJnS3k1t4gxQFyQ1/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c44abae730079dae03a5112943f820c99df175065ad5b9dcf8a81596ba323611","last_reissued_at":"2026-08-13T01:30:08.465126Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:30:08.465126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ready Cohorts: Bounding GPU Opportunity and Avoiding Host Round Trips in LLM-Agent Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.OS"],"primary_cat":"cs.DC","authors_text":"Josef Liyanjun Chen","submitted_at":"2026-08-12T14:42:15Z","abstract_excerpt":"LLM-agent services repeatedly execute small deterministic transitions between model and tool calls: route an outcome, update state, and emit the next effect. We ask when this control path exposes enough concurrent work for GPU execution, and what changes when a GPU-computed route decision remains on device. We formalize the ready-cohort boundary using fixed-partition share F, exact offline share P*, local upper bound U, and online achieved share A. Under zero service time, unlimited capacity, and equal relative launch deadlines, a specialized dynamic program computes P* exactly. In a stationar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12123","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/2608.12123/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":"2608.12123","created_at":"2026-08-13T01:30:08.466320+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12123v1","created_at":"2026-08-13T01:30:08.466320+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12123","created_at":"2026-08-13T01:30:08.466320+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRFLVZZQA6O2","created_at":"2026-08-13T01:30:08.466320+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRFLVZZQA6O24A5F","created_at":"2026-08-13T01:30:08.466320+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRFLVZZQ","created_at":"2026-08-13T01:30:08.466320+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG","json":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG.json","graph_json":"https://pith.science/api/pith-number/YRFLVZZQA6O24A5FCEUUH6BAZG/graph.json","events_json":"https://pith.science/api/pith-number/YRFLVZZQA6O24A5FCEUUH6BAZG/events.json","paper":"https://pith.science/paper/YRFLVZZQ"},"agent_actions":{"view_html":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG","download_json":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG.json","view_paper":"https://pith.science/paper/YRFLVZZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12123&json=true","fetch_graph":"https://pith.science/api/pith-number/YRFLVZZQA6O24A5FCEUUH6BAZG/graph.json","fetch_events":"https://pith.science/api/pith-number/YRFLVZZQA6O24A5FCEUUH6BAZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG/action/storage_attestation","attest_author":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG/action/author_attestation","sign_citation":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG/action/citation_signature","submit_replication":"https://pith.science/pith/YRFLVZZQA6O24A5FCEUUH6BAZG/action/replication_record"}},"created_at":"2026-08-13T01:30:08.466320+00:00","updated_at":"2026-08-13T01:30:08.466320+00:00"}