{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S22AY4BDXXBB7DU2X6P3DTLJ52","short_pith_number":"pith:S22AY4BD","canonical_record":{"source":{"id":"1709.09932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-28T13:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"fc3a773caa4531c940f7b153368ad452cb48866ee9570c0c5fa360ce9694ed4a","abstract_canon_sha256":"42277e5d3b3bf348429a0499e9bd66ea78f0d96be814c65eb6da72cad6f617da"},"schema_version":"1.0"},"canonical_sha256":"96b40c7023bdc21f8e9abf9fb1cd69eea84d1a7d15b845f531b1429a8be62be9","source":{"kind":"arxiv","id":"1709.09932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09932","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09932v2","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09932","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"S22AY4BDXXBB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S22AY4BDXXBB7DU2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S22AY4BD","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S22AY4BDXXBB7DU2X6P3DTLJ52","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-28T13:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"fc3a773caa4531c940f7b153368ad452cb48866ee9570c0c5fa360ce9694ed4a","abstract_canon_sha256":"42277e5d3b3bf348429a0499e9bd66ea78f0d96be814c65eb6da72cad6f617da"},"schema_version":"1.0"},"canonical_sha256":"96b40c7023bdc21f8e9abf9fb1cd69eea84d1a7d15b845f531b1429a8be62be9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:53.284045Z","signature_b64":"QpG/9b4f1SoZ/ZUq4gnMJTJ1tc5ZhqDesvk53X2xCq3Rv7JKSbpJ5Tp1zs+JCgv6HW0GVbDFJaD8n0sqO0LTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b40c7023bdc21f8e9abf9fb1cd69eea84d1a7d15b845f531b1429a8be62be9","last_reissued_at":"2026-05-18T00:18:53.283499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:53.283499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09932","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-18T00:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KmoY1B3KMy/SnQ3ZFKXAdEPSAWZ+YSUsBl4WEkn93qbgIpqew9Tfb0qmtC5Vznnm4mmt+YFzSHGpzh/lG2ZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:22:49.641199Z"},"content_sha256":"641cf32c602c7692bce8c507a42deabb6f0dee9f5abad26faac7f8ea9300116c","schema_version":"1.0","event_id":"sha256:641cf32c602c7692bce8c507a42deabb6f0dee9f5abad26faac7f8ea9300116c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S22AY4BDXXBB7DU2X6P3DTLJ52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn","submitted_at":"2017-09-28T13:13:25Z","abstract_excerpt":"We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only $O(s)$ words of workspace in addition to the memory for input. In this paper, we present an $O(n^2/s)$-time $s$-workspace algorithm for subdividing a simple polygon into $O(\\min\\{n/s,s\\})$ subpolygons of complexity $O(\\max\\{n/s,s\\})$.\n  As applications of the subdivision, the previously best known time-space trade-offs for the following three geometric problems are improved immediately: (1) computing the shortest path between two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09932","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-18T00:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRPyhUzEmY/SgtPJIiAFIsAf42v5R41/oHHjfp6N0djKZLSOXgMAvAIAeP/GhH3CZxXCJEZDvvVajzz1V6p8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:22:49.641923Z"},"content_sha256":"34afe282a1196ca965473c5575d09aaa43597b3b7ed757522f050797d16e3dd6","schema_version":"1.0","event_id":"sha256:34afe282a1196ca965473c5575d09aaa43597b3b7ed757522f050797d16e3dd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S22AY4BDXXBB7DU2X6P3DTLJ52/bundle.json","state_url":"https://pith.science/pith/S22AY4BDXXBB7DU2X6P3DTLJ52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S22AY4BDXXBB7DU2X6P3DTLJ52/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-06-08T00:22:49Z","links":{"resolver":"https://pith.science/pith/S22AY4BDXXBB7DU2X6P3DTLJ52","bundle":"https://pith.science/pith/S22AY4BDXXBB7DU2X6P3DTLJ52/bundle.json","state":"https://pith.science/pith/S22AY4BDXXBB7DU2X6P3DTLJ52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S22AY4BDXXBB7DU2X6P3DTLJ52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S22AY4BDXXBB7DU2X6P3DTLJ52","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":"42277e5d3b3bf348429a0499e9bd66ea78f0d96be814c65eb6da72cad6f617da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-28T13:13:25Z","title_canon_sha256":"fc3a773caa4531c940f7b153368ad452cb48866ee9570c0c5fa360ce9694ed4a"},"schema_version":"1.0","source":{"id":"1709.09932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09932","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09932v2","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09932","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"S22AY4BDXXBB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S22AY4BDXXBB7DU2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S22AY4BD","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:34afe282a1196ca965473c5575d09aaa43597b3b7ed757522f050797d16e3dd6","target":"graph","created_at":"2026-05-18T00:18:53Z","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":"We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only $O(s)$ words of workspace in addition to the memory for input. In this paper, we present an $O(n^2/s)$-time $s$-workspace algorithm for subdividing a simple polygon into $O(\\min\\{n/s,s\\})$ subpolygons of complexity $O(\\max\\{n/s,s\\})$.\n  As applications of the subdivision, the previously best known time-space trade-offs for the following three geometric problems are improved immediately: (1) computing the shortest path between two ","authors_text":"Eunjin Oh, Hee-Kap Ahn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-28T13:13:25Z","title":"A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09932","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:641cf32c602c7692bce8c507a42deabb6f0dee9f5abad26faac7f8ea9300116c","target":"record","created_at":"2026-05-18T00:18:53Z","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":"42277e5d3b3bf348429a0499e9bd66ea78f0d96be814c65eb6da72cad6f617da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-28T13:13:25Z","title_canon_sha256":"fc3a773caa4531c940f7b153368ad452cb48866ee9570c0c5fa360ce9694ed4a"},"schema_version":"1.0","source":{"id":"1709.09932","kind":"arxiv","version":2}},"canonical_sha256":"96b40c7023bdc21f8e9abf9fb1cd69eea84d1a7d15b845f531b1429a8be62be9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96b40c7023bdc21f8e9abf9fb1cd69eea84d1a7d15b845f531b1429a8be62be9","first_computed_at":"2026-05-18T00:18:53.283499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:53.283499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QpG/9b4f1SoZ/ZUq4gnMJTJ1tc5ZhqDesvk53X2xCq3Rv7JKSbpJ5Tp1zs+JCgv6HW0GVbDFJaD8n0sqO0LTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:53.284045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:641cf32c602c7692bce8c507a42deabb6f0dee9f5abad26faac7f8ea9300116c","sha256:34afe282a1196ca965473c5575d09aaa43597b3b7ed757522f050797d16e3dd6"],"state_sha256":"450d32106ee10c619a256daeeb91a0746ae70d1d60f65b26c2fa481980f974cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E86FQYVkWFR3GBcVBK0LZ9+SpboRqfIK1ZoZbE25zbJUJWoP3rTeS44X9xn/FNBLOF77T6Tf6TgbeZsCSxHFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T00:22:49.645887Z","bundle_sha256":"f255b465a2b7b5901533fe30ff0bd6a22f4d7dc18eb87948f8e94e646682b9f9"}}