{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SA3BCOUOZHOIXPLSPR3UMD3YL6","short_pith_number":"pith:SA3BCOUO","canonical_record":{"source":{"id":"1905.08994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T07:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"f9f5e152abb357617471aae2bb768310b7fb0714e775c95f07a597c3feed0e30","abstract_canon_sha256":"2e766a620e590b980049da299c5d76d892071b227eb0203d5bccc6f9e200a922"},"schema_version":"1.0"},"canonical_sha256":"9036113a8ec9dc8bbd727c77460f785f801f7d7b2fa78864cc968a462aed1315","source":{"kind":"arxiv","id":"1905.08994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08994","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08994v2","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08994","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"SA3BCOUOZHOI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SA3BCOUOZHOIXPLS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SA3BCOUO","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SA3BCOUOZHOIXPLSPR3UMD3YL6","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T07:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"f9f5e152abb357617471aae2bb768310b7fb0714e775c95f07a597c3feed0e30","abstract_canon_sha256":"2e766a620e590b980049da299c5d76d892071b227eb0203d5bccc6f9e200a922"},"schema_version":"1.0"},"canonical_sha256":"9036113a8ec9dc8bbd727c77460f785f801f7d7b2fa78864cc968a462aed1315","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:37.472537Z","signature_b64":"/kO2c/C7oXZO8uT1HGIm2Q/jC7iSeFwPU5v2k4QLiEAuFALjVDumiYP23cODCKk94j+suy1G7UhN5BzJLbWUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9036113a8ec9dc8bbd727c77460f785f801f7d7b2fa78864cc968a462aed1315","last_reissued_at":"2026-05-17T23:44:37.472039Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:37.472039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08994","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-05-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xBaiyCvp2NnKSkzfltcYZ+mXkYOIlnG3V1+YdmKssOJri/W7tugheYcHisYRISkOm5gsoagCZiwtw/cuOkODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:35:32.094915Z"},"content_sha256":"594ece43cecf47e57593a94ce8ead38f8caa003cabe9588d174066dd433870a9","schema_version":"1.0","event_id":"sha256:594ece43cecf47e57593a94ce8ead38f8caa003cabe9588d174066dd433870a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SA3BCOUOZHOIXPLSPR3UMD3YL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Turan numbers of bipartite subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tao Jiang, Yu Qiu","submitted_at":"2019-05-22T07:32:40Z","abstract_excerpt":"Given a graph $H$, the Tur\\'an number $ex(n,H)$ is the largest number of edges in an $H$-free graph on $n$ vertices. We make progress on a recent conjecture of Conlon, Janzer, and Lee on the Tur\\'an numbers of bipartite graphs, which in turn yields further progress on a conjecture of Erd\\H{o}s and Simonovits. Let $s,t,k\\geq 2$ be integers. Let $K_{s,t}^k$ denote the graph obtained from the complete bipartite graph $K_{s,t}$ by replacing each edge $uv$ in it with a path of length $k$ between $u$ and $v$ such that the $st$ replacing paths are internally disjoint. It follows from a general theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08994","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"},"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-17T23:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehpO2d1I6O6xaqmeOXP4pdZTJCcYFfnAEzxHUQWXIZNmxBCt2532bLgX15EP8FXJhACMQ59wrIZvLj9iVttQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:35:32.095530Z"},"content_sha256":"a9d1595bdfd76bf48ede40b1e8d0b54ebc123950fbbe50075ec6e0cc9cb0d4b0","schema_version":"1.0","event_id":"sha256:a9d1595bdfd76bf48ede40b1e8d0b54ebc123950fbbe50075ec6e0cc9cb0d4b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SA3BCOUOZHOIXPLSPR3UMD3YL6/bundle.json","state_url":"https://pith.science/pith/SA3BCOUOZHOIXPLSPR3UMD3YL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SA3BCOUOZHOIXPLSPR3UMD3YL6/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-01T19:35:32Z","links":{"resolver":"https://pith.science/pith/SA3BCOUOZHOIXPLSPR3UMD3YL6","bundle":"https://pith.science/pith/SA3BCOUOZHOIXPLSPR3UMD3YL6/bundle.json","state":"https://pith.science/pith/SA3BCOUOZHOIXPLSPR3UMD3YL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SA3BCOUOZHOIXPLSPR3UMD3YL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SA3BCOUOZHOIXPLSPR3UMD3YL6","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":"2e766a620e590b980049da299c5d76d892071b227eb0203d5bccc6f9e200a922","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T07:32:40Z","title_canon_sha256":"f9f5e152abb357617471aae2bb768310b7fb0714e775c95f07a597c3feed0e30"},"schema_version":"1.0","source":{"id":"1905.08994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08994","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08994v2","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08994","created_at":"2026-05-17T23:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"SA3BCOUOZHOI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SA3BCOUOZHOIXPLS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SA3BCOUO","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:a9d1595bdfd76bf48ede40b1e8d0b54ebc123950fbbe50075ec6e0cc9cb0d4b0","target":"graph","created_at":"2026-05-17T23:44:37Z","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 a graph $H$, the Tur\\'an number $ex(n,H)$ is the largest number of edges in an $H$-free graph on $n$ vertices. We make progress on a recent conjecture of Conlon, Janzer, and Lee on the Tur\\'an numbers of bipartite graphs, which in turn yields further progress on a conjecture of Erd\\H{o}s and Simonovits. Let $s,t,k\\geq 2$ be integers. Let $K_{s,t}^k$ denote the graph obtained from the complete bipartite graph $K_{s,t}$ by replacing each edge $uv$ in it with a path of length $k$ between $u$ and $v$ such that the $st$ replacing paths are internally disjoint. It follows from a general theore","authors_text":"Tao Jiang, Yu Qiu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T07:32:40Z","title":"Turan numbers of bipartite subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08994","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:594ece43cecf47e57593a94ce8ead38f8caa003cabe9588d174066dd433870a9","target":"record","created_at":"2026-05-17T23:44:37Z","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":"2e766a620e590b980049da299c5d76d892071b227eb0203d5bccc6f9e200a922","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-22T07:32:40Z","title_canon_sha256":"f9f5e152abb357617471aae2bb768310b7fb0714e775c95f07a597c3feed0e30"},"schema_version":"1.0","source":{"id":"1905.08994","kind":"arxiv","version":2}},"canonical_sha256":"9036113a8ec9dc8bbd727c77460f785f801f7d7b2fa78864cc968a462aed1315","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9036113a8ec9dc8bbd727c77460f785f801f7d7b2fa78864cc968a462aed1315","first_computed_at":"2026-05-17T23:44:37.472039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:37.472039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/kO2c/C7oXZO8uT1HGIm2Q/jC7iSeFwPU5v2k4QLiEAuFALjVDumiYP23cODCKk94j+suy1G7UhN5BzJLbWUCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:37.472537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:594ece43cecf47e57593a94ce8ead38f8caa003cabe9588d174066dd433870a9","sha256:a9d1595bdfd76bf48ede40b1e8d0b54ebc123950fbbe50075ec6e0cc9cb0d4b0"],"state_sha256":"bf673abf64674d696f20f46ca3b3d8b69860673cc67fedfded3ce1dd59ba5317"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+H3Q0D6w6hErjLamBNO/ND642L9UM8nJaKwj2zTJ12o/B179ZYt0ucidFmYHyMkQyp0bWw4DXv+Cc116bBKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:35:32.098185Z","bundle_sha256":"9ac2fe7cacf5d89689e7e572d633811f36800f905eb4501a5796a2f26d585662"}}