{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:35ODKHOY6PBRRYLTNQFZYFBKPY","short_pith_number":"pith:35ODKHOY","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"},"canonical_sha256":"df5c351dd8f3c318e1736c0b9c142a7e3fe17266421a068808a6d2f9c8497529","source":{"kind":"arxiv","id":"1605.05546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05546","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05546v1","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05546","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"35ODKHOY6PBR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"35ODKHOY6PBRRYLT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"35ODKHOY","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:35ODKHOY6PBRRYLTNQFZYFBKPY","target":"record","payload":{"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"},"canonical_sha256":"df5c351dd8f3c318e1736c0b9c142a7e3fe17266421a068808a6d2f9c8497529","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"},"source_kind":"arxiv","source_id":"1605.05546","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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIo2mUFPjd+uVlJW57mBiaEYSZ1lX2HUPVQe0bsJN2QyJ+WcUUIDdtBHfJi/7weAKoQNv/3ceq+3oAJS2tnxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:44:35.095927Z"},"content_sha256":"df73f6dee397c02827459e3030253318f83fcb1c252b7e863eaa7d45d7f52642","schema_version":"1.0","event_id":"sha256:df73f6dee397c02827459e3030253318f83fcb1c252b7e863eaa7d45d7f52642"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:35ODKHOY6PBRRYLTNQFZYFBKPY","target":"graph","payload":{"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"},"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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ss2w38m60nbUH4+bhYYogTxAJu3RxSLLintwETxrCbOf92Kqry/Ah/n2A8PmO6YzWziPhE5rqS3FNhivHKocBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:44:35.096576Z"},"content_sha256":"50a1ca54a9257cbc740481b0f298fcaa54203245f173f5d080daa33da508808d","schema_version":"1.0","event_id":"sha256:50a1ca54a9257cbc740481b0f298fcaa54203245f173f5d080daa33da508808d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/bundle.json","state_url":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/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-09T07:44:35Z","links":{"resolver":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY","bundle":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/bundle.json","state":"https://pith.science/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35ODKHOY6PBRRYLTNQFZYFBKPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:35ODKHOY6PBRRYLTNQFZYFBKPY","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":"4e28a247526b8d1399c43e6fa22d0947f16588ead675fd6315e9dc273bb16b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-18T12:21:39Z","title_canon_sha256":"e8c35034eb82abf6e3ee3639546a96bc8d56842b83ef768eeeb372e372b0c5e6"},"schema_version":"1.0","source":{"id":"1605.05546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05546","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05546v1","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05546","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"35ODKHOY6PBR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"35ODKHOY6PBRRYLT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"35ODKHOY","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:50a1ca54a9257cbc740481b0f298fcaa54203245f173f5d080daa33da508808d","target":"graph","created_at":"2026-05-18T01:14:34Z","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":"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 \\","authors_text":"Ajit Arvind Diwan, Bodhayan Roy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-18T12:21:39Z","title":"Partitions of planar point sets into polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05546","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:df73f6dee397c02827459e3030253318f83fcb1c252b7e863eaa7d45d7f52642","target":"record","created_at":"2026-05-18T01:14:34Z","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":"4e28a247526b8d1399c43e6fa22d0947f16588ead675fd6315e9dc273bb16b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-18T12:21:39Z","title_canon_sha256":"e8c35034eb82abf6e3ee3639546a96bc8d56842b83ef768eeeb372e372b0c5e6"},"schema_version":"1.0","source":{"id":"1605.05546","kind":"arxiv","version":1}},"canonical_sha256":"df5c351dd8f3c318e1736c0b9c142a7e3fe17266421a068808a6d2f9c8497529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df5c351dd8f3c318e1736c0b9c142a7e3fe17266421a068808a6d2f9c8497529","first_computed_at":"2026-05-18T01:14:34.636955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:34.636955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Okn/JDjgkyHb4s5sTqnkC3ttAktRBN2olxWnwEGjurt+qjE7qYHe9nDyna7VBW0sPLTLYU4ZqyXvwmnl4sTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:34.637569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df73f6dee397c02827459e3030253318f83fcb1c252b7e863eaa7d45d7f52642","sha256:50a1ca54a9257cbc740481b0f298fcaa54203245f173f5d080daa33da508808d"],"state_sha256":"aa07490cbbfa817f31851899a63981ba772e5356f234fe268af2b536a1999cef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cf/mf/ssF+9I7rBUtvjCgBtMJgVhrA1F8/aKwDU+qrrgxmsV1ZZbiqJsS52ZPqak4t2pTNdGQntRyE1l56kXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:44:35.100142Z","bundle_sha256":"9853aed763a161b302bd31a569f84749178b2fc5c787a501f82a5951eb92e288"}}