{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IOAMMMFEHFMOJOSKK5RVIV5Q7G","short_pith_number":"pith:IOAMMMFE","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"},"canonical_sha256":"4380c630a43958e4ba4a57635457b0f9a2d25fc2d7691852f61ef54a98948d76","source":{"kind":"arxiv","id":"1207.5357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5357","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5357v1","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5357","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"IOAMMMFEHFMO","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IOAMMMFEHFMOJOSK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IOAMMMFE","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IOAMMMFEHFMOJOSKK5RVIV5Q7G","target":"record","payload":{"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"},"canonical_sha256":"4380c630a43958e4ba4a57635457b0f9a2d25fc2d7691852f61ef54a98948d76","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"},"source_kind":"arxiv","source_id":"1207.5357","source_version":1,"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:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHEcBiiDUAyHmmt9+gpo8usKBHzoEIfXwNVV9J/Du29uHtial65PClNFdHpQ4JdcG0PRrlv0dGXUslxOJqO2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:03:33.482526Z"},"content_sha256":"d25c5aaeb43dd2bb5b08510339912215620958d5fd4393c164472ea64577e0e8","schema_version":"1.0","event_id":"sha256:d25c5aaeb43dd2bb5b08510339912215620958d5fd4393c164472ea64577e0e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IOAMMMFEHFMOJOSKK5RVIV5Q7G","target":"graph","payload":{"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"},"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:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0u4c/CpkzF11P2qbIBLgkUaDMbPSiXFbidHuIA/H7fQ/Dnl9n3W2yvFCyLZGNT3gJPqC6vhtqOhmTvmzvlpuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:03:33.483074Z"},"content_sha256":"2f385f26ad5f6101231a4c77a30f1cccce6d7298be4f98f2678105d710931a3a","schema_version":"1.0","event_id":"sha256:2f385f26ad5f6101231a4c77a30f1cccce6d7298be4f98f2678105d710931a3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/bundle.json","state_url":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/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-05-30T06:03:33Z","links":{"resolver":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G","bundle":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/bundle.json","state":"https://pith.science/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOAMMMFEHFMOJOSKK5RVIV5Q7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IOAMMMFEHFMOJOSKK5RVIV5Q7G","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":"b47a7954a833095a951d9a61c6b081435673834b4295b3adcec3cb0d72017f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-23T11:17:15Z","title_canon_sha256":"d67996e4e20afefc0822af3bce9aa490e0d77a51fddf1081d6effe56d5936acc"},"schema_version":"1.0","source":{"id":"1207.5357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5357","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5357v1","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5357","created_at":"2026-05-18T03:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"IOAMMMFEHFMO","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IOAMMMFEHFMOJOSK","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IOAMMMFE","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:2f385f26ad5f6101231a4c77a30f1cccce6d7298be4f98f2678105d710931a3a","target":"graph","created_at":"2026-05-18T03:50:23Z","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":"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","authors_text":"Olivier Durand de Gevigney, Zolt\\'an Szigeti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-23T11:17:15Z","title":"On (2k,k)-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5357","kind":"arxiv","version":1},"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:d25c5aaeb43dd2bb5b08510339912215620958d5fd4393c164472ea64577e0e8","target":"record","created_at":"2026-05-18T03:50:23Z","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":"b47a7954a833095a951d9a61c6b081435673834b4295b3adcec3cb0d72017f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-23T11:17:15Z","title_canon_sha256":"d67996e4e20afefc0822af3bce9aa490e0d77a51fddf1081d6effe56d5936acc"},"schema_version":"1.0","source":{"id":"1207.5357","kind":"arxiv","version":1}},"canonical_sha256":"4380c630a43958e4ba4a57635457b0f9a2d25fc2d7691852f61ef54a98948d76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4380c630a43958e4ba4a57635457b0f9a2d25fc2d7691852f61ef54a98948d76","first_computed_at":"2026-05-18T03:50:23.788058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:23.788058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ipqi37SlW/etHQmA+I/DHWBA1roORIc8NCMyYup+4gMFsR8e+KSSzRjLTu5aDJAfM3wFSjM5ohE7dSON+4NCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:23.788872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d25c5aaeb43dd2bb5b08510339912215620958d5fd4393c164472ea64577e0e8","sha256:2f385f26ad5f6101231a4c77a30f1cccce6d7298be4f98f2678105d710931a3a"],"state_sha256":"d5a3815815604eac5e72aa62b5e5374e13c0b20b76c98ab6d86eda9fcbbc7833"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgnSf2GX/1zknfFyRak7QSPBKaqoC76V872C5LmHwlz8fujMPqN/BdxY3aCPZMgz//tdSgVT0Wfa74pmJDjnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:03:33.486076Z","bundle_sha256":"3f9772f0a23293578fbb4339291764a8cdf33054ea5f156a12a98dc270561ac5"}}