{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HMSXK3IKQRVEYULYGMLAO4VLFL","short_pith_number":"pith:HMSXK3IK","schema_version":"1.0","canonical_sha256":"3b25756d0a846a4c517833160772ab2ade2d12b19ab4411d6644782f6baddee6","source":{"kind":"arxiv","id":"2010.03289","version":2},"attestation_state":"computed","paper":{"title":"QarSUMO: A Parallel, Congestion-optimized Traffic Simulator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giovanna Vantini, Hao Chen, Ke Yang, Phillip Taylor, Sanjay Chawla, Stefano Giovanni Rizzo, Xiaosong Ma","submitted_at":"2020-10-07T09:10:42Z","abstract_excerpt":"Traffic simulators are important tools for tasks such as urban planning and transportation management. Microscopic simulators allow per-vehicle movement simulation, but require longer simulation time. The simulation overhead is exacerbated when there is traffic congestion and most vehicles move slowly. This in particular hurts the productivity of emerging urban computing studies based on reinforcement learning, where traffic simulations are heavily and repeatedly used for designing policies to optimize traffic related tasks.\n  In this paper, we develop QarSUMO, a parallel, congestion-optimized"},"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":"2010.03289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-10-07T09:10:42Z","cross_cats_sorted":[],"title_canon_sha256":"f82c368a70a865e5a5ea8584c385c43d3ae014cd06e0e15ee480f0931f0fce2f","abstract_canon_sha256":"bc7dc5e8bea28ae2d67b37a3532659a945c547c42f14ddce3902b0910c83baad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:06.463545Z","signature_b64":"REj2wEFi4qIVBw2EbNlMxV5Qis9D1/rUL3FBd2jZB4SOcp5+93aPVsxlTpr0g/N0fZdxo8KHEOxFNcI+99JQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b25756d0a846a4c517833160772ab2ade2d12b19ab4411d6644782f6baddee6","last_reissued_at":"2026-07-05T01:45:06.463067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:06.463067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QarSUMO: A Parallel, Congestion-optimized Traffic Simulator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giovanna Vantini, Hao Chen, Ke Yang, Phillip Taylor, Sanjay Chawla, Stefano Giovanni Rizzo, Xiaosong Ma","submitted_at":"2020-10-07T09:10:42Z","abstract_excerpt":"Traffic simulators are important tools for tasks such as urban planning and transportation management. Microscopic simulators allow per-vehicle movement simulation, but require longer simulation time. The simulation overhead is exacerbated when there is traffic congestion and most vehicles move slowly. This in particular hurts the productivity of emerging urban computing studies based on reinforcement learning, where traffic simulations are heavily and repeatedly used for designing policies to optimize traffic related tasks.\n  In this paper, we develop QarSUMO, a parallel, congestion-optimized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03289","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/2010.03289/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":"2010.03289","created_at":"2026-07-05T01:45:06.463125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.03289v2","created_at":"2026-07-05T01:45:06.463125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03289","created_at":"2026-07-05T01:45:06.463125+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMSXK3IKQRVE","created_at":"2026-07-05T01:45:06.463125+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMSXK3IKQRVEYULY","created_at":"2026-07-05T01:45:06.463125+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMSXK3IK","created_at":"2026-07-05T01:45:06.463125+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/HMSXK3IKQRVEYULYGMLAO4VLFL","json":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL.json","graph_json":"https://pith.science/api/pith-number/HMSXK3IKQRVEYULYGMLAO4VLFL/graph.json","events_json":"https://pith.science/api/pith-number/HMSXK3IKQRVEYULYGMLAO4VLFL/events.json","paper":"https://pith.science/paper/HMSXK3IK"},"agent_actions":{"view_html":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL","download_json":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL.json","view_paper":"https://pith.science/paper/HMSXK3IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.03289&json=true","fetch_graph":"https://pith.science/api/pith-number/HMSXK3IKQRVEYULYGMLAO4VLFL/graph.json","fetch_events":"https://pith.science/api/pith-number/HMSXK3IKQRVEYULYGMLAO4VLFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL/action/storage_attestation","attest_author":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL/action/author_attestation","sign_citation":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL/action/citation_signature","submit_replication":"https://pith.science/pith/HMSXK3IKQRVEYULYGMLAO4VLFL/action/replication_record"}},"created_at":"2026-07-05T01:45:06.463125+00:00","updated_at":"2026-07-05T01:45:06.463125+00:00"}