{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z75ZRMHGAV7G4IRAWAGYDPD3TH","short_pith_number":"pith:Z75ZRMHG","schema_version":"1.0","canonical_sha256":"cffb98b0e6057e6e2220b00d81bc7b99d44097695af3d98df79842d25eafb2e8","source":{"kind":"arxiv","id":"1905.08001","version":1},"attestation_state":"computed","paper":{"title":"The extremal number of longer subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oliver Janzer","submitted_at":"2019-05-20T11:28:08Z","abstract_excerpt":"For a multigraph $F$, the $k$-subdivision of $F$ is the graph obtained by replacing the edges of $F$ with pairwise internally vertex-disjoint paths of length $k+1$. Conlon and Lee conjectured that if $k$ is even, then the $(k-1)$-subdivision of any multigraph has extremal number $O(n^{1+\\frac{1}{k}})$, and moreover, that for any simple graph $F$ there exists $\\varepsilon>0$ such that the $(k-1)$-subdivision of $F$ has extremal number $O(n^{1+\\frac{1}{k}-\\varepsilon})$. In this paper, we prove both conjectures."},"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":"1905.08001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-20T11:28:08Z","cross_cats_sorted":[],"title_canon_sha256":"be8a86b598de05656298f9b2ebe53f5d9f6b0fce50004e16f89e69edecd2e25f","abstract_canon_sha256":"262d2c5671b5000c65756f8d9335419222a780a4e1dada26adfc25d29066dd3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:13:10.545918Z","signature_b64":"xIIbsVp3xQFIViCBdRPYvagI1nZt7C7nVMZ9GC1cldS2NSmStuBRpJ/4JOh2jgcrqU5n8ikBmFcA215StwjVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cffb98b0e6057e6e2220b00d81bc7b99d44097695af3d98df79842d25eafb2e8","last_reissued_at":"2026-07-05T02:13:10.545489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:13:10.545489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The extremal number of longer subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oliver Janzer","submitted_at":"2019-05-20T11:28:08Z","abstract_excerpt":"For a multigraph $F$, the $k$-subdivision of $F$ is the graph obtained by replacing the edges of $F$ with pairwise internally vertex-disjoint paths of length $k+1$. Conlon and Lee conjectured that if $k$ is even, then the $(k-1)$-subdivision of any multigraph has extremal number $O(n^{1+\\frac{1}{k}})$, and moreover, that for any simple graph $F$ there exists $\\varepsilon>0$ such that the $(k-1)$-subdivision of $F$ has extremal number $O(n^{1+\\frac{1}{k}-\\varepsilon})$. In this paper, we prove both conjectures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08001","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.08001/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.08001","created_at":"2026-07-05T02:13:10.545547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08001v1","created_at":"2026-07-05T02:13:10.545547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08001","created_at":"2026-07-05T02:13:10.545547+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z75ZRMHGAV7G","created_at":"2026-07-05T02:13:10.545547+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z75ZRMHGAV7G4IRA","created_at":"2026-07-05T02:13:10.545547+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z75ZRMHG","created_at":"2026-07-05T02:13:10.545547+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02385","citing_title":"Many Turan exponents via subdivisions","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH","json":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH.json","graph_json":"https://pith.science/api/pith-number/Z75ZRMHGAV7G4IRAWAGYDPD3TH/graph.json","events_json":"https://pith.science/api/pith-number/Z75ZRMHGAV7G4IRAWAGYDPD3TH/events.json","paper":"https://pith.science/paper/Z75ZRMHG"},"agent_actions":{"view_html":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH","download_json":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH.json","view_paper":"https://pith.science/paper/Z75ZRMHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08001&json=true","fetch_graph":"https://pith.science/api/pith-number/Z75ZRMHGAV7G4IRAWAGYDPD3TH/graph.json","fetch_events":"https://pith.science/api/pith-number/Z75ZRMHGAV7G4IRAWAGYDPD3TH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH/action/storage_attestation","attest_author":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH/action/author_attestation","sign_citation":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH/action/citation_signature","submit_replication":"https://pith.science/pith/Z75ZRMHGAV7G4IRAWAGYDPD3TH/action/replication_record"}},"created_at":"2026-07-05T02:13:10.545547+00:00","updated_at":"2026-07-05T02:13:10.545547+00:00"}