{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DFQO5WDBFIAXKUIYYLQXSY26ZZ","short_pith_number":"pith:DFQO5WDB","schema_version":"1.0","canonical_sha256":"1960eed8612a01755118c2e179635ece7381f2d7fd369a02c35a2cfbde970408","source":{"kind":"arxiv","id":"1306.0442","version":1},"attestation_state":"computed","paper":{"title":"Evolutionary Approach for the Containers Bin-Packing Problem","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"(2), Ecole Centrale de Lille, Ecole Nationale des Ingenieurs de Tunis, France (2): LACS, I. Ayachi (1), M. Ksouri (2), P. Borne (1) ((1): LAGIS, R. Kammarti (2), Tunis - Belvedere. TUNISIE), Villeneuve dAscq","submitted_at":"2013-06-03T14:47:11Z","abstract_excerpt":"This paper deals with the resolution of combinatorial optimization problems, particularly those concerning the maritime transport scheduling. We are interested in the management platforms in a river port and more specifically in container organisation operations with a view to minimizing the number of container rehandlings. Subsequently, we rmeet customers delivery deadlines and we reduce ship stoppage time In this paper, we propose a genetic algorithm to solve this problem and we present some experiments and results."},"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":"1306.0442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.NE","submitted_at":"2013-06-03T14:47:11Z","cross_cats_sorted":[],"title_canon_sha256":"2ddd09435e8402fba8d837a0b30f4140a8ec55c02070856d69ecb030962bb688","abstract_canon_sha256":"3d3217e0d230ed975ef50cd910e8ebf56593e6c4c5a6cfa88b203dfbe5ec146f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:55.264085Z","signature_b64":"So/8prhCJ4rmM08ch46Q+9xcaHi4MsZ5uelkONYDVUru1nooiIJP2TTB1LasbHsb8n1/F0TgGYOe0cLTr++3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1960eed8612a01755118c2e179635ece7381f2d7fd369a02c35a2cfbde970408","last_reissued_at":"2026-05-18T03:21:55.263530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:55.263530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evolutionary Approach for the Containers Bin-Packing Problem","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"(2), Ecole Centrale de Lille, Ecole Nationale des Ingenieurs de Tunis, France (2): LACS, I. Ayachi (1), M. Ksouri (2), P. Borne (1) ((1): LAGIS, R. Kammarti (2), Tunis - Belvedere. TUNISIE), Villeneuve dAscq","submitted_at":"2013-06-03T14:47:11Z","abstract_excerpt":"This paper deals with the resolution of combinatorial optimization problems, particularly those concerning the maritime transport scheduling. We are interested in the management platforms in a river port and more specifically in container organisation operations with a view to minimizing the number of container rehandlings. Subsequently, we rmeet customers delivery deadlines and we reduce ship stoppage time In this paper, we propose a genetic algorithm to solve this problem and we present some experiments and results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0442","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":"1306.0442","created_at":"2026-05-18T03:21:55.263620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0442v1","created_at":"2026-05-18T03:21:55.263620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0442","created_at":"2026-05-18T03:21:55.263620+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFQO5WDBFIAX","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFQO5WDBFIAXKUIY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFQO5WDB","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ","json":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ.json","graph_json":"https://pith.science/api/pith-number/DFQO5WDBFIAXKUIYYLQXSY26ZZ/graph.json","events_json":"https://pith.science/api/pith-number/DFQO5WDBFIAXKUIYYLQXSY26ZZ/events.json","paper":"https://pith.science/paper/DFQO5WDB"},"agent_actions":{"view_html":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ","download_json":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ.json","view_paper":"https://pith.science/paper/DFQO5WDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0442&json=true","fetch_graph":"https://pith.science/api/pith-number/DFQO5WDBFIAXKUIYYLQXSY26ZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DFQO5WDBFIAXKUIYYLQXSY26ZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ/action/storage_attestation","attest_author":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ/action/author_attestation","sign_citation":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ/action/citation_signature","submit_replication":"https://pith.science/pith/DFQO5WDBFIAXKUIYYLQXSY26ZZ/action/replication_record"}},"created_at":"2026-05-18T03:21:55.263620+00:00","updated_at":"2026-05-18T03:21:55.263620+00:00"}