{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5SCATVMVLTWWLAQNORSP4H2QO4","short_pith_number":"pith:5SCATVMV","schema_version":"1.0","canonical_sha256":"ec8409d5955ced65820d7464fe1f507733553d967e110fb9ecb5441b9e7256e8","source":{"kind":"arxiv","id":"1502.07659","version":2},"attestation_state":"computed","paper":{"title":"On the complexity of computing the $k$-restricted edge-connectivity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Luis Pedro Montejano","submitted_at":"2015-02-26T18:10:43Z","abstract_excerpt":"The \\emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices. This graph invariant, which can be seen as a generalization of a minimum edge-cut, has been extensively studied from a combinatorial point of view. However, very little is known about the complexity of computing $\\lambda_k(G)$. Very recently, in the parameterized complexity community the notion of \\emph{good edge separation} of a graph has been defined, which happens to b"},"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":"1502.07659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-26T18:10:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3da2244dfe79d8346d13c7aa30b1a369481580c9f63072a356c7da28a15f1c26","abstract_canon_sha256":"4b5784ddb6cd4496f113ef6d017de0589ebb2b665dfcfab77671fb3d5f46e577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:30.316626Z","signature_b64":"xrr6zdaZFSoIrfRB0PRVIMOYSC/QAr/Sr1Chv2Fi+mqr/xdDFBApUwIII0DXzGDJrNyZEcuoDd2pZJWHgWhWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec8409d5955ced65820d7464fe1f507733553d967e110fb9ecb5441b9e7256e8","last_reissued_at":"2026-05-18T01:04:30.315978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:30.315978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of computing the $k$-restricted edge-connectivity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Luis Pedro Montejano","submitted_at":"2015-02-26T18:10:43Z","abstract_excerpt":"The \\emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices. This graph invariant, which can be seen as a generalization of a minimum edge-cut, has been extensively studied from a combinatorial point of view. However, very little is known about the complexity of computing $\\lambda_k(G)$. Very recently, in the parameterized complexity community the notion of \\emph{good edge separation} of a graph has been defined, which happens to b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07659","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":"1502.07659","created_at":"2026-05-18T01:04:30.316067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07659v2","created_at":"2026-05-18T01:04:30.316067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07659","created_at":"2026-05-18T01:04:30.316067+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SCATVMVLTWW","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SCATVMVLTWWLAQN","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SCATVMV","created_at":"2026-05-18T12:29:07.941421+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/5SCATVMVLTWWLAQNORSP4H2QO4","json":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4.json","graph_json":"https://pith.science/api/pith-number/5SCATVMVLTWWLAQNORSP4H2QO4/graph.json","events_json":"https://pith.science/api/pith-number/5SCATVMVLTWWLAQNORSP4H2QO4/events.json","paper":"https://pith.science/paper/5SCATVMV"},"agent_actions":{"view_html":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4","download_json":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4.json","view_paper":"https://pith.science/paper/5SCATVMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07659&json=true","fetch_graph":"https://pith.science/api/pith-number/5SCATVMVLTWWLAQNORSP4H2QO4/graph.json","fetch_events":"https://pith.science/api/pith-number/5SCATVMVLTWWLAQNORSP4H2QO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4/action/storage_attestation","attest_author":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4/action/author_attestation","sign_citation":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4/action/citation_signature","submit_replication":"https://pith.science/pith/5SCATVMVLTWWLAQNORSP4H2QO4/action/replication_record"}},"created_at":"2026-05-18T01:04:30.316067+00:00","updated_at":"2026-05-18T01:04:30.316067+00:00"}