{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QEM75EMXMUZXGW3ANPK2OVJ2XJ","short_pith_number":"pith:QEM75EMX","schema_version":"1.0","canonical_sha256":"8119fe91976533735b606bd5a7553aba60ceb671e63b37dac90d7afb9f562dae","source":{"kind":"arxiv","id":"1804.11026","version":1},"attestation_state":"computed","paper":{"title":"A unified software framework for solving traffic assignment problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandre Bayen, Emily Porter, Gabriel Gomes, Juliette Ugirumurera, Xiaoye S. Li","submitted_at":"2018-04-30T02:24:55Z","abstract_excerpt":"We describe a software framework for solving user equilibrium traffic assignment problems. The design is based on the formulation of the problem as a variational inequality. The software implements these as well as several numerical methods for find equilirbria. We compare the solutions obtained under several models: static, Merchant-Nemhauser, `CTM with instantaneous travel time', and `CTM with actual travel time'. Some important differences are demonstrated."},"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":"1804.11026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-30T02:24:55Z","cross_cats_sorted":[],"title_canon_sha256":"723d14b21b574dedaf520b2fdf4d3fe53193132d21c19944c134c3f8e3459cae","abstract_canon_sha256":"c3a00e2c01cde4221b4b3a604e83047a96c9931d2e52a51e0a9854dc85472f1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.851776Z","signature_b64":"fAueYpsrrt//yWNbjcPmyJSWYPizBJ4C1H4tIyt5rAqWsIUw3Cw1aSaIAOUHcgcX6jA6wTdkrB1wg2f43XrGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8119fe91976533735b606bd5a7553aba60ceb671e63b37dac90d7afb9f562dae","last_reissued_at":"2026-05-18T00:17:14.851265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.851265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified software framework for solving traffic assignment problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandre Bayen, Emily Porter, Gabriel Gomes, Juliette Ugirumurera, Xiaoye S. Li","submitted_at":"2018-04-30T02:24:55Z","abstract_excerpt":"We describe a software framework for solving user equilibrium traffic assignment problems. The design is based on the formulation of the problem as a variational inequality. The software implements these as well as several numerical methods for find equilirbria. We compare the solutions obtained under several models: static, Merchant-Nemhauser, `CTM with instantaneous travel time', and `CTM with actual travel time'. Some important differences are demonstrated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11026","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":""},"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":"1804.11026","created_at":"2026-05-18T00:17:14.851343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11026v1","created_at":"2026-05-18T00:17:14.851343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11026","created_at":"2026-05-18T00:17:14.851343+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEM75EMXMUZX","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEM75EMXMUZXGW3A","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEM75EMX","created_at":"2026-05-18T12:32:46.962924+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/QEM75EMXMUZXGW3ANPK2OVJ2XJ","json":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ.json","graph_json":"https://pith.science/api/pith-number/QEM75EMXMUZXGW3ANPK2OVJ2XJ/graph.json","events_json":"https://pith.science/api/pith-number/QEM75EMXMUZXGW3ANPK2OVJ2XJ/events.json","paper":"https://pith.science/paper/QEM75EMX"},"agent_actions":{"view_html":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ","download_json":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ.json","view_paper":"https://pith.science/paper/QEM75EMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11026&json=true","fetch_graph":"https://pith.science/api/pith-number/QEM75EMXMUZXGW3ANPK2OVJ2XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QEM75EMXMUZXGW3ANPK2OVJ2XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ/action/storage_attestation","attest_author":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ/action/author_attestation","sign_citation":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ/action/citation_signature","submit_replication":"https://pith.science/pith/QEM75EMXMUZXGW3ANPK2OVJ2XJ/action/replication_record"}},"created_at":"2026-05-18T00:17:14.851343+00:00","updated_at":"2026-05-18T00:17:14.851343+00:00"}