{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IOAMMMFEHFMOJOSKK5RVIV5Q7G","short_pith_number":"pith:IOAMMMFE","schema_version":"1.0","canonical_sha256":"4380c630a43958e4ba4a57635457b0f9a2d25fc2d7691852f61ef54a98948d76","source":{"kind":"arxiv","id":"1207.5357","version":1},"attestation_state":"computed","paper":{"title":"On (2k,k)-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olivier Durand de Gevigney, Zolt\\'an Szigeti","submitted_at":"2012-07-23T11:17:15Z","abstract_excerpt":"A graph G is called (2k, k)-connected if G is 2k-edge-connected and G-v is k-edge-connected for every vertex v. The study of (2k, k)-connected graphs is motivated by a conjecture of Frank which states that a graph has a 2-vertex-connected orientation if and only if it is (4, 2)-connected. In this paper, we provide a construction of the family of (2k, k)-connected graphs for k even which generalizes the construction given by Jord\\'an for k = 2. We also solve the corresponding connectivity augmentation problem: given a graph G and an integer k \\geq 2, what is the minimum number of edges to be ad"},"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":"1207.5357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-23T11:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"d67996e4e20afefc0822af3bce9aa490e0d77a51fddf1081d6effe56d5936acc","abstract_canon_sha256":"b47a7954a833095a951d9a61c6b081435673834b4295b3adcec3cb0d72017f54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:23.788872Z","signature_b64":"8ipqi37SlW/etHQmA+I/DHWBA1roORIc8NCMyYup+4gMFsR8e+KSSzRjLTu5aDJAfM3wFSjM5ohE7dSON+4NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4380c630a43958e4ba4a57635457b0f9a2d25fc2d7691852f61ef54a98948d76","last_reissued_at":"2026-05-18T03:50:23.788058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:23.788058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On (2k,k)-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olivier Durand de Gevigney, Zolt\\'an Szigeti","submitted_at":"2012-07-23T11:17:15Z","abstract_excerpt":"A graph G is called (2k, k)-connected if G is 2k-edge-connected and G-v is k-edge-connected for every vertex v. The study of (2k, k)-connected graphs is motivated by a conjecture of Frank which states that a graph has a 2-vertex-connected orientation if and only if it is (4, 2)-connected. In this paper, we provide a construction of the family of (2k, k)-connected graphs for k even which generalizes the construction given by Jord\\'an for k = 2. We also solve the corresponding connectivity augmentation problem: given a graph G and an integer k \\geq 2, what is the minimum number of edges to be ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5357","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":"1207.5357","created_at":"2026-05-18T03:50:23.788193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5357v1","created_at":"2026-05-18T03:50:23.788193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5357","created_at":"2026-05-18T03:50:23.788193+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOAMMMFEHFMO","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOAMMMFEHFMOJOSK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOAMMMFE","created_at":"2026-05-18T12:27:09.501522+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/IOAMMMFEHFMOJOSKK5RVIV5Q7G","json":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G.json","graph_json":"https://pith.science/api/pith-number/IOAMMMFEHFMOJOSKK5RVIV5Q7G/graph.json","events_json":"https://pith.science/api/pith-number/IOAMMMFEHFMOJOSKK5RVIV5Q7G/events.json","paper":"https://pith.science/paper/IOAMMMFE"},"agent_actions":{"view_html":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G","download_json":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G.json","view_paper":"https://pith.science/paper/IOAMMMFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5357&json=true","fetch_graph":"https://pith.science/api/pith-number/IOAMMMFEHFMOJOSKK5RVIV5Q7G/graph.json","fetch_events":"https://pith.science/api/pith-number/IOAMMMFEHFMOJOSKK5RVIV5Q7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/action/storage_attestation","attest_author":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/action/author_attestation","sign_citation":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/action/citation_signature","submit_replication":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/action/replication_record"}},"created_at":"2026-05-18T03:50:23.788193+00:00","updated_at":"2026-05-18T03:50:23.788193+00:00"}