{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3J7QY3EPRHVXCZXU4S67QUWHVH","short_pith_number":"pith:3J7QY3EP","schema_version":"1.0","canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","source":{"kind":"arxiv","id":"2608.00795","version":1},"attestation_state":"computed","paper":{"title":"Exact Algorithms for Minimum Steiner Point Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Donghoon Shin, Eungyu Woo","submitted_at":"2026-08-01T17:51:30Z","abstract_excerpt":"Given distinct terminals $P\\subset R^2$ and $R>0$, the Steiner tree problem with minimum number of Steiner points and bounded edge length asks for a straight line tree spanning $P$, with every edge of length at most $R$, that minimizes the number of Steiner points. Length is measured in a fixed $L_p$ metric with $p\\in Q_{\\ge 1}\\cup\\{\\infty\\}$. The optimum $k$ is not bounded by $n$, even in two-terminal case.\n  We give a deterministic exact algorithm that computes an optimal implicit representation in $n^{O(n)}$ time, independent of $k$, in the computation model of Section~\\ref{subseccomputatio"},"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":"2608.00795","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3165d63a715942be76f90218de47ff35da75d2f0b33be107f2c212e6f2267e3","abstract_canon_sha256":"e44f258f50164cc7be2591627e1dcc8c6e8775d94eb91f26f9056e3e5220090e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:55:09.724358Z","signature_b64":"DvKDsXrQ8hXso8P9zLgVD83BLSQXVF+SIYX8fP/a0Q/t+18tqXpwnlx2qWM1qNsQrpuKz4vjoCraKzWQXzl3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","last_reissued_at":"2026-08-04T01:55:09.722831Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:55:09.722831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Algorithms for Minimum Steiner Point Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Donghoon Shin, Eungyu Woo","submitted_at":"2026-08-01T17:51:30Z","abstract_excerpt":"Given distinct terminals $P\\subset R^2$ and $R>0$, the Steiner tree problem with minimum number of Steiner points and bounded edge length asks for a straight line tree spanning $P$, with every edge of length at most $R$, that minimizes the number of Steiner points. Length is measured in a fixed $L_p$ metric with $p\\in Q_{\\ge 1}\\cup\\{\\infty\\}$. The optimum $k$ is not bounded by $n$, even in two-terminal case.\n  We give a deterministic exact algorithm that computes an optimal implicit representation in $n^{O(n)}$ time, independent of $k$, in the computation model of Section~\\ref{subseccomputatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00795","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/2608.00795/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":"2608.00795","created_at":"2026-08-04T01:55:09.724181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00795v1","created_at":"2026-08-04T01:55:09.724181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00795","created_at":"2026-08-04T01:55:09.724181+00:00"},{"alias_kind":"pith_short_12","alias_value":"3J7QY3EPRHVX","created_at":"2026-08-04T01:55:09.724181+00:00"},{"alias_kind":"pith_short_16","alias_value":"3J7QY3EPRHVXCZXU","created_at":"2026-08-04T01:55:09.724181+00:00"},{"alias_kind":"pith_short_8","alias_value":"3J7QY3EP","created_at":"2026-08-04T01:55:09.724181+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/3J7QY3EPRHVXCZXU4S67QUWHVH","json":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH.json","graph_json":"https://pith.science/api/pith-number/3J7QY3EPRHVXCZXU4S67QUWHVH/graph.json","events_json":"https://pith.science/api/pith-number/3J7QY3EPRHVXCZXU4S67QUWHVH/events.json","paper":"https://pith.science/paper/3J7QY3EP"},"agent_actions":{"view_html":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH","download_json":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH.json","view_paper":"https://pith.science/paper/3J7QY3EP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00795&json=true","fetch_graph":"https://pith.science/api/pith-number/3J7QY3EPRHVXCZXU4S67QUWHVH/graph.json","fetch_events":"https://pith.science/api/pith-number/3J7QY3EPRHVXCZXU4S67QUWHVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/action/storage_attestation","attest_author":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/action/author_attestation","sign_citation":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/action/citation_signature","submit_replication":"https://pith.science/pith/3J7QY3EPRHVXCZXU4S67QUWHVH/action/replication_record"}},"created_at":"2026-08-04T01:55:09.724181+00:00","updated_at":"2026-08-04T01:55:09.724181+00:00"}