{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GIJNGX5W3JUS222FVPIQE5EA2W","short_pith_number":"pith:GIJNGX5W","schema_version":"1.0","canonical_sha256":"3212d35fb6da692d6b45abd1027480d599848c10ee9a46ceef816b4cc8c84052","source":{"kind":"arxiv","id":"2503.11301","version":1},"attestation_state":"computed","paper":{"title":"GNNs as Predictors of Agentic Workflow Performances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.CL","authors_text":"Bohan Tang, Muhan Zhang, Shuo Chen, Siheng Chen, Xiaowen Dong, Yuanshuo Zhang, Yuchen Hou","submitted_at":"2025-03-14T11:11:00Z","abstract_excerpt":"Agentic workflows invoked by Large Language Models (LLMs) have achieved remarkable success in handling complex tasks. However, optimizing such workflows is costly and inefficient in real-world applications due to extensive invocations of LLMs. To fill this gap, this position paper formulates agentic workflows as computational graphs and advocates Graph Neural Networks (GNNs) as efficient predictors of agentic workflow performances, avoiding repeated LLM invocations for evaluation. To empirically ground this position, we construct FLORA-Bench, a unified platform for benchmarking GNNs for predic"},"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":"2503.11301","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-03-14T11:11:00Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ec3fa871bc08b7ee078d933dc708cf7cf277d4ea3a0ed5b55bc90d9fbd5468a9","abstract_canon_sha256":"e8a6fbe6eed0092908d329c4739f911e8afee130eb52b42dcbd0db561f284b50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:16.574051Z","signature_b64":"fh/8tWLlCObUPdxa05c08oQmfnoa7nkkbLFaVZ+0iK+7NFfiorB1gRT0SCeEpp0gvdSinn2aBjycsL9eq3pADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3212d35fb6da692d6b45abd1027480d599848c10ee9a46ceef816b4cc8c84052","last_reissued_at":"2026-07-05T10:31:16.572839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:16.572839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GNNs as Predictors of Agentic Workflow Performances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.CL","authors_text":"Bohan Tang, Muhan Zhang, Shuo Chen, Siheng Chen, Xiaowen Dong, Yuanshuo Zhang, Yuchen Hou","submitted_at":"2025-03-14T11:11:00Z","abstract_excerpt":"Agentic workflows invoked by Large Language Models (LLMs) have achieved remarkable success in handling complex tasks. However, optimizing such workflows is costly and inefficient in real-world applications due to extensive invocations of LLMs. To fill this gap, this position paper formulates agentic workflows as computational graphs and advocates Graph Neural Networks (GNNs) as efficient predictors of agentic workflow performances, avoiding repeated LLM invocations for evaluation. To empirically ground this position, we construct FLORA-Bench, a unified platform for benchmarking GNNs for predic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11301","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/2503.11301/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":"2503.11301","created_at":"2026-07-05T10:31:16.572957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.11301v1","created_at":"2026-07-05T10:31:16.572957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11301","created_at":"2026-07-05T10:31:16.572957+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIJNGX5W3JUS","created_at":"2026-07-05T10:31:16.572957+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIJNGX5W3JUS222F","created_at":"2026-07-05T10:31:16.572957+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIJNGX5W","created_at":"2026-07-05T10:31:16.572957+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22741","citing_title":"GRADE: Graph Representation of LLM Agent Dependency and Execution","ref_index":145,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01557","citing_title":"Everywhere Learning: Artificial Intelligence with Pointwise Constraints","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27470","citing_title":"Detect by Yourself: Self-Designing Agentic Workflows for Few-Shot Graph Anomaly Detection","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2507.21046","citing_title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","ref_index":279,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W","json":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W.json","graph_json":"https://pith.science/api/pith-number/GIJNGX5W3JUS222FVPIQE5EA2W/graph.json","events_json":"https://pith.science/api/pith-number/GIJNGX5W3JUS222FVPIQE5EA2W/events.json","paper":"https://pith.science/paper/GIJNGX5W"},"agent_actions":{"view_html":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W","download_json":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W.json","view_paper":"https://pith.science/paper/GIJNGX5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.11301&json=true","fetch_graph":"https://pith.science/api/pith-number/GIJNGX5W3JUS222FVPIQE5EA2W/graph.json","fetch_events":"https://pith.science/api/pith-number/GIJNGX5W3JUS222FVPIQE5EA2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W/action/storage_attestation","attest_author":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W/action/author_attestation","sign_citation":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W/action/citation_signature","submit_replication":"https://pith.science/pith/GIJNGX5W3JUS222FVPIQE5EA2W/action/replication_record"}},"created_at":"2026-07-05T10:31:16.572957+00:00","updated_at":"2026-07-05T10:31:16.572957+00:00"}