{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KN5Q6RIGYFIJMMWEZCFID4RWI2","short_pith_number":"pith:KN5Q6RIG","schema_version":"1.0","canonical_sha256":"537b0f4506c1509632c4c88a81f2364692aefb185451a4d560b03c1ce3b792d3","source":{"kind":"arxiv","id":"2601.22365","version":2},"attestation_state":"computed","paper":{"title":"Towards Solving the Gilbert-Pollak Conjecture via Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DM","authors_text":"Di He, Jingchu Gai, Liwei Wang, Tianyu Huang, Yankai Shu, Yisi Ke","submitted_at":"2026-01-29T22:18:04Z","abstract_excerpt":"The Gilbert-Pollak Conjecture \\citep{gilbert1968steiner}, also known as the Steiner Ratio Conjecture, states that for any finite point set in the Euclidean plane, the Steiner minimum tree has length at least $\\sqrt{3}/2 \\approx 0.866$ times that of the Euclidean minimum spanning tree (the Steiner ratio). A sequence of improvements through the 1980s culminated in a lower bound of $0.824$, with no substantial progress reported over the past three decades. Recent advances in LLMs have demonstrated strong performance on contest-level mathematical problems, yet their potential for addressing open, "},"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":"2601.22365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-01-29T22:18:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d66aa6e9fa52dfadc32c5d11ee421c4f0c948e0192ea7ee5d54bb78fe7923005","abstract_canon_sha256":"3a705e14487124237149f714ccc42f4a0fbb014118c90038fdba5a1d99777acc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:54.933080Z","signature_b64":"e4RzAA1QcjbGPL9blxnZ0eNrjxDYib84gMdosgVjUqzWmmu9oQR4vZ6UxqnhM1O6aRXFqjhyppVRZLkCDnvWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"537b0f4506c1509632c4c88a81f2364692aefb185451a4d560b03c1ce3b792d3","last_reissued_at":"2026-05-22T01:03:54.932061Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:54.932061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Solving the Gilbert-Pollak Conjecture via Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DM","authors_text":"Di He, Jingchu Gai, Liwei Wang, Tianyu Huang, Yankai Shu, Yisi Ke","submitted_at":"2026-01-29T22:18:04Z","abstract_excerpt":"The Gilbert-Pollak Conjecture \\citep{gilbert1968steiner}, also known as the Steiner Ratio Conjecture, states that for any finite point set in the Euclidean plane, the Steiner minimum tree has length at least $\\sqrt{3}/2 \\approx 0.866$ times that of the Euclidean minimum spanning tree (the Steiner ratio). A sequence of improvements through the 1980s culminated in a lower bound of $0.824$, with no substantial progress reported over the past three decades. Recent advances in LLMs have demonstrated strong performance on contest-level mathematical problems, yet their potential for addressing open, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.22365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.22365/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":"2601.22365","created_at":"2026-05-22T01:03:54.932179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.22365v2","created_at":"2026-05-22T01:03:54.932179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.22365","created_at":"2026-05-22T01:03:54.932179+00:00"},{"alias_kind":"pith_short_12","alias_value":"KN5Q6RIGYFIJ","created_at":"2026-05-22T01:03:54.932179+00:00"},{"alias_kind":"pith_short_16","alias_value":"KN5Q6RIGYFIJMMWE","created_at":"2026-05-22T01:03:54.932179+00:00"},{"alias_kind":"pith_short_8","alias_value":"KN5Q6RIG","created_at":"2026-05-22T01:03:54.932179+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/KN5Q6RIGYFIJMMWEZCFID4RWI2","json":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2.json","graph_json":"https://pith.science/api/pith-number/KN5Q6RIGYFIJMMWEZCFID4RWI2/graph.json","events_json":"https://pith.science/api/pith-number/KN5Q6RIGYFIJMMWEZCFID4RWI2/events.json","paper":"https://pith.science/paper/KN5Q6RIG"},"agent_actions":{"view_html":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2","download_json":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2.json","view_paper":"https://pith.science/paper/KN5Q6RIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.22365&json=true","fetch_graph":"https://pith.science/api/pith-number/KN5Q6RIGYFIJMMWEZCFID4RWI2/graph.json","fetch_events":"https://pith.science/api/pith-number/KN5Q6RIGYFIJMMWEZCFID4RWI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2/action/storage_attestation","attest_author":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2/action/author_attestation","sign_citation":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2/action/citation_signature","submit_replication":"https://pith.science/pith/KN5Q6RIGYFIJMMWEZCFID4RWI2/action/replication_record"}},"created_at":"2026-05-22T01:03:54.932179+00:00","updated_at":"2026-05-22T01:03:54.932179+00:00"}