{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DVG5WPQEC6NQV7J4IKJAREFSID","short_pith_number":"pith:DVG5WPQE","schema_version":"1.0","canonical_sha256":"1d4ddb3e04179b0afd3c42920890b240c09922e014cb6ec7ab7bf8134f10633a","source":{"kind":"arxiv","id":"1606.05927","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.05927","created_at":"2026-05-18T01:12:15.790478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05927v1","created_at":"2026-05-18T01:12:15.790478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05927","created_at":"2026-05-18T01:12:15.790478+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVG5WPQEC6NQ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVG5WPQEC6NQV7J4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVG5WPQE","created_at":"2026-05-18T12:30:12.583610+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/DVG5WPQEC6NQV7J4IKJAREFSID","json":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID.json","graph_json":"https://pith.science/api/pith-number/DVG5WPQEC6NQV7J4IKJAREFSID/graph.json","events_json":"https://pith.science/api/pith-number/DVG5WPQEC6NQV7J4IKJAREFSID/events.json","paper":"https://pith.science/paper/DVG5WPQE"},"agent_actions":{"view_html":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID","download_json":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID.json","view_paper":"https://pith.science/paper/DVG5WPQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05927&json=true","fetch_graph":"https://pith.science/api/pith-number/DVG5WPQEC6NQV7J4IKJAREFSID/graph.json","fetch_events":"https://pith.science/api/pith-number/DVG5WPQEC6NQV7J4IKJAREFSID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/action/storage_attestation","attest_author":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/action/author_attestation","sign_citation":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/action/citation_signature","submit_replication":"https://pith.science/pith/DVG5WPQEC6NQV7J4IKJAREFSID/action/replication_record"}},"created_at":"2026-05-18T01:12:15.790478+00:00","updated_at":"2026-05-18T01:12:15.790478+00:00"}