{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QZMDHTZHYU6VZW3T7HM34AEQ2T","short_pith_number":"pith:QZMDHTZH","canonical_record":{"source":{"id":"1805.03631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-09T17:48:39Z","cross_cats_sorted":[],"title_canon_sha256":"f636476de77dc1629b8a8de66cc627f797f57c0cec007fc1d9c311e206e40cd3","abstract_canon_sha256":"7d5e69019d30f09714a9bb129eba0eae435f26d4088fbd2be65ae8e83eb9d687"},"schema_version":"1.0"},"canonical_sha256":"865833cf27c53d5cdb73f9d9be0090d4ec0f964ad6f88fea7aa1adfc4a842260","source":{"kind":"arxiv","id":"1805.03631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03631","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03631v1","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03631","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"QZMDHTZHYU6V","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QZMDHTZHYU6VZW3T","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QZMDHTZH","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QZMDHTZHYU6VZW3T7HM34AEQ2T","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-09T17:48:39Z","cross_cats_sorted":[],"title_canon_sha256":"f636476de77dc1629b8a8de66cc627f797f57c0cec007fc1d9c311e206e40cd3","abstract_canon_sha256":"7d5e69019d30f09714a9bb129eba0eae435f26d4088fbd2be65ae8e83eb9d687"},"schema_version":"1.0"},"canonical_sha256":"865833cf27c53d5cdb73f9d9be0090d4ec0f964ad6f88fea7aa1adfc4a842260","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:19.685675Z","signature_b64":"gnfJCY25OWzXFvxW//HG4movAg1VZoxpE686VZ9fjlgk0wueVpksWnHeEzhm7xFdkfY7tZ1OfA6HHYcporAyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865833cf27c53d5cdb73f9d9be0090d4ec0f964ad6f88fea7aa1adfc4a842260","last_reissued_at":"2026-05-18T00:16:19.685264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:19.685264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03631","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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsfG8JBJLNuV6sTpWmwwe4uCgmuEVSAn9pmwvakQNT2KacBDNumDtCdFJwiI+t7o/02OKxW18/Lx8x48lFqsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:37:56.972300Z"},"content_sha256":"f52c54af031f3f53af05dafdc69219716d6ad8b43aa60438aee0935d975336be","schema_version":"1.0","event_id":"sha256:f52c54af031f3f53af05dafdc69219716d6ad8b43aa60438aee0935d975336be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QZMDHTZHYU6VZW3T7HM34AEQ2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On three soft rectangle packing problems with guillotine constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Minh Ho\\`ang H\\`a, Quoc Trung Bui, Thibaut Vidal","submitted_at":"2018-05-09T17:48:39Z","abstract_excerpt":"We investigate how to partition a rectangular region of length $L_1$ and height $L_2$ into $n$ rectangles of given areas $(a_1, \\dots, a_n)$ using two-stage guillotine cuts, so as to minimize either (i) the sum of the perimeters, (ii) the largest perimeter, or (iii) the maximum aspect ratio of the rectangles. These problems play an important role in the ongoing Vietnamese land-allocation reform, as well as in the optimization of matrix multiplication algorithms. We show that the first problem can be solved to optimality in $\\mathcal{O}(n \\log n)$, while the two others are NP-hard. We propose m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03631","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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TN4T/CgkGyedbqsdNvDPnmXJPqsCRKoLPRXrc93vVyPygv1l+VkIXkXCriW3M5vcl9SBezpXKhJHuwbA6in8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:37:56.973124Z"},"content_sha256":"77b3b64bcbe853fb3a1f2661eb7617f454ca38ad9d24aaba31e1280ee7433971","schema_version":"1.0","event_id":"sha256:77b3b64bcbe853fb3a1f2661eb7617f454ca38ad9d24aaba31e1280ee7433971"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZMDHTZHYU6VZW3T7HM34AEQ2T/bundle.json","state_url":"https://pith.science/pith/QZMDHTZHYU6VZW3T7HM34AEQ2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZMDHTZHYU6VZW3T7HM34AEQ2T/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-25T19:37:56Z","links":{"resolver":"https://pith.science/pith/QZMDHTZHYU6VZW3T7HM34AEQ2T","bundle":"https://pith.science/pith/QZMDHTZHYU6VZW3T7HM34AEQ2T/bundle.json","state":"https://pith.science/pith/QZMDHTZHYU6VZW3T7HM34AEQ2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZMDHTZHYU6VZW3T7HM34AEQ2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QZMDHTZHYU6VZW3T7HM34AEQ2T","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":"7d5e69019d30f09714a9bb129eba0eae435f26d4088fbd2be65ae8e83eb9d687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-09T17:48:39Z","title_canon_sha256":"f636476de77dc1629b8a8de66cc627f797f57c0cec007fc1d9c311e206e40cd3"},"schema_version":"1.0","source":{"id":"1805.03631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03631","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03631v1","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03631","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"QZMDHTZHYU6V","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QZMDHTZHYU6VZW3T","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QZMDHTZH","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:77b3b64bcbe853fb3a1f2661eb7617f454ca38ad9d24aaba31e1280ee7433971","target":"graph","created_at":"2026-05-18T00:16:19Z","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":"We investigate how to partition a rectangular region of length $L_1$ and height $L_2$ into $n$ rectangles of given areas $(a_1, \\dots, a_n)$ using two-stage guillotine cuts, so as to minimize either (i) the sum of the perimeters, (ii) the largest perimeter, or (iii) the maximum aspect ratio of the rectangles. These problems play an important role in the ongoing Vietnamese land-allocation reform, as well as in the optimization of matrix multiplication algorithms. We show that the first problem can be solved to optimality in $\\mathcal{O}(n \\log n)$, while the two others are NP-hard. We propose m","authors_text":"Minh Ho\\`ang H\\`a, Quoc Trung Bui, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-09T17:48:39Z","title":"On three soft rectangle packing problems with guillotine constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03631","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:f52c54af031f3f53af05dafdc69219716d6ad8b43aa60438aee0935d975336be","target":"record","created_at":"2026-05-18T00:16:19Z","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":"7d5e69019d30f09714a9bb129eba0eae435f26d4088fbd2be65ae8e83eb9d687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-09T17:48:39Z","title_canon_sha256":"f636476de77dc1629b8a8de66cc627f797f57c0cec007fc1d9c311e206e40cd3"},"schema_version":"1.0","source":{"id":"1805.03631","kind":"arxiv","version":1}},"canonical_sha256":"865833cf27c53d5cdb73f9d9be0090d4ec0f964ad6f88fea7aa1adfc4a842260","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"865833cf27c53d5cdb73f9d9be0090d4ec0f964ad6f88fea7aa1adfc4a842260","first_computed_at":"2026-05-18T00:16:19.685264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:19.685264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gnfJCY25OWzXFvxW//HG4movAg1VZoxpE686VZ9fjlgk0wueVpksWnHeEzhm7xFdkfY7tZ1OfA6HHYcporAyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:19.685675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f52c54af031f3f53af05dafdc69219716d6ad8b43aa60438aee0935d975336be","sha256:77b3b64bcbe853fb3a1f2661eb7617f454ca38ad9d24aaba31e1280ee7433971"],"state_sha256":"35ff44215da89a7d24ad529b7e5b4a7b6a69eb6d0a214e50ccf404a19208bc31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBIB1sqNZEkF4kw/s0Hk8gutElophhfwY1tunG4ZFtNUkf3OCVJpUaZOtnrYDP/1cNC51r+kMGd8JelyaKamBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:37:56.977102Z","bundle_sha256":"7087661c6f30e32dc8eb6694cf938b394b5298684f7c6c099b9e7539fa039824"}}