{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZHOJALNEJIGNPL6GWTXNJQYDDL","short_pith_number":"pith:ZHOJALNE","schema_version":"1.0","canonical_sha256":"c9dc902da44a0cd7afc6b4eed4c3031aee7e017b19706ad53315dc3b450d7b75","source":{"kind":"arxiv","id":"1101.5278","version":1},"attestation_state":"computed","paper":{"title":"Nonseparating K4-subdivisions in graphs of minimum degree at least 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Kriesell","submitted_at":"2011-01-27T13:12:28Z","abstract_excerpt":"We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative answer to a question of W. Kuehnel whether every 4-connected graph G contains a subdivision H of K4 as a subgraph such that G-V(H) is connected. The motor for our induction is a result of Fontet and Martinov stating that every 4-connected graph can be reduced to a smaller one by contracting a single edge, unless the graph is the square of a cycle or the line "},"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.5278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-27T13:12:28Z","cross_cats_sorted":[],"title_canon_sha256":"fd3bef27d59b1995b84f8a4e0934fd58fe86cc3604ff77fb89e47fb3aa0282e9","abstract_canon_sha256":"cea92684ee4efdb45492616bf666d3147a6e963efc7cdceccf201dc240486990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:35.785499Z","signature_b64":"9hGOy8uQBY4Q62tqkxY5yAGjbRJKc9xjCL7F/Bjct4EN1pItVvcVGWG1T2lZF8vytjGh4vuhFW2uzbXz9bWjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9dc902da44a0cd7afc6b4eed4c3031aee7e017b19706ad53315dc3b450d7b75","last_reissued_at":"2026-05-18T04:30:35.784893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:35.784893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonseparating K4-subdivisions in graphs of minimum degree at least 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Kriesell","submitted_at":"2011-01-27T13:12:28Z","abstract_excerpt":"We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative answer to a question of W. Kuehnel whether every 4-connected graph G contains a subdivision H of K4 as a subgraph such that G-V(H) is connected. The motor for our induction is a result of Fontet and Martinov stating that every 4-connected graph can be reduced to a smaller one by contracting a single edge, unless the graph is the square of a cycle or the line "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5278","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.5278","created_at":"2026-05-18T04:30:35.784989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5278v1","created_at":"2026-05-18T04:30:35.784989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5278","created_at":"2026-05-18T04:30:35.784989+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHOJALNEJIGN","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHOJALNEJIGNPL6G","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHOJALNE","created_at":"2026-05-18T12:26:47.523578+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/ZHOJALNEJIGNPL6GWTXNJQYDDL","json":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL.json","graph_json":"https://pith.science/api/pith-number/ZHOJALNEJIGNPL6GWTXNJQYDDL/graph.json","events_json":"https://pith.science/api/pith-number/ZHOJALNEJIGNPL6GWTXNJQYDDL/events.json","paper":"https://pith.science/paper/ZHOJALNE"},"agent_actions":{"view_html":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL","download_json":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL.json","view_paper":"https://pith.science/paper/ZHOJALNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5278&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHOJALNEJIGNPL6GWTXNJQYDDL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHOJALNEJIGNPL6GWTXNJQYDDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL/action/storage_attestation","attest_author":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL/action/author_attestation","sign_citation":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL/action/citation_signature","submit_replication":"https://pith.science/pith/ZHOJALNEJIGNPL6GWTXNJQYDDL/action/replication_record"}},"created_at":"2026-05-18T04:30:35.784989+00:00","updated_at":"2026-05-18T04:30:35.784989+00:00"}