{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EKAVYEMZR5GN66QCA6MNDKUGEQ","short_pith_number":"pith:EKAVYEMZ","schema_version":"1.0","canonical_sha256":"22815c11998f4cdf7a020798d1aa862438100b06882ada6e5240f4f77e9fa0cf","source":{"kind":"arxiv","id":"1304.6593","version":2},"attestation_state":"computed","paper":{"title":"Fixed-parameter algorithms for minimum cost edge-connectivity augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, L\\'aszl\\'o A. V\\'egh","submitted_at":"2013-04-24T14:06:47Z","abstract_excerpt":"We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k-1 to k with at most p new edges is fixed-parameter tractable parameterized by p and admits a polynomial kernel. We also prove the fixed-parameter tractability of increasing edge-connectivity from 0 to 2, and increasing node-connectivity from 1 to 2."},"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":"1304.6593","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T14:06:47Z","cross_cats_sorted":[],"title_canon_sha256":"1ace751ed8375d83fa658e969db1e36391f89c094d029eb47f14efd6e46c7471","abstract_canon_sha256":"60560baaab77b414082e6e38719af8d2b0906a047aa45ae3aad89cfea7d67a4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:05.930921Z","signature_b64":"yz9JbnVZwIyfJytK1KQ6GOP4JXGzcRZcUvQH1zcsryL7fseLqCZglqmuVsQyatHbkbDJinj9CkKUJAvRZt0nAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22815c11998f4cdf7a020798d1aa862438100b06882ada6e5240f4f77e9fa0cf","last_reissued_at":"2026-05-18T03:15:05.929947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:05.929947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-parameter algorithms for minimum cost edge-connectivity augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, L\\'aszl\\'o A. V\\'egh","submitted_at":"2013-04-24T14:06:47Z","abstract_excerpt":"We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k-1 to k with at most p new edges is fixed-parameter tractable parameterized by p and admits a polynomial kernel. We also prove the fixed-parameter tractability of increasing edge-connectivity from 0 to 2, and increasing node-connectivity from 1 to 2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6593","kind":"arxiv","version":2},"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":"1304.6593","created_at":"2026-05-18T03:15:05.930097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6593v2","created_at":"2026-05-18T03:15:05.930097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6593","created_at":"2026-05-18T03:15:05.930097+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKAVYEMZR5GN","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKAVYEMZR5GN66QC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKAVYEMZ","created_at":"2026-05-18T12:27:43.054852+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/EKAVYEMZR5GN66QCA6MNDKUGEQ","json":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ.json","graph_json":"https://pith.science/api/pith-number/EKAVYEMZR5GN66QCA6MNDKUGEQ/graph.json","events_json":"https://pith.science/api/pith-number/EKAVYEMZR5GN66QCA6MNDKUGEQ/events.json","paper":"https://pith.science/paper/EKAVYEMZ"},"agent_actions":{"view_html":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ","download_json":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ.json","view_paper":"https://pith.science/paper/EKAVYEMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6593&json=true","fetch_graph":"https://pith.science/api/pith-number/EKAVYEMZR5GN66QCA6MNDKUGEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EKAVYEMZR5GN66QCA6MNDKUGEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/action/storage_attestation","attest_author":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/action/author_attestation","sign_citation":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/action/citation_signature","submit_replication":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/action/replication_record"}},"created_at":"2026-05-18T03:15:05.930097+00:00","updated_at":"2026-05-18T03:15:05.930097+00:00"}