{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R5V6MFZLFNUXX7Z34SGIGFGR5J","short_pith_number":"pith:R5V6MFZL","canonical_record":{"source":{"id":"1509.07669","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-25T10:45:49Z","cross_cats_sorted":[],"title_canon_sha256":"f82fe33a889db0c8a2c8116036996e72bb926e3e989f451cb97a667caab1c940","abstract_canon_sha256":"63fc52c56ce28ea1f62f325459ee2d26a9732ff1a68ceaedb057ec14fa536a09"},"schema_version":"1.0"},"canonical_sha256":"8f6be6172b2b697bff3be48c8314d1ea640cb535a79247e0102bc396bd567f87","source":{"kind":"arxiv","id":"1509.07669","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07669","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07669v3","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07669","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"R5V6MFZLFNUX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5V6MFZLFNUXX7Z3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5V6MFZL","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R5V6MFZLFNUXX7Z34SGIGFGR5J","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07669","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-25T10:45:49Z","cross_cats_sorted":[],"title_canon_sha256":"f82fe33a889db0c8a2c8116036996e72bb926e3e989f451cb97a667caab1c940","abstract_canon_sha256":"63fc52c56ce28ea1f62f325459ee2d26a9732ff1a68ceaedb057ec14fa536a09"},"schema_version":"1.0"},"canonical_sha256":"8f6be6172b2b697bff3be48c8314d1ea640cb535a79247e0102bc396bd567f87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:20.286205Z","signature_b64":"6gKAYlVsixUopRL2fDDRpDsEeg9hPM8Olh5Es6OvjtvSctmD//FRn6RVk4U17/RH334plQ19N3HEdo+cwEx3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f6be6172b2b697bff3be48c8314d1ea640cb535a79247e0102bc396bd567f87","last_reissued_at":"2026-05-18T00:45:20.285668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:20.285668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07669","source_version":3,"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-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpTjiInA9uk1amQADjNijoUV0BiV95d2SDch4ixisD0tZkKJBnffQtgahqTUXtxwTQXWr/4lg5uIj2eFBHWpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:45:07.998916Z"},"content_sha256":"600a6ba0f3fc225f22c778bffe829e56f41b2bd7033db76c9c5f2716fb580912","schema_version":"1.0","event_id":"sha256:600a6ba0f3fc225f22c778bffe829e56f41b2bd7033db76c9c5f2716fb580912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R5V6MFZLFNUXX7Z34SGIGFGR5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Space Trade-off Algorithms for Triangulating a Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Boris Aronov, Marcel Roeloffzen, Matias Korman, Simon Pratt","submitted_at":"2015-09-25T10:45:49Z","abstract_excerpt":"An $s$-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses $O(s)$ additional words of space. We present a randomized $s$-workspace algorithm for triangulating a simple polygon $P$ of $n$ vertices that runs in $O(n^2/s+n \\log n \\log^{5} (n/s))$ expected time using $O(s)$ variables, for any $s \\leq n$. In particular, when $s \\leq \\frac{n}{\\log n\\log^{5}\\log n}$ the algorithm runs in $O(n^2/s)$ expected time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07669","kind":"arxiv","version":3},"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-18T00:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lphHjlphgbbfdwyUJ6WHqg2bbWFuXHFo2hcsTrdqVxFAfNWBNBH0VtiUtcrrNSHPBsPDXOCvMJ3E8SKMPbVhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:45:07.999336Z"},"content_sha256":"685d1bc5f613c9edb14551b120e449a9d37f37e5f1e1c6f1544dabf26beb2a8d","schema_version":"1.0","event_id":"sha256:685d1bc5f613c9edb14551b120e449a9d37f37e5f1e1c6f1544dabf26beb2a8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5V6MFZLFNUXX7Z34SGIGFGR5J/bundle.json","state_url":"https://pith.science/pith/R5V6MFZLFNUXX7Z34SGIGFGR5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5V6MFZLFNUXX7Z34SGIGFGR5J/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-27T00:45:08Z","links":{"resolver":"https://pith.science/pith/R5V6MFZLFNUXX7Z34SGIGFGR5J","bundle":"https://pith.science/pith/R5V6MFZLFNUXX7Z34SGIGFGR5J/bundle.json","state":"https://pith.science/pith/R5V6MFZLFNUXX7Z34SGIGFGR5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5V6MFZLFNUXX7Z34SGIGFGR5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R5V6MFZLFNUXX7Z34SGIGFGR5J","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":"63fc52c56ce28ea1f62f325459ee2d26a9732ff1a68ceaedb057ec14fa536a09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-25T10:45:49Z","title_canon_sha256":"f82fe33a889db0c8a2c8116036996e72bb926e3e989f451cb97a667caab1c940"},"schema_version":"1.0","source":{"id":"1509.07669","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07669","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07669v3","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07669","created_at":"2026-05-18T00:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"R5V6MFZLFNUX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5V6MFZLFNUXX7Z3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5V6MFZL","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:685d1bc5f613c9edb14551b120e449a9d37f37e5f1e1c6f1544dabf26beb2a8d","target":"graph","created_at":"2026-05-18T00:45:20Z","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":"An $s$-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses $O(s)$ additional words of space. We present a randomized $s$-workspace algorithm for triangulating a simple polygon $P$ of $n$ vertices that runs in $O(n^2/s+n \\log n \\log^{5} (n/s))$ expected time using $O(s)$ variables, for any $s \\leq n$. In particular, when $s \\leq \\frac{n}{\\log n\\log^{5}\\log n}$ the algorithm runs in $O(n^2/s)$ expected time.","authors_text":"Andr\\'e van Renssen, Boris Aronov, Marcel Roeloffzen, Matias Korman, Simon Pratt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-25T10:45:49Z","title":"Time-Space Trade-off Algorithms for Triangulating a Simple Polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07669","kind":"arxiv","version":3},"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:600a6ba0f3fc225f22c778bffe829e56f41b2bd7033db76c9c5f2716fb580912","target":"record","created_at":"2026-05-18T00:45:20Z","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":"63fc52c56ce28ea1f62f325459ee2d26a9732ff1a68ceaedb057ec14fa536a09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-25T10:45:49Z","title_canon_sha256":"f82fe33a889db0c8a2c8116036996e72bb926e3e989f451cb97a667caab1c940"},"schema_version":"1.0","source":{"id":"1509.07669","kind":"arxiv","version":3}},"canonical_sha256":"8f6be6172b2b697bff3be48c8314d1ea640cb535a79247e0102bc396bd567f87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f6be6172b2b697bff3be48c8314d1ea640cb535a79247e0102bc396bd567f87","first_computed_at":"2026-05-18T00:45:20.285668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:20.285668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6gKAYlVsixUopRL2fDDRpDsEeg9hPM8Olh5Es6OvjtvSctmD//FRn6RVk4U17/RH334plQ19N3HEdo+cwEx3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:20.286205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07669","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:600a6ba0f3fc225f22c778bffe829e56f41b2bd7033db76c9c5f2716fb580912","sha256:685d1bc5f613c9edb14551b120e449a9d37f37e5f1e1c6f1544dabf26beb2a8d"],"state_sha256":"600af838510295fd8e5c0ab7af06e4cb78a771a3766755a445953032eb11eb69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pq3X3l1aJhlyWwtmp5EjWAOyq3p5HeT/HHLptPJ1Ol+3luIN2HleWd1iLdkRMAM/MRfGHe5F+vQe2ceXmuG/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:45:08.003270Z","bundle_sha256":"c1ca6254d1199d8034279649f3e1dd09011dcf881371bf6bb1fb554af674276a"}}