{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IXVWT253FWT6XIHNJFPZRFTEDN","short_pith_number":"pith:IXVWT253","schema_version":"1.0","canonical_sha256":"45eb69ebbb2da7eba0ed495f9896641b65e58ea30eeb037bcfaec76c1396942f","source":{"kind":"arxiv","id":"2110.04043","version":1},"attestation_state":"computed","paper":{"title":"Polygon Area Decomposition Using a Compactness Metric","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Cyrille Berger, Mariusz Wzorek, Patrick Doherty","submitted_at":"2021-10-08T11:35:21Z","abstract_excerpt":"In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the goal is to find a set of efficient plans for a team of heterogeneous robots to cover a given area. Within this application, solving a polygon partitioning problem is an essential stepping stone. Unlike previous work, the problem formulation proposed in this paper also considers a compactness metric of the generated sub-polygons, in addition to the area size c"},"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":"2110.04043","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2021-10-08T11:35:21Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"114761dc8af187ca616b7fcc98a3aa2ed238decdc476593115cd73869de00a01","abstract_canon_sha256":"d4119eb33f6bd289e245bd0503787329f0b06f487ca1e8be41c3a37bccb9cbf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:00.226340Z","signature_b64":"KdseI9rVOPupacyqtBWc5tUJgFsjmMqCVCGWUF+nc25EAWEOEzmur7KCZbkWaxKCP2ViNhFBGvmS5sbrfidDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45eb69ebbb2da7eba0ed495f9896641b65e58ea30eeb037bcfaec76c1396942f","last_reissued_at":"2026-07-05T03:21:00.225954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:00.225954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polygon Area Decomposition Using a Compactness Metric","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Cyrille Berger, Mariusz Wzorek, Patrick Doherty","submitted_at":"2021-10-08T11:35:21Z","abstract_excerpt":"In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the goal is to find a set of efficient plans for a team of heterogeneous robots to cover a given area. Within this application, solving a polygon partitioning problem is an essential stepping stone. Unlike previous work, the problem formulation proposed in this paper also considers a compactness metric of the generated sub-polygons, in addition to the area size c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04043","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.04043/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.04043","created_at":"2026-07-05T03:21:00.226018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.04043v1","created_at":"2026-07-05T03:21:00.226018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04043","created_at":"2026-07-05T03:21:00.226018+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXVWT253FWT6","created_at":"2026-07-05T03:21:00.226018+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXVWT253FWT6XIHN","created_at":"2026-07-05T03:21:00.226018+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXVWT253","created_at":"2026-07-05T03:21:00.226018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09969","citing_title":"Vectorized Region Based Brush Strokes for Artistic Rendering","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN","json":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN.json","graph_json":"https://pith.science/api/pith-number/IXVWT253FWT6XIHNJFPZRFTEDN/graph.json","events_json":"https://pith.science/api/pith-number/IXVWT253FWT6XIHNJFPZRFTEDN/events.json","paper":"https://pith.science/paper/IXVWT253"},"agent_actions":{"view_html":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN","download_json":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN.json","view_paper":"https://pith.science/paper/IXVWT253","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.04043&json=true","fetch_graph":"https://pith.science/api/pith-number/IXVWT253FWT6XIHNJFPZRFTEDN/graph.json","fetch_events":"https://pith.science/api/pith-number/IXVWT253FWT6XIHNJFPZRFTEDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN/action/storage_attestation","attest_author":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN/action/author_attestation","sign_citation":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN/action/citation_signature","submit_replication":"https://pith.science/pith/IXVWT253FWT6XIHNJFPZRFTEDN/action/replication_record"}},"created_at":"2026-07-05T03:21:00.226018+00:00","updated_at":"2026-07-05T03:21:00.226018+00:00"}