{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CDZIYDXXYKNFHJL765J742KYDN","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":"5f0d98270b5419bd7d957865f3db436c0cfa467cd89c8e49203f2585ee3ac15c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-18T12:05:57Z","title_canon_sha256":"186227fcd2ce0d46449ae0c7c3ed60b7240d90b73f14d4e70281382347ea3c03"},"schema_version":"1.0","source":{"id":"1411.4819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4819","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4819v2","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4819","created_at":"2026-05-18T01:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"CDZIYDXXYKNF","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDZIYDXXYKNFHJL7","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDZIYDXX","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:2020a6e416b0e4edc1dfdcaef27381454f9dd119dc1df7f735c0ff9e1a9ace71","target":"graph","created_at":"2026-05-18T01:49:31Z","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 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.","authors_text":"Jens M. Schmidt, Mingji Xia, Tillmann Miltzow","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-18T12:05:57Z","title":"Counting K_4-Subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4819","kind":"arxiv","version":2},"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:17a4c10dd7270ad6b017906ac3f83f8341e995d49186901122f9cee9f4eb87a6","target":"record","created_at":"2026-05-18T01:49:31Z","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":"5f0d98270b5419bd7d957865f3db436c0cfa467cd89c8e49203f2585ee3ac15c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-18T12:05:57Z","title_canon_sha256":"186227fcd2ce0d46449ae0c7c3ed60b7240d90b73f14d4e70281382347ea3c03"},"schema_version":"1.0","source":{"id":"1411.4819","kind":"arxiv","version":2}},"canonical_sha256":"10f28c0ef7c29a53a57ff753fe69581b54e8f14f6070e5122b48499958d45f6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10f28c0ef7c29a53a57ff753fe69581b54e8f14f6070e5122b48499958d45f6a","first_computed_at":"2026-05-18T01:49:31.365687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:31.365687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/GO+GcIYru3hF/e8NzmdlrW5fqiV4FmdafDaxpF3IhjbVio6MjECbjD/LFxZfTo4hQHssiNZKPXU3yw5yFO5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:31.366150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a4c10dd7270ad6b017906ac3f83f8341e995d49186901122f9cee9f4eb87a6","sha256:2020a6e416b0e4edc1dfdcaef27381454f9dd119dc1df7f735c0ff9e1a9ace71"],"state_sha256":"aac86ec0d96db339f650a7deb42fb5bd17db4839beb1baa4fefabbc0186ac59f"}