{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AJYAQIFUWWDUHFF64TDYLGWHSJ","short_pith_number":"pith:AJYAQIFU","schema_version":"1.0","canonical_sha256":"02700820b4b5874394bee4c7859ac79271397fb175c9249971e319d8a506abf3","source":{"kind":"arxiv","id":"1503.01535","version":1},"attestation_state":"computed","paper":{"title":"Managing Relocation and Delay in Container Terminals with Flexible Service Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Cynthia Barnhart, Patrick Jaillet, Setareh Borjian, Vahideh H. Manshadi","submitted_at":"2015-03-05T04:37:24Z","abstract_excerpt":"We introduce a new model and mathematical formulation for planning crane moves in the storage yard of container terminals. Our objective is to develop a tool that captures customer centric elements, especially service time, and helps operators to manage costly relocation moves. Our model incorporates several practical details and provides port operators with expanded capabilities including planning repositioning moves in off-peak hours, controlling wait times of each customer as well as total service time, optimizing the number of relocations and wait time jointly, and optimizing simultaneousl"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.01535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-05T04:37:24Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3fedf526fa9c27f4721339c01cbf0dc641834656a67b1f59e5ba9ee707581009","abstract_canon_sha256":"3d5ed71d315f24492e439ab960a06e5b216813f8b7cb94427a9c205ca36926a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:33.438156Z","signature_b64":"NV0wHXs6yKNiDAfKxtGptdhZiD42RtZ+qUEsINJBnbWWMwPEoLCFuNtdqM3usRV5BmBEcE34mLkSMA0YXpg/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02700820b4b5874394bee4c7859ac79271397fb175c9249971e319d8a506abf3","last_reissued_at":"2026-05-18T02:25:33.437702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:33.437702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Managing Relocation and Delay in Container Terminals with Flexible Service Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Cynthia Barnhart, Patrick Jaillet, Setareh Borjian, Vahideh H. Manshadi","submitted_at":"2015-03-05T04:37:24Z","abstract_excerpt":"We introduce a new model and mathematical formulation for planning crane moves in the storage yard of container terminals. Our objective is to develop a tool that captures customer centric elements, especially service time, and helps operators to manage costly relocation moves. Our model incorporates several practical details and provides port operators with expanded capabilities including planning repositioning moves in off-peak hours, controlling wait times of each customer as well as total service time, optimizing the number of relocations and wait time jointly, and optimizing simultaneousl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01535","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.01535","created_at":"2026-05-18T02:25:33.437770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01535v1","created_at":"2026-05-18T02:25:33.437770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01535","created_at":"2026-05-18T02:25:33.437770+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJYAQIFUWWDU","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJYAQIFUWWDUHFF6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJYAQIFU","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.26542","citing_title":"The Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem: Exact and Heuristic Approaches","ref_index":2018,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ","json":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ.json","graph_json":"https://pith.science/api/pith-number/AJYAQIFUWWDUHFF64TDYLGWHSJ/graph.json","events_json":"https://pith.science/api/pith-number/AJYAQIFUWWDUHFF64TDYLGWHSJ/events.json","paper":"https://pith.science/paper/AJYAQIFU"},"agent_actions":{"view_html":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ","download_json":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ.json","view_paper":"https://pith.science/paper/AJYAQIFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01535&json=true","fetch_graph":"https://pith.science/api/pith-number/AJYAQIFUWWDUHFF64TDYLGWHSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AJYAQIFUWWDUHFF64TDYLGWHSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ/action/storage_attestation","attest_author":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ/action/author_attestation","sign_citation":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ/action/citation_signature","submit_replication":"https://pith.science/pith/AJYAQIFUWWDUHFF64TDYLGWHSJ/action/replication_record"}},"created_at":"2026-05-18T02:25:33.437770+00:00","updated_at":"2026-05-18T02:25:33.437770+00:00"}