{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3W7T7CCJF4FVHA2HCOMITT5N6N","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":"29ea89c996d5653cd0fea2659c118009b4c1c5a92780647259529cbc7f3e0b06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T15:47:38Z","title_canon_sha256":"a5980691c6d946a9a80b1a9bc29aa1a876360e69d196a03045b91707c366e98a"},"schema_version":"1.0","source":{"id":"1811.06871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06871","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06871v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06871","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"3W7T7CCJF4FV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3W7T7CCJF4FVHA2H","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3W7T7CCJ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:08fa48f50e2723c8b49aac5cc18a9c9aef9ee4fcd0bade27a10740a0da4dd718","target":"graph","created_at":"2026-05-18T00:00:33Z","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":"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","authors_text":"Erik Jan van Leeuwen, Jesper Nederlof, S\\'andor Kisfaludi-Bak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T15:47:38Z","title":"Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06871","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:4d3aef639abc911501526bafa5cf8547a92e47613b6f9a2dbeb7d398ab8801e3","target":"record","created_at":"2026-05-18T00:00:33Z","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":"29ea89c996d5653cd0fea2659c118009b4c1c5a92780647259529cbc7f3e0b06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T15:47:38Z","title_canon_sha256":"a5980691c6d946a9a80b1a9bc29aa1a876360e69d196a03045b91707c366e98a"},"schema_version":"1.0","source":{"id":"1811.06871","kind":"arxiv","version":1}},"canonical_sha256":"ddbf3f88492f0b538347139889cfadf37d0d67dfa4293b6123a5670814a32d2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddbf3f88492f0b538347139889cfadf37d0d67dfa4293b6123a5670814a32d2a","first_computed_at":"2026-05-18T00:00:33.625185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.625185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MhnXHKOaEKG0HCCD7akIqZqyhDQh9WEPe+ZQZUMBfHiBoRrRMFiGhAcGVTF/ajPMBkSHq2M3PL9U0DuF7vXTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.625629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d3aef639abc911501526bafa5cf8547a92e47613b6f9a2dbeb7d398ab8801e3","sha256:08fa48f50e2723c8b49aac5cc18a9c9aef9ee4fcd0bade27a10740a0da4dd718"],"state_sha256":"1366267be993b4087569f651e69270a4d1e010788f1bdf8be52918a86e98aa40"}