{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MBGWXDYMREZ2IKVWFW6LL7VYS3","short_pith_number":"pith:MBGWXDYM","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"},"canonical_sha256":"604d6b8f0c8933a42ab62dbcb5feb896e05eb706b8eab7da30971a3baca36b45","source":{"kind":"arxiv","id":"1605.07791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07791","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07791v1","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07791","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"MBGWXDYMREZ2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MBGWXDYMREZ2IKVW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MBGWXDYM","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MBGWXDYMREZ2IKVWFW6LL7VYS3","target":"record","payload":{"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"},"canonical_sha256":"604d6b8f0c8933a42ab62dbcb5feb896e05eb706b8eab7da30971a3baca36b45","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"},"source_kind":"arxiv","source_id":"1605.07791","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEEmgBVasz8A98B1AbCnzt/WWi4pEeq6lNE6qV35i2R+e6wFmBK+XRMULU8GYmhqc9K20CZjFWNPVVAiuNntCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:18:55.180370Z"},"content_sha256":"3e4a0d83a2b47fa7a20154ee23800cf1df2082cfa2bdd5d3d744af6c4607446e","schema_version":"1.0","event_id":"sha256:3e4a0d83a2b47fa7a20154ee23800cf1df2082cfa2bdd5d3d744af6c4607446e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MBGWXDYMREZ2IKVWFW6LL7VYS3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsfi7OAvavWcl68yGb78yxMruFRFdUAXUf2AzDosWepqnwlEflR4eRCzUl+ZJQEfYZc5PFTZmsG2guyGTT8iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:18:55.180708Z"},"content_sha256":"8a73a78115ff0639128d8f0a70d3cfa9053a86f4166652eb03db4a80ca0eaee0","schema_version":"1.0","event_id":"sha256:8a73a78115ff0639128d8f0a70d3cfa9053a86f4166652eb03db4a80ca0eaee0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/bundle.json","state_url":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T12:18:55Z","links":{"resolver":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3","bundle":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/bundle.json","state":"https://pith.science/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBGWXDYMREZ2IKVWFW6LL7VYS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MBGWXDYMREZ2IKVWFW6LL7VYS3","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":"b28a3e300f8b52c95aa323f0b41b91c0e814f2fb3bc224b8ab8e537fc2ed9ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T09:18:56Z","title_canon_sha256":"6a899e5e0a1dac4ab1e66ed982c4145817a8abb3a2afb464ce0e549e27cc853f"},"schema_version":"1.0","source":{"id":"1605.07791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07791","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07791v1","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07791","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"MBGWXDYMREZ2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MBGWXDYMREZ2IKVW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MBGWXDYM","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:8a73a78115ff0639128d8f0a70d3cfa9053a86f4166652eb03db4a80ca0eaee0","target":"graph","created_at":"2026-05-18T00:45:06Z","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":"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)$.","authors_text":"Hong Liu, Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T09:18:56Z","title":"A proof of Mader's conjecture on large clique subdivisions in $C_4$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07791","kind":"arxiv","version":1},"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:3e4a0d83a2b47fa7a20154ee23800cf1df2082cfa2bdd5d3d744af6c4607446e","target":"record","created_at":"2026-05-18T00:45:06Z","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":"b28a3e300f8b52c95aa323f0b41b91c0e814f2fb3bc224b8ab8e537fc2ed9ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T09:18:56Z","title_canon_sha256":"6a899e5e0a1dac4ab1e66ed982c4145817a8abb3a2afb464ce0e549e27cc853f"},"schema_version":"1.0","source":{"id":"1605.07791","kind":"arxiv","version":1}},"canonical_sha256":"604d6b8f0c8933a42ab62dbcb5feb896e05eb706b8eab7da30971a3baca36b45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"604d6b8f0c8933a42ab62dbcb5feb896e05eb706b8eab7da30971a3baca36b45","first_computed_at":"2026-05-18T00:45:06.561455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:06.561455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qCZyMyW9GIcz7HBQuNGvt+46wVSgc6Gyd6eeiQtH9THtx2tGP/MmIlnyD8QtTBt4qCYdEW9THAKfHEOSNlGfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:06.561814Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e4a0d83a2b47fa7a20154ee23800cf1df2082cfa2bdd5d3d744af6c4607446e","sha256:8a73a78115ff0639128d8f0a70d3cfa9053a86f4166652eb03db4a80ca0eaee0"],"state_sha256":"05fafa225ede5c69ef4a72a173e7d4cf9e6e86f1a08a142120fbf3b9033cb1f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9b+Hf6/Utg9j/ltP+F16aZn6aqsZ1Zm5AQafJG4h5HlX20LGW5EhABjC8M0NWFVKx4RktSCo3FPxmypBkxW6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:18:55.182550Z","bundle_sha256":"ef7d6d69605ba832bbeadb1669dfa91f10099c668d5f439453b44ce57a3e7c93"}}