{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FUJWFFZDHBF6WPWFMEI5OC6P4Z","short_pith_number":"pith:FUJWFFZD","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"},"canonical_sha256":"2d13629723384beb3ec56111d70bcfe64998cac9a773603d2ce5a1badbfe8fcd","source":{"kind":"arxiv","id":"1112.5904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5904","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5904v2","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5904","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"FUJWFFZDHBF6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUJWFFZDHBF6WPWF","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUJWFFZD","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FUJWFFZDHBF6WPWFMEI5OC6P4Z","target":"record","payload":{"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"},"canonical_sha256":"2d13629723384beb3ec56111d70bcfe64998cac9a773603d2ce5a1badbfe8fcd","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"},"source_kind":"arxiv","source_id":"1112.5904","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-05-18T03:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGUq24bvsZp4QLU979ESi0gLeCDC0KTA8JUeDUrg5lOciOBC4kU6xcr5q9uazNv+ahhfnBGl8dcQw0FlirEbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T04:09:00.107591Z"},"content_sha256":"98106e15ac228a752b86b384b1ecc13c9416e6ba5f0a150a354347e3d68165df","schema_version":"1.0","event_id":"sha256:98106e15ac228a752b86b384b1ecc13c9416e6ba5f0a150a354347e3d68165df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FUJWFFZDHBF6WPWFMEI5OC6P4Z","target":"graph","payload":{"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"},"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-18T03:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8moKuxRZ6PcJRVfuTnWbwrZNx6crcNgeIrKOp9ZeJ7AFjuM1/VAsKWZsESua4VgYQOtSD5w00MsncOgrgJUODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T04:09:00.107934Z"},"content_sha256":"54c43d92a44e386d5fdd035c21728a88620455b7ebb84af369630001ca880bc1","schema_version":"1.0","event_id":"sha256:54c43d92a44e386d5fdd035c21728a88620455b7ebb84af369630001ca880bc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/bundle.json","state_url":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/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-05-21T04:09:00Z","links":{"resolver":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z","bundle":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/bundle.json","state":"https://pith.science/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUJWFFZDHBF6WPWFMEI5OC6P4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FUJWFFZDHBF6WPWFMEI5OC6P4Z","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":"22a993a2c607e6094d8a8ab4bf76e91617097ec664be70f95f96f087b493af67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-27T00:44:55Z","title_canon_sha256":"6668c67189b5e61d2b394766cd71625469f460f0c2469965ceafa475889eeac3"},"schema_version":"1.0","source":{"id":"1112.5904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5904","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5904v2","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5904","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"FUJWFFZDHBF6","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUJWFFZDHBF6WPWF","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUJWFFZD","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:54c43d92a44e386d5fdd035c21728a88620455b7ebb84af369630001ca880bc1","target":"graph","created_at":"2026-05-18T03:21:08Z","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":"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","authors_text":"Andr\\'e Schulz, G\\\"unter Rote, Kevin Buchin, Maike Buchin, Matias Korman, Tetsuo Asano, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-27T00:44:55Z","title":"Memory-Constrained Algorithms for Simple Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5904","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:98106e15ac228a752b86b384b1ecc13c9416e6ba5f0a150a354347e3d68165df","target":"record","created_at":"2026-05-18T03:21:08Z","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":"22a993a2c607e6094d8a8ab4bf76e91617097ec664be70f95f96f087b493af67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-27T00:44:55Z","title_canon_sha256":"6668c67189b5e61d2b394766cd71625469f460f0c2469965ceafa475889eeac3"},"schema_version":"1.0","source":{"id":"1112.5904","kind":"arxiv","version":2}},"canonical_sha256":"2d13629723384beb3ec56111d70bcfe64998cac9a773603d2ce5a1badbfe8fcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d13629723384beb3ec56111d70bcfe64998cac9a773603d2ce5a1badbfe8fcd","first_computed_at":"2026-05-18T03:21:08.716288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:08.716288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sajRd0j0bcYsHE/b72qxXJH8WgozgzKIlwYGHdQ3aoKcYYIaDjcLKjFDckxl9/bx0keiskxYrIw80tAAc8nZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:08.717050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98106e15ac228a752b86b384b1ecc13c9416e6ba5f0a150a354347e3d68165df","sha256:54c43d92a44e386d5fdd035c21728a88620455b7ebb84af369630001ca880bc1"],"state_sha256":"8bc23a2656a41923995e8187cc39ad5f382d537c8ad30b6808f4e17cbccccfbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CK7ifzFNrPAMFoR/8BYhhmQkWFHBA/N+5Y0JHuk9kYLB9AsdN1MCq+4ZIgLkH1zp+kMdaCqokavljAgPfk/mDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T04:09:00.110284Z","bundle_sha256":"2067cb39ff1804f295839dc621cbb3ef587c378e43598cbc391efa3c4a7d9d63"}}