{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IZSJSVY5LTCSAVDLBIUPRPNCXE","short_pith_number":"pith:IZSJSVY5","canonical_record":{"source":{"id":"2507.22235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-29T21:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"4011d26fb9a934632d7a7a9f90bc23ac8843a11509981c4dfe4ae6e6da1a9d5e","abstract_canon_sha256":"459e76c4cccf08d752e52b47b8198a8eba3ce0157cf2957af50f92379b1de0a3"},"schema_version":"1.0"},"canonical_sha256":"466499571d5cc520546b0a28f8bda2b93ca69aaf81fc2b80841951949f6ab5a4","source":{"kind":"arxiv","id":"2507.22235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22235","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22235v1","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22235","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"pith_short_12","alias_value":"IZSJSVY5LTCS","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"pith_short_16","alias_value":"IZSJSVY5LTCSAVDL","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"pith_short_8","alias_value":"IZSJSVY5","created_at":"2026-07-05T11:45:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IZSJSVY5LTCSAVDLBIUPRPNCXE","target":"record","payload":{"canonical_record":{"source":{"id":"2507.22235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-29T21:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"4011d26fb9a934632d7a7a9f90bc23ac8843a11509981c4dfe4ae6e6da1a9d5e","abstract_canon_sha256":"459e76c4cccf08d752e52b47b8198a8eba3ce0157cf2957af50f92379b1de0a3"},"schema_version":"1.0"},"canonical_sha256":"466499571d5cc520546b0a28f8bda2b93ca69aaf81fc2b80841951949f6ab5a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:18.951220Z","signature_b64":"7xultJdoNiuf19HSujP2al8AEGwRI4kOBkegeLs/cFJUpwe9Fwymo3KBq7yhOoxvfijQ5lZ359QIEzL7D1hWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"466499571d5cc520546b0a28f8bda2b93ca69aaf81fc2b80841951949f6ab5a4","last_reissued_at":"2026-07-05T11:45:18.950654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:18.950654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.22235","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-07-05T11:45:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKBLB2e3AphPAvHcagzdbOSzFB7OE9k9K6AtP4YuNUU5FU/HAOZI2HLAqu9op2P6r1jvHUorJPhKrH1z8Rb/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:27:56.409952Z"},"content_sha256":"e6374c306b64249a8a7913e1941ce6fabde07c334b1666a85defa3267661b396","schema_version":"1.0","event_id":"sha256:e6374c306b64249a8a7913e1941ce6fabde07c334b1666a85defa3267661b396"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IZSJSVY5LTCSAVDLBIUPRPNCXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practice-Based Optimization for the Strategic Locomotive Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amira Hijazi, Kevin Dalmeijer, Pascal Van Hentenryck, Yunji Kim","submitted_at":"2025-07-29T21:07:36Z","abstract_excerpt":"This study addresses the challenge of efficiently assigning locomotives in large freight rail networks, where operational complexity and power imbalances make cost-effective planning difficult. It presents a strategic optimization framework for the Locomotive Assignment Problem (LAP), developed in collaboration with a major North American Class I Freight Railroad. The problem is formulated as a network-based integer program over a cyclic space-time network, producing a repeatable weekly locomotive assignment plan. The model captures a comprehensive set of real-world operational constraints and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22235","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/2507.22235/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"},"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-07-05T11:45:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yJhDHg1kJ68FJ7Q+H4r/mkjm6llB45Shb38+FLSMhcAd+vtUyN4jGXmRE/YkPGudGxyNW1NbmFd+DWlgtZWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:27:56.410898Z"},"content_sha256":"16696cdf690fdcc98c14aa3a38f7102464be86b2340bf55bdb8eb0b358d1b6b9","schema_version":"1.0","event_id":"sha256:16696cdf690fdcc98c14aa3a38f7102464be86b2340bf55bdb8eb0b358d1b6b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZSJSVY5LTCSAVDLBIUPRPNCXE/bundle.json","state_url":"https://pith.science/pith/IZSJSVY5LTCSAVDLBIUPRPNCXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZSJSVY5LTCSAVDLBIUPRPNCXE/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-08-11T01:27:56Z","links":{"resolver":"https://pith.science/pith/IZSJSVY5LTCSAVDLBIUPRPNCXE","bundle":"https://pith.science/pith/IZSJSVY5LTCSAVDLBIUPRPNCXE/bundle.json","state":"https://pith.science/pith/IZSJSVY5LTCSAVDLBIUPRPNCXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZSJSVY5LTCSAVDLBIUPRPNCXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IZSJSVY5LTCSAVDLBIUPRPNCXE","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":"459e76c4cccf08d752e52b47b8198a8eba3ce0157cf2957af50f92379b1de0a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-29T21:07:36Z","title_canon_sha256":"4011d26fb9a934632d7a7a9f90bc23ac8843a11509981c4dfe4ae6e6da1a9d5e"},"schema_version":"1.0","source":{"id":"2507.22235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22235","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22235v1","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22235","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"pith_short_12","alias_value":"IZSJSVY5LTCS","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"pith_short_16","alias_value":"IZSJSVY5LTCSAVDL","created_at":"2026-07-05T11:45:18Z"},{"alias_kind":"pith_short_8","alias_value":"IZSJSVY5","created_at":"2026-07-05T11:45:18Z"}],"graph_snapshots":[{"event_id":"sha256:16696cdf690fdcc98c14aa3a38f7102464be86b2340bf55bdb8eb0b358d1b6b9","target":"graph","created_at":"2026-07-05T11:45:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.22235/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This study addresses the challenge of efficiently assigning locomotives in large freight rail networks, where operational complexity and power imbalances make cost-effective planning difficult. It presents a strategic optimization framework for the Locomotive Assignment Problem (LAP), developed in collaboration with a major North American Class I Freight Railroad. The problem is formulated as a network-based integer program over a cyclic space-time network, producing a repeatable weekly locomotive assignment plan. The model captures a comprehensive set of real-world operational constraints and","authors_text":"Amira Hijazi, Kevin Dalmeijer, Pascal Van Hentenryck, Yunji Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-29T21:07:36Z","title":"Practice-Based Optimization for the Strategic Locomotive Assignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22235","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:e6374c306b64249a8a7913e1941ce6fabde07c334b1666a85defa3267661b396","target":"record","created_at":"2026-07-05T11:45:18Z","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":"459e76c4cccf08d752e52b47b8198a8eba3ce0157cf2957af50f92379b1de0a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-29T21:07:36Z","title_canon_sha256":"4011d26fb9a934632d7a7a9f90bc23ac8843a11509981c4dfe4ae6e6da1a9d5e"},"schema_version":"1.0","source":{"id":"2507.22235","kind":"arxiv","version":1}},"canonical_sha256":"466499571d5cc520546b0a28f8bda2b93ca69aaf81fc2b80841951949f6ab5a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"466499571d5cc520546b0a28f8bda2b93ca69aaf81fc2b80841951949f6ab5a4","first_computed_at":"2026-07-05T11:45:18.950654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:18.950654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7xultJdoNiuf19HSujP2al8AEGwRI4kOBkegeLs/cFJUpwe9Fwymo3KBq7yhOoxvfijQ5lZ359QIEzL7D1hWAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:18.951220Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.22235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6374c306b64249a8a7913e1941ce6fabde07c334b1666a85defa3267661b396","sha256:16696cdf690fdcc98c14aa3a38f7102464be86b2340bf55bdb8eb0b358d1b6b9"],"state_sha256":"e0d04963f7a537b7fc169a386a1e239793b32fa9e8bd838ad362a44409aa43ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dK3he6retUPZFZ0P8ehB97zaUwtn+T6jlukVwWQeFer8iPl1qXJxgcxtAxzPF5zMIoEEBOK/L0Ene52ExIPRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:27:56.418629Z","bundle_sha256":"853d1a5f739ff8c64e4f599f4549dfa8e9bd5c96617725420e717875c15e6a05"}}