{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JT2UC65B63IM54JPV63C254HLB","short_pith_number":"pith:JT2UC65B","canonical_record":{"source":{"id":"1811.06916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T17:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"584db867842ca6596a5f45d02fcb7970fdb082ec350242c64a5f79ecb5f8abe7","abstract_canon_sha256":"e66bec8aa8965c2d810712d39b48563248440851e8391db2dc7d3808eae601d0"},"schema_version":"1.0"},"canonical_sha256":"4cf5417ba1f6d0cef12fafb62d7787585fa17115ae9b303b4c1f26efd5fd4a16","source":{"kind":"arxiv","id":"1811.06916","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06916","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06916v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06916","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"JT2UC65B63IM","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JT2UC65B63IM54JP","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JT2UC65B","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JT2UC65B63IM54JPV63C254HLB","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T17:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"584db867842ca6596a5f45d02fcb7970fdb082ec350242c64a5f79ecb5f8abe7","abstract_canon_sha256":"e66bec8aa8965c2d810712d39b48563248440851e8391db2dc7d3808eae601d0"},"schema_version":"1.0"},"canonical_sha256":"4cf5417ba1f6d0cef12fafb62d7787585fa17115ae9b303b4c1f26efd5fd4a16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.474560Z","signature_b64":"qY8xN1ys293JfvKWYReafmYop/6KnlJMfwO6Slmi5z6+MiloDF6UhCPhT6QnaPCt2Psz5xiI/rx0+nEPKo6RAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cf5417ba1f6d0cef12fafb62d7787585fa17115ae9b303b4c1f26efd5fd4a16","last_reissued_at":"2026-05-18T00:00:33.473997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.473997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06916","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:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aqa6wcHuAQAAToH/jLrXS1Ot8UaZ+el68BNLYXu+tABkJXaq4KB3GKiXbEkeJT9XalqJ5K3yblqJ/EP1tXM9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:39.151196Z"},"content_sha256":"ab023c80e660bdae3382541327cfd27e3d1576be1143b3aefdbd937b456014ac","schema_version":"1.0","event_id":"sha256:ab023c80e660bdae3382541327cfd27e3d1576be1143b3aefdbd937b456014ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JT2UC65B63IM54JPV63C254HLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the rational Tur\\'an exponents conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Hong Liu, Jaehoon Kim","submitted_at":"2018-11-16T17:00:15Z","abstract_excerpt":"The extremal number $\\mathrm{ex}(n,F)$ of a graph $F$ is the maximum number of edges in an $n$-vertex graph not containing $F$ as a subgraph. A real number $r \\in [1,2]$ is realisable if there exists a graph $F$ with $\\mathrm{ex}(n , F) = \\Theta(n^r)$. Several decades ago, Erd\\H{o}s and Simonovits conjectured that every rational number in $[1,2]$ is realisable. Despite decades of effort, the only known realisable numbers are $0,1, \\frac{7}{5}, 2$, and the numbers of the form $1+\\frac{1}{m}$, $2-\\frac{1}{m}$, $2-\\frac{2}{m}$ for integers $m \\geq 1$. In particular, it is not even known whether t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06916","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:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAogMp5ylSkBJ2N5abB6MmCgeo1ryvly9ohdOlfphDUWvVCeq8mi04pypS1ygZfELC+2Q+jJy5Otwq2MjxXzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:39.151819Z"},"content_sha256":"b2e3aed162f4766aee885fa91b43277b42fab89d30190bc9056afc8d93579a9e","schema_version":"1.0","event_id":"sha256:b2e3aed162f4766aee885fa91b43277b42fab89d30190bc9056afc8d93579a9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JT2UC65B63IM54JPV63C254HLB/bundle.json","state_url":"https://pith.science/pith/JT2UC65B63IM54JPV63C254HLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JT2UC65B63IM54JPV63C254HLB/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-05-27T08:30:39Z","links":{"resolver":"https://pith.science/pith/JT2UC65B63IM54JPV63C254HLB","bundle":"https://pith.science/pith/JT2UC65B63IM54JPV63C254HLB/bundle.json","state":"https://pith.science/pith/JT2UC65B63IM54JPV63C254HLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JT2UC65B63IM54JPV63C254HLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JT2UC65B63IM54JPV63C254HLB","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":"e66bec8aa8965c2d810712d39b48563248440851e8391db2dc7d3808eae601d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T17:00:15Z","title_canon_sha256":"584db867842ca6596a5f45d02fcb7970fdb082ec350242c64a5f79ecb5f8abe7"},"schema_version":"1.0","source":{"id":"1811.06916","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06916","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06916v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06916","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"JT2UC65B63IM","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JT2UC65B63IM54JP","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JT2UC65B","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:b2e3aed162f4766aee885fa91b43277b42fab89d30190bc9056afc8d93579a9e","target":"graph","created_at":"2026-05-18T00:00:33Z","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":"The extremal number $\\mathrm{ex}(n,F)$ of a graph $F$ is the maximum number of edges in an $n$-vertex graph not containing $F$ as a subgraph. A real number $r \\in [1,2]$ is realisable if there exists a graph $F$ with $\\mathrm{ex}(n , F) = \\Theta(n^r)$. Several decades ago, Erd\\H{o}s and Simonovits conjectured that every rational number in $[1,2]$ is realisable. Despite decades of effort, the only known realisable numbers are $0,1, \\frac{7}{5}, 2$, and the numbers of the form $1+\\frac{1}{m}$, $2-\\frac{1}{m}$, $2-\\frac{2}{m}$ for integers $m \\geq 1$. In particular, it is not even known whether t","authors_text":"Dong Yeap Kang, Hong Liu, Jaehoon Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T17:00:15Z","title":"On the rational Tur\\'an exponents conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06916","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:ab023c80e660bdae3382541327cfd27e3d1576be1143b3aefdbd937b456014ac","target":"record","created_at":"2026-05-18T00:00:33Z","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":"e66bec8aa8965c2d810712d39b48563248440851e8391db2dc7d3808eae601d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T17:00:15Z","title_canon_sha256":"584db867842ca6596a5f45d02fcb7970fdb082ec350242c64a5f79ecb5f8abe7"},"schema_version":"1.0","source":{"id":"1811.06916","kind":"arxiv","version":1}},"canonical_sha256":"4cf5417ba1f6d0cef12fafb62d7787585fa17115ae9b303b4c1f26efd5fd4a16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cf5417ba1f6d0cef12fafb62d7787585fa17115ae9b303b4c1f26efd5fd4a16","first_computed_at":"2026-05-18T00:00:33.473997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.473997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qY8xN1ys293JfvKWYReafmYop/6KnlJMfwO6Slmi5z6+MiloDF6UhCPhT6QnaPCt2Psz5xiI/rx0+nEPKo6RAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.474560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06916","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab023c80e660bdae3382541327cfd27e3d1576be1143b3aefdbd937b456014ac","sha256:b2e3aed162f4766aee885fa91b43277b42fab89d30190bc9056afc8d93579a9e"],"state_sha256":"c1d55f1ab50d8117efe1b6f3d0c63b340a739b32eecf902af0fbea0e5932e081"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GygyWZsR1ULwkGB/GhwZCCr81+KCZHAIiNCZCl61rp8X/EYeABZWFIDQWVI7upB5tyKsEv9IQRApK0Uz8/8YCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:30:39.154569Z","bundle_sha256":"da39c2133edc3b14edbb7079e89e369215dac05d4eb5a2547ddd2b039e5b2957"}}