{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CDZIYDXXYKNFHJL765J742KYDN","short_pith_number":"pith:CDZIYDXX","schema_version":"1.0","canonical_sha256":"10f28c0ef7c29a53a57ff753fe69581b54e8f14f6070e5122b48499958d45f6a","source":{"kind":"arxiv","id":"1411.4819","version":2},"attestation_state":"computed","paper":{"title":"Counting K_4-Subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jens M. Schmidt, Mingji Xia, Tillmann Miltzow","submitted_at":"2014-11-18T12:05:57Z","abstract_excerpt":"A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of $K_4$. As a generalization, we ask for the minimum number of $K_4$-subdivisions that are contained in every $3$-connected graph on $n$ vertices. We prove that there are $\\Omega(n^3)$ such $K_4$-subdivisions and show that the order of this bound is tight for infinitely many graphs. We further investigate a better bound in dependence on $m$ and prove that the computational complexity of the problem of counting the exact number of $K_4$-subdivisions is $\\#P$-hard."},"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":"1411.4819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-18T12:05:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"186227fcd2ce0d46449ae0c7c3ed60b7240d90b73f14d4e70281382347ea3c03","abstract_canon_sha256":"5f0d98270b5419bd7d957865f3db436c0cfa467cd89c8e49203f2585ee3ac15c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:31.366150Z","signature_b64":"/GO+GcIYru3hF/e8NzmdlrW5fqiV4FmdafDaxpF3IhjbVio6MjECbjD/LFxZfTo4hQHssiNZKPXU3yw5yFO5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10f28c0ef7c29a53a57ff753fe69581b54e8f14f6070e5122b48499958d45f6a","last_reissued_at":"2026-05-18T01:49:31.365687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:31.365687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting K_4-Subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jens M. Schmidt, Mingji Xia, Tillmann Miltzow","submitted_at":"2014-11-18T12:05:57Z","abstract_excerpt":"A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of $K_4$. As a generalization, we ask for the minimum number of $K_4$-subdivisions that are contained in every $3$-connected graph on $n$ vertices. We prove that there are $\\Omega(n^3)$ such $K_4$-subdivisions and show that the order of this bound is tight for infinitely many graphs. We further investigate a better bound in dependence on $m$ and prove that the computational complexity of the problem of counting the exact number of $K_4$-subdivisions is $\\#P$-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4819","kind":"arxiv","version":2},"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":"1411.4819","created_at":"2026-05-18T01:49:31.365758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4819v2","created_at":"2026-05-18T01:49:31.365758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4819","created_at":"2026-05-18T01:49:31.365758+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDZIYDXXYKNF","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDZIYDXXYKNFHJL7","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDZIYDXX","created_at":"2026-05-18T12:28:22.404517+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/CDZIYDXXYKNFHJL765J742KYDN","json":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN.json","graph_json":"https://pith.science/api/pith-number/CDZIYDXXYKNFHJL765J742KYDN/graph.json","events_json":"https://pith.science/api/pith-number/CDZIYDXXYKNFHJL765J742KYDN/events.json","paper":"https://pith.science/paper/CDZIYDXX"},"agent_actions":{"view_html":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN","download_json":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN.json","view_paper":"https://pith.science/paper/CDZIYDXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4819&json=true","fetch_graph":"https://pith.science/api/pith-number/CDZIYDXXYKNFHJL765J742KYDN/graph.json","fetch_events":"https://pith.science/api/pith-number/CDZIYDXXYKNFHJL765J742KYDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN/action/storage_attestation","attest_author":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN/action/author_attestation","sign_citation":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN/action/citation_signature","submit_replication":"https://pith.science/pith/CDZIYDXXYKNFHJL765J742KYDN/action/replication_record"}},"created_at":"2026-05-18T01:49:31.365758+00:00","updated_at":"2026-05-18T01:49:31.365758+00:00"}