{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4RQYRPQNR3WXQ3JJJKFGWK6OO5","short_pith_number":"pith:4RQYRPQN","schema_version":"1.0","canonical_sha256":"e46188be0d8eed786d294a8a6b2bce77796fa6ef35bbbd1f9dbccfb79d1c114e","source":{"kind":"arxiv","id":"1101.2357","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.2357","created_at":"2026-05-18T04:31:43.128631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2357v1","created_at":"2026-05-18T04:31:43.128631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2357","created_at":"2026-05-18T04:31:43.128631+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RQYRPQNR3WX","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RQYRPQNR3WXQ3JJ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RQYRPQN","created_at":"2026-05-18T12:26:20.644004+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/4RQYRPQNR3WXQ3JJJKFGWK6OO5","json":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5.json","graph_json":"https://pith.science/api/pith-number/4RQYRPQNR3WXQ3JJJKFGWK6OO5/graph.json","events_json":"https://pith.science/api/pith-number/4RQYRPQNR3WXQ3JJJKFGWK6OO5/events.json","paper":"https://pith.science/paper/4RQYRPQN"},"agent_actions":{"view_html":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5","download_json":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5.json","view_paper":"https://pith.science/paper/4RQYRPQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2357&json=true","fetch_graph":"https://pith.science/api/pith-number/4RQYRPQNR3WXQ3JJJKFGWK6OO5/graph.json","fetch_events":"https://pith.science/api/pith-number/4RQYRPQNR3WXQ3JJJKFGWK6OO5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/action/storage_attestation","attest_author":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/action/author_attestation","sign_citation":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/action/citation_signature","submit_replication":"https://pith.science/pith/4RQYRPQNR3WXQ3JJJKFGWK6OO5/action/replication_record"}},"created_at":"2026-05-18T04:31:43.128631+00:00","updated_at":"2026-05-18T04:31:43.128631+00:00"}