{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YS4RFFXFFLKDMEOAELWN5DQUB4","short_pith_number":"pith:YS4RFFXF","schema_version":"1.0","canonical_sha256":"c4b91296e52ad43611c022ecde8e140f02a3daed12b7e90ad82d17a62741017b","source":{"kind":"arxiv","id":"2104.12911","version":2},"attestation_state":"computed","paper":{"title":"Quasi-Dynamic Traffic Assignment using High Performance Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Keimer, Alexandre Bayen, Anu Kuncheria, Bingyu Zhao, Bin Wang, Cy Chan, Jane Macfarlane, Theophile Cabannes","submitted_at":"2021-04-26T23:36:49Z","abstract_excerpt":"Traffic assignment methods are some of the key approaches used to model flow patterns that arise in transportation networks. Since static traffic assignment does not have a notion of time, it is not designed to represent temporal dynamics that arise as vehicles flow through the network and demand varies through the day. Dynamic traffic assignment methods attempt to resolve these issues, but require significant computational resources if modeling urban-scale regions (on the order of millions of links and vehicles) and often take days of compute time to complete. The focus of this work is two-fo"},"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":"2104.12911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-04-26T23:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"545c54054f226b8a8775c3d896789d5f3275ceaef4fa404ba140715fe8dc2925","abstract_canon_sha256":"8758d2768874cccd8802a617e9d3eb795605f67029342125f8e07b125739bfac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:41:32.582692Z","signature_b64":"LqL6dhw2KO3Qq9FS3b5JWaNMqJm+lteH80IFO88T5OSLJf5zs+jg5WGKZ1hRh7AN2w7p3v4qtj79OwlHo+96CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4b91296e52ad43611c022ecde8e140f02a3daed12b7e90ad82d17a62741017b","last_reissued_at":"2026-07-05T02:41:32.582269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:41:32.582269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Dynamic Traffic Assignment using High Performance Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Keimer, Alexandre Bayen, Anu Kuncheria, Bingyu Zhao, Bin Wang, Cy Chan, Jane Macfarlane, Theophile Cabannes","submitted_at":"2021-04-26T23:36:49Z","abstract_excerpt":"Traffic assignment methods are some of the key approaches used to model flow patterns that arise in transportation networks. Since static traffic assignment does not have a notion of time, it is not designed to represent temporal dynamics that arise as vehicles flow through the network and demand varies through the day. Dynamic traffic assignment methods attempt to resolve these issues, but require significant computational resources if modeling urban-scale regions (on the order of millions of links and vehicles) and often take days of compute time to complete. The focus of this work is two-fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12911","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/2104.12911/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":"2104.12911","created_at":"2026-07-05T02:41:32.582329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.12911v2","created_at":"2026-07-05T02:41:32.582329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12911","created_at":"2026-07-05T02:41:32.582329+00:00"},{"alias_kind":"pith_short_12","alias_value":"YS4RFFXFFLKD","created_at":"2026-07-05T02:41:32.582329+00:00"},{"alias_kind":"pith_short_16","alias_value":"YS4RFFXFFLKDMEOA","created_at":"2026-07-05T02:41:32.582329+00:00"},{"alias_kind":"pith_short_8","alias_value":"YS4RFFXF","created_at":"2026-07-05T02:41:32.582329+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/YS4RFFXFFLKDMEOAELWN5DQUB4","json":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4.json","graph_json":"https://pith.science/api/pith-number/YS4RFFXFFLKDMEOAELWN5DQUB4/graph.json","events_json":"https://pith.science/api/pith-number/YS4RFFXFFLKDMEOAELWN5DQUB4/events.json","paper":"https://pith.science/paper/YS4RFFXF"},"agent_actions":{"view_html":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4","download_json":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4.json","view_paper":"https://pith.science/paper/YS4RFFXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.12911&json=true","fetch_graph":"https://pith.science/api/pith-number/YS4RFFXFFLKDMEOAELWN5DQUB4/graph.json","fetch_events":"https://pith.science/api/pith-number/YS4RFFXFFLKDMEOAELWN5DQUB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4/action/storage_attestation","attest_author":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4/action/author_attestation","sign_citation":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4/action/citation_signature","submit_replication":"https://pith.science/pith/YS4RFFXFFLKDMEOAELWN5DQUB4/action/replication_record"}},"created_at":"2026-07-05T02:41:32.582329+00:00","updated_at":"2026-07-05T02:41:32.582329+00:00"}