{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ALNEEQYMEDRRBXL647XANH4PNQ","short_pith_number":"pith:ALNEEQYM","schema_version":"1.0","canonical_sha256":"02da42430c20e310dd7ee7ee069f8f6c2924d4b150544162bea78872db5918dd","source":{"kind":"arxiv","id":"1911.02569","version":1},"attestation_state":"computed","paper":{"title":"Minimum weight disk triangulations and fillings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Eyal Lubetzky, Itai Benjamini, Yuval Peled","submitted_at":"2019-11-06T19:00:00Z","abstract_excerpt":"We study the minimum total weight of a disk triangulation using vertices out of $\\{1,\\ldots,n\\}$, where the boundary is the triangle $(123)$ and the $\\binom{n}3$ triangles have independent weights, e.g. $\\mathrm{Exp}(1)$ or $\\mathrm{U}(0,1)$.\n  We show that for explicit constants $c_1,c_2>0$, this minimum is $c_1 \\frac{\\log n}{\\sqrt n} + c_2 \\frac{\\log\\log n}{\\sqrt n} + \\frac{Y_n}{\\sqrt n}$ where the random variable $Y_n$ is tight, and it is attained by a triangulation that consists of $\\frac14\\log n + O_P(\\sqrt{\\log n}) $ vertices.\n  Moreover, for disk triangulations that are canonical, in th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1911.02569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-11-06T19:00:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ea76f09e4a51e9930521e013e687eb8378c4c51c7c05944355ff6ff9e0f481f3","abstract_canon_sha256":"2ab60098a94a31b98e73adfb2e9a9b90d5c8dcad14d7c32ed740af341aeb72bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:39.424801Z","signature_b64":"QstAq5fIt9c13a8e0LFK/QZw5RL1YllWiosAhQXI1P6rnEYGYvcVbr6673Nn96Epm3tqmpS2U6gH//brPY6ZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02da42430c20e310dd7ee7ee069f8f6c2924d4b150544162bea78872db5918dd","last_reissued_at":"2026-07-05T00:17:39.424347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:39.424347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum weight disk triangulations and fillings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Eyal Lubetzky, Itai Benjamini, Yuval Peled","submitted_at":"2019-11-06T19:00:00Z","abstract_excerpt":"We study the minimum total weight of a disk triangulation using vertices out of $\\{1,\\ldots,n\\}$, where the boundary is the triangle $(123)$ and the $\\binom{n}3$ triangles have independent weights, e.g. $\\mathrm{Exp}(1)$ or $\\mathrm{U}(0,1)$.\n  We show that for explicit constants $c_1,c_2>0$, this minimum is $c_1 \\frac{\\log n}{\\sqrt n} + c_2 \\frac{\\log\\log n}{\\sqrt n} + \\frac{Y_n}{\\sqrt n}$ where the random variable $Y_n$ is tight, and it is attained by a triangulation that consists of $\\frac14\\log n + O_P(\\sqrt{\\log n}) $ vertices.\n  Moreover, for disk triangulations that are canonical, in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.02569","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/1911.02569/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.02569","created_at":"2026-07-05T00:17:39.424405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.02569v1","created_at":"2026-07-05T00:17:39.424405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.02569","created_at":"2026-07-05T00:17:39.424405+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALNEEQYMEDRR","created_at":"2026-07-05T00:17:39.424405+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALNEEQYMEDRRBXL6","created_at":"2026-07-05T00:17:39.424405+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALNEEQYM","created_at":"2026-07-05T00:17:39.424405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ","json":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ.json","graph_json":"https://pith.science/api/pith-number/ALNEEQYMEDRRBXL647XANH4PNQ/graph.json","events_json":"https://pith.science/api/pith-number/ALNEEQYMEDRRBXL647XANH4PNQ/events.json","paper":"https://pith.science/paper/ALNEEQYM"},"agent_actions":{"view_html":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ","download_json":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ.json","view_paper":"https://pith.science/paper/ALNEEQYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.02569&json=true","fetch_graph":"https://pith.science/api/pith-number/ALNEEQYMEDRRBXL647XANH4PNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ALNEEQYMEDRRBXL647XANH4PNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ/action/storage_attestation","attest_author":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ/action/author_attestation","sign_citation":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ/action/citation_signature","submit_replication":"https://pith.science/pith/ALNEEQYMEDRRBXL647XANH4PNQ/action/replication_record"}},"created_at":"2026-07-05T00:17:39.424405+00:00","updated_at":"2026-07-05T00:17:39.424405+00:00"}