{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:35ODKHOY6PBRRYLTNQFZYFBKPY","short_pith_number":"pith:35ODKHOY","schema_version":"1.0","canonical_sha256":"df5c351dd8f3c318e1736c0b9c142a7e3fe17266421a068808a6d2f9c8497529","source":{"kind":"arxiv","id":"1605.05546","version":1},"attestation_state":"computed","paper":{"title":"Partitions of planar point sets into polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ajit Arvind Diwan, Bodhayan Roy","submitted_at":"2016-05-18T12:21:39Z","abstract_excerpt":"In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this problem is equivalent to finding a specified $2$-factor in the visibility graph of the point set. The characterization for the case where all cycles have length $3$ also translates to finding a $K_3$-factor of the visibility graph of the point set. We show that the generalized problem of finding a $K_k$-factor of the visibility graph of a given point set for $k \\"},"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":"1605.05546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-18T12:21:39Z","cross_cats_sorted":[],"title_canon_sha256":"e8c35034eb82abf6e3ee3639546a96bc8d56842b83ef768eeeb372e372b0c5e6","abstract_canon_sha256":"4e28a247526b8d1399c43e6fa22d0947f16588ead675fd6315e9dc273bb16b57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:34.637569Z","signature_b64":"4Okn/JDjgkyHb4s5sTqnkC3ttAktRBN2olxWnwEGjurt+qjE7qYHe9nDyna7VBW0sPLTLYU4ZqyXvwmnl4sTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5c351dd8f3c318e1736c0b9c142a7e3fe17266421a068808a6d2f9c8497529","last_reissued_at":"2026-05-18T01:14:34.636955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:34.636955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitions of planar point sets into polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ajit Arvind Diwan, Bodhayan Roy","submitted_at":"2016-05-18T12:21:39Z","abstract_excerpt":"In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this problem is equivalent to finding a specified $2$-factor in the visibility graph of the point set. The characterization for the case where all cycles have length $3$ also translates to finding a $K_3$-factor of the visibility graph of the point set. We show that the generalized problem of finding a $K_k$-factor of the visibility graph of a given point set for $k \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05546","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":"1605.05546","created_at":"2026-05-18T01:14:34.637051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05546v1","created_at":"2026-05-18T01:14:34.637051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05546","created_at":"2026-05-18T01:14:34.637051+00:00"},{"alias_kind":"pith_short_12","alias_value":"35ODKHOY6PBR","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"35ODKHOY6PBRRYLT","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"35ODKHOY","created_at":"2026-05-18T12:29:55.572404+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/35ODKHOY6PBRRYLTNQFZYFBKPY","json":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY.json","graph_json":"https://pith.science/api/pith-number/35ODKHOY6PBRRYLTNQFZYFBKPY/graph.json","events_json":"https://pith.science/api/pith-number/35ODKHOY6PBRRYLTNQFZYFBKPY/events.json","paper":"https://pith.science/paper/35ODKHOY"},"agent_actions":{"view_html":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY","download_json":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY.json","view_paper":"https://pith.science/paper/35ODKHOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05546&json=true","fetch_graph":"https://pith.science/api/pith-number/35ODKHOY6PBRRYLTNQFZYFBKPY/graph.json","fetch_events":"https://pith.science/api/pith-number/35ODKHOY6PBRRYLTNQFZYFBKPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/action/storage_attestation","attest_author":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/action/author_attestation","sign_citation":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/action/citation_signature","submit_replication":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/action/replication_record"}},"created_at":"2026-05-18T01:14:34.637051+00:00","updated_at":"2026-05-18T01:14:34.637051+00:00"}