{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:R6YADY3WSU6RRLZE3X3VSMPZOL","short_pith_number":"pith:R6YADY3W","canonical_record":{"source":{"id":"2507.04538","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-07-06T21:07:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9db3bc31c4ff84274b64a265c21c0b1a7e142197327f5570aa70df27462a09dd","abstract_canon_sha256":"e5eb96b26cce748e692e533f200e9ca16c33488e27bfb1a2393bb9eeceb50b40"},"schema_version":"1.0"},"canonical_sha256":"8fb001e376953d18af24ddf75931f972f02b32ce1a760a591216658c848b8ee4","source":{"kind":"arxiv","id":"2507.04538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04538","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04538v1","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04538","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"R6YADY3WSU6R","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"pith_short_16","alias_value":"R6YADY3WSU6RRLZE","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"pith_short_8","alias_value":"R6YADY3W","created_at":"2026-07-05T11:32:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:R6YADY3WSU6RRLZE3X3VSMPZOL","target":"record","payload":{"canonical_record":{"source":{"id":"2507.04538","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-07-06T21:07:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9db3bc31c4ff84274b64a265c21c0b1a7e142197327f5570aa70df27462a09dd","abstract_canon_sha256":"e5eb96b26cce748e692e533f200e9ca16c33488e27bfb1a2393bb9eeceb50b40"},"schema_version":"1.0"},"canonical_sha256":"8fb001e376953d18af24ddf75931f972f02b32ce1a760a591216658c848b8ee4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:49.578262Z","signature_b64":"gM2WbD2+z0+0kPDjCSQVFqGb0lY3LY16Or3inkMRwcB+GzI/iqA7Uxwn6o9Bn7U1ITxC9v23cm/XOLlhMB43Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb001e376953d18af24ddf75931f972f02b32ce1a760a591216658c848b8ee4","last_reissued_at":"2026-07-05T11:32:49.577786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:49.577786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.04538","source_version":1,"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-07-05T11:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JV4r7XcUhvIHnIv93GuqO4WMIrmbt9GoS32h7fZo7Tt0rWLhwvCWUUraP1zv81yLcMiDv5gk43J0v8PFiwPyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:26:08.283840Z"},"content_sha256":"98a0e53e9b1a127185484fd286197e501e6452b6ab19a3a5ad5f4077103dd433","schema_version":"1.0","event_id":"sha256:98a0e53e9b1a127185484fd286197e501e6452b6ab19a3a5ad5f4077103dd433"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:R6YADY3WSU6RRLZE3X3VSMPZOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decremental Greedy Polygons and Polyhedra Without Sharp Angles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"David Eppstein","submitted_at":"2025-07-06T21:07:33Z","abstract_excerpt":"We show that the max-min-angle polygon in a planar point set can be found in time $O(n\\log n)$ and a max-min-solid-angle convex polyhedron in a three-dimensional point set can be found in time $O(n^2)$. We also study the maxmin-angle polygonal curve in 3d, which we show to be $\\mathsf{NP}$-hard to find if repetitions are forbidden but can be found in near-cubic time if repeated vertices or line segments are allowed, by reducing the problem to finding a bottleneck cycle in a graph. We formalize a class of problems on which a decremental greedy algorithm can be guaranteed to find an optimal solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04538","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04538/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJpZXV02TsS/3aOt4xKDZSFpxfV5hUjPLhLmkRGnAuq31BYO6xPIbDlg8ds1s/73TGn9/6LjF4aCQlaFUA3vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:26:08.284415Z"},"content_sha256":"15781b91bc32badf397476a78b7998b3cda945fa454124e3e9ba5b9613f00254","schema_version":"1.0","event_id":"sha256:15781b91bc32badf397476a78b7998b3cda945fa454124e3e9ba5b9613f00254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6YADY3WSU6RRLZE3X3VSMPZOL/bundle.json","state_url":"https://pith.science/pith/R6YADY3WSU6RRLZE3X3VSMPZOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6YADY3WSU6RRLZE3X3VSMPZOL/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-08-12T21:26:08Z","links":{"resolver":"https://pith.science/pith/R6YADY3WSU6RRLZE3X3VSMPZOL","bundle":"https://pith.science/pith/R6YADY3WSU6RRLZE3X3VSMPZOL/bundle.json","state":"https://pith.science/pith/R6YADY3WSU6RRLZE3X3VSMPZOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6YADY3WSU6RRLZE3X3VSMPZOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:R6YADY3WSU6RRLZE3X3VSMPZOL","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":"e5eb96b26cce748e692e533f200e9ca16c33488e27bfb1a2393bb9eeceb50b40","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-07-06T21:07:33Z","title_canon_sha256":"9db3bc31c4ff84274b64a265c21c0b1a7e142197327f5570aa70df27462a09dd"},"schema_version":"1.0","source":{"id":"2507.04538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04538","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04538v1","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04538","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"R6YADY3WSU6R","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"pith_short_16","alias_value":"R6YADY3WSU6RRLZE","created_at":"2026-07-05T11:32:49Z"},{"alias_kind":"pith_short_8","alias_value":"R6YADY3W","created_at":"2026-07-05T11:32:49Z"}],"graph_snapshots":[{"event_id":"sha256:15781b91bc32badf397476a78b7998b3cda945fa454124e3e9ba5b9613f00254","target":"graph","created_at":"2026-07-05T11:32:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.04538/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that the max-min-angle polygon in a planar point set can be found in time $O(n\\log n)$ and a max-min-solid-angle convex polyhedron in a three-dimensional point set can be found in time $O(n^2)$. We also study the maxmin-angle polygonal curve in 3d, which we show to be $\\mathsf{NP}$-hard to find if repetitions are forbidden but can be found in near-cubic time if repeated vertices or line segments are allowed, by reducing the problem to finding a bottleneck cycle in a graph. We formalize a class of problems on which a decremental greedy algorithm can be guaranteed to find an optimal solu","authors_text":"David Eppstein","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-07-06T21:07:33Z","title":"Decremental Greedy Polygons and Polyhedra Without Sharp Angles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04538","kind":"arxiv","version":1},"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:98a0e53e9b1a127185484fd286197e501e6452b6ab19a3a5ad5f4077103dd433","target":"record","created_at":"2026-07-05T11:32:49Z","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":"e5eb96b26cce748e692e533f200e9ca16c33488e27bfb1a2393bb9eeceb50b40","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-07-06T21:07:33Z","title_canon_sha256":"9db3bc31c4ff84274b64a265c21c0b1a7e142197327f5570aa70df27462a09dd"},"schema_version":"1.0","source":{"id":"2507.04538","kind":"arxiv","version":1}},"canonical_sha256":"8fb001e376953d18af24ddf75931f972f02b32ce1a760a591216658c848b8ee4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fb001e376953d18af24ddf75931f972f02b32ce1a760a591216658c848b8ee4","first_computed_at":"2026-07-05T11:32:49.577786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:49.577786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gM2WbD2+z0+0kPDjCSQVFqGb0lY3LY16Or3inkMRwcB+GzI/iqA7Uxwn6o9Bn7U1ITxC9v23cm/XOLlhMB43Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:49.578262Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.04538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98a0e53e9b1a127185484fd286197e501e6452b6ab19a3a5ad5f4077103dd433","sha256:15781b91bc32badf397476a78b7998b3cda945fa454124e3e9ba5b9613f00254"],"state_sha256":"2aeefe25ddcf08e1f7fe41e16bed9e643ee16e9061542123cbda88c2faf108fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZR00X4sWYQGxtCh5jyV9lV/1r42Vb5h2p3wphuwwvbxzkVRfl1sBjt9gcm920m4JEOZyK1FXzKjPWgEA1tbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:26:08.288896Z","bundle_sha256":"dc0fa6bc32735784f56824b6fd77c95783da5c9b2ff9485eac3232cd8f739853"}}