{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XGTWMVACT3CNFB33EPDCAETRYF","short_pith_number":"pith:XGTWMVAC","schema_version":"1.0","canonical_sha256":"b9a76654029ec4d2877b23c6201271c168242b079db9137d0c593038ecdaa06a","source":{"kind":"arxiv","id":"2204.13648","version":1},"attestation_state":"computed","paper":{"title":"Survivable Network Design Revisited: Group-Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Chao Liao, Qingyun Chen, Yuhao Zhang","submitted_at":"2022-04-28T17:08:12Z","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"},"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":"2204.13648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-04-28T17:08:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8c2104735dc0282f1fdfaa5d3add447237900673ac67a4a6ce2c8ebcd74764a8","abstract_canon_sha256":"a8ee17e68abe08c3995e2245c636e62db774d2268459fe16874378ec8be2a950"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:44.378168Z","signature_b64":"1u4pkp5DNjRZgQwA6nfrU38EFVdy6/IjEtvfClm7puj2YCccr8wcnV5Lusxbns/B3WtMs8FTyUN5003oCdNPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a76654029ec4d2877b23c6201271c168242b079db9137d0c593038ecdaa06a","last_reissued_at":"2026-07-05T04:18:44.377736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:44.377736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survivable Network Design Revisited: Group-Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Chao Liao, Qingyun Chen, Yuhao Zhang","submitted_at":"2022-04-28T17:08:12Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.13648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.13648/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2204.13648","created_at":"2026-07-05T04:18:44.377793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.13648v1","created_at":"2026-07-05T04:18:44.377793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.13648","created_at":"2026-07-05T04:18:44.377793+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGTWMVACT3CN","created_at":"2026-07-05T04:18:44.377793+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGTWMVACT3CNFB33","created_at":"2026-07-05T04:18:44.377793+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGTWMVAC","created_at":"2026-07-05T04:18:44.377793+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/XGTWMVACT3CNFB33EPDCAETRYF","json":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF.json","graph_json":"https://pith.science/api/pith-number/XGTWMVACT3CNFB33EPDCAETRYF/graph.json","events_json":"https://pith.science/api/pith-number/XGTWMVACT3CNFB33EPDCAETRYF/events.json","paper":"https://pith.science/paper/XGTWMVAC"},"agent_actions":{"view_html":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF","download_json":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF.json","view_paper":"https://pith.science/paper/XGTWMVAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.13648&json=true","fetch_graph":"https://pith.science/api/pith-number/XGTWMVACT3CNFB33EPDCAETRYF/graph.json","fetch_events":"https://pith.science/api/pith-number/XGTWMVACT3CNFB33EPDCAETRYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF/action/storage_attestation","attest_author":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF/action/author_attestation","sign_citation":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF/action/citation_signature","submit_replication":"https://pith.science/pith/XGTWMVACT3CNFB33EPDCAETRYF/action/replication_record"}},"created_at":"2026-07-05T04:18:44.377793+00:00","updated_at":"2026-07-05T04:18:44.377793+00:00"}