{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4RQYRPQNR3WXQ3JJJKFGWK6OO5","short_pith_number":"pith:4RQYRPQN","canonical_record":{"source":{"id":"1101.2357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T13:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"db2ee9d5e4ccef72c4a6b4853db70663cdf3b95072594e8ebb26eaa4d8cfa902","abstract_canon_sha256":"7e400358589b83fb62372f7df692a94e4deacec71a229ecbf4ad8fde20a336b1"},"schema_version":"1.0"},"canonical_sha256":"e46188be0d8eed786d294a8a6b2bce77796fa6ef35bbbd1f9dbccfb79d1c114e","source":{"kind":"arxiv","id":"1101.2357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2357","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2357v1","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2357","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"4RQYRPQNR3WX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4RQYRPQNR3WXQ3JJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4RQYRPQN","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4RQYRPQNR3WXQ3JJJKFGWK6OO5","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T13:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"db2ee9d5e4ccef72c4a6b4853db70663cdf3b95072594e8ebb26eaa4d8cfa902","abstract_canon_sha256":"7e400358589b83fb62372f7df692a94e4deacec71a229ecbf4ad8fde20a336b1"},"schema_version":"1.0"},"canonical_sha256":"e46188be0d8eed786d294a8a6b2bce77796fa6ef35bbbd1f9dbccfb79d1c114e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:43.128938Z","signature_b64":"hvZw3Fa7Bv+6xJyOe6aqgFpuIkwVTnHncaDFfPtC33q1+q/+43kDpdva2T+F1rONdaEfPjMfSSaWtvEubgASDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e46188be0d8eed786d294a8a6b2bce77796fa6ef35bbbd1f9dbccfb79d1c114e","last_reissued_at":"2026-05-18T04:31:43.128575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:43.128575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2357","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-18T04:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3rqq09tzPYubBNYapGyPWbFMH+6mkkUYYSgcNeSRhRc0ZNHWxsHsOmOILU1KFt1aNCgdR9ICdNBGXaXIoy8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:40:05.723964Z"},"content_sha256":"c94969a3201c3580787057c6fb3b847d94f3cfb73cf4fbdfd9e44cc5d76471be","schema_version":"1.0","event_id":"sha256:c94969a3201c3580787057c6fb3b847d94f3cfb73cf4fbdfd9e44cc5d76471be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4RQYRPQNR3WXQ3JJJKFGWK6OO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Kriesell","submitted_at":"2011-01-12T13:44:25Z","abstract_excerpt":"A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a prominent role in graph connectivity theory, and we give a brief introduction with a light emphasis on reduction- and construction theorems for classes of k-connected graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2357","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-18T04:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gw7TN3300rvoI2UWzy1vDDP/a8+XMv4WVN+MaJ6+HIQI/Z0774/tr+R6h+BwEnv5m7Me+EhFtTPpmdqLLp8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:40:05.724302Z"},"content_sha256":"e489f0bebcbe4e3662b33f7bad4603e7bda7a690b82bf192a350100a06dbfef9","schema_version":"1.0","event_id":"sha256:e489f0bebcbe4e3662b33f7bad4603e7bda7a690b82bf192a350100a06dbfef9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/bundle.json","state_url":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/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-22T17:40:05Z","links":{"resolver":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5","bundle":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/bundle.json","state":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4RQYRPQNR3WXQ3JJJKFGWK6OO5","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":"7e400358589b83fb62372f7df692a94e4deacec71a229ecbf4ad8fde20a336b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T13:44:25Z","title_canon_sha256":"db2ee9d5e4ccef72c4a6b4853db70663cdf3b95072594e8ebb26eaa4d8cfa902"},"schema_version":"1.0","source":{"id":"1101.2357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2357","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2357v1","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2357","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"4RQYRPQNR3WX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4RQYRPQNR3WXQ3JJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4RQYRPQN","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:e489f0bebcbe4e3662b33f7bad4603e7bda7a690b82bf192a350100a06dbfef9","target":"graph","created_at":"2026-05-18T04:31:43Z","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 k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a prominent role in graph connectivity theory, and we give a brief introduction with a light emphasis on reduction- and construction theorems for classes of k-connected graphs.","authors_text":"Matthias Kriesell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T13:44:25Z","title":"Minimal Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2357","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:c94969a3201c3580787057c6fb3b847d94f3cfb73cf4fbdfd9e44cc5d76471be","target":"record","created_at":"2026-05-18T04:31:43Z","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":"7e400358589b83fb62372f7df692a94e4deacec71a229ecbf4ad8fde20a336b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T13:44:25Z","title_canon_sha256":"db2ee9d5e4ccef72c4a6b4853db70663cdf3b95072594e8ebb26eaa4d8cfa902"},"schema_version":"1.0","source":{"id":"1101.2357","kind":"arxiv","version":1}},"canonical_sha256":"e46188be0d8eed786d294a8a6b2bce77796fa6ef35bbbd1f9dbccfb79d1c114e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e46188be0d8eed786d294a8a6b2bce77796fa6ef35bbbd1f9dbccfb79d1c114e","first_computed_at":"2026-05-18T04:31:43.128575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:43.128575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvZw3Fa7Bv+6xJyOe6aqgFpuIkwVTnHncaDFfPtC33q1+q/+43kDpdva2T+F1rONdaEfPjMfSSaWtvEubgASDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:43.128938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c94969a3201c3580787057c6fb3b847d94f3cfb73cf4fbdfd9e44cc5d76471be","sha256:e489f0bebcbe4e3662b33f7bad4603e7bda7a690b82bf192a350100a06dbfef9"],"state_sha256":"97b6d1f4d9864e9626a0f477d0a9126f4b1acba8ce71f8940be9e480c0ffd935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buHDD5nn2dc55Qsx2a4soqgNbsQwtuJ/mhyg1dQpClgbgTgHHNsTQA965wC9+z34pLASvJQLIgC1TgDPObP5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:40:05.726215Z","bundle_sha256":"6f6ae6e6d043871d628ad275afa5bb7af024662179242d33ef7bb7db19aeb8ba"}}