{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LMOOXO7J2DIVVNHOZ7INOF3HAA","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":"b1edbc5f0077a516c5adf5bcc8560676cd10462679dbac97ab35b07cc139cf3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T16:03:54Z","title_canon_sha256":"37acef56bd1d5f7e70ce80c9c68526e31af960f7b5407d8af748d2784c2196c6"},"schema_version":"1.0","source":{"id":"1509.05681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05681","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05681v2","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05681","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"LMOOXO7J2DIV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LMOOXO7J2DIVVNHO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LMOOXO7J","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:2bdfabdf6c6c1fa82afa0ff98fe3cefa88e681a2f8222daa25f1111079caae50","target":"graph","created_at":"2026-05-18T01:00:12Z","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":"Given a set of $k$-colored points in the plane, we consider the problem of finding $k$ trees such that each tree connects all points of one color class, no two trees cross, and the total edge length of the trees is minimized. For $k=1$, this is the well-known Euclidean Steiner tree problem. For general $k$, a $k\\rho$-approximation algorithm is known, where $\\rho \\le 1.21$ is the Steiner ratio.\n  We present a PTAS for $k=2$, a $(5/3+\\varepsilon)$-approximation algorithm for $k=3$, and two approximation algorithms for general~$k$, with ratios $O(\\sqrt n \\log k)$ and $k+\\varepsilon$.","authors_text":"Alexander Wolff, Joachim Spoerhase, Krzysztof Fleszar, Philipp Kindermann, Sergey Bereg, Sergey Pupyrev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T16:03:54Z","title":"Colored Non-Crossing Euclidean Steiner Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05681","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:fca5409b23688b3905f29d2c95ee803f0ee7af8d20aa354f1f3d245dffed4a5b","target":"record","created_at":"2026-05-18T01:00:12Z","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":"b1edbc5f0077a516c5adf5bcc8560676cd10462679dbac97ab35b07cc139cf3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T16:03:54Z","title_canon_sha256":"37acef56bd1d5f7e70ce80c9c68526e31af960f7b5407d8af748d2784c2196c6"},"schema_version":"1.0","source":{"id":"1509.05681","kind":"arxiv","version":2}},"canonical_sha256":"5b1cebbbe9d0d15ab4eecfd0d7176700206d2ba5815efb1c8784c5ad6cdbef6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b1cebbbe9d0d15ab4eecfd0d7176700206d2ba5815efb1c8784c5ad6cdbef6d","first_computed_at":"2026-05-18T01:00:12.732808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:12.732808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Hqs1X7q/y5Qhq62T0SY/6E5JcoXz+iDUmcgXJhUALZ0iS6DLPmJszL39ysMGw0lBWGc1KJEaoFBTAD0LWF9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:12.733508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fca5409b23688b3905f29d2c95ee803f0ee7af8d20aa354f1f3d245dffed4a5b","sha256:2bdfabdf6c6c1fa82afa0ff98fe3cefa88e681a2f8222daa25f1111079caae50"],"state_sha256":"cbb4c0e4d9b14c30f69ab8d206e0a9e4e9786dd7985bf1fc78bb9c970f175e69"}