{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FZO762VABC3WMNJVOCP3ULEQSC","short_pith_number":"pith:FZO762VA","canonical_record":{"source":{"id":"1709.04324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-13T13:40:08Z","cross_cats_sorted":[],"title_canon_sha256":"9c8f3fdb8465fe4b5cd5d12050c5cc827a8dcbb1874c96dfee522fc0eab594df","abstract_canon_sha256":"2c574c77191be90fcc511183b7ebf396736e3320916e501e7814a5eda7a3a175"},"schema_version":"1.0"},"canonical_sha256":"2e5dff6aa008b7663535709fba2c9090b1d399f1d8b8639003545210adcfffbc","source":{"kind":"arxiv","id":"1709.04324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04324","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04324v1","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04324","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"FZO762VABC3W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZO762VABC3WMNJV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZO762VA","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FZO762VABC3WMNJVOCP3ULEQSC","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-13T13:40:08Z","cross_cats_sorted":[],"title_canon_sha256":"9c8f3fdb8465fe4b5cd5d12050c5cc827a8dcbb1874c96dfee522fc0eab594df","abstract_canon_sha256":"2c574c77191be90fcc511183b7ebf396736e3320916e501e7814a5eda7a3a175"},"schema_version":"1.0"},"canonical_sha256":"2e5dff6aa008b7663535709fba2c9090b1d399f1d8b8639003545210adcfffbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:14.691548Z","signature_b64":"zyVXBzDjGlMCnLpDgcEDCo1lm4N/U+CFInbAdkZ+SFhY01DnMYy7fI3KANcAlKds7Gib4bXCK+gVVLMg3ocDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e5dff6aa008b7663535709fba2c9090b1d399f1d8b8639003545210adcfffbc","last_reissued_at":"2026-05-18T00:35:14.690889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:14.690889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04324","source_version":1,"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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4Y8cOK20wHSLddc4OmF75hbajxzXVK7FdLOWsS5mGacFWZGp+hNh2qxh7f/QBnaMG14ppj5/t50/xEpS2aXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:41:36.168173Z"},"content_sha256":"3ea440cc523ac7c0a5f7b25131aaf02fa7c45a76522277985a12a2b21c8c4864","schema_version":"1.0","event_id":"sha256:3ea440cc523ac7c0a5f7b25131aaf02fa7c45a76522277985a12a2b21c8c4864"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FZO762VABC3WMNJVOCP3ULEQSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A short-term planning model for high-speed train assignment and maintenance scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boliang Lin","submitted_at":"2017-09-13T13:40:08Z","abstract_excerpt":"This paper considers the simultaneous high-speed train assignment and maintenance scheduling problem. For the maintenance scheduling module, our focus is the second-level maintenance, which is carried out once a month on average. We propose a binary non-linear programming model to mathematically describe the problem. The objective aims to minimize the mileage losses for all high-speed trains and the constraints cover various operational requirements and capacity restrictions. To model the difficult operational requirements, a novel cumulative mileage update function is developed; meanwhile, to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04324","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"},"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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpDzqC3DAPlf/PyFG1dsWejq/kc9j99punAbHDy76kI/LMmab3k+uRr18ffMkBVyPnwD1CbKB3lml1A4Y2bWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:41:36.168526Z"},"content_sha256":"f7c965066f18ff26ba209920cdcfd9acdf1c8ea0caa6de96f848fd4e63823876","schema_version":"1.0","event_id":"sha256:f7c965066f18ff26ba209920cdcfd9acdf1c8ea0caa6de96f848fd4e63823876"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZO762VABC3WMNJVOCP3ULEQSC/bundle.json","state_url":"https://pith.science/pith/FZO762VABC3WMNJVOCP3ULEQSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZO762VABC3WMNJVOCP3ULEQSC/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-27T11:41:36Z","links":{"resolver":"https://pith.science/pith/FZO762VABC3WMNJVOCP3ULEQSC","bundle":"https://pith.science/pith/FZO762VABC3WMNJVOCP3ULEQSC/bundle.json","state":"https://pith.science/pith/FZO762VABC3WMNJVOCP3ULEQSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZO762VABC3WMNJVOCP3ULEQSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FZO762VABC3WMNJVOCP3ULEQSC","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":"2c574c77191be90fcc511183b7ebf396736e3320916e501e7814a5eda7a3a175","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-13T13:40:08Z","title_canon_sha256":"9c8f3fdb8465fe4b5cd5d12050c5cc827a8dcbb1874c96dfee522fc0eab594df"},"schema_version":"1.0","source":{"id":"1709.04324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04324","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04324v1","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04324","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"FZO762VABC3W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZO762VABC3WMNJV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZO762VA","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:f7c965066f18ff26ba209920cdcfd9acdf1c8ea0caa6de96f848fd4e63823876","target":"graph","created_at":"2026-05-18T00:35:14Z","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":"This paper considers the simultaneous high-speed train assignment and maintenance scheduling problem. For the maintenance scheduling module, our focus is the second-level maintenance, which is carried out once a month on average. We propose a binary non-linear programming model to mathematically describe the problem. The objective aims to minimize the mileage losses for all high-speed trains and the constraints cover various operational requirements and capacity restrictions. To model the difficult operational requirements, a novel cumulative mileage update function is developed; meanwhile, to","authors_text":"Boliang Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-13T13:40:08Z","title":"A short-term planning model for high-speed train assignment and maintenance scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04324","kind":"arxiv","version":1},"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:3ea440cc523ac7c0a5f7b25131aaf02fa7c45a76522277985a12a2b21c8c4864","target":"record","created_at":"2026-05-18T00:35:14Z","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":"2c574c77191be90fcc511183b7ebf396736e3320916e501e7814a5eda7a3a175","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-13T13:40:08Z","title_canon_sha256":"9c8f3fdb8465fe4b5cd5d12050c5cc827a8dcbb1874c96dfee522fc0eab594df"},"schema_version":"1.0","source":{"id":"1709.04324","kind":"arxiv","version":1}},"canonical_sha256":"2e5dff6aa008b7663535709fba2c9090b1d399f1d8b8639003545210adcfffbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e5dff6aa008b7663535709fba2c9090b1d399f1d8b8639003545210adcfffbc","first_computed_at":"2026-05-18T00:35:14.690889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:14.690889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zyVXBzDjGlMCnLpDgcEDCo1lm4N/U+CFInbAdkZ+SFhY01DnMYy7fI3KANcAlKds7Gib4bXCK+gVVLMg3ocDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:14.691548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ea440cc523ac7c0a5f7b25131aaf02fa7c45a76522277985a12a2b21c8c4864","sha256:f7c965066f18ff26ba209920cdcfd9acdf1c8ea0caa6de96f848fd4e63823876"],"state_sha256":"82e10112d72838a15b4f7a98d43fa0b1e808eed6e2002b29a053cca099384e51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vnsc7abOyQsHDpZ6KHGw+MUsHU/tklry6rYimkhQFuykmIaRTik4QmHFzCDqMY0qvpiLt7tYgLatQ/iIhrexCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T11:41:36.170414Z","bundle_sha256":"9bc1e7d3057eff4ea1ffb919fd371db459590fd3f1f8e92541edcb64cb0ee53b"}}