{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MBGWXDYMREZ2IKVWFW6LL7VYS3","short_pith_number":"pith:MBGWXDYM","schema_version":"1.0","canonical_sha256":"604d6b8f0c8933a42ab62dbcb5feb896e05eb706b8eab7da30971a3baca36b45","source":{"kind":"arxiv","id":"1605.07791","version":1},"attestation_state":"computed","paper":{"title":"A proof of Mader's conjecture on large clique subdivisions in $C_4$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Richard Montgomery","submitted_at":"2016-05-25T09:18:56Z","abstract_excerpt":"Given any integers $s,t\\geq 2$, we show there exists some $c=c(s,t)>0$ such that any $K_{s,t}$-free graph with average degree $d$ contains a subdivision of a clique with at least $cd^{\\frac{1}{2}\\frac{s}{s-1}}$ vertices. In particular, when $s=2$ this resolves in a strong sense the conjecture of Mader in 1999 that every $C_4$-free graph has a subdivision of a clique with order linear in the average degree of the original graph. In general, the widely conjectured asymptotic behaviour of the extremal density of $K_{s,t}$-free graphs suggests our result is tight up to the constant $c(s,t)$."},"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":"1605.07791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T09:18:56Z","cross_cats_sorted":[],"title_canon_sha256":"6a899e5e0a1dac4ab1e66ed982c4145817a8abb3a2afb464ce0e549e27cc853f","abstract_canon_sha256":"b28a3e300f8b52c95aa323f0b41b91c0e814f2fb3bc224b8ab8e537fc2ed9ad7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:06.561814Z","signature_b64":"qCZyMyW9GIcz7HBQuNGvt+46wVSgc6Gyd6eeiQtH9THtx2tGP/MmIlnyD8QtTBt4qCYdEW9THAKfHEOSNlGfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"604d6b8f0c8933a42ab62dbcb5feb896e05eb706b8eab7da30971a3baca36b45","last_reissued_at":"2026-05-18T00:45:06.561455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:06.561455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of Mader's conjecture on large clique subdivisions in $C_4$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Richard Montgomery","submitted_at":"2016-05-25T09:18:56Z","abstract_excerpt":"Given any integers $s,t\\geq 2$, we show there exists some $c=c(s,t)>0$ such that any $K_{s,t}$-free graph with average degree $d$ contains a subdivision of a clique with at least $cd^{\\frac{1}{2}\\frac{s}{s-1}}$ vertices. In particular, when $s=2$ this resolves in a strong sense the conjecture of Mader in 1999 that every $C_4$-free graph has a subdivision of a clique with order linear in the average degree of the original graph. In general, the widely conjectured asymptotic behaviour of the extremal density of $K_{s,t}$-free graphs suggests our result is tight up to the constant $c(s,t)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07791","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":"1605.07791","created_at":"2026-05-18T00:45:06.561514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07791v1","created_at":"2026-05-18T00:45:06.561514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07791","created_at":"2026-05-18T00:45:06.561514+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBGWXDYMREZ2","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBGWXDYMREZ2IKVW","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBGWXDYM","created_at":"2026-05-18T12:30:32.724797+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/MBGWXDYMREZ2IKVWFW6LL7VYS3","json":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3.json","graph_json":"https://pith.science/api/pith-number/MBGWXDYMREZ2IKVWFW6LL7VYS3/graph.json","events_json":"https://pith.science/api/pith-number/MBGWXDYMREZ2IKVWFW6LL7VYS3/events.json","paper":"https://pith.science/paper/MBGWXDYM"},"agent_actions":{"view_html":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3","download_json":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3.json","view_paper":"https://pith.science/paper/MBGWXDYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07791&json=true","fetch_graph":"https://pith.science/api/pith-number/MBGWXDYMREZ2IKVWFW6LL7VYS3/graph.json","fetch_events":"https://pith.science/api/pith-number/MBGWXDYMREZ2IKVWFW6LL7VYS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/action/storage_attestation","attest_author":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/action/author_attestation","sign_citation":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/action/citation_signature","submit_replication":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/action/replication_record"}},"created_at":"2026-05-18T00:45:06.561514+00:00","updated_at":"2026-05-18T00:45:06.561514+00:00"}