{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EHNNQS6L27PAZDVNGWLFLJE6FT","short_pith_number":"pith:EHNNQS6L","canonical_record":{"source":{"id":"1506.08243","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-27T00:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"91d63c28aeb6f2227e07e6bf3986332e148f635cfecbd95995fc082f0c40126c","abstract_canon_sha256":"f9f16e230252066d5cd31bc3192f11221a56f56bd727af3e975af5d2146e3fa4"},"schema_version":"1.0"},"canonical_sha256":"21dad84bcbd7de0c8ead359655a49e2cd1a7c92d2032b8c5aefffd919b140593","source":{"kind":"arxiv","id":"1506.08243","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08243","created_at":"2026-05-18T00:14:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08243v4","created_at":"2026-05-18T00:14:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08243","created_at":"2026-05-18T00:14:47Z"},{"alias_kind":"pith_short_12","alias_value":"EHNNQS6L27PA","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EHNNQS6L27PAZDVN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EHNNQS6L","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EHNNQS6L27PAZDVNGWLFLJE6FT","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08243","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-27T00:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"91d63c28aeb6f2227e07e6bf3986332e148f635cfecbd95995fc082f0c40126c","abstract_canon_sha256":"f9f16e230252066d5cd31bc3192f11221a56f56bd727af3e975af5d2146e3fa4"},"schema_version":"1.0"},"canonical_sha256":"21dad84bcbd7de0c8ead359655a49e2cd1a7c92d2032b8c5aefffd919b140593","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:47.974029Z","signature_b64":"cRgXz5GapharWubSA1aMr4byskd40bQjD1xbydyK/HHP3bgSlSktRxP1/IqlAxEuP85izg39T7g43cQYE34uAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21dad84bcbd7de0c8ead359655a49e2cd1a7c92d2032b8c5aefffd919b140593","last_reissued_at":"2026-05-18T00:14:47.973578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:47.973578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08243","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUZO/9otI6mPOgZg+MW7/bgXMt0u7412FQ0gGhtFuAOBbIJYHeYEZLhIwqzTxgTLGdTfNVFW391xPA9cyBQQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:52:04.554029Z"},"content_sha256":"26ff499ae952720d179c115ac510f5ded3735f329486b7b33a7e084ba72e3852","schema_version":"1.0","event_id":"sha256:26ff499ae952720d179c115ac510f5ded3735f329486b7b33a7e084ba72e3852"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EHNNQS6L27PAZDVNGWLFLJE6FT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-Step Linear Programming Model for Energy-Efficient Timetables in Metro Railway Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. Kevin Tobin, Lacra Pavel, Shuvomoy Das Gupta","submitted_at":"2015-06-27T00:38:56Z","abstract_excerpt":"In this paper we propose a novel two-step linear optimization model to calculate energy-efficient timetables in metro railway networks. The resultant timetable minimizes the total energy consumed by all trains and maximizes the utilization of regenerative energy produced by braking trains, subject to the constraints in the railway network. In contrast to other existing models, which are NP-hard, our model is computationally the most tractable one being a linear program. We apply our optimization model to different instances of service PES2-SFM2 of line 8 of Shanghai Metro network spanning a fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08243","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pr3srYz3WyUIHCfqxgAYSB+alT2tbhVsmuHEYd7PDVWov8GieIQOZM2JWS1/C7LlwACIsrwos7sj769EQRHSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:52:04.554398Z"},"content_sha256":"7635097bad44cd5accf6e000b65c264be708dd8aadb386a635f6cfd5d046b16f","schema_version":"1.0","event_id":"sha256:7635097bad44cd5accf6e000b65c264be708dd8aadb386a635f6cfd5d046b16f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHNNQS6L27PAZDVNGWLFLJE6FT/bundle.json","state_url":"https://pith.science/pith/EHNNQS6L27PAZDVNGWLFLJE6FT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHNNQS6L27PAZDVNGWLFLJE6FT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T11:52:04Z","links":{"resolver":"https://pith.science/pith/EHNNQS6L27PAZDVNGWLFLJE6FT","bundle":"https://pith.science/pith/EHNNQS6L27PAZDVNGWLFLJE6FT/bundle.json","state":"https://pith.science/pith/EHNNQS6L27PAZDVNGWLFLJE6FT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHNNQS6L27PAZDVNGWLFLJE6FT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EHNNQS6L27PAZDVNGWLFLJE6FT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f9f16e230252066d5cd31bc3192f11221a56f56bd727af3e975af5d2146e3fa4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-27T00:38:56Z","title_canon_sha256":"91d63c28aeb6f2227e07e6bf3986332e148f635cfecbd95995fc082f0c40126c"},"schema_version":"1.0","source":{"id":"1506.08243","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08243","created_at":"2026-05-18T00:14:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08243v4","created_at":"2026-05-18T00:14:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08243","created_at":"2026-05-18T00:14:47Z"},{"alias_kind":"pith_short_12","alias_value":"EHNNQS6L27PA","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EHNNQS6L27PAZDVN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EHNNQS6L","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:7635097bad44cd5accf6e000b65c264be708dd8aadb386a635f6cfd5d046b16f","target":"graph","created_at":"2026-05-18T00:14:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we propose a novel two-step linear optimization model to calculate energy-efficient timetables in metro railway networks. The resultant timetable minimizes the total energy consumed by all trains and maximizes the utilization of regenerative energy produced by braking trains, subject to the constraints in the railway network. In contrast to other existing models, which are NP-hard, our model is computationally the most tractable one being a linear program. We apply our optimization model to different instances of service PES2-SFM2 of line 8 of Shanghai Metro network spanning a fu","authors_text":"J. Kevin Tobin, Lacra Pavel, Shuvomoy Das Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-27T00:38:56Z","title":"A Two-Step Linear Programming Model for Energy-Efficient Timetables in Metro Railway Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08243","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:26ff499ae952720d179c115ac510f5ded3735f329486b7b33a7e084ba72e3852","target":"record","created_at":"2026-05-18T00:14:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f9f16e230252066d5cd31bc3192f11221a56f56bd727af3e975af5d2146e3fa4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-27T00:38:56Z","title_canon_sha256":"91d63c28aeb6f2227e07e6bf3986332e148f635cfecbd95995fc082f0c40126c"},"schema_version":"1.0","source":{"id":"1506.08243","kind":"arxiv","version":4}},"canonical_sha256":"21dad84bcbd7de0c8ead359655a49e2cd1a7c92d2032b8c5aefffd919b140593","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21dad84bcbd7de0c8ead359655a49e2cd1a7c92d2032b8c5aefffd919b140593","first_computed_at":"2026-05-18T00:14:47.973578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:47.973578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cRgXz5GapharWubSA1aMr4byskd40bQjD1xbydyK/HHP3bgSlSktRxP1/IqlAxEuP85izg39T7g43cQYE34uAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:47.974029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08243","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26ff499ae952720d179c115ac510f5ded3735f329486b7b33a7e084ba72e3852","sha256:7635097bad44cd5accf6e000b65c264be708dd8aadb386a635f6cfd5d046b16f"],"state_sha256":"aeaa4e1df2c65936ff1470e13487f6ccef5fedcbb947280445114b2f299f4f07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0nWT4jk2oW6dl0FwnAuqrXZxqGIPobveP3bR5CFTrK/lYux1imocIRUJPJ315PznYNfSxjif4lJ3RaUEFfgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:52:04.556673Z","bundle_sha256":"6ee47e0f41bdd7a4582cab0db11e489209e1c696413f3137472e6f1e56a8d0cd"}}