{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TSCWVMJVR2MEWXMCDPMDPZ322P","short_pith_number":"pith:TSCWVMJV","schema_version":"1.0","canonical_sha256":"9c856ab1358e984b5d821bd837e77ad3e387e9510294148c95927224d6463ac0","source":{"kind":"arxiv","id":"1802.10403","version":1},"attestation_state":"computed","paper":{"title":"Survivable Network Design for Group Connectivity in Low-Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Daniel Vaz, Guy Even, Parinya Chalermsook, Syamantak Das","submitted_at":"2018-02-28T13:38:40Z","abstract_excerpt":"In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph $G=(V,E)$ on $n$ vertices, a root vertex $r$ and a collection of groups $\\{S_i\\}_{i\\in[h]}: S_i\\subseteq V(G)$. The goal is to find a min-cost subgraph $H$ that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each group $S_i$ has a demand $k_i\\in[k],k\\in\\mathbb N$, and we wish to find a min-cost $H\\subseteq G$ such that, for each group $S_i$, there is a vertex in $S_i$ connected to the root via $k_i$ (vertex or edg"},"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":"1802.10403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T13:38:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"54e6522dc7fba3f4f9fb17f81dd2bdc920edfb55efa4447fc15a918731306138","abstract_canon_sha256":"7cb47efd156fabece806dc332e072762554d7b9823e9364fe2101986c442b9e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.233536Z","signature_b64":"6cvvnJG1lq8YT+NCDU1iL+orbyfmb6LHu7zV+rdtcsVqeKp+lkX+l8bCfHrOo1lDuVJx7BbpkeUCjyNbORL1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c856ab1358e984b5d821bd837e77ad3e387e9510294148c95927224d6463ac0","last_reissued_at":"2026-05-18T00:22:17.232913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.232913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survivable Network Design for Group Connectivity in Low-Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Daniel Vaz, Guy Even, Parinya Chalermsook, Syamantak Das","submitted_at":"2018-02-28T13:38:40Z","abstract_excerpt":"In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph $G=(V,E)$ on $n$ vertices, a root vertex $r$ and a collection of groups $\\{S_i\\}_{i\\in[h]}: S_i\\subseteq V(G)$. The goal is to find a min-cost subgraph $H$ that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each group $S_i$ has a demand $k_i\\in[k],k\\in\\mathbb N$, and we wish to find a min-cost $H\\subseteq G$ such that, for each group $S_i$, there is a vertex in $S_i$ connected to the root via $k_i$ (vertex or edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10403","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":"1802.10403","created_at":"2026-05-18T00:22:17.233007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10403v1","created_at":"2026-05-18T00:22:17.233007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10403","created_at":"2026-05-18T00:22:17.233007+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSCWVMJVR2ME","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSCWVMJVR2MEWXMC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSCWVMJV","created_at":"2026-05-18T12:32:56.356000+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/TSCWVMJVR2MEWXMCDPMDPZ322P","json":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P.json","graph_json":"https://pith.science/api/pith-number/TSCWVMJVR2MEWXMCDPMDPZ322P/graph.json","events_json":"https://pith.science/api/pith-number/TSCWVMJVR2MEWXMCDPMDPZ322P/events.json","paper":"https://pith.science/paper/TSCWVMJV"},"agent_actions":{"view_html":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P","download_json":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P.json","view_paper":"https://pith.science/paper/TSCWVMJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10403&json=true","fetch_graph":"https://pith.science/api/pith-number/TSCWVMJVR2MEWXMCDPMDPZ322P/graph.json","fetch_events":"https://pith.science/api/pith-number/TSCWVMJVR2MEWXMCDPMDPZ322P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/action/storage_attestation","attest_author":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/action/author_attestation","sign_citation":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/action/citation_signature","submit_replication":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/action/replication_record"}},"created_at":"2026-05-18T00:22:17.233007+00:00","updated_at":"2026-05-18T00:22:17.233007+00:00"}