{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EKAVYEMZR5GN66QCA6MNDKUGEQ","short_pith_number":"pith:EKAVYEMZ","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"},"canonical_sha256":"22815c11998f4cdf7a020798d1aa862438100b06882ada6e5240f4f77e9fa0cf","source":{"kind":"arxiv","id":"1304.6593","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6593","created_at":"2026-05-18T03:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6593v2","created_at":"2026-05-18T03:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6593","created_at":"2026-05-18T03:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"EKAVYEMZR5GN","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EKAVYEMZR5GN66QC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EKAVYEMZ","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EKAVYEMZR5GN66QCA6MNDKUGEQ","target":"record","payload":{"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"},"canonical_sha256":"22815c11998f4cdf7a020798d1aa862438100b06882ada6e5240f4f77e9fa0cf","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"},"source_kind":"arxiv","source_id":"1304.6593","source_version":2,"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-18T03:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Odu5LqU9k3lGxRhC+dh9A7XWU0n4aP0dwmOu7GXYaFNoVTvY/+us8PMyhj/ZlWwSl+QyrPSv214HAAAidaj+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:21:13.349777Z"},"content_sha256":"924e37b704a67e46543bb6c2fe64a664bb1baa23387267c3a66e313eb4d57f1f","schema_version":"1.0","event_id":"sha256:924e37b704a67e46543bb6c2fe64a664bb1baa23387267c3a66e313eb4d57f1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EKAVYEMZR5GN66QCA6MNDKUGEQ","target":"graph","payload":{"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"},"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-18T03:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/nWZD4sftnGZQ5ANQA2pUh0K3/AhHT4Ea8XG1y3Wx0kXGCZENByKqi1cADDf644UoapWshTrqx5Gmxx/sT9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:21:13.350105Z"},"content_sha256":"3fc5b4e9b9917408d30d812892f983b60f206db17df0ba9f2a5ccb0aa70bebb0","schema_version":"1.0","event_id":"sha256:3fc5b4e9b9917408d30d812892f983b60f206db17df0ba9f2a5ccb0aa70bebb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/bundle.json","state_url":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/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-06-27T09:21:13Z","links":{"resolver":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ","bundle":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/bundle.json","state":"https://pith.science/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKAVYEMZR5GN66QCA6MNDKUGEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EKAVYEMZR5GN66QCA6MNDKUGEQ","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":"60560baaab77b414082e6e38719af8d2b0906a047aa45ae3aad89cfea7d67a4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T14:06:47Z","title_canon_sha256":"1ace751ed8375d83fa658e969db1e36391f89c094d029eb47f14efd6e46c7471"},"schema_version":"1.0","source":{"id":"1304.6593","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6593","created_at":"2026-05-18T03:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6593v2","created_at":"2026-05-18T03:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6593","created_at":"2026-05-18T03:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"EKAVYEMZR5GN","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EKAVYEMZR5GN66QC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EKAVYEMZ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:3fc5b4e9b9917408d30d812892f983b60f206db17df0ba9f2a5ccb0aa70bebb0","target":"graph","created_at":"2026-05-18T03:15:05Z","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":"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.","authors_text":"D\\'aniel Marx, L\\'aszl\\'o A. V\\'egh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T14:06:47Z","title":"Fixed-parameter algorithms for minimum cost edge-connectivity augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6593","kind":"arxiv","version":2},"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:924e37b704a67e46543bb6c2fe64a664bb1baa23387267c3a66e313eb4d57f1f","target":"record","created_at":"2026-05-18T03:15:05Z","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":"60560baaab77b414082e6e38719af8d2b0906a047aa45ae3aad89cfea7d67a4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-24T14:06:47Z","title_canon_sha256":"1ace751ed8375d83fa658e969db1e36391f89c094d029eb47f14efd6e46c7471"},"schema_version":"1.0","source":{"id":"1304.6593","kind":"arxiv","version":2}},"canonical_sha256":"22815c11998f4cdf7a020798d1aa862438100b06882ada6e5240f4f77e9fa0cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22815c11998f4cdf7a020798d1aa862438100b06882ada6e5240f4f77e9fa0cf","first_computed_at":"2026-05-18T03:15:05.929947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:05.929947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yz9JbnVZwIyfJytK1KQ6GOP4JXGzcRZcUvQH1zcsryL7fseLqCZglqmuVsQyatHbkbDJinj9CkKUJAvRZt0nAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:05.930921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6593","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:924e37b704a67e46543bb6c2fe64a664bb1baa23387267c3a66e313eb4d57f1f","sha256:3fc5b4e9b9917408d30d812892f983b60f206db17df0ba9f2a5ccb0aa70bebb0"],"state_sha256":"8c4124ea152627dce5849159b7bdadcdbb545887bae2e26142369cc30fa43e00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ws4+EIxsFxS5igpBF2K6wqHvZNmy0Qr8S1dzyyg9kMFwg73dK7F8IKgAVF8Vw3FRrFWrBwxeQhclJzyFlzV9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:21:13.351806Z","bundle_sha256":"49a9dadc311e676760983f66f001a78840190f78f8112a4560ddbe8ac18afdcd"}}