{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VTYSFXQEMKOTPWRB3U3M6CBQTS","short_pith_number":"pith:VTYSFXQE","canonical_record":{"source":{"id":"1712.05302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-14T15:56:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"86ff6b69c0823bcf8718adcd174068a8ffd861fe8704c14f75ffdbf389de9d87","abstract_canon_sha256":"bf76045f2ebfccc400262b5610049310daf4c5420ed7602d977ba0e2bfc62616"},"schema_version":"1.0"},"canonical_sha256":"acf122de04629d37da21dd36cf08309c878a06599d1d5795487d3456db28bafb","source":{"kind":"arxiv","id":"1712.05302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05302","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05302v1","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05302","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"VTYSFXQEMKOT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VTYSFXQEMKOTPWRB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VTYSFXQE","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VTYSFXQEMKOTPWRB3U3M6CBQTS","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-14T15:56:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"86ff6b69c0823bcf8718adcd174068a8ffd861fe8704c14f75ffdbf389de9d87","abstract_canon_sha256":"bf76045f2ebfccc400262b5610049310daf4c5420ed7602d977ba0e2bfc62616"},"schema_version":"1.0"},"canonical_sha256":"acf122de04629d37da21dd36cf08309c878a06599d1d5795487d3456db28bafb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:58.322380Z","signature_b64":"x1VqaDHCWbsXwQiB4QxC/uodhC3TRDfzGPVdZv0Oo7Xg+NL1tBQ2Zeal7DGBYRAsw3VRrkPP1OEBUOwEs2JYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf122de04629d37da21dd36cf08309c878a06599d1d5795487d3456db28bafb","last_reissued_at":"2026-05-18T00:27:58.321610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:58.321610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05302","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:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUmiGExCj9CeKNIpqInovlakwvMFUkAFgmn/+HH7ZDj3z1lLaG2o1KLphZWcDV/NNKA6Ab4uFChhpOxPBhzPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:03:07.726852Z"},"content_sha256":"4e799e44dad9ec24c99e1055d091d23b4a3654ac85d17d4e65c6769ccd763631","schema_version":"1.0","event_id":"sha256:4e799e44dad9ec24c99e1055d091d23b4a3654ac85d17d4e65c6769ccd763631"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VTYSFXQEMKOTPWRB3U3M6CBQTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Damla Kizilay, Deniz T. Eliiyi, Pascal Van Hentenryck","submitted_at":"2017-12-14T15:56:46Z","abstract_excerpt":"This paper considers the integrated problem of quay crane assignment, quay crane scheduling, yard location assignment, and vehicle dispatching operations at a container terminal. The main objective is to minimize vessel turnover times and maximize the terminal throughput, which are key economic drivers in terminal operations. Due to their computational complexities, these problems are not optimized jointly in existing work. This paper revisits this limitation and proposes Mixed Integer Programming (MIP) and Constraint Programming (CP) models for the integrated problem, under some realistic ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05302","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:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77DCdGcmUKiRD4dW+ceKYOewNLMkjTtpNY4YRsiZukDGxmYIYuC9Cq/FctbI0G7UZTP5+NsT1HM6Eezc04NODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:03:07.727569Z"},"content_sha256":"b11aeca61a548bbf75774f005e51e606240fd348fe49a5bd8a6d239e6b95b58a","schema_version":"1.0","event_id":"sha256:b11aeca61a548bbf75774f005e51e606240fd348fe49a5bd8a6d239e6b95b58a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTYSFXQEMKOTPWRB3U3M6CBQTS/bundle.json","state_url":"https://pith.science/pith/VTYSFXQEMKOTPWRB3U3M6CBQTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTYSFXQEMKOTPWRB3U3M6CBQTS/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-05-25T12:03:07Z","links":{"resolver":"https://pith.science/pith/VTYSFXQEMKOTPWRB3U3M6CBQTS","bundle":"https://pith.science/pith/VTYSFXQEMKOTPWRB3U3M6CBQTS/bundle.json","state":"https://pith.science/pith/VTYSFXQEMKOTPWRB3U3M6CBQTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTYSFXQEMKOTPWRB3U3M6CBQTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VTYSFXQEMKOTPWRB3U3M6CBQTS","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":"bf76045f2ebfccc400262b5610049310daf4c5420ed7602d977ba0e2bfc62616","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-14T15:56:46Z","title_canon_sha256":"86ff6b69c0823bcf8718adcd174068a8ffd861fe8704c14f75ffdbf389de9d87"},"schema_version":"1.0","source":{"id":"1712.05302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05302","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05302v1","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05302","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"VTYSFXQEMKOT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VTYSFXQEMKOTPWRB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VTYSFXQE","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b11aeca61a548bbf75774f005e51e606240fd348fe49a5bd8a6d239e6b95b58a","target":"graph","created_at":"2026-05-18T00:27:58Z","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 integrated problem of quay crane assignment, quay crane scheduling, yard location assignment, and vehicle dispatching operations at a container terminal. The main objective is to minimize vessel turnover times and maximize the terminal throughput, which are key economic drivers in terminal operations. Due to their computational complexities, these problems are not optimized jointly in existing work. This paper revisits this limitation and proposes Mixed Integer Programming (MIP) and Constraint Programming (CP) models for the integrated problem, under some realistic ass","authors_text":"Damla Kizilay, Deniz T. Eliiyi, Pascal Van Hentenryck","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-14T15:56:46Z","title":"Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05302","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:4e799e44dad9ec24c99e1055d091d23b4a3654ac85d17d4e65c6769ccd763631","target":"record","created_at":"2026-05-18T00:27:58Z","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":"bf76045f2ebfccc400262b5610049310daf4c5420ed7602d977ba0e2bfc62616","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-14T15:56:46Z","title_canon_sha256":"86ff6b69c0823bcf8718adcd174068a8ffd861fe8704c14f75ffdbf389de9d87"},"schema_version":"1.0","source":{"id":"1712.05302","kind":"arxiv","version":1}},"canonical_sha256":"acf122de04629d37da21dd36cf08309c878a06599d1d5795487d3456db28bafb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acf122de04629d37da21dd36cf08309c878a06599d1d5795487d3456db28bafb","first_computed_at":"2026-05-18T00:27:58.321610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:58.321610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x1VqaDHCWbsXwQiB4QxC/uodhC3TRDfzGPVdZv0Oo7Xg+NL1tBQ2Zeal7DGBYRAsw3VRrkPP1OEBUOwEs2JYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:58.322380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e799e44dad9ec24c99e1055d091d23b4a3654ac85d17d4e65c6769ccd763631","sha256:b11aeca61a548bbf75774f005e51e606240fd348fe49a5bd8a6d239e6b95b58a"],"state_sha256":"1b1072eb782c4c2225107da91c606770fbb53ae6dc3997f2d207e23948e0ba77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDvvr1VWzFd99WQ5ZJXpkZPZ/nqbwGWRjswxzyBOjig/SVA1kV3zZk29xquGcYKzQNfrAT2Y/4RltMJQPKrBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:03:07.730975Z","bundle_sha256":"96ca871ad9a9247be9bb80d44d67959bbf8b629aa58bf02bd0c9e6c14e5c5204"}}