{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TSCWVMJVR2MEWXMCDPMDPZ322P","short_pith_number":"pith:TSCWVMJV","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"},"canonical_sha256":"9c856ab1358e984b5d821bd837e77ad3e387e9510294148c95927224d6463ac0","source":{"kind":"arxiv","id":"1802.10403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10403","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10403v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10403","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"TSCWVMJVR2ME","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TSCWVMJVR2MEWXMC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TSCWVMJV","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TSCWVMJVR2MEWXMCDPMDPZ322P","target":"record","payload":{"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"},"canonical_sha256":"9c856ab1358e984b5d821bd837e77ad3e387e9510294148c95927224d6463ac0","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"},"source_kind":"arxiv","source_id":"1802.10403","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxnz4gYu20Du4gw6behyinIRJ8frcCcywSVlBwC53FJ1O9Z3zTDaBKmc57FaRgVu7GuyHw/RLrfib4b1hn3iCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:51:02.105417Z"},"content_sha256":"eff5cc2b189e1b07175ab5efa04c850fb186784b1b915d71afccfff23655fc11","schema_version":"1.0","event_id":"sha256:eff5cc2b189e1b07175ab5efa04c850fb186784b1b915d71afccfff23655fc11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TSCWVMJVR2MEWXMCDPMDPZ322P","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XA5D66SMRsGZC6BrH465lxPSxKTNFwcZPp7GRAZ13bbatuLGIpOh2KM029tOfmG8hCQbwT9LFBgWEHdII1BdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:51:02.106113Z"},"content_sha256":"f1ea73e5701d69beb434cce779bf7741d2c4461ffd81b4a2e74b1307e3d44c96","schema_version":"1.0","event_id":"sha256:f1ea73e5701d69beb434cce779bf7741d2c4461ffd81b4a2e74b1307e3d44c96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/bundle.json","state_url":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T14:51:02Z","links":{"resolver":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P","bundle":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/bundle.json","state":"https://pith.science/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSCWVMJVR2MEWXMCDPMDPZ322P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TSCWVMJVR2MEWXMCDPMDPZ322P","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":"7cb47efd156fabece806dc332e072762554d7b9823e9364fe2101986c442b9e9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T13:38:40Z","title_canon_sha256":"54e6522dc7fba3f4f9fb17f81dd2bdc920edfb55efa4447fc15a918731306138"},"schema_version":"1.0","source":{"id":"1802.10403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10403","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10403v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10403","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"TSCWVMJVR2ME","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TSCWVMJVR2MEWXMC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TSCWVMJV","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:f1ea73e5701d69beb434cce779bf7741d2c4461ffd81b4a2e74b1307e3d44c96","target":"graph","created_at":"2026-05-18T00:22:17Z","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":"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","authors_text":"Bundit Laekhanukit, Daniel Vaz, Guy Even, Parinya Chalermsook, Syamantak Das","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T13:38:40Z","title":"Survivable Network Design for Group Connectivity in Low-Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10403","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:eff5cc2b189e1b07175ab5efa04c850fb186784b1b915d71afccfff23655fc11","target":"record","created_at":"2026-05-18T00:22:17Z","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":"7cb47efd156fabece806dc332e072762554d7b9823e9364fe2101986c442b9e9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T13:38:40Z","title_canon_sha256":"54e6522dc7fba3f4f9fb17f81dd2bdc920edfb55efa4447fc15a918731306138"},"schema_version":"1.0","source":{"id":"1802.10403","kind":"arxiv","version":1}},"canonical_sha256":"9c856ab1358e984b5d821bd837e77ad3e387e9510294148c95927224d6463ac0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c856ab1358e984b5d821bd837e77ad3e387e9510294148c95927224d6463ac0","first_computed_at":"2026-05-18T00:22:17.232913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:17.232913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6cvvnJG1lq8YT+NCDU1iL+orbyfmb6LHu7zV+rdtcsVqeKp+lkX+l8bCfHrOo1lDuVJx7BbpkeUCjyNbORL1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:17.233536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eff5cc2b189e1b07175ab5efa04c850fb186784b1b915d71afccfff23655fc11","sha256:f1ea73e5701d69beb434cce779bf7741d2c4461ffd81b4a2e74b1307e3d44c96"],"state_sha256":"e6345195283815349204c0ab1eb14967bae8e37a344a736fe460582affd32000"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYSgkyc24DFwBJyzM6w7BowqW0QSJW/eDhYEeb+EjuB3l1wIqZisud9pkg0xdSOPkmYe/1yZjg4z9UJ6lLiEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:51:02.109260Z","bundle_sha256":"263f39f913fac626e5ebe324260c96a433fd9d0dc3e176a2bbd17907b09197c8"}}