{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SMBJ3PCVSG3QHYWOLD3EKYBCDE","short_pith_number":"pith:SMBJ3PCV","schema_version":"1.0","canonical_sha256":"93029dbc5591b703e2ce58f6456022192774ef20fb7315c4f8ac03db8704106a","source":{"kind":"arxiv","id":"1604.07049","version":1},"attestation_state":"computed","paper":{"title":"Fast Approximation Algorithms for the Generalized Survivable Network Design Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Andreas Emil Feldmann, Jochen K\\\"onemann, Kanstantsin Pashkovich, Laura Sanit\\`a","submitted_at":"2016-04-24T16:40:41Z","abstract_excerpt":"In a standard $f$-connectivity network design problem, we are given an undirected graph $G=(V,E)$, a cut-requirement function $f:2^V \\rightarrow {\\mathbb{N}}$, and non-negative costs $c(e)$ for all $e \\in E$. We are then asked to find a minimum-cost vector $x \\in {\\mathbb{N}}^E$ such that $x(\\delta(S)) \\geq f(S)$ for all $S \\subseteq V$. We focus on the class of such problems where $f$ is a proper function. This encodes many well-studied NP-hard problems such as the generalized survivable network design problem.\n  In this paper we present the first strongly polynomial time FPTAS for solving th"},"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":"1604.07049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-24T16:40:41Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"221a892518c6d541897512133b8727114f33066836d488d118d53576548ba8e9","abstract_canon_sha256":"84137c6dcfbbc30de8b16049f0203c8b4aac0f01518aabffb038d8c1c1694577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.185181Z","signature_b64":"bzgm7Hv2D9nEeznIMfaqb++k5YG5nehWrd908ObfnTeD0KEugN8chJWQJtaVqufAo/qH4kbG4JKOrrbhQuFtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93029dbc5591b703e2ce58f6456022192774ef20fb7315c4f8ac03db8704106a","last_reissued_at":"2026-05-18T01:16:23.184643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.184643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximation Algorithms for the Generalized Survivable Network Design Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Andreas Emil Feldmann, Jochen K\\\"onemann, Kanstantsin Pashkovich, Laura Sanit\\`a","submitted_at":"2016-04-24T16:40:41Z","abstract_excerpt":"In a standard $f$-connectivity network design problem, we are given an undirected graph $G=(V,E)$, a cut-requirement function $f:2^V \\rightarrow {\\mathbb{N}}$, and non-negative costs $c(e)$ for all $e \\in E$. We are then asked to find a minimum-cost vector $x \\in {\\mathbb{N}}^E$ such that $x(\\delta(S)) \\geq f(S)$ for all $S \\subseteq V$. We focus on the class of such problems where $f$ is a proper function. This encodes many well-studied NP-hard problems such as the generalized survivable network design problem.\n  In this paper we present the first strongly polynomial time FPTAS for solving th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07049","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":"1604.07049","created_at":"2026-05-18T01:16:23.184724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07049v1","created_at":"2026-05-18T01:16:23.184724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07049","created_at":"2026-05-18T01:16:23.184724+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMBJ3PCVSG3Q","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMBJ3PCVSG3QHYWO","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMBJ3PCV","created_at":"2026-05-18T12:30:44.179134+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/SMBJ3PCVSG3QHYWOLD3EKYBCDE","json":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE.json","graph_json":"https://pith.science/api/pith-number/SMBJ3PCVSG3QHYWOLD3EKYBCDE/graph.json","events_json":"https://pith.science/api/pith-number/SMBJ3PCVSG3QHYWOLD3EKYBCDE/events.json","paper":"https://pith.science/paper/SMBJ3PCV"},"agent_actions":{"view_html":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE","download_json":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE.json","view_paper":"https://pith.science/paper/SMBJ3PCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07049&json=true","fetch_graph":"https://pith.science/api/pith-number/SMBJ3PCVSG3QHYWOLD3EKYBCDE/graph.json","fetch_events":"https://pith.science/api/pith-number/SMBJ3PCVSG3QHYWOLD3EKYBCDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE/action/storage_attestation","attest_author":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE/action/author_attestation","sign_citation":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE/action/citation_signature","submit_replication":"https://pith.science/pith/SMBJ3PCVSG3QHYWOLD3EKYBCDE/action/replication_record"}},"created_at":"2026-05-18T01:16:23.184724+00:00","updated_at":"2026-05-18T01:16:23.184724+00:00"}