{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5XZWTWU747TRFN7FBMKEKVV343","short_pith_number":"pith:5XZWTWU7","schema_version":"1.0","canonical_sha256":"edf369da9fe7e712b7e50b144556bbe6d032cf98d4451f75a972e04a06dbc841","source":{"kind":"arxiv","id":"2607.10987","version":1},"attestation_state":"computed","paper":{"title":"[AAFLOW+] Stateful Operator Abstraction with Zero-Copy Distributed KV Cache Orchestration for Multi-Agent Workflows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander James Halpern, Arup Kumar Sarker, Aymen Alsaadi, Geoffrey Fox, Gregor von Laszewski, Mills Staylor, Shantenu Jha, Yue Cheng","submitted_at":"2026-07-13T01:19:13Z","abstract_excerpt":"Multi-agent LLM systems increasingly integrate retrieval, planning, and reasoning, but remain fundamentally text-centric, requiring agents to repeatedly recompute shared context through expensive prefill. Although single-request inference is known to be accelerated by KV-cache management, it is usually restricted to local serving scopes. We introduce AAFLOW+, a stateful extension of agentic workflow operators that makes KV cache a first-class distributed systems object. AAFLOW+ builds processes into communication-aware graphs that concurrently optimize data, prompts, and reusable model state. "},"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":"2607.10987","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-13T01:19:13Z","cross_cats_sorted":[],"title_canon_sha256":"215efc8acccfc479d17a60dd0466c41429f8dd05a4014b5a39da496f6f99b669","abstract_canon_sha256":"e2f55be3fdfe2af5bc22b667b853374b4f72cb81321dfafcb36f718eaf54eec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:51.052049Z","signature_b64":"BDMPdLoqELz9bIc+ZOc430OQNe3+1O/S92OfcLyCeXAdioQiEEkSP3eGw9QG1F7Gm85n3HoX4vZ6aKjp1QVpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edf369da9fe7e712b7e50b144556bbe6d032cf98d4451f75a972e04a06dbc841","last_reissued_at":"2026-07-14T01:21:51.051168Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:51.051168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"[AAFLOW+] Stateful Operator Abstraction with Zero-Copy Distributed KV Cache Orchestration for Multi-Agent Workflows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander James Halpern, Arup Kumar Sarker, Aymen Alsaadi, Geoffrey Fox, Gregor von Laszewski, Mills Staylor, Shantenu Jha, Yue Cheng","submitted_at":"2026-07-13T01:19:13Z","abstract_excerpt":"Multi-agent LLM systems increasingly integrate retrieval, planning, and reasoning, but remain fundamentally text-centric, requiring agents to repeatedly recompute shared context through expensive prefill. Although single-request inference is known to be accelerated by KV-cache management, it is usually restricted to local serving scopes. We introduce AAFLOW+, a stateful extension of agentic workflow operators that makes KV cache a first-class distributed systems object. AAFLOW+ builds processes into communication-aware graphs that concurrently optimize data, prompts, and reusable model state. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10987","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.10987/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":"2607.10987","created_at":"2026-07-14T01:21:51.051618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10987v1","created_at":"2026-07-14T01:21:51.051618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10987","created_at":"2026-07-14T01:21:51.051618+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XZWTWU747TR","created_at":"2026-07-14T01:21:51.051618+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XZWTWU747TRFN7F","created_at":"2026-07-14T01:21:51.051618+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XZWTWU7","created_at":"2026-07-14T01:21:51.051618+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08340","citing_title":"OpRAG: A Resource-Deterministic Runtime for GPU-Backed Multi-Stage RAG Workflows","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343","json":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343.json","graph_json":"https://pith.science/api/pith-number/5XZWTWU747TRFN7FBMKEKVV343/graph.json","events_json":"https://pith.science/api/pith-number/5XZWTWU747TRFN7FBMKEKVV343/events.json","paper":"https://pith.science/paper/5XZWTWU7"},"agent_actions":{"view_html":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343","download_json":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343.json","view_paper":"https://pith.science/paper/5XZWTWU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10987&json=true","fetch_graph":"https://pith.science/api/pith-number/5XZWTWU747TRFN7FBMKEKVV343/graph.json","fetch_events":"https://pith.science/api/pith-number/5XZWTWU747TRFN7FBMKEKVV343/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343/action/storage_attestation","attest_author":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343/action/author_attestation","sign_citation":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343/action/citation_signature","submit_replication":"https://pith.science/pith/5XZWTWU747TRFN7FBMKEKVV343/action/replication_record"}},"created_at":"2026-07-14T01:21:51.051618+00:00","updated_at":"2026-07-14T01:21:51.051618+00:00"}