{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DYSCFTB2MLQVC3M77XZZOJYIBU","short_pith_number":"pith:DYSCFTB2","schema_version":"1.0","canonical_sha256":"1e2422cc3a62e1516d9ffdf39727080d30833b1cbe37bd159be91eed4878f7e5","source":{"kind":"arxiv","id":"2507.13511","version":1},"attestation_state":"computed","paper":{"title":"GraphTrafficGPT: Enhancing Traffic Management Through Graph-Based AI Agent Coordination","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdolazim Rezaei, Mehdi Sookhak, Nabil Abdelaziz Ferhat Taleb, Raj Atulkumar Patel","submitted_at":"2025-07-17T19:41:09Z","abstract_excerpt":"Large Language Models (LLMs) offer significant promise for intelligent traffic management; however, current chain-based systems like TrafficGPT are hindered by sequential task execution, high token usage, and poor scalability, making them inefficient for complex, real-world scenarios. To address these limitations, we propose GraphTrafficGPT, a novel graph-based architecture, which fundamentally redesigns the task coordination process for LLM-driven traffic applications. GraphTrafficGPT represents tasks and their dependencies as nodes and edges in a directed graph, enabling efficient parallel e"},"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":"2507.13511","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-17T19:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"409a60ae70e3a73f23c5b0cc24ba0dd080c049a1bb42d00df654156d554b9b73","abstract_canon_sha256":"f62ab6857093f579c95f202134ccf0ab8b8f43f8f99c01494cad478775b049db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:18.477116Z","signature_b64":"0A5vUz/E9nPmlZYMaBSQx3DF6KcD3WRtbWzLf2f/CEYfMxNAK5ser+x22r0rut8rVDiC3tU4PqZD+GmslxNWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e2422cc3a62e1516d9ffdf39727080d30833b1cbe37bd159be91eed4878f7e5","last_reissued_at":"2026-07-05T11:39:18.476689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:18.476689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphTrafficGPT: Enhancing Traffic Management Through Graph-Based AI Agent Coordination","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abdolazim Rezaei, Mehdi Sookhak, Nabil Abdelaziz Ferhat Taleb, Raj Atulkumar Patel","submitted_at":"2025-07-17T19:41:09Z","abstract_excerpt":"Large Language Models (LLMs) offer significant promise for intelligent traffic management; however, current chain-based systems like TrafficGPT are hindered by sequential task execution, high token usage, and poor scalability, making them inefficient for complex, real-world scenarios. To address these limitations, we propose GraphTrafficGPT, a novel graph-based architecture, which fundamentally redesigns the task coordination process for LLM-driven traffic applications. GraphTrafficGPT represents tasks and their dependencies as nodes and edges in a directed graph, enabling efficient parallel e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13511","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/2507.13511/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":"2507.13511","created_at":"2026-07-05T11:39:18.476738+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13511v1","created_at":"2026-07-05T11:39:18.476738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13511","created_at":"2026-07-05T11:39:18.476738+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYSCFTB2MLQV","created_at":"2026-07-05T11:39:18.476738+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYSCFTB2MLQVC3M7","created_at":"2026-07-05T11:39:18.476738+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYSCFTB2","created_at":"2026-07-05T11:39:18.476738+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/DYSCFTB2MLQVC3M77XZZOJYIBU","json":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU.json","graph_json":"https://pith.science/api/pith-number/DYSCFTB2MLQVC3M77XZZOJYIBU/graph.json","events_json":"https://pith.science/api/pith-number/DYSCFTB2MLQVC3M77XZZOJYIBU/events.json","paper":"https://pith.science/paper/DYSCFTB2"},"agent_actions":{"view_html":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU","download_json":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU.json","view_paper":"https://pith.science/paper/DYSCFTB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13511&json=true","fetch_graph":"https://pith.science/api/pith-number/DYSCFTB2MLQVC3M77XZZOJYIBU/graph.json","fetch_events":"https://pith.science/api/pith-number/DYSCFTB2MLQVC3M77XZZOJYIBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU/action/storage_attestation","attest_author":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU/action/author_attestation","sign_citation":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU/action/citation_signature","submit_replication":"https://pith.science/pith/DYSCFTB2MLQVC3M77XZZOJYIBU/action/replication_record"}},"created_at":"2026-07-05T11:39:18.476738+00:00","updated_at":"2026-07-05T11:39:18.476738+00:00"}