{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SQV7AQ56P3AH65W4W6ITHZWLK4","short_pith_number":"pith:SQV7AQ56","schema_version":"1.0","canonical_sha256":"942bf043be7ec07f76dcb79133e6cb57092406e946d4d45dc4e52bac820dbed0","source":{"kind":"arxiv","id":"1105.3435","version":1},"attestation_state":"computed","paper":{"title":"Visibility-preserving convexifications using single-vertex moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.CO"],"primary_cat":"cs.CG","authors_text":"Bernardo M. Abrego, Gelasio Salazar, Jesus Leanos, Mario Cetina","submitted_at":"2011-05-17T17:16:12Z","abstract_excerpt":"Devadoss asked: (1) can every polygon be convexified so that no internal visibility (between vertices) is lost in the process? Moreover, (2) does such a convexification exist, in which exactly one vertex is moved at a time (that is, using {\\em single-vertex moves})? We prove the redundancy of the \"single-vertex moves\" condition: an affirmative answer to (1) implies an affirmative answer to (2). Since Aichholzer et al. recently proved (1), this settles (2)."},"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":"1105.3435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-05-17T17:16:12Z","cross_cats_sorted":["cs.RO","math.CO"],"title_canon_sha256":"393cf4f4b437ca9d9698aa2b72c86a183311d96b424da22ceb4cf6c34783a3da","abstract_canon_sha256":"5afa9a4cd7f9180ba6c001763b879a14a0c2b9d5ba5a47656dfe31998bf69109"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:00.047697Z","signature_b64":"QCLyqcN3PHu8IjKsl8Sjgym0MuEg4iq5RJk49r0vGzkb1q48sN3gR08y80bv8yLx2Ji8Cgi1U9vKC+M3dwRzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"942bf043be7ec07f76dcb79133e6cb57092406e946d4d45dc4e52bac820dbed0","last_reissued_at":"2026-05-18T04:22:00.047112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:00.047112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Visibility-preserving convexifications using single-vertex moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.CO"],"primary_cat":"cs.CG","authors_text":"Bernardo M. Abrego, Gelasio Salazar, Jesus Leanos, Mario Cetina","submitted_at":"2011-05-17T17:16:12Z","abstract_excerpt":"Devadoss asked: (1) can every polygon be convexified so that no internal visibility (between vertices) is lost in the process? Moreover, (2) does such a convexification exist, in which exactly one vertex is moved at a time (that is, using {\\em single-vertex moves})? We prove the redundancy of the \"single-vertex moves\" condition: an affirmative answer to (1) implies an affirmative answer to (2). Since Aichholzer et al. recently proved (1), this settles (2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3435","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":"1105.3435","created_at":"2026-05-18T04:22:00.047209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3435v1","created_at":"2026-05-18T04:22:00.047209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3435","created_at":"2026-05-18T04:22:00.047209+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQV7AQ56P3AH","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQV7AQ56P3AH65W4","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQV7AQ56","created_at":"2026-05-18T12:26:41.206345+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/SQV7AQ56P3AH65W4W6ITHZWLK4","json":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4.json","graph_json":"https://pith.science/api/pith-number/SQV7AQ56P3AH65W4W6ITHZWLK4/graph.json","events_json":"https://pith.science/api/pith-number/SQV7AQ56P3AH65W4W6ITHZWLK4/events.json","paper":"https://pith.science/paper/SQV7AQ56"},"agent_actions":{"view_html":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4","download_json":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4.json","view_paper":"https://pith.science/paper/SQV7AQ56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3435&json=true","fetch_graph":"https://pith.science/api/pith-number/SQV7AQ56P3AH65W4W6ITHZWLK4/graph.json","fetch_events":"https://pith.science/api/pith-number/SQV7AQ56P3AH65W4W6ITHZWLK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4/action/storage_attestation","attest_author":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4/action/author_attestation","sign_citation":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4/action/citation_signature","submit_replication":"https://pith.science/pith/SQV7AQ56P3AH65W4W6ITHZWLK4/action/replication_record"}},"created_at":"2026-05-18T04:22:00.047209+00:00","updated_at":"2026-05-18T04:22:00.047209+00:00"}