{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q7EPKYS7VZU6GZXZQFQHIM2AFQ","short_pith_number":"pith:Q7EPKYS7","schema_version":"1.0","canonical_sha256":"87c8f5625fae69e366f981607433402c237f0f860fa380d59740f478c5058e72","source":{"kind":"arxiv","id":"1312.3396","version":2},"attestation_state":"computed","paper":{"title":"Non-jumping Numbers for 5-Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kang Yang, Ran Gu, Xueliang Li, Yongtang Shi, Zhongmei Qin","submitted_at":"2013-12-12T03:35:32Z","abstract_excerpt":"Let $\\ell$ and $r$ be integers. A real number $\\alpha \\in [0,1)$ is a jump for $r$ if for any $\\varepsilon > 0$ and any integer $m,\\ m \\geq r$, any $r$-uniform graph with $n > n_0(\\varepsilon,m)$ vertices and at least \\alpha+ \\varepsilon)\\binom{n}{r}$ edges contains a subgraph with $m$ vertices and at least $(\\alpha +c)\\binom{m}{r}$ edges, where $c=c(\\alpha)$ does not depend on $\\varepsilon$ and $m$. It follows from a theorem of Erd\\H{o}s, Stone and Simonovits that every $\\alpha \\in [0,1)$ is a jump for $r=2$. Erd\\H{o}s asked whether the same is true for $r \\geq 3$. However, Frankl and R\\\"{o}d"},"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":"1312.3396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-12T03:35:32Z","cross_cats_sorted":[],"title_canon_sha256":"40080d86b0d74558ac593f5def7693bc1516ae7bfad235adbf4d0ab8b68c7e76","abstract_canon_sha256":"e8eafd271af314483f6f94cd42cf7ee7e70eeac629a2813439c41fce63a5ec4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:49.489709Z","signature_b64":"PeYsnJ/doqPIUuC14yi9OO+ScETVQaJzOQqvQU0mNgDOBH3ESn4WnD/iPm4iyq1iE8rbjxws0diGAQuIrUb4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87c8f5625fae69e366f981607433402c237f0f860fa380d59740f478c5058e72","last_reissued_at":"2026-05-18T00:29:49.488882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:49.488882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-jumping Numbers for 5-Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kang Yang, Ran Gu, Xueliang Li, Yongtang Shi, Zhongmei Qin","submitted_at":"2013-12-12T03:35:32Z","abstract_excerpt":"Let $\\ell$ and $r$ be integers. A real number $\\alpha \\in [0,1)$ is a jump for $r$ if for any $\\varepsilon > 0$ and any integer $m,\\ m \\geq r$, any $r$-uniform graph with $n > n_0(\\varepsilon,m)$ vertices and at least \\alpha+ \\varepsilon)\\binom{n}{r}$ edges contains a subgraph with $m$ vertices and at least $(\\alpha +c)\\binom{m}{r}$ edges, where $c=c(\\alpha)$ does not depend on $\\varepsilon$ and $m$. It follows from a theorem of Erd\\H{o}s, Stone and Simonovits that every $\\alpha \\in [0,1)$ is a jump for $r=2$. Erd\\H{o}s asked whether the same is true for $r \\geq 3$. However, Frankl and R\\\"{o}d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3396","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.3396","created_at":"2026-05-18T00:29:49.489007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3396v2","created_at":"2026-05-18T00:29:49.489007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3396","created_at":"2026-05-18T00:29:49.489007+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7EPKYS7VZU6","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7EPKYS7VZU6GZXZ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7EPKYS7","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ","json":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ.json","graph_json":"https://pith.science/api/pith-number/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/graph.json","events_json":"https://pith.science/api/pith-number/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/events.json","paper":"https://pith.science/paper/Q7EPKYS7"},"agent_actions":{"view_html":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ","download_json":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ.json","view_paper":"https://pith.science/paper/Q7EPKYS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3396&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/action/storage_attestation","attest_author":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/action/author_attestation","sign_citation":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/action/citation_signature","submit_replication":"https://pith.science/pith/Q7EPKYS7VZU6GZXZQFQHIM2AFQ/action/replication_record"}},"created_at":"2026-05-18T00:29:49.489007+00:00","updated_at":"2026-05-18T00:29:49.489007+00:00"}