{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LMOOXO7J2DIVVNHOZ7INOF3HAA","short_pith_number":"pith:LMOOXO7J","schema_version":"1.0","canonical_sha256":"5b1cebbbe9d0d15ab4eecfd0d7176700206d2ba5815efb1c8784c5ad6cdbef6d","source":{"kind":"arxiv","id":"1509.05681","version":2},"attestation_state":"computed","paper":{"title":"Colored Non-Crossing Euclidean Steiner Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Joachim Spoerhase, Krzysztof Fleszar, Philipp Kindermann, Sergey Bereg, Sergey Pupyrev","submitted_at":"2015-09-18T16:03:54Z","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$."},"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":"1509.05681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-18T16:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"37acef56bd1d5f7e70ce80c9c68526e31af960f7b5407d8af748d2784c2196c6","abstract_canon_sha256":"b1edbc5f0077a516c5adf5bcc8560676cd10462679dbac97ab35b07cc139cf3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:12.733508Z","signature_b64":"4Hqs1X7q/y5Qhq62T0SY/6E5JcoXz+iDUmcgXJhUALZ0iS6DLPmJszL39ysMGw0lBWGc1KJEaoFBTAD0LWF9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b1cebbbe9d0d15ab4eecfd0d7176700206d2ba5815efb1c8784c5ad6cdbef6d","last_reissued_at":"2026-05-18T01:00:12.732808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:12.732808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colored Non-Crossing Euclidean Steiner Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Joachim Spoerhase, Krzysztof Fleszar, Philipp Kindermann, Sergey Bereg, Sergey Pupyrev","submitted_at":"2015-09-18T16:03:54Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05681","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":""},"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":"1509.05681","created_at":"2026-05-18T01:00:12.732905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05681v2","created_at":"2026-05-18T01:00:12.732905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05681","created_at":"2026-05-18T01:00:12.732905+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMOOXO7J2DIV","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMOOXO7J2DIVVNHO","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMOOXO7J","created_at":"2026-05-18T12:29:29.992203+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/LMOOXO7J2DIVVNHOZ7INOF3HAA","json":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA.json","graph_json":"https://pith.science/api/pith-number/LMOOXO7J2DIVVNHOZ7INOF3HAA/graph.json","events_json":"https://pith.science/api/pith-number/LMOOXO7J2DIVVNHOZ7INOF3HAA/events.json","paper":"https://pith.science/paper/LMOOXO7J"},"agent_actions":{"view_html":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA","download_json":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA.json","view_paper":"https://pith.science/paper/LMOOXO7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05681&json=true","fetch_graph":"https://pith.science/api/pith-number/LMOOXO7J2DIVVNHOZ7INOF3HAA/graph.json","fetch_events":"https://pith.science/api/pith-number/LMOOXO7J2DIVVNHOZ7INOF3HAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA/action/storage_attestation","attest_author":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA/action/author_attestation","sign_citation":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA/action/citation_signature","submit_replication":"https://pith.science/pith/LMOOXO7J2DIVVNHOZ7INOF3HAA/action/replication_record"}},"created_at":"2026-05-18T01:00:12.732905+00:00","updated_at":"2026-05-18T01:00:12.732905+00:00"}