{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ONV3Z3I6LORYYOQMXWAAFF3QJ6","short_pith_number":"pith:ONV3Z3I6","schema_version":"1.0","canonical_sha256":"736bbced1e5ba38c3a0cbd800297704fb5fad7c37c7d6d3f2bae76cdb97d776b","source":{"kind":"arxiv","id":"2306.06455","version":1},"attestation_state":"computed","paper":{"title":"Scalable Rail Planning and Replanning with Soft Deadlines","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Daniel Harabor, Jiaoyang Li, Peter J. Stuckey, Zhe Chen","submitted_at":"2023-06-10T14:41:05Z","abstract_excerpt":"The Flatland Challenge, which was first held in 2019 and reported in NeurIPS 2020, is designed to answer the question: How to efficiently manage dense traffic on complex rail networks? Considering the significance of punctuality in real-world railway network operation and the fact that fast passenger trains share the network with slow freight trains, Flatland version 3 introduces trains with different speeds and scheduling time windows. This paper introduces the Flatland 3 problem definitions and extends an award-winning MAPF-based software, which won the NeurIPS 2020 competition, to efficient"},"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":"2306.06455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2023-06-10T14:41:05Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"a9b5d7eb64d88f8f3caa78361530facd9c5eba9245cf89c978e03a8ce074ea7c","abstract_canon_sha256":"165deab268aece54b2ebcf1a1fd61b76a66a086012f74079f28dea9497dd7244"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:25.004612Z","signature_b64":"qWsSW33HAstAJfSGyiy7rQXggQNwNDhqbnuShbWrrpeMgIEbTC/2hwEFm0srfff6cQpUO9NHz4xAecvWB45GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"736bbced1e5ba38c3a0cbd800297704fb5fad7c37c7d6d3f2bae76cdb97d776b","last_reissued_at":"2026-07-05T06:19:25.004166Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:25.004166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Rail Planning and Replanning with Soft Deadlines","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Daniel Harabor, Jiaoyang Li, Peter J. Stuckey, Zhe Chen","submitted_at":"2023-06-10T14:41:05Z","abstract_excerpt":"The Flatland Challenge, which was first held in 2019 and reported in NeurIPS 2020, is designed to answer the question: How to efficiently manage dense traffic on complex rail networks? Considering the significance of punctuality in real-world railway network operation and the fact that fast passenger trains share the network with slow freight trains, Flatland version 3 introduces trains with different speeds and scheduling time windows. This paper introduces the Flatland 3 problem definitions and extends an award-winning MAPF-based software, which won the NeurIPS 2020 competition, to efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06455","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/2306.06455/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":"2306.06455","created_at":"2026-07-05T06:19:25.004212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06455v1","created_at":"2026-07-05T06:19:25.004212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06455","created_at":"2026-07-05T06:19:25.004212+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONV3Z3I6LORY","created_at":"2026-07-05T06:19:25.004212+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONV3Z3I6LORYYOQM","created_at":"2026-07-05T06:19:25.004212+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONV3Z3I6","created_at":"2026-07-05T06:19:25.004212+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/ONV3Z3I6LORYYOQMXWAAFF3QJ6","json":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6.json","graph_json":"https://pith.science/api/pith-number/ONV3Z3I6LORYYOQMXWAAFF3QJ6/graph.json","events_json":"https://pith.science/api/pith-number/ONV3Z3I6LORYYOQMXWAAFF3QJ6/events.json","paper":"https://pith.science/paper/ONV3Z3I6"},"agent_actions":{"view_html":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6","download_json":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6.json","view_paper":"https://pith.science/paper/ONV3Z3I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06455&json=true","fetch_graph":"https://pith.science/api/pith-number/ONV3Z3I6LORYYOQMXWAAFF3QJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/ONV3Z3I6LORYYOQMXWAAFF3QJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6/action/storage_attestation","attest_author":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6/action/author_attestation","sign_citation":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6/action/citation_signature","submit_replication":"https://pith.science/pith/ONV3Z3I6LORYYOQMXWAAFF3QJ6/action/replication_record"}},"created_at":"2026-07-05T06:19:25.004212+00:00","updated_at":"2026-07-05T06:19:25.004212+00:00"}