{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5QACEPNIWRVUB35YRFW3RWY2YG","short_pith_number":"pith:5QACEPNI","canonical_record":{"source":{"id":"1903.10631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T23:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"3c595052045f0bdb550d265cb3b42a73be2fc31ff06b4b7b1efbf7b658aca8a5","abstract_canon_sha256":"00b0a5a044fb2c79d6d9868c29ca7b84695cfd59f3e1ba5b763dde3034657c6b"},"schema_version":"1.0"},"canonical_sha256":"ec00223da8b46b40efb8896db8db1ac184577b3b5b34724d7dd4b7ca66f1362b","source":{"kind":"arxiv","id":"1903.10631","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10631","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10631v2","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10631","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"5QACEPNIWRVU","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"5QACEPNIWRVUB35Y","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"5QACEPNI","created_at":"2026-07-05T00:58:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5QACEPNIWRVUB35YRFW3RWY2YG","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T23:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"3c595052045f0bdb550d265cb3b42a73be2fc31ff06b4b7b1efbf7b658aca8a5","abstract_canon_sha256":"00b0a5a044fb2c79d6d9868c29ca7b84695cfd59f3e1ba5b763dde3034657c6b"},"schema_version":"1.0"},"canonical_sha256":"ec00223da8b46b40efb8896db8db1ac184577b3b5b34724d7dd4b7ca66f1362b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:02.609484Z","signature_b64":"URZWaRkoYGDuAO/mbBYsQEZBj14iX3VS9mu4SW80LDzZZFghYdbG1csW0Syvn1vJpasfFv6miR4s9+Zcf/WbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec00223da8b46b40efb8896db8db1ac184577b3b5b34724d7dd4b7ca66f1362b","last_reissued_at":"2026-07-05T00:58:02.609029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:02.609029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10631","source_version":2,"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-07-05T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5du3Gw9IPi2qyiRaaormxdCfM1RieDzEFRqMpZRhoKbtD83oBmGxSTk3DeX67D0xjdOo2otDZwjGd8wN842BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:15:31.629691Z"},"content_sha256":"c8c06891eb82ee2bb5b82437049a1883efa13078508ce02514e5764b34e846ac","schema_version":"1.0","event_id":"sha256:c8c06891eb82ee2bb5b82437049a1883efa13078508ce02514e5764b34e846ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5QACEPNIWRVUB35YRFW3RWY2YG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More on the extremal number of subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Conlon, Joonkyung Lee, Oliver Janzer","submitted_at":"2019-03-25T23:16:03Z","abstract_excerpt":"Given a graph $H$, the extremal number $\\mathrm{ex}(n,H)$ is the largest number of edges in an $H$-free graph on $n$ vertices. We make progress on a number of conjectures about the extremal number of bipartite graphs. First, writing $K'_{s,t}$ for the subdivision of the bipartite graph $K_{s,t}$, we show that $\\mathrm{ex}(n, K'_{s,t}) = O(n^{3/2 - \\frac{1}{2s}})$. This proves a conjecture of Kang, Kim and Liu and is tight up to the implied constant for $t$ sufficiently large in terms of $s$. Second, for any integers $s, k \\geq 1$, we show that $\\mathrm{ex}(n, L) = \\Theta(n^{1 + \\frac{s}{sk+1}}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10631","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.10631/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O30GIXu54hTn2/SqgZvK5GHS56+tkRcPgDmHSHvqaRVoR5UvZgzfLJ3cZOUqDnbNOUN/GDtLJ/rgKVvFS8UMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:15:31.630196Z"},"content_sha256":"04357a4282b6d1aea69ee0f03453072f590e6f2c690da455f77085561f7511f3","schema_version":"1.0","event_id":"sha256:04357a4282b6d1aea69ee0f03453072f590e6f2c690da455f77085561f7511f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QACEPNIWRVUB35YRFW3RWY2YG/bundle.json","state_url":"https://pith.science/pith/5QACEPNIWRVUB35YRFW3RWY2YG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QACEPNIWRVUB35YRFW3RWY2YG/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-08-16T11:15:31Z","links":{"resolver":"https://pith.science/pith/5QACEPNIWRVUB35YRFW3RWY2YG","bundle":"https://pith.science/pith/5QACEPNIWRVUB35YRFW3RWY2YG/bundle.json","state":"https://pith.science/pith/5QACEPNIWRVUB35YRFW3RWY2YG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QACEPNIWRVUB35YRFW3RWY2YG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5QACEPNIWRVUB35YRFW3RWY2YG","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":"00b0a5a044fb2c79d6d9868c29ca7b84695cfd59f3e1ba5b763dde3034657c6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T23:16:03Z","title_canon_sha256":"3c595052045f0bdb550d265cb3b42a73be2fc31ff06b4b7b1efbf7b658aca8a5"},"schema_version":"1.0","source":{"id":"1903.10631","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10631","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10631v2","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10631","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"5QACEPNIWRVU","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"5QACEPNIWRVUB35Y","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"5QACEPNI","created_at":"2026-07-05T00:58:02Z"}],"graph_snapshots":[{"event_id":"sha256:04357a4282b6d1aea69ee0f03453072f590e6f2c690da455f77085561f7511f3","target":"graph","created_at":"2026-07-05T00:58:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.10631/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $H$, the extremal number $\\mathrm{ex}(n,H)$ is the largest number of edges in an $H$-free graph on $n$ vertices. We make progress on a number of conjectures about the extremal number of bipartite graphs. First, writing $K'_{s,t}$ for the subdivision of the bipartite graph $K_{s,t}$, we show that $\\mathrm{ex}(n, K'_{s,t}) = O(n^{3/2 - \\frac{1}{2s}})$. This proves a conjecture of Kang, Kim and Liu and is tight up to the implied constant for $t$ sufficiently large in terms of $s$. Second, for any integers $s, k \\geq 1$, we show that $\\mathrm{ex}(n, L) = \\Theta(n^{1 + \\frac{s}{sk+1}}","authors_text":"David Conlon, Joonkyung Lee, Oliver Janzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T23:16:03Z","title":"More on the extremal number of subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10631","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:c8c06891eb82ee2bb5b82437049a1883efa13078508ce02514e5764b34e846ac","target":"record","created_at":"2026-07-05T00:58:02Z","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":"00b0a5a044fb2c79d6d9868c29ca7b84695cfd59f3e1ba5b763dde3034657c6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-25T23:16:03Z","title_canon_sha256":"3c595052045f0bdb550d265cb3b42a73be2fc31ff06b4b7b1efbf7b658aca8a5"},"schema_version":"1.0","source":{"id":"1903.10631","kind":"arxiv","version":2}},"canonical_sha256":"ec00223da8b46b40efb8896db8db1ac184577b3b5b34724d7dd4b7ca66f1362b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec00223da8b46b40efb8896db8db1ac184577b3b5b34724d7dd4b7ca66f1362b","first_computed_at":"2026-07-05T00:58:02.609029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:02.609029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"URZWaRkoYGDuAO/mbBYsQEZBj14iX3VS9mu4SW80LDzZZFghYdbG1csW0Syvn1vJpasfFv6miR4s9+Zcf/WbDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:02.609484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10631","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8c06891eb82ee2bb5b82437049a1883efa13078508ce02514e5764b34e846ac","sha256:04357a4282b6d1aea69ee0f03453072f590e6f2c690da455f77085561f7511f3"],"state_sha256":"d036b36c8245539a54c8530f607659ecbba8f5ba75ff628841ed1982bb3252a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZ2dQEtDzD107UvtvHhE+2Pc5zCEP0M0YJa4R+6zxhN3GnBqsRZ0/GmhfOiF6Vi8yihgcq0Jc7aL8OELtzIQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:15:31.635286Z","bundle_sha256":"57fb7c7896cc64fe767331bff4c0a189565f3d77f4d7e7a4ef542c2e16e25fc6"}}