{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XGTWMVACT3CNFB33EPDCAETRYF","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":"a8ee17e68abe08c3995e2245c636e62db774d2268459fe16874378ec8be2a950","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-04-28T17:08:12Z","title_canon_sha256":"8c2104735dc0282f1fdfaa5d3add447237900673ac67a4a6ce2c8ebcd74764a8"},"schema_version":"1.0","source":{"id":"2204.13648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.13648","created_at":"2026-07-05T04:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"2204.13648v1","created_at":"2026-07-05T04:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.13648","created_at":"2026-07-05T04:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"XGTWMVACT3CN","created_at":"2026-07-05T04:18:44Z"},{"alias_kind":"pith_short_16","alias_value":"XGTWMVACT3CNFB33","created_at":"2026-07-05T04:18:44Z"},{"alias_kind":"pith_short_8","alias_value":"XGTWMVAC","created_at":"2026-07-05T04:18:44Z"}],"graph_snapshots":[{"event_id":"sha256:4207277a23cd216f92cc6db462952e86f833a33d2c7f8673ecf0ed9ca353a5d0","target":"graph","created_at":"2026-07-05T04:18:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2204.13648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the classical survivable network design problem (SNDP), we are given an undirected graph $G=(V,E)$ with costs on edges and a connectivity requirement $k(s,t)$ for each pair of vertices. The goal is to find a minimum-cost subgraph $H\\subseteq V$ such that every pair $(s,t)$ are connected by $k(s,t)$ edge or (openly) vertex disjoint paths, abbreviated as EC-SNDP and VC-SNDP, respectively. The seminal result of Jain [FOCS'98, Combinatorica'01] gives a $2$-approximation algorithm for EC-SNDP, and a decade later, an $O(k^3\\log n)$-approximation algorithm for VC-SNDP, where $k$ is the largest con","authors_text":"Bundit Laekhanukit, Chao Liao, Qingyun Chen, Yuhao Zhang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-04-28T17:08:12Z","title":"Survivable Network Design Revisited: Group-Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.13648","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:9845ccd8aeb4ce623eda5d9a7dae679ac1f72949529f19fe5a38fa5092f11c69","target":"record","created_at":"2026-07-05T04:18:44Z","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":"a8ee17e68abe08c3995e2245c636e62db774d2268459fe16874378ec8be2a950","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-04-28T17:08:12Z","title_canon_sha256":"8c2104735dc0282f1fdfaa5d3add447237900673ac67a4a6ce2c8ebcd74764a8"},"schema_version":"1.0","source":{"id":"2204.13648","kind":"arxiv","version":1}},"canonical_sha256":"b9a76654029ec4d2877b23c6201271c168242b079db9137d0c593038ecdaa06a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a76654029ec4d2877b23c6201271c168242b079db9137d0c593038ecdaa06a","first_computed_at":"2026-07-05T04:18:44.377736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:18:44.377736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1u4pkp5DNjRZgQwA6nfrU38EFVdy6/IjEtvfClm7puj2YCccr8wcnV5Lusxbns/B3WtMs8FTyUN5003oCdNPCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:18:44.378168Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.13648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9845ccd8aeb4ce623eda5d9a7dae679ac1f72949529f19fe5a38fa5092f11c69","sha256:4207277a23cd216f92cc6db462952e86f833a33d2c7f8673ecf0ed9ca353a5d0"],"state_sha256":"9152a3b0c1f931dcc5e7a52e4bf4ce1289a08a8fd60b0050efaf75ec0b635ab9"}