{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3W7T7CCJF4FVHA2HCOMITT5N6N","short_pith_number":"pith:3W7T7CCJ","schema_version":"1.0","canonical_sha256":"ddbf3f88492f0b538347139889cfadf37d0d67dfa4293b6123a5670814a32d2a","source":{"kind":"arxiv","id":"1811.06871","version":1},"attestation_state":"computed","paper":{"title":"Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Jan van Leeuwen, Jesper Nederlof, S\\'andor Kisfaludi-Bak","submitted_at":"2018-11-16T15:47:38Z","abstract_excerpt":"The Planar Steiner Tree problem is one of the most fundamental NP-complete problems as it models many network design problems. Recall that an instance of this problem consists of a graph with edge weights, and a subset of vertices (often called terminals); the goal is to find a subtree of the graph of minimum total weight that connects all terminals. A seminal paper by Erickson et al. [Math. Oper. Res., 1987] considers instances where the underlying graph is planar and all terminals can be covered by the boundary of $k$ faces. Erickson et al. show that the problem can be solved by an algorithm"},"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":"1811.06871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T15:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"a5980691c6d946a9a80b1a9bc29aa1a876360e69d196a03045b91707c366e98a","abstract_canon_sha256":"29ea89c996d5653cd0fea2659c118009b4c1c5a92780647259529cbc7f3e0b06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.625629Z","signature_b64":"MhnXHKOaEKG0HCCD7akIqZqyhDQh9WEPe+ZQZUMBfHiBoRrRMFiGhAcGVTF/ajPMBkSHq2M3PL9U0DuF7vXTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddbf3f88492f0b538347139889cfadf37d0d67dfa4293b6123a5670814a32d2a","last_reissued_at":"2026-05-18T00:00:33.625185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.625185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik Jan van Leeuwen, Jesper Nederlof, S\\'andor Kisfaludi-Bak","submitted_at":"2018-11-16T15:47:38Z","abstract_excerpt":"The Planar Steiner Tree problem is one of the most fundamental NP-complete problems as it models many network design problems. Recall that an instance of this problem consists of a graph with edge weights, and a subset of vertices (often called terminals); the goal is to find a subtree of the graph of minimum total weight that connects all terminals. A seminal paper by Erickson et al. [Math. Oper. Res., 1987] considers instances where the underlying graph is planar and all terminals can be covered by the boundary of $k$ faces. Erickson et al. show that the problem can be solved by an algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06871","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":""},"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":"1811.06871","created_at":"2026-05-18T00:00:33.625253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06871v1","created_at":"2026-05-18T00:00:33.625253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06871","created_at":"2026-05-18T00:00:33.625253+00:00"},{"alias_kind":"pith_short_12","alias_value":"3W7T7CCJF4FV","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3W7T7CCJF4FVHA2H","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3W7T7CCJ","created_at":"2026-05-18T12:32:05.422762+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/3W7T7CCJF4FVHA2HCOMITT5N6N","json":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N.json","graph_json":"https://pith.science/api/pith-number/3W7T7CCJF4FVHA2HCOMITT5N6N/graph.json","events_json":"https://pith.science/api/pith-number/3W7T7CCJF4FVHA2HCOMITT5N6N/events.json","paper":"https://pith.science/paper/3W7T7CCJ"},"agent_actions":{"view_html":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N","download_json":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N.json","view_paper":"https://pith.science/paper/3W7T7CCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06871&json=true","fetch_graph":"https://pith.science/api/pith-number/3W7T7CCJF4FVHA2HCOMITT5N6N/graph.json","fetch_events":"https://pith.science/api/pith-number/3W7T7CCJF4FVHA2HCOMITT5N6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N/action/storage_attestation","attest_author":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N/action/author_attestation","sign_citation":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N/action/citation_signature","submit_replication":"https://pith.science/pith/3W7T7CCJF4FVHA2HCOMITT5N6N/action/replication_record"}},"created_at":"2026-05-18T00:00:33.625253+00:00","updated_at":"2026-05-18T00:00:33.625253+00:00"}