{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FUJWFFZDHBF6WPWFMEI5OC6P4Z","short_pith_number":"pith:FUJWFFZD","schema_version":"1.0","canonical_sha256":"2d13629723384beb3ec56111d70bcfe64998cac9a773603d2ce5a1badbfe8fcd","source":{"kind":"arxiv","id":"1112.5904","version":2},"attestation_state":"computed","paper":{"title":"Memory-Constrained Algorithms for Simple Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, G\\\"unter Rote, Kevin Buchin, Maike Buchin, Matias Korman, Tetsuo Asano, Wolfgang Mulzer","submitted_at":"2011-12-27T00:44:55Z","abstract_excerpt":"A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of $O(\\log n)$ bits, where $n$ is the size of the input. We assume that a simple $n$-gon is given by the ordered sequence of its vertices. We show that we can find a triangulation of a plane straight-line graph in $O(n^2)$ time. We also consider preprocessing a simple polygon for shortest path queries when the space constraint is relaxed to allow $s$ words of working space. After a preprocessing of $O(n^2)$ time, we are able to solve shortest path queries between any two points inside t"},"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":"1112.5904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-27T00:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"6668c67189b5e61d2b394766cd71625469f460f0c2469965ceafa475889eeac3","abstract_canon_sha256":"22a993a2c607e6094d8a8ab4bf76e91617097ec664be70f95f96f087b493af67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:08.717050Z","signature_b64":"sajRd0j0bcYsHE/b72qxXJH8WgozgzKIlwYGHdQ3aoKcYYIaDjcLKjFDckxl9/bx0keiskxYrIw80tAAc8nZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d13629723384beb3ec56111d70bcfe64998cac9a773603d2ce5a1badbfe8fcd","last_reissued_at":"2026-05-18T03:21:08.716288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:08.716288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-Constrained Algorithms for Simple Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, G\\\"unter Rote, Kevin Buchin, Maike Buchin, Matias Korman, Tetsuo Asano, Wolfgang Mulzer","submitted_at":"2011-12-27T00:44:55Z","abstract_excerpt":"A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of $O(\\log n)$ bits, where $n$ is the size of the input. We assume that a simple $n$-gon is given by the ordered sequence of its vertices. We show that we can find a triangulation of a plane straight-line graph in $O(n^2)$ time. We also consider preprocessing a simple polygon for shortest path queries when the space constraint is relaxed to allow $s$ words of working space. After a preprocessing of $O(n^2)$ time, we are able to solve shortest path queries between any two points inside t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5904","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":""},"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":"1112.5904","created_at":"2026-05-18T03:21:08.716425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5904v2","created_at":"2026-05-18T03:21:08.716425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5904","created_at":"2026-05-18T03:21:08.716425+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUJWFFZDHBF6","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUJWFFZDHBF6WPWF","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUJWFFZD","created_at":"2026-05-18T12:26:28.662955+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/FUJWFFZDHBF6WPWFMEI5OC6P4Z","json":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z.json","graph_json":"https://pith.science/api/pith-number/FUJWFFZDHBF6WPWFMEI5OC6P4Z/graph.json","events_json":"https://pith.science/api/pith-number/FUJWFFZDHBF6WPWFMEI5OC6P4Z/events.json","paper":"https://pith.science/paper/FUJWFFZD"},"agent_actions":{"view_html":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z","download_json":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z.json","view_paper":"https://pith.science/paper/FUJWFFZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5904&json=true","fetch_graph":"https://pith.science/api/pith-number/FUJWFFZDHBF6WPWFMEI5OC6P4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/FUJWFFZDHBF6WPWFMEI5OC6P4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/action/storage_attestation","attest_author":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/action/author_attestation","sign_citation":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/action/citation_signature","submit_replication":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/action/replication_record"}},"created_at":"2026-05-18T03:21:08.716425+00:00","updated_at":"2026-05-18T03:21:08.716425+00:00"}