{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JIO7YV6CSFIQGZWV4Q722U7OO7","short_pith_number":"pith:JIO7YV6C","schema_version":"1.0","canonical_sha256":"4a1dfc57c291510366d5e43fad53ee77f60d1960225011ee02d064609d6406ff","source":{"kind":"arxiv","id":"2505.22241","version":1},"attestation_state":"computed","paper":{"title":"An Exact System Optimum Assignment Model for Transit Demand Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel D. Harabor, Mark Wallace, Xia Zhou, Zhenliang Ma","submitted_at":"2025-05-28T11:22:41Z","abstract_excerpt":"Mass transit systems are experiencing increasing congestion in many cities. The schedule-based transit assignment problem (STAP) involves a joint choice model for departure times and routes, defining a space-time path in which passengers decide when to depart and which route to take. User equilibrium (UE) models for the STAP indicates the current congestion cost, while a system optimum (SO) models can provide insights for congestion relief directions. However, current STAP methods rely on approximate SO (Approx. SO) models, which underestimate the potential for congestion reduction in the syst"},"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":"2505.22241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-28T11:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"d45f802d6963d19c06b8d1400fc6602ba07a1c478876972c61f4b1df99fdb151","abstract_canon_sha256":"e3a3bb1ee0f106fdda9f688430d4bfa981c9a19ff17357d757ccb5190ca6354a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:11.794679Z","signature_b64":"ZjM7pMSC6sQU1E6JVY+5eYP9IS9zU1vknS2zOfQVI3ZrRqQdMxL6S91AqO4+RDJLrPshjkovdbO7rkLtBi3QAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a1dfc57c291510366d5e43fad53ee77f60d1960225011ee02d064609d6406ff","last_reissued_at":"2026-07-05T11:11:11.794252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:11.794252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exact System Optimum Assignment Model for Transit Demand Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel D. Harabor, Mark Wallace, Xia Zhou, Zhenliang Ma","submitted_at":"2025-05-28T11:22:41Z","abstract_excerpt":"Mass transit systems are experiencing increasing congestion in many cities. The schedule-based transit assignment problem (STAP) involves a joint choice model for departure times and routes, defining a space-time path in which passengers decide when to depart and which route to take. User equilibrium (UE) models for the STAP indicates the current congestion cost, while a system optimum (SO) models can provide insights for congestion relief directions. However, current STAP methods rely on approximate SO (Approx. SO) models, which underestimate the potential for congestion reduction in the syst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22241","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.22241/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":"2505.22241","created_at":"2026-07-05T11:11:11.794309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22241v1","created_at":"2026-07-05T11:11:11.794309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22241","created_at":"2026-07-05T11:11:11.794309+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIO7YV6CSFIQ","created_at":"2026-07-05T11:11:11.794309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIO7YV6CSFIQGZWV","created_at":"2026-07-05T11:11:11.794309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIO7YV6C","created_at":"2026-07-05T11:11:11.794309+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/JIO7YV6CSFIQGZWV4Q722U7OO7","json":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7.json","graph_json":"https://pith.science/api/pith-number/JIO7YV6CSFIQGZWV4Q722U7OO7/graph.json","events_json":"https://pith.science/api/pith-number/JIO7YV6CSFIQGZWV4Q722U7OO7/events.json","paper":"https://pith.science/paper/JIO7YV6C"},"agent_actions":{"view_html":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7","download_json":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7.json","view_paper":"https://pith.science/paper/JIO7YV6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22241&json=true","fetch_graph":"https://pith.science/api/pith-number/JIO7YV6CSFIQGZWV4Q722U7OO7/graph.json","fetch_events":"https://pith.science/api/pith-number/JIO7YV6CSFIQGZWV4Q722U7OO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7/action/storage_attestation","attest_author":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7/action/author_attestation","sign_citation":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7/action/citation_signature","submit_replication":"https://pith.science/pith/JIO7YV6CSFIQGZWV4Q722U7OO7/action/replication_record"}},"created_at":"2026-07-05T11:11:11.794309+00:00","updated_at":"2026-07-05T11:11:11.794309+00:00"}