{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RYAWOJUE7FFRZHLR32OQNWICOQ","short_pith_number":"pith:RYAWOJUE","canonical_record":{"source":{"id":"2211.01359","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-11-02T17:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"d611fdc1bb7ccfd49943adc64b15e7e5a13a3edd1e5fc97e017403d1dc8d3b05","abstract_canon_sha256":"984115d022c42df4dd278fd29d26f63af43d3b05f22b40c3c87bf54038fbe1a6"},"schema_version":"1.0"},"canonical_sha256":"8e01672684f94b1c9d71de9d06d90274162ff169bb375db813b8008ff830f214","source":{"kind":"arxiv","id":"2211.01359","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.01359","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"arxiv_version","alias_value":"2211.01359v2","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01359","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"pith_short_12","alias_value":"RYAWOJUE7FFR","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"pith_short_16","alias_value":"RYAWOJUE7FFRZHLR","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"pith_short_8","alias_value":"RYAWOJUE","created_at":"2026-07-05T09:23:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RYAWOJUE7FFRZHLR32OQNWICOQ","target":"record","payload":{"canonical_record":{"source":{"id":"2211.01359","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-11-02T17:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"d611fdc1bb7ccfd49943adc64b15e7e5a13a3edd1e5fc97e017403d1dc8d3b05","abstract_canon_sha256":"984115d022c42df4dd278fd29d26f63af43d3b05f22b40c3c87bf54038fbe1a6"},"schema_version":"1.0"},"canonical_sha256":"8e01672684f94b1c9d71de9d06d90274162ff169bb375db813b8008ff830f214","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:42.486329Z","signature_b64":"794JOCI8xHo0YPGbAU//fmYmPvyCY0Z7Hwi8QySFNu6QDcCZE8yljudf24GLqQZEU/ZeZpVPTR/K1lDV0VP9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e01672684f94b1c9d71de9d06d90274162ff169bb375db813b8008ff830f214","last_reissued_at":"2026-07-05T09:23:42.485876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:42.485876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.01359","source_version":2,"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-07-05T09:23:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlWgh+zSc4owg6dI/moyIXhqJ21exGGabVx62ISrYa85IdSe0YM2VDYnXuFlt7xbO/pUeU3n2ssyo3JHMQyvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:49:27.137124Z"},"content_sha256":"4ea3aa04195c90ef8089d8a6d452a2996d83c757a0fec21d7d0eb0e51661983a","schema_version":"1.0","event_id":"sha256:4ea3aa04195c90ef8089d8a6d452a2996d83c757a0fec21d7d0eb0e51661983a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RYAWOJUE7FFRZHLR32OQNWICOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning a Polygon Into Small Pieces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mikkel Abrahamsen, Nichlas Langhoff Rasmussen","submitted_at":"2022-11-02T17:57:44Z","abstract_excerpt":"We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of `bounded size,' namely that each piece must be contained in an axis-aligned or arbitrarily rotated unit square or a unit disk, or that each piece has bounded perimeter, straight-line diameter or geodesic diameter. The problems are motivated by practical settings in manufacturing, finite element analysis, collision detection, vehicle routing, shipping and laser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01359","kind":"arxiv","version":2},"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/2211.01359/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"},"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-07-05T09:23:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ukZMYP6fvvbhqruuXDu3eUDomr38gnWx722pd/ypQ2KXIo0AZF/g8fDli1NnoQdmd6STLJHWAM0muOzmb/HDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:49:27.137637Z"},"content_sha256":"bbeab48707d09199ca38386a1ab110150d7270daa4b5899646cef64ca8528022","schema_version":"1.0","event_id":"sha256:bbeab48707d09199ca38386a1ab110150d7270daa4b5899646cef64ca8528022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYAWOJUE7FFRZHLR32OQNWICOQ/bundle.json","state_url":"https://pith.science/pith/RYAWOJUE7FFRZHLR32OQNWICOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYAWOJUE7FFRZHLR32OQNWICOQ/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-08-16T05:49:27Z","links":{"resolver":"https://pith.science/pith/RYAWOJUE7FFRZHLR32OQNWICOQ","bundle":"https://pith.science/pith/RYAWOJUE7FFRZHLR32OQNWICOQ/bundle.json","state":"https://pith.science/pith/RYAWOJUE7FFRZHLR32OQNWICOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYAWOJUE7FFRZHLR32OQNWICOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RYAWOJUE7FFRZHLR32OQNWICOQ","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":"984115d022c42df4dd278fd29d26f63af43d3b05f22b40c3c87bf54038fbe1a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-11-02T17:57:44Z","title_canon_sha256":"d611fdc1bb7ccfd49943adc64b15e7e5a13a3edd1e5fc97e017403d1dc8d3b05"},"schema_version":"1.0","source":{"id":"2211.01359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.01359","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"arxiv_version","alias_value":"2211.01359v2","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01359","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"pith_short_12","alias_value":"RYAWOJUE7FFR","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"pith_short_16","alias_value":"RYAWOJUE7FFRZHLR","created_at":"2026-07-05T09:23:42Z"},{"alias_kind":"pith_short_8","alias_value":"RYAWOJUE","created_at":"2026-07-05T09:23:42Z"}],"graph_snapshots":[{"event_id":"sha256:bbeab48707d09199ca38386a1ab110150d7270daa4b5899646cef64ca8528022","target":"graph","created_at":"2026-07-05T09:23:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.01359/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of `bounded size,' namely that each piece must be contained in an axis-aligned or arbitrarily rotated unit square or a unit disk, or that each piece has bounded perimeter, straight-line diameter or geodesic diameter. The problems are motivated by practical settings in manufacturing, finite element analysis, collision detection, vehicle routing, shipping and laser","authors_text":"Mikkel Abrahamsen, Nichlas Langhoff Rasmussen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-11-02T17:57:44Z","title":"Partitioning a Polygon Into Small Pieces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01359","kind":"arxiv","version":2},"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:4ea3aa04195c90ef8089d8a6d452a2996d83c757a0fec21d7d0eb0e51661983a","target":"record","created_at":"2026-07-05T09:23:42Z","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":"984115d022c42df4dd278fd29d26f63af43d3b05f22b40c3c87bf54038fbe1a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-11-02T17:57:44Z","title_canon_sha256":"d611fdc1bb7ccfd49943adc64b15e7e5a13a3edd1e5fc97e017403d1dc8d3b05"},"schema_version":"1.0","source":{"id":"2211.01359","kind":"arxiv","version":2}},"canonical_sha256":"8e01672684f94b1c9d71de9d06d90274162ff169bb375db813b8008ff830f214","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e01672684f94b1c9d71de9d06d90274162ff169bb375db813b8008ff830f214","first_computed_at":"2026-07-05T09:23:42.485876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:42.485876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"794JOCI8xHo0YPGbAU//fmYmPvyCY0Z7Hwi8QySFNu6QDcCZE8yljudf24GLqQZEU/ZeZpVPTR/K1lDV0VP9AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:42.486329Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.01359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ea3aa04195c90ef8089d8a6d452a2996d83c757a0fec21d7d0eb0e51661983a","sha256:bbeab48707d09199ca38386a1ab110150d7270daa4b5899646cef64ca8528022"],"state_sha256":"cc2715b8b589ddc6879c11b573a73c510c7fe5c1a9fd48bc8fe3607bf275f024"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqEp/Yxx0aPI9lO8UwgnuFYW4W4CwrM4i9eYQxwmbUb5N/+8yGoK5DCnzDBWFGmVX11UqFbhdYrTiP4/lYgsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:49:27.141618Z","bundle_sha256":"237e1c5d0192a7e8291a8f8521472fbf54564723bc3ce0d5c364c9a0bf092ba0"}}