{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TUXDP3ZBCF3VIVOVGZDZCJP455","short_pith_number":"pith:TUXDP3ZB","schema_version":"1.0","canonical_sha256":"9d2e37ef2111775455d536479125fcef62c790fb80451ef6cd4c8728f6fd0cee","source":{"kind":"arxiv","id":"2005.05783","version":2},"attestation_state":"computed","paper":{"title":"Modeling Route Choice with Real-Time Information: Comparing the Recursive and Non-Recursive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.AP"],"primary_cat":"eess.SY","authors_text":"Emma Frejinger, Jing Ding-Mastera, Song Gao, Tien Mai, Xinlian Yu","submitted_at":"2020-05-08T18:23:46Z","abstract_excerpt":"We study the routing policy choice problems in a stochastic time-dependent (STD) network. A routing policy is defined as a decision rule applied at the end of each link that maps the realized traffic condition to the decision on the link to take next. Two types of routing policy choice models are formulated with perfect online information (POI): recursive logit model and non-recursive logit model. In the non-recursive model, a choice set of routing policies between an origin-destination (OD) pair is generated, and a probabilistic choice is modeled at the origin, while the choice of the next li"},"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":"2005.05783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-05-08T18:23:46Z","cross_cats_sorted":["cs.SY","stat.AP"],"title_canon_sha256":"a1a6d7cdbf1fac0c94e56db67ac94610d62fff37c232c94cffc420afa2bfc970","abstract_canon_sha256":"204034156ca4cce9689d50a2e88bb10c31bd41b7b0408086a7f018b6ed33578c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:13.179935Z","signature_b64":"gAf3Vy0f3c5JxXydYpRo/poyB4lFogk4ATCyTOnISaieCaFm6JkwNhsJxRMXVV/jh5LPzDrXChZ2FhKvD/F1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d2e37ef2111775455d536479125fcef62c790fb80451ef6cd4c8728f6fd0cee","last_reissued_at":"2026-07-05T01:08:13.179538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:13.179538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Route Choice with Real-Time Information: Comparing the Recursive and Non-Recursive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.AP"],"primary_cat":"eess.SY","authors_text":"Emma Frejinger, Jing Ding-Mastera, Song Gao, Tien Mai, Xinlian Yu","submitted_at":"2020-05-08T18:23:46Z","abstract_excerpt":"We study the routing policy choice problems in a stochastic time-dependent (STD) network. A routing policy is defined as a decision rule applied at the end of each link that maps the realized traffic condition to the decision on the link to take next. Two types of routing policy choice models are formulated with perfect online information (POI): recursive logit model and non-recursive logit model. In the non-recursive model, a choice set of routing policies between an origin-destination (OD) pair is generated, and a probabilistic choice is modeled at the origin, while the choice of the next li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05783","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/2005.05783/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":"2005.05783","created_at":"2026-07-05T01:08:13.179595+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.05783v2","created_at":"2026-07-05T01:08:13.179595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05783","created_at":"2026-07-05T01:08:13.179595+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUXDP3ZBCF3V","created_at":"2026-07-05T01:08:13.179595+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUXDP3ZBCF3VIVOV","created_at":"2026-07-05T01:08:13.179595+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUXDP3ZB","created_at":"2026-07-05T01:08:13.179595+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/TUXDP3ZBCF3VIVOVGZDZCJP455","json":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455.json","graph_json":"https://pith.science/api/pith-number/TUXDP3ZBCF3VIVOVGZDZCJP455/graph.json","events_json":"https://pith.science/api/pith-number/TUXDP3ZBCF3VIVOVGZDZCJP455/events.json","paper":"https://pith.science/paper/TUXDP3ZB"},"agent_actions":{"view_html":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455","download_json":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455.json","view_paper":"https://pith.science/paper/TUXDP3ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.05783&json=true","fetch_graph":"https://pith.science/api/pith-number/TUXDP3ZBCF3VIVOVGZDZCJP455/graph.json","fetch_events":"https://pith.science/api/pith-number/TUXDP3ZBCF3VIVOVGZDZCJP455/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455/action/storage_attestation","attest_author":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455/action/author_attestation","sign_citation":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455/action/citation_signature","submit_replication":"https://pith.science/pith/TUXDP3ZBCF3VIVOVGZDZCJP455/action/replication_record"}},"created_at":"2026-07-05T01:08:13.179595+00:00","updated_at":"2026-07-05T01:08:13.179595+00:00"}