{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HRPVBNILTFUSV3AFABS5I2O2OC","short_pith_number":"pith:HRPVBNIL","canonical_record":{"source":{"id":"1802.06415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-18T18:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"797b917e8c60b6bd87739eab4f66a9ec54299621ba9dc276a5406e0c3b3cd648","abstract_canon_sha256":"876baabb72cc4c0da93730e7b3bda31c6227414c0b1ae8daf5690540a5a39e9f"},"schema_version":"1.0"},"canonical_sha256":"3c5f50b50b99692aec050065d469da70b69ba40a6fa3fe333b8c3c1469517f8d","source":{"kind":"arxiv","id":"1802.06415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06415","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06415v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06415","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"HRPVBNILTFUS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HRPVBNILTFUSV3AF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HRPVBNIL","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HRPVBNILTFUSV3AFABS5I2O2OC","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-18T18:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"797b917e8c60b6bd87739eab4f66a9ec54299621ba9dc276a5406e0c3b3cd648","abstract_canon_sha256":"876baabb72cc4c0da93730e7b3bda31c6227414c0b1ae8daf5690540a5a39e9f"},"schema_version":"1.0"},"canonical_sha256":"3c5f50b50b99692aec050065d469da70b69ba40a6fa3fe333b8c3c1469517f8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.358251Z","signature_b64":"yMz3+l+gMXOv2ePA2HV0Qz0QEi0mykmt7bk1tfBQ1q/5SqW9EL1NsO6DFPkJ47Q7gOLSpULCepjH+txwszgzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c5f50b50b99692aec050065d469da70b69ba40a6fa3fe333b8c3c1469517f8d","last_reissued_at":"2026-05-18T00:23:03.357664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.357664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06415","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-05-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soen7mxRm9EombZSIFPcZCaead/INRmgBIq4zTG6oU6ILTLwWC7g9/s4LZg1NTEOMGx56HjvCtBd6+4M+qWOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:02:27.016465Z"},"content_sha256":"8e0f952bc8a79efadff6aff6d9e716ccb40fa5898c8d6c39b676c8a106a23dec","schema_version":"1.0","event_id":"sha256:8e0f952bc8a79efadff6aff6d9e716ccb40fa5898c8d6c39b676c8a106a23dec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HRPVBNILTFUSV3AFABS5I2O2OC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andreas Haas","submitted_at":"2018-02-18T18:00:32Z","abstract_excerpt":"We consider practical methods for the problem of finding a minimum-weight triangulation (MWT) of a planar point set, a classic problem of computational geometry with many applications. While Mulzer and Rote proved in 2006 that computing an MWT is NP-hard, Beirouti and Snoeyink showed in 1998 that computing provably optimal solutions for MWT instances of up to 80,000 uniformly distributed points is possible, making use of clever heuristics that are based on geometric insights. We show that these techniques can be refined and extended to instances of much bigger size and different type, based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06415","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":""},"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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvnFICiRc0KWO1IPq0AhTB2euGkvvZsyLrpO5RnLXqTSK4CxmYu3OSrXBA1DOSnz3nOEpWPjMEz5YRyRvRMICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:02:27.016817Z"},"content_sha256":"34d0580e7d622743d5421518b97f2643c45a8be1c15ff68c48b57be22d8293e3","schema_version":"1.0","event_id":"sha256:34d0580e7d622743d5421518b97f2643c45a8be1c15ff68c48b57be22d8293e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRPVBNILTFUSV3AFABS5I2O2OC/bundle.json","state_url":"https://pith.science/pith/HRPVBNILTFUSV3AFABS5I2O2OC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRPVBNILTFUSV3AFABS5I2O2OC/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-27T23:02:27Z","links":{"resolver":"https://pith.science/pith/HRPVBNILTFUSV3AFABS5I2O2OC","bundle":"https://pith.science/pith/HRPVBNILTFUSV3AFABS5I2O2OC/bundle.json","state":"https://pith.science/pith/HRPVBNILTFUSV3AFABS5I2O2OC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRPVBNILTFUSV3AFABS5I2O2OC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HRPVBNILTFUSV3AFABS5I2O2OC","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":"876baabb72cc4c0da93730e7b3bda31c6227414c0b1ae8daf5690540a5a39e9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-18T18:00:32Z","title_canon_sha256":"797b917e8c60b6bd87739eab4f66a9ec54299621ba9dc276a5406e0c3b3cd648"},"schema_version":"1.0","source":{"id":"1802.06415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06415","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06415v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06415","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"HRPVBNILTFUS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HRPVBNILTFUSV3AF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HRPVBNIL","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:34d0580e7d622743d5421518b97f2643c45a8be1c15ff68c48b57be22d8293e3","target":"graph","created_at":"2026-05-18T00:23:03Z","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 consider practical methods for the problem of finding a minimum-weight triangulation (MWT) of a planar point set, a classic problem of computational geometry with many applications. While Mulzer and Rote proved in 2006 that computing an MWT is NP-hard, Beirouti and Snoeyink showed in 1998 that computing provably optimal solutions for MWT instances of up to 80,000 uniformly distributed points is possible, making use of clever heuristics that are based on geometric insights. We show that these techniques can be refined and extended to instances of much bigger size and different type, based on","authors_text":"Andreas Haas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-18T18:00:32Z","title":"Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06415","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:8e0f952bc8a79efadff6aff6d9e716ccb40fa5898c8d6c39b676c8a106a23dec","target":"record","created_at":"2026-05-18T00:23:03Z","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":"876baabb72cc4c0da93730e7b3bda31c6227414c0b1ae8daf5690540a5a39e9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-18T18:00:32Z","title_canon_sha256":"797b917e8c60b6bd87739eab4f66a9ec54299621ba9dc276a5406e0c3b3cd648"},"schema_version":"1.0","source":{"id":"1802.06415","kind":"arxiv","version":1}},"canonical_sha256":"3c5f50b50b99692aec050065d469da70b69ba40a6fa3fe333b8c3c1469517f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c5f50b50b99692aec050065d469da70b69ba40a6fa3fe333b8c3c1469517f8d","first_computed_at":"2026-05-18T00:23:03.357664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.357664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yMz3+l+gMXOv2ePA2HV0Qz0QEi0mykmt7bk1tfBQ1q/5SqW9EL1NsO6DFPkJ47Q7gOLSpULCepjH+txwszgzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.358251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e0f952bc8a79efadff6aff6d9e716ccb40fa5898c8d6c39b676c8a106a23dec","sha256:34d0580e7d622743d5421518b97f2643c45a8be1c15ff68c48b57be22d8293e3"],"state_sha256":"aca7b25b3fd1cb51e2ba77859d29cbf019be56a6a5557b7421dd583f69e0e7da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBh1Y/mhJAbtUB1csvdWwDoMpINPuHMp71ZAY2zp8YQ3kkhmoOuxILdW8vCO70L2eiX1sFutkiZxH9YLXZiBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:02:27.019676Z","bundle_sha256":"b1bd900692b34cff3adc97875f518ea595c90c818520341e552ddc8ae7fc5b1a"}}