{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A7VEJWHM4M54T5AO4UBJK3T34F","short_pith_number":"pith:A7VEJWHM","canonical_record":{"source":{"id":"1907.06701","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T19:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"e394eed849d658a190e3f97e4a19a9f0f2a0ad3d17fef9ec5dd813dace70a0dc","abstract_canon_sha256":"dc18ff7e734779b32bbd0ecc170cd6b36c86aca4d4661f52378a272c59761ddc"},"schema_version":"1.0"},"canonical_sha256":"07ea44d8ece33bc9f40ee502956e7be16350032d8e3edae40dbeed89e49c036d","source":{"kind":"arxiv","id":"1907.06701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06701","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06701v1","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06701","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"A7VEJWHM4M54","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A7VEJWHM4M54T5AO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A7VEJWHM","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A7VEJWHM4M54T5AO4UBJK3T34F","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06701","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T19:05:10Z","cross_cats_sorted":[],"title_canon_sha256":"e394eed849d658a190e3f97e4a19a9f0f2a0ad3d17fef9ec5dd813dace70a0dc","abstract_canon_sha256":"dc18ff7e734779b32bbd0ecc170cd6b36c86aca4d4661f52378a272c59761ddc"},"schema_version":"1.0"},"canonical_sha256":"07ea44d8ece33bc9f40ee502956e7be16350032d8e3edae40dbeed89e49c036d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:29.400112Z","signature_b64":"4mTLymlBBRtTFLx8ApYj3xio+SLPrgZhLN6Y+DezYWo89UEcyhPYXcolg3Twa5x8IRQtIHiFCjOU9MRS5SV1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ea44d8ece33bc9f40ee502956e7be16350032d8e3edae40dbeed89e49c036d","last_reissued_at":"2026-05-17T23:40:29.399577Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:29.399577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06701","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-17T23:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9ZS/Je7HAYIpwB4uebG1P8UNBdkaERKaDeGKstBDdAqXNZz4EsBqxYPYWlDorm7YPTMPDNbhCZjBY8t7ASuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:46:43.361088Z"},"content_sha256":"65cb5a4325c0e8dd2aef5070d42acf730857efdf340d2ec9e2f74ca20e6daee3","schema_version":"1.0","event_id":"sha256:65cb5a4325c0e8dd2aef5070d42acf730857efdf340d2ec9e2f74ca20e6daee3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A7VEJWHM4M54T5AO4UBJK3T34F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Output maximization container loading problem with time availability constraints","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alysson M. Costa, Franklina M. B. Toledo, Pedro Castellucci","submitted_at":"2019-07-15T19:05:10Z","abstract_excerpt":"Research on container loading problems has been proved effective in increasing the filling rate of containers in different practical situations. However, the broader logistic context might pressure the loading process, leading to sub-optimal solutions. Some facilities like cross-docks have reduced storage space which might force early loading activities. We propose a container loading problem which accounts for this limited storage by explicitly considering the schedule of arrival for the boxes and the departure time of the trucks. Also, we design a framework which handles the geometric and te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06701","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-17T23:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hvVOkbMnvh+Y0zl+ryXD6Sz38bVV1Eg04K09lcXXZkvP9MMoIyK+riK0IeZr4OihVk077nDBNZ/iOIOKcLQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:46:43.361455Z"},"content_sha256":"676692e83da6aa5e74640425269ca5329627348f36de58f276d29f7204b60425","schema_version":"1.0","event_id":"sha256:676692e83da6aa5e74640425269ca5329627348f36de58f276d29f7204b60425"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7VEJWHM4M54T5AO4UBJK3T34F/bundle.json","state_url":"https://pith.science/pith/A7VEJWHM4M54T5AO4UBJK3T34F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7VEJWHM4M54T5AO4UBJK3T34F/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-28T13:46:43Z","links":{"resolver":"https://pith.science/pith/A7VEJWHM4M54T5AO4UBJK3T34F","bundle":"https://pith.science/pith/A7VEJWHM4M54T5AO4UBJK3T34F/bundle.json","state":"https://pith.science/pith/A7VEJWHM4M54T5AO4UBJK3T34F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7VEJWHM4M54T5AO4UBJK3T34F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A7VEJWHM4M54T5AO4UBJK3T34F","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":"dc18ff7e734779b32bbd0ecc170cd6b36c86aca4d4661f52378a272c59761ddc","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T19:05:10Z","title_canon_sha256":"e394eed849d658a190e3f97e4a19a9f0f2a0ad3d17fef9ec5dd813dace70a0dc"},"schema_version":"1.0","source":{"id":"1907.06701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06701","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06701v1","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06701","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"A7VEJWHM4M54","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A7VEJWHM4M54T5AO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A7VEJWHM","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:676692e83da6aa5e74640425269ca5329627348f36de58f276d29f7204b60425","target":"graph","created_at":"2026-05-17T23:40:29Z","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":"Research on container loading problems has been proved effective in increasing the filling rate of containers in different practical situations. However, the broader logistic context might pressure the loading process, leading to sub-optimal solutions. Some facilities like cross-docks have reduced storage space which might force early loading activities. We propose a container loading problem which accounts for this limited storage by explicitly considering the schedule of arrival for the boxes and the departure time of the trucks. Also, we design a framework which handles the geometric and te","authors_text":"Alysson M. Costa, Franklina M. B. Toledo, Pedro Castellucci","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T19:05:10Z","title":"Output maximization container loading problem with time availability constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06701","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:65cb5a4325c0e8dd2aef5070d42acf730857efdf340d2ec9e2f74ca20e6daee3","target":"record","created_at":"2026-05-17T23:40:29Z","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":"dc18ff7e734779b32bbd0ecc170cd6b36c86aca4d4661f52378a272c59761ddc","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T19:05:10Z","title_canon_sha256":"e394eed849d658a190e3f97e4a19a9f0f2a0ad3d17fef9ec5dd813dace70a0dc"},"schema_version":"1.0","source":{"id":"1907.06701","kind":"arxiv","version":1}},"canonical_sha256":"07ea44d8ece33bc9f40ee502956e7be16350032d8e3edae40dbeed89e49c036d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07ea44d8ece33bc9f40ee502956e7be16350032d8e3edae40dbeed89e49c036d","first_computed_at":"2026-05-17T23:40:29.399577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:29.399577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4mTLymlBBRtTFLx8ApYj3xio+SLPrgZhLN6Y+DezYWo89UEcyhPYXcolg3Twa5x8IRQtIHiFCjOU9MRS5SV1DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:29.400112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65cb5a4325c0e8dd2aef5070d42acf730857efdf340d2ec9e2f74ca20e6daee3","sha256:676692e83da6aa5e74640425269ca5329627348f36de58f276d29f7204b60425"],"state_sha256":"bcb4d70cc360773243634371dfd9686f2cf9167691824d9edc5d3e1390ebbcfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1d4U7/bSY489JOkm1RUZZ8IfNTqZUCRvLhdXTe9G3414KyH4FmDwVXxf4CHG1VHo+xG+tNhYpRMAwE3ZHwpCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:46:43.363333Z","bundle_sha256":"1561f6c12eaf46701fd2b8b55d0aeea197662d560ea65166ce97ec508cd88b53"}}