{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HORTJQ5DGCEQMKNY3UNUT5SNWD","short_pith_number":"pith:HORTJQ5D","schema_version":"1.0","canonical_sha256":"3ba334c3a330890629b8dd1b49f64db0f3eb80326e72407d459fdd43b035939d","source":{"kind":"arxiv","id":"1906.04739","version":1},"attestation_state":"computed","paper":{"title":"Trip Table Estimation and Prediction for Dynamic Traffic Assignment Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"eess.SP","authors_text":"Adriana-Simona Mihaita, Chen Cai, Sajjad Shafiei","submitted_at":"2019-06-11T13:42:12Z","abstract_excerpt":"The study focuses on estimating and predicting time-varying origin to destination (OD) trip tables for a dynamic traffic assignment (DTA) model. A bi-level optimisation problem is formulated and solved to estimate OD flows from pre-existent demand matrix and historical traffic flow counts. The estimated demand is then considered as an input for a time series OD demand prediction model to support the DTA model for short-term traffic condition forecasting. Results show a high capability of the proposed OD demand estimation method to reduce the DTA model error through an iterative solution algori"},"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":"1906.04739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-06-11T13:42:12Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"40722a1a600c50a5a397fe236e67294a8d0996a43e9d2d72b0bcef6f2ba58cfb","abstract_canon_sha256":"cc13877308945469b53e498103343a8acfbd90f2919b921e438e327788e8e684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:32.359169Z","signature_b64":"XtPAdYvXTGfs3FpY/5gavcMtSZF0knHeY5U4DszyCMvsIjIv3p/dtkOHrv/CqMehbzVx2zJ7gLfEvMZO9zEfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba334c3a330890629b8dd1b49f64db0f3eb80326e72407d459fdd43b035939d","last_reissued_at":"2026-05-17T23:43:32.358640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:32.358640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trip Table Estimation and Prediction for Dynamic Traffic Assignment Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"eess.SP","authors_text":"Adriana-Simona Mihaita, Chen Cai, Sajjad Shafiei","submitted_at":"2019-06-11T13:42:12Z","abstract_excerpt":"The study focuses on estimating and predicting time-varying origin to destination (OD) trip tables for a dynamic traffic assignment (DTA) model. A bi-level optimisation problem is formulated and solved to estimate OD flows from pre-existent demand matrix and historical traffic flow counts. The estimated demand is then considered as an input for a time series OD demand prediction model to support the DTA model for short-term traffic condition forecasting. Results show a high capability of the proposed OD demand estimation method to reduce the DTA model error through an iterative solution algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04739","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":"1906.04739","created_at":"2026-05-17T23:43:32.358715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.04739v1","created_at":"2026-05-17T23:43:32.358715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04739","created_at":"2026-05-17T23:43:32.358715+00:00"},{"alias_kind":"pith_short_12","alias_value":"HORTJQ5DGCEQ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HORTJQ5DGCEQMKNY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HORTJQ5D","created_at":"2026-05-18T12:33:18.533446+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/HORTJQ5DGCEQMKNY3UNUT5SNWD","json":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD.json","graph_json":"https://pith.science/api/pith-number/HORTJQ5DGCEQMKNY3UNUT5SNWD/graph.json","events_json":"https://pith.science/api/pith-number/HORTJQ5DGCEQMKNY3UNUT5SNWD/events.json","paper":"https://pith.science/paper/HORTJQ5D"},"agent_actions":{"view_html":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD","download_json":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD.json","view_paper":"https://pith.science/paper/HORTJQ5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.04739&json=true","fetch_graph":"https://pith.science/api/pith-number/HORTJQ5DGCEQMKNY3UNUT5SNWD/graph.json","fetch_events":"https://pith.science/api/pith-number/HORTJQ5DGCEQMKNY3UNUT5SNWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD/action/storage_attestation","attest_author":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD/action/author_attestation","sign_citation":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD/action/citation_signature","submit_replication":"https://pith.science/pith/HORTJQ5DGCEQMKNY3UNUT5SNWD/action/replication_record"}},"created_at":"2026-05-17T23:43:32.358715+00:00","updated_at":"2026-05-17T23:43:32.358715+00:00"}