{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3J7QY3EPRHVXCZXU4S67QUWHVH","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e44f258f50164cc7be2591627e1dcc8c6e8775d94eb91f26f9056e3e5220090e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","title_canon_sha256":"d3165d63a715942be76f90218de47ff35da75d2f0b33be107f2c212e6f2267e3"},"schema_version":"1.0","source":{"id":"2608.00795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00795","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00795v1","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00795","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_12","alias_value":"3J7QY3EPRHVX","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_16","alias_value":"3J7QY3EPRHVXCZXU","created_at":"2026-08-04T01:55:09Z"},{"alias_kind":"pith_short_8","alias_value":"3J7QY3EP","created_at":"2026-08-04T01:55:09Z"}],"graph_snapshots":[{"event_id":"sha256:61b5eeb667c4c31892f3e8431812fb17681146ca6f228810d8593089ea87e7cb","target":"graph","created_at":"2026-08-04T01:55:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.00795/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Donghoon Shin, Eungyu Woo","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","title":"Exact Algorithms for Minimum Steiner Point Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00795","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:44aa831da7c616b72a920a88ce1b27d9e1206876a786fc788f7b14757c309483","target":"record","created_at":"2026-08-04T01:55:09Z","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":"e44f258f50164cc7be2591627e1dcc8c6e8775d94eb91f26f9056e3e5220090e","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-08-01T17:51:30Z","title_canon_sha256":"d3165d63a715942be76f90218de47ff35da75d2f0b33be107f2c212e6f2267e3"},"schema_version":"1.0","source":{"id":"2608.00795","kind":"arxiv","version":1}},"canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da7f0c6c8f89eb7166f4e4bdf852c7a9d76329a294cb4b6dfba4b8707693f9f1","first_computed_at":"2026-08-04T01:55:09.722831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T01:55:09.722831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DvKDsXrQ8hXso8P9zLgVD83BLSQXVF+SIYX8fP/a0Q/t+18tqXpwnlx2qWM1qNsQrpuKz4vjoCraKzWQXzl3DQ==","signature_status":"signed_v1","signed_at":"2026-08-04T01:55:09.724358Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.00795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44aa831da7c616b72a920a88ce1b27d9e1206876a786fc788f7b14757c309483","sha256:61b5eeb667c4c31892f3e8431812fb17681146ca6f228810d8593089ea87e7cb","sha256:01ed5076dd914444fac6710cdd5cdc7619337b3576c8203cb3f9ded59d0b3731"],"state_sha256":"e809a35d3cd0f67f272f1655fdd6d770ae3249ea348c5b6df9c495abd291e4f1"}