{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XUPXBFWWC35FICPZ2HNGDVZ3YC","short_pith_number":"pith:XUPXBFWW","canonical_record":{"source":{"id":"1111.5305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-22T19:49:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7b692aab7407b8ed54c80b8b424ba194dbaf3ce5b8894c139109076c7c07591a","abstract_canon_sha256":"3f7b73c3bfcfbac5bce0e969fe4fcdb261c441fc4a32ea337e87c14c7e7e3032"},"schema_version":"1.0"},"canonical_sha256":"bd1f7096d616fa5409f9d1da61d73bc0a0b51662945d789508a615f822b8826c","source":{"kind":"arxiv","id":"1111.5305","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5305","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5305v2","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5305","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"XUPXBFWWC35F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XUPXBFWWC35FICPZ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XUPXBFWW","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XUPXBFWWC35FICPZ2HNGDVZ3YC","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-22T19:49:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7b692aab7407b8ed54c80b8b424ba194dbaf3ce5b8894c139109076c7c07591a","abstract_canon_sha256":"3f7b73c3bfcfbac5bce0e969fe4fcdb261c441fc4a32ea337e87c14c7e7e3032"},"schema_version":"1.0"},"canonical_sha256":"bd1f7096d616fa5409f9d1da61d73bc0a0b51662945d789508a615f822b8826c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.334089Z","signature_b64":"4lxT4ZQ17trIewP+B6rR2+u4rv/dzcLHS36K49j9huSa/8RnoNOkcWKi+TeLBmb/02JrpH8Ki8FaB3ojYDkkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd1f7096d616fa5409f9d1da61d73bc0a0b51662945d789508a615f822b8826c","last_reissued_at":"2026-05-18T01:59:59.333643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.333643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5305","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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBJ4/kVIrZ8CN1XlZLXzHF2iPaVN9O29Ch/MslquC9URr/OVpDZcHgw3xAiuldfO29ibTX+LGBARElIce8o4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:52:14.592125Z"},"content_sha256":"f5be44b652e1fc9427d89533a03c97a05e154c728aab85c0c638f89cfeb2bb16","schema_version":"1.0","event_id":"sha256:f5be44b652e1fc9427d89533a03c97a05e154c728aab85c0c638f89cfeb2bb16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XUPXBFWWC35FICPZ2HNGDVZ3YC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Linear Program for Minimum-Weight Triangulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Arman Yousefi, Neal E. Young","submitted_at":"2011-11-22T19:49:25Z","abstract_excerpt":"Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics find the MWT, then so doe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5305","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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/DUQfQi4ihQK3JY4PZKszdvxw1Yk8rRAaxIezbVnzi7IcT2gitftoFQ53ELAeOca1ZfghY0aPPvmRHsy1VhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:52:14.592739Z"},"content_sha256":"e635f8c5a02a7b56f3c1a22c8112c7aa274afb58d1339ce45e4402a63835c136","schema_version":"1.0","event_id":"sha256:e635f8c5a02a7b56f3c1a22c8112c7aa274afb58d1339ce45e4402a63835c136"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUPXBFWWC35FICPZ2HNGDVZ3YC/bundle.json","state_url":"https://pith.science/pith/XUPXBFWWC35FICPZ2HNGDVZ3YC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUPXBFWWC35FICPZ2HNGDVZ3YC/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-27T15:52:14Z","links":{"resolver":"https://pith.science/pith/XUPXBFWWC35FICPZ2HNGDVZ3YC","bundle":"https://pith.science/pith/XUPXBFWWC35FICPZ2HNGDVZ3YC/bundle.json","state":"https://pith.science/pith/XUPXBFWWC35FICPZ2HNGDVZ3YC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUPXBFWWC35FICPZ2HNGDVZ3YC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XUPXBFWWC35FICPZ2HNGDVZ3YC","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":"3f7b73c3bfcfbac5bce0e969fe4fcdb261c441fc4a32ea337e87c14c7e7e3032","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-22T19:49:25Z","title_canon_sha256":"7b692aab7407b8ed54c80b8b424ba194dbaf3ce5b8894c139109076c7c07591a"},"schema_version":"1.0","source":{"id":"1111.5305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5305","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5305v2","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5305","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"XUPXBFWWC35F","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XUPXBFWWC35FICPZ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XUPXBFWW","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:e635f8c5a02a7b56f3c1a22c8112c7aa274afb58d1339ce45e4402a63835c136","target":"graph","created_at":"2026-05-18T01:59:59Z","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":"Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics find the MWT, then so doe","authors_text":"Arman Yousefi, Neal E. Young","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-22T19:49:25Z","title":"On a Linear Program for Minimum-Weight Triangulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5305","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:f5be44b652e1fc9427d89533a03c97a05e154c728aab85c0c638f89cfeb2bb16","target":"record","created_at":"2026-05-18T01:59:59Z","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":"3f7b73c3bfcfbac5bce0e969fe4fcdb261c441fc4a32ea337e87c14c7e7e3032","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-22T19:49:25Z","title_canon_sha256":"7b692aab7407b8ed54c80b8b424ba194dbaf3ce5b8894c139109076c7c07591a"},"schema_version":"1.0","source":{"id":"1111.5305","kind":"arxiv","version":2}},"canonical_sha256":"bd1f7096d616fa5409f9d1da61d73bc0a0b51662945d789508a615f822b8826c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd1f7096d616fa5409f9d1da61d73bc0a0b51662945d789508a615f822b8826c","first_computed_at":"2026-05-18T01:59:59.333643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:59.333643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4lxT4ZQ17trIewP+B6rR2+u4rv/dzcLHS36K49j9huSa/8RnoNOkcWKi+TeLBmb/02JrpH8Ki8FaB3ojYDkkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:59.334089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5be44b652e1fc9427d89533a03c97a05e154c728aab85c0c638f89cfeb2bb16","sha256:e635f8c5a02a7b56f3c1a22c8112c7aa274afb58d1339ce45e4402a63835c136"],"state_sha256":"f62b6f66289081a7e25787bfbecd9bcb7443872f79f257739b2bd6150489b1af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsz3j2e9kbBTvQ9TkdbPQYRGOF7Z+D8aSHl9fBb3d2qCdAOQ7obbx06PA4TWGYZ66kxDSvbJb9QbKQckPqXoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:52:14.596242Z","bundle_sha256":"7f19c617ce386269df6274c07b6a3a13b05ebab4f4dcc1a52a7d412b3cae19d0"}}