{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:55SGOYFW2AI7XJYCPV32AD7ZPQ","short_pith_number":"pith:55SGOYFW","schema_version":"1.0","canonical_sha256":"ef646760b6d011fba7027d77a00ff97c2f10be11ab2b105a79aa00e1871631df","source":{"kind":"arxiv","id":"2408.14185","version":1},"attestation_state":"computed","paper":{"title":"DynamicRouteGPT: A Real-Time Multi-Vehicle Dynamic Navigation Framework Based on Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Bin Zhou, Hao Liu, Ziai Zhou","submitted_at":"2024-08-26T11:19:58Z","abstract_excerpt":"Real-time dynamic path planning in complex traffic environments presents challenges, such as varying traffic volumes and signal wait times. Traditional static routing algorithms like Dijkstra and A* compute shortest paths but often fail under dynamic conditions. Recent Reinforcement Learning (RL) approaches offer improvements but tend to focus on local optima, risking dead-ends or boundary issues. This paper proposes a novel approach based on causal inference for real-time dynamic path planning, balancing global and local optimality. We first use the static Dijkstra algorithm to compute a glob"},"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":"2408.14185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-26T11:19:58Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"d57ab83f720acd8ad58af98b06bcb1fdf1084f9b1d181e9f455ccf2e693b91b3","abstract_canon_sha256":"e7ded64e499d7c20ec2749a309689129061a71a1d8666f289a87174e3f5b4e63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:17.437811Z","signature_b64":"v27/jMdufVVSsQPC+FrTixrA0TCKsZoi84PAYMY+4vZoToxQgmF1htDTwLwVt97KgeDG4Dmuxe07dmgmlKM9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef646760b6d011fba7027d77a00ff97c2f10be11ab2b105a79aa00e1871631df","last_reissued_at":"2026-07-05T08:59:17.437357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:17.437357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DynamicRouteGPT: A Real-Time Multi-Vehicle Dynamic Navigation Framework Based on Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Bin Zhou, Hao Liu, Ziai Zhou","submitted_at":"2024-08-26T11:19:58Z","abstract_excerpt":"Real-time dynamic path planning in complex traffic environments presents challenges, such as varying traffic volumes and signal wait times. Traditional static routing algorithms like Dijkstra and A* compute shortest paths but often fail under dynamic conditions. Recent Reinforcement Learning (RL) approaches offer improvements but tend to focus on local optima, risking dead-ends or boundary issues. This paper proposes a novel approach based on causal inference for real-time dynamic path planning, balancing global and local optimality. We first use the static Dijkstra algorithm to compute a glob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14185","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/2408.14185/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":"2408.14185","created_at":"2026-07-05T08:59:17.437419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.14185v1","created_at":"2026-07-05T08:59:17.437419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14185","created_at":"2026-07-05T08:59:17.437419+00:00"},{"alias_kind":"pith_short_12","alias_value":"55SGOYFW2AI7","created_at":"2026-07-05T08:59:17.437419+00:00"},{"alias_kind":"pith_short_16","alias_value":"55SGOYFW2AI7XJYC","created_at":"2026-07-05T08:59:17.437419+00:00"},{"alias_kind":"pith_short_8","alias_value":"55SGOYFW","created_at":"2026-07-05T08:59:17.437419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03381","citing_title":"Automated Traffic Incident Response Plans using Generative Artificial Intelligence: Part 1 -- Building the Incident Response Benchmark","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ","json":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ.json","graph_json":"https://pith.science/api/pith-number/55SGOYFW2AI7XJYCPV32AD7ZPQ/graph.json","events_json":"https://pith.science/api/pith-number/55SGOYFW2AI7XJYCPV32AD7ZPQ/events.json","paper":"https://pith.science/paper/55SGOYFW"},"agent_actions":{"view_html":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ","download_json":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ.json","view_paper":"https://pith.science/paper/55SGOYFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.14185&json=true","fetch_graph":"https://pith.science/api/pith-number/55SGOYFW2AI7XJYCPV32AD7ZPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/55SGOYFW2AI7XJYCPV32AD7ZPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ/action/storage_attestation","attest_author":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ/action/author_attestation","sign_citation":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ/action/citation_signature","submit_replication":"https://pith.science/pith/55SGOYFW2AI7XJYCPV32AD7ZPQ/action/replication_record"}},"created_at":"2026-07-05T08:59:17.437419+00:00","updated_at":"2026-07-05T08:59:17.437419+00:00"}