{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BQCVPKWOHO2T4JTHWKUK77OCBQ","short_pith_number":"pith:BQCVPKWO","schema_version":"1.0","canonical_sha256":"0c0557aace3bb53e2667b2a8affdc20c0f82ca0611540902288397f487249678","source":{"kind":"arxiv","id":"2404.07446","version":2},"attestation_state":"computed","paper":{"title":"Graph Attention Network for Lane-Wise and Topology-Invariant Intersection Traffic Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Anand Rangarajan, Nooshin Yousefzadeh, Rahul Sengupta, Sanjay Ranka, Yashaswi Karnati","submitted_at":"2024-04-11T03:02:06Z","abstract_excerpt":"Traffic congestion has significant economic, environmental, and social ramifications. Intersection traffic flow dynamics are influenced by numerous factors. While microscopic traffic simulators are valuable tools, they are computationally intensive and challenging to calibrate. Moreover, existing machine-learning approaches struggle to provide lane-specific waveforms or adapt to intersection topology and traffic patterns. In this study, we propose two efficient and accurate \"Digital Twin\" models for intersections, leveraging Graph Attention Neural Networks (GAT). These attentional graph auto-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":"2404.07446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-11T03:02:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4f1ca753a732007e6f56757336c36e975b325ba221474150e2ff4812f90ce576","abstract_canon_sha256":"f0de8496f5ff40d9b0d355e26340d084f539cb3c7a5f64812643c24eea692d7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:23.315555Z","signature_b64":"LQaQhmbrbqi8ZCUgPW7pO8Una7HstbWty8V52Cosx1Wmk1EJOZA3Di0CYAhh+qD989kdUiIpyxfKwY6zLMs1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c0557aace3bb53e2667b2a8affdc20c0f82ca0611540902288397f487249678","last_reissued_at":"2026-07-05T08:14:23.315065Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:23.315065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Attention Network for Lane-Wise and Topology-Invariant Intersection Traffic Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Anand Rangarajan, Nooshin Yousefzadeh, Rahul Sengupta, Sanjay Ranka, Yashaswi Karnati","submitted_at":"2024-04-11T03:02:06Z","abstract_excerpt":"Traffic congestion has significant economic, environmental, and social ramifications. Intersection traffic flow dynamics are influenced by numerous factors. While microscopic traffic simulators are valuable tools, they are computationally intensive and challenging to calibrate. Moreover, existing machine-learning approaches struggle to provide lane-specific waveforms or adapt to intersection topology and traffic patterns. In this study, we propose two efficient and accurate \"Digital Twin\" models for intersections, leveraging Graph Attention Neural Networks (GAT). These attentional graph auto-e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07446","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/2404.07446/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":"2404.07446","created_at":"2026-07-05T08:14:23.315130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07446v2","created_at":"2026-07-05T08:14:23.315130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07446","created_at":"2026-07-05T08:14:23.315130+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQCVPKWOHO2T","created_at":"2026-07-05T08:14:23.315130+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQCVPKWOHO2T4JTH","created_at":"2026-07-05T08:14:23.315130+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQCVPKWO","created_at":"2026-07-05T08:14:23.315130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11095","citing_title":"Dynamic Graph Attention Networks for Travel Time Distribution Prediction in Urban Arterial Roads","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ","json":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ.json","graph_json":"https://pith.science/api/pith-number/BQCVPKWOHO2T4JTHWKUK77OCBQ/graph.json","events_json":"https://pith.science/api/pith-number/BQCVPKWOHO2T4JTHWKUK77OCBQ/events.json","paper":"https://pith.science/paper/BQCVPKWO"},"agent_actions":{"view_html":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ","download_json":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ.json","view_paper":"https://pith.science/paper/BQCVPKWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07446&json=true","fetch_graph":"https://pith.science/api/pith-number/BQCVPKWOHO2T4JTHWKUK77OCBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BQCVPKWOHO2T4JTHWKUK77OCBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ/action/storage_attestation","attest_author":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ/action/author_attestation","sign_citation":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ/action/citation_signature","submit_replication":"https://pith.science/pith/BQCVPKWOHO2T4JTHWKUK77OCBQ/action/replication_record"}},"created_at":"2026-07-05T08:14:23.315130+00:00","updated_at":"2026-07-05T08:14:23.315130+00:00"}