{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WFSV43DCK4IWV7BSWY2UQBOQV6","short_pith_number":"pith:WFSV43DC","schema_version":"1.0","canonical_sha256":"b1655e6c6257116afc32b6354805d0afb4011ffef992323b7362c04ad371b6be","source":{"kind":"arxiv","id":"2501.07834","version":2},"attestation_state":"computed","paper":{"title":"Flow: Modularized Agentic Workflow Automation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.AI","authors_text":"Boye Niu, Kai Lian, Kun Zhang, Tongliang Liu, Yifan Shen, Yiliao Song, Yu Yao","submitted_at":"2025-01-14T04:35:37Z","abstract_excerpt":"Multi-agent frameworks powered by large language models (LLMs) have demonstrated great success in automated planning and task execution. However, the effective adjustment of agentic workflows during execution has not been well studied. An effective workflow adjustment is crucial in real-world scenarios, as the initial plan must adjust to unforeseen challenges and changing conditions in real time to ensure the efficient execution of complex tasks. In this paper, we define workflows as an activity-on-vertex (AOV) graph, which allows continuous workflow refinement by LLM agents through dynamic su"},"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":"2501.07834","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-01-14T04:35:37Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"b464020268a6390de4b082e11df127b383c25aa934e27b641e277ac1a7172517","abstract_canon_sha256":"c235acab9d4b65fc2d1dbbe54c1931d7a536311386d84aba366ad4d3933c4d62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:48.196312Z","signature_b64":"aNX8ZVfVFG2ZJaB2oqBgd9JhpfLqlYUa2ngXQqxPvHhej9LGR5889hGuUaxmW/YUFUvFzv6bOntZcMjfz3BRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1655e6c6257116afc32b6354805d0afb4011ffef992323b7362c04ad371b6be","last_reissued_at":"2026-07-05T10:18:48.195747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:48.195747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flow: Modularized Agentic Workflow Automation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.AI","authors_text":"Boye Niu, Kai Lian, Kun Zhang, Tongliang Liu, Yifan Shen, Yiliao Song, Yu Yao","submitted_at":"2025-01-14T04:35:37Z","abstract_excerpt":"Multi-agent frameworks powered by large language models (LLMs) have demonstrated great success in automated planning and task execution. However, the effective adjustment of agentic workflows during execution has not been well studied. An effective workflow adjustment is crucial in real-world scenarios, as the initial plan must adjust to unforeseen challenges and changing conditions in real time to ensure the efficient execution of complex tasks. In this paper, we define workflows as an activity-on-vertex (AOV) graph, which allows continuous workflow refinement by LLM agents through dynamic su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07834","kind":"arxiv","version":2},"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/2501.07834/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":"2501.07834","created_at":"2026-07-05T10:18:48.195816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07834v2","created_at":"2026-07-05T10:18:48.195816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07834","created_at":"2026-07-05T10:18:48.195816+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFSV43DCK4IW","created_at":"2026-07-05T10:18:48.195816+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFSV43DCK4IWV7BS","created_at":"2026-07-05T10:18:48.195816+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFSV43DC","created_at":"2026-07-05T10:18:48.195816+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21565","citing_title":"Composing Verifiable Conceptual Models via Building Blocks: Towards Design-Time Verification of Agentic AI Workflows","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15706","citing_title":"Differentiable Mixture-of-Agents Incentivizes Swarm Intelligence of Large Language Models","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2509.09505","citing_title":"Combating the Memory Walls: Optimization Pathways for Long-Context Agentic LLM Inference","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13647","citing_title":"FlowCompile: An Optimizing Compiler for Structured LLM Workflows","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6","json":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6.json","graph_json":"https://pith.science/api/pith-number/WFSV43DCK4IWV7BSWY2UQBOQV6/graph.json","events_json":"https://pith.science/api/pith-number/WFSV43DCK4IWV7BSWY2UQBOQV6/events.json","paper":"https://pith.science/paper/WFSV43DC"},"agent_actions":{"view_html":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6","download_json":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6.json","view_paper":"https://pith.science/paper/WFSV43DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07834&json=true","fetch_graph":"https://pith.science/api/pith-number/WFSV43DCK4IWV7BSWY2UQBOQV6/graph.json","fetch_events":"https://pith.science/api/pith-number/WFSV43DCK4IWV7BSWY2UQBOQV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6/action/storage_attestation","attest_author":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6/action/author_attestation","sign_citation":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6/action/citation_signature","submit_replication":"https://pith.science/pith/WFSV43DCK4IWV7BSWY2UQBOQV6/action/replication_record"}},"created_at":"2026-07-05T10:18:48.195816+00:00","updated_at":"2026-07-05T10:18:48.195816+00:00"}