{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KS7JB6XS7DVA33TCEPKHDMHP7F","short_pith_number":"pith:KS7JB6XS","canonical_record":{"source":{"id":"1707.08326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-26T09:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"6fedd0dc1bb1e156349038d58f94262be43d1c485d0ba87f47772509397a80bc","abstract_canon_sha256":"6beafccb0e9a8c5dfd1d0ca32cab8c47771b0c558708bbf10ff993675e57bf1f"},"schema_version":"1.0"},"canonical_sha256":"54be90faf2f8ea0dee6223d471b0eff952425cbd4d96b609032e6918facc0bd6","source":{"kind":"arxiv","id":"1707.08326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08326","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08326v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08326","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"KS7JB6XS7DVA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KS7JB6XS7DVA33TC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KS7JB6XS","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KS7JB6XS7DVA33TCEPKHDMHP7F","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-26T09:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"6fedd0dc1bb1e156349038d58f94262be43d1c485d0ba87f47772509397a80bc","abstract_canon_sha256":"6beafccb0e9a8c5dfd1d0ca32cab8c47771b0c558708bbf10ff993675e57bf1f"},"schema_version":"1.0"},"canonical_sha256":"54be90faf2f8ea0dee6223d471b0eff952425cbd4d96b609032e6918facc0bd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.578206Z","signature_b64":"pe51Aj4VL8DM0bd4HMoySIxbd5MYLyMItnAxFdCu4G4BmK56hqBnS2ZZA8tzq0X8+7ES0cuB2YW/f5iT9i6iBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54be90faf2f8ea0dee6223d471b0eff952425cbd4d96b609032e6918facc0bd6","last_reissued_at":"2026-05-18T00:39:24.577552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.577552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08326","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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k988Pw4PrbC72nOEvDW3Pc2rdsMKrKNwVa26oD3hKWviZcKTzPRkyZDrYoLGsZHrBiK3kbHiXjhGyOusa82tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:43:39.149670Z"},"content_sha256":"8409d1adab87bdf95fe62a7cf02a28340da7f9723b4d3d08d534b1fc48d97e49","schema_version":"1.0","event_id":"sha256:8409d1adab87bdf95fe62a7cf02a28340da7f9723b4d3d08d534b1fc48d97e49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KS7JB6XS7DVA33TCEPKHDMHP7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integrating car path optimization with train formation plan: a non-linear binary programming model and simulated annealing based heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boliang Lin","submitted_at":"2017-07-26T09:08:41Z","abstract_excerpt":"An essential issue that a freight transportation system faced is how to deliver shipments (OD pairs) on a capacitated physical network optimally; that is, to determine the best physical path for each OD pair and assign each OD pair into the most reasonable freight train service sequence. Instead of pre-specifying or pre-solving the railcar routing beforehand and optimizing the train formation plan subsequently, which is a standard practice in China railway system and a widely used method in existing literature to reduce the problem complexity, this paper proposes a non-linear binary programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08326","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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBCqb6xODF3wq9Pv303ktDlcdYOqSLHdMJGO0PJJSMnTmUfh1F6WpDgUN2MuMC1eoHUcDMf8Z2AsHdDgaud1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T11:43:39.150019Z"},"content_sha256":"5012131fe702050cc38e32c17247534cabedd0b5b3eb5e576180c83a39d83110","schema_version":"1.0","event_id":"sha256:5012131fe702050cc38e32c17247534cabedd0b5b3eb5e576180c83a39d83110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KS7JB6XS7DVA33TCEPKHDMHP7F/bundle.json","state_url":"https://pith.science/pith/KS7JB6XS7DVA33TCEPKHDMHP7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KS7JB6XS7DVA33TCEPKHDMHP7F/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:43:39Z","links":{"resolver":"https://pith.science/pith/KS7JB6XS7DVA33TCEPKHDMHP7F","bundle":"https://pith.science/pith/KS7JB6XS7DVA33TCEPKHDMHP7F/bundle.json","state":"https://pith.science/pith/KS7JB6XS7DVA33TCEPKHDMHP7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KS7JB6XS7DVA33TCEPKHDMHP7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KS7JB6XS7DVA33TCEPKHDMHP7F","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":"6beafccb0e9a8c5dfd1d0ca32cab8c47771b0c558708bbf10ff993675e57bf1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-26T09:08:41Z","title_canon_sha256":"6fedd0dc1bb1e156349038d58f94262be43d1c485d0ba87f47772509397a80bc"},"schema_version":"1.0","source":{"id":"1707.08326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08326","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08326v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08326","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"KS7JB6XS7DVA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KS7JB6XS7DVA33TC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KS7JB6XS","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5012131fe702050cc38e32c17247534cabedd0b5b3eb5e576180c83a39d83110","target":"graph","created_at":"2026-05-18T00:39:24Z","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":"An essential issue that a freight transportation system faced is how to deliver shipments (OD pairs) on a capacitated physical network optimally; that is, to determine the best physical path for each OD pair and assign each OD pair into the most reasonable freight train service sequence. Instead of pre-specifying or pre-solving the railcar routing beforehand and optimizing the train formation plan subsequently, which is a standard practice in China railway system and a widely used method in existing literature to reduce the problem complexity, this paper proposes a non-linear binary programmin","authors_text":"Boliang Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-26T09:08:41Z","title":"Integrating car path optimization with train formation plan: a non-linear binary programming model and simulated annealing based heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08326","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:8409d1adab87bdf95fe62a7cf02a28340da7f9723b4d3d08d534b1fc48d97e49","target":"record","created_at":"2026-05-18T00:39:24Z","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":"6beafccb0e9a8c5dfd1d0ca32cab8c47771b0c558708bbf10ff993675e57bf1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-26T09:08:41Z","title_canon_sha256":"6fedd0dc1bb1e156349038d58f94262be43d1c485d0ba87f47772509397a80bc"},"schema_version":"1.0","source":{"id":"1707.08326","kind":"arxiv","version":1}},"canonical_sha256":"54be90faf2f8ea0dee6223d471b0eff952425cbd4d96b609032e6918facc0bd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54be90faf2f8ea0dee6223d471b0eff952425cbd4d96b609032e6918facc0bd6","first_computed_at":"2026-05-18T00:39:24.577552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:24.577552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pe51Aj4VL8DM0bd4HMoySIxbd5MYLyMItnAxFdCu4G4BmK56hqBnS2ZZA8tzq0X8+7ES0cuB2YW/f5iT9i6iBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:24.578206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8409d1adab87bdf95fe62a7cf02a28340da7f9723b4d3d08d534b1fc48d97e49","sha256:5012131fe702050cc38e32c17247534cabedd0b5b3eb5e576180c83a39d83110"],"state_sha256":"3e67af095644c72dfe63e65737f0cc4633106806682508876b0029712710df51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1eTuvBWi2Kb+xITp4Ce3I75vt7wjG3d2Vkm1D5yDFylDYmf6CoXHyZOHnrj+nWw4RJbVQvHN5Qx/pVTKl/MAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T11:43:39.152757Z","bundle_sha256":"65e646feadc117622b60f33839ba618ee874df36d363320dce314bc74c55e9d8"}}