{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DVG5WPQEC6NQV7J4IKJAREFSID","short_pith_number":"pith:DVG5WPQE","canonical_record":{"source":{"id":"1606.05927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-19T23:50:15Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"be66d22c9407dcb565d36c16283f071d1f8416f1acf23136b5970b9fd3cc7967","abstract_canon_sha256":"f1d806cc02ec839be243ff5fa58f852b2d1094295d284e8612bb8a9a897cc793"},"schema_version":"1.0"},"canonical_sha256":"1d4ddb3e04179b0afd3c42920890b240c09922e014cb6ec7ab7bf8134f10633a","source":{"kind":"arxiv","id":"1606.05927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05927","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05927v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05927","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"DVG5WPQEC6NQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVG5WPQEC6NQV7J4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVG5WPQE","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DVG5WPQEC6NQV7J4IKJAREFSID","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-19T23:50:15Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"be66d22c9407dcb565d36c16283f071d1f8416f1acf23136b5970b9fd3cc7967","abstract_canon_sha256":"f1d806cc02ec839be243ff5fa58f852b2d1094295d284e8612bb8a9a897cc793"},"schema_version":"1.0"},"canonical_sha256":"1d4ddb3e04179b0afd3c42920890b240c09922e014cb6ec7ab7bf8134f10633a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:15.790788Z","signature_b64":"Rhw0LrDMi9W5xqMhM2lJEOoGMSjW7/cbtakD2N4gFMu19y0c8Wr/x7W/mxBAh5SfO7MjWjOji1o3C76fsiOVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d4ddb3e04179b0afd3c42920890b240c09922e014cb6ec7ab7bf8134f10633a","last_reissued_at":"2026-05-18T01:12:15.790427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:15.790427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05927","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-18T01:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biawCDTVYn/EU+ifLO0cKbk+yWUvwRNICQmAYiHe4HS16MLopkOLsOUOCm9SLXropuJ5yhT19n+WuFKDQhtPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:49:49.465656Z"},"content_sha256":"dc0a86cef8b616cb3cbbad88f59872971ce3d5efd0fee399ac22793463caa9b9","schema_version":"1.0","event_id":"sha256:dc0a86cef8b616cb3cbbad88f59872971ce3d5efd0fee399ac22793463caa9b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DVG5WPQEC6NQV7J4IKJAREFSID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum cost polygon overlay with rectangular shape stock panels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.NE","authors_text":"Andy M. Connor, Nick Alexander, Nick Clements, Wilson S. Siringoringo","submitted_at":"2016-06-19T23:50:15Z","abstract_excerpt":"Minimum Cost Polygon Overlay (MCPO) is a unique two-dimensional optimization problem that involves the task of covering a polygon shaped area with a series of rectangular shaped panels. This has a number of applications in the construction industry. This work examines the MCPO problem in order to construct a model that captures essential parameters of the problem to be solved automatically using numerical optimization algorithms. Three algorithms have been implemented of the actual optimization task: the greedy search, the Monte Carlo (MC) method, and the Genetic Algorithm (GA). Results are pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05927","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-18T01:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhUrV99WX/ev+ssaQGMJj8nkcEeaYJGeEO+7ohlUhPvZ6VFpEwaUbZHmr6kOf1+LfsdlQvOfJHCOTcVikVfsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:49:49.466370Z"},"content_sha256":"1922d7f80f139703e313fbcd00dc38339dd70454ed940fa3e5262431f36ce7a6","schema_version":"1.0","event_id":"sha256:1922d7f80f139703e313fbcd00dc38339dd70454ed940fa3e5262431f36ce7a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/bundle.json","state_url":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVG5WPQEC6NQV7J4IKJAREFSID/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-05T21:49:49Z","links":{"resolver":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID","bundle":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/bundle.json","state":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVG5WPQEC6NQV7J4IKJAREFSID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DVG5WPQEC6NQV7J4IKJAREFSID","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":"f1d806cc02ec839be243ff5fa58f852b2d1094295d284e8612bb8a9a897cc793","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-19T23:50:15Z","title_canon_sha256":"be66d22c9407dcb565d36c16283f071d1f8416f1acf23136b5970b9fd3cc7967"},"schema_version":"1.0","source":{"id":"1606.05927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05927","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05927v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05927","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"DVG5WPQEC6NQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVG5WPQEC6NQV7J4","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVG5WPQE","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1922d7f80f139703e313fbcd00dc38339dd70454ed940fa3e5262431f36ce7a6","target":"graph","created_at":"2026-05-18T01:12:15Z","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":"Minimum Cost Polygon Overlay (MCPO) is a unique two-dimensional optimization problem that involves the task of covering a polygon shaped area with a series of rectangular shaped panels. This has a number of applications in the construction industry. This work examines the MCPO problem in order to construct a model that captures essential parameters of the problem to be solved automatically using numerical optimization algorithms. Three algorithms have been implemented of the actual optimization task: the greedy search, the Monte Carlo (MC) method, and the Genetic Algorithm (GA). Results are pr","authors_text":"Andy M. Connor, Nick Alexander, Nick Clements, Wilson S. Siringoringo","cross_cats":["cs.CG","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-19T23:50:15Z","title":"Minimum cost polygon overlay with rectangular shape stock panels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05927","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:dc0a86cef8b616cb3cbbad88f59872971ce3d5efd0fee399ac22793463caa9b9","target":"record","created_at":"2026-05-18T01:12:15Z","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":"f1d806cc02ec839be243ff5fa58f852b2d1094295d284e8612bb8a9a897cc793","cross_cats_sorted":["cs.CG","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-19T23:50:15Z","title_canon_sha256":"be66d22c9407dcb565d36c16283f071d1f8416f1acf23136b5970b9fd3cc7967"},"schema_version":"1.0","source":{"id":"1606.05927","kind":"arxiv","version":1}},"canonical_sha256":"1d4ddb3e04179b0afd3c42920890b240c09922e014cb6ec7ab7bf8134f10633a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d4ddb3e04179b0afd3c42920890b240c09922e014cb6ec7ab7bf8134f10633a","first_computed_at":"2026-05-18T01:12:15.790427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:15.790427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rhw0LrDMi9W5xqMhM2lJEOoGMSjW7/cbtakD2N4gFMu19y0c8Wr/x7W/mxBAh5SfO7MjWjOji1o3C76fsiOVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:15.790788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc0a86cef8b616cb3cbbad88f59872971ce3d5efd0fee399ac22793463caa9b9","sha256:1922d7f80f139703e313fbcd00dc38339dd70454ed940fa3e5262431f36ce7a6"],"state_sha256":"d66bad548e8d8b2ed900f4e0635740cdcce56e3ab2292be401b990e2399f4650"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aord4ZEVICVAvN9S5j0cAMQ2uXq85QRbfWFGGi5RasHxgPpEheGyHj1s6r986+tAzfL4oFCoHddQv8/Ea5rVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:49:49.469813Z","bundle_sha256":"f4ceba2dbdf0a72353af283aecea9ed28c10a3eac3c5f4a4a6d558c4b9f3c344"}}