{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P3F4R4TSE2AXBQGXWIH44QVQOI","short_pith_number":"pith:P3F4R4TS","schema_version":"1.0","canonical_sha256":"7ecbc8f272268170c0d7b20fce42b072348c678639e37d59f5ec407853363826","source":{"kind":"arxiv","id":"2412.07297","version":1},"attestation_state":"computed","paper":{"title":"Lagrangians are attained as uniform Tur\\'an densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bjarne Sch\\\"ulke, Dylan King, Marcelo Sales","submitted_at":"2024-12-10T08:27:49Z","abstract_excerpt":"The study of uniform Tur\\'an densities was initiated in the 1980s by Erd\\H{o}s and S\\'os. Given a $3$-graph $F$, the uniform Tur\\'an density of $F$, $\\pi_{\\therefore}(F)$, is defined as the infimum $d\\in[0,1]$ such that every $3$-graph $H$ in which every linearly sized $S\\subseteq V(H)$ induces at least $(d+o(1))\\binom{\\vert S\\vert}{3}$ edges must contain a copy of $F$. Disproving Erd\\H{o}s's famous jumping conjecture, Frankl and R\\\"odl showed that the set of Tur\\'an densities is not well-ordered. We prove an analogous result for the uniform Tur\\'an density, namely that the set $\\Pi^{(3)}_{\\th"},"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":"2412.07297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-10T08:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"3d09b9641d0da76635cf3c7b1066d065cdf75ba3a3f10d87c945ef07b7d3061c","abstract_canon_sha256":"358cef2f2a91f3cf62f57a34a2ac0fed1a59667a5789d7430132e47546c0bd26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:07.724606Z","signature_b64":"NSefFCRWWQu5kenf3gfUznhC2loKeGjpOquHK5GAvu5VsKaSMZUOha6hDzX7bQV3b0oNFtKhL/mx20IixIbjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ecbc8f272268170c0d7b20fce42b072348c678639e37d59f5ec407853363826","last_reissued_at":"2026-07-05T09:47:07.724149Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:07.724149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lagrangians are attained as uniform Tur\\'an densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bjarne Sch\\\"ulke, Dylan King, Marcelo Sales","submitted_at":"2024-12-10T08:27:49Z","abstract_excerpt":"The study of uniform Tur\\'an densities was initiated in the 1980s by Erd\\H{o}s and S\\'os. Given a $3$-graph $F$, the uniform Tur\\'an density of $F$, $\\pi_{\\therefore}(F)$, is defined as the infimum $d\\in[0,1]$ such that every $3$-graph $H$ in which every linearly sized $S\\subseteq V(H)$ induces at least $(d+o(1))\\binom{\\vert S\\vert}{3}$ edges must contain a copy of $F$. Disproving Erd\\H{o}s's famous jumping conjecture, Frankl and R\\\"odl showed that the set of Tur\\'an densities is not well-ordered. We prove an analogous result for the uniform Tur\\'an density, namely that the set $\\Pi^{(3)}_{\\th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07297","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/2412.07297/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":"2412.07297","created_at":"2026-07-05T09:47:07.724222+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07297v1","created_at":"2026-07-05T09:47:07.724222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07297","created_at":"2026-07-05T09:47:07.724222+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3F4R4TSE2AX","created_at":"2026-07-05T09:47:07.724222+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3F4R4TSE2AXBQGX","created_at":"2026-07-05T09:47:07.724222+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3F4R4TS","created_at":"2026-07-05T09:47:07.724222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15105","citing_title":"Uniform Tur\\'an densities of $k$-uniform hypergraphs","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI","json":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI.json","graph_json":"https://pith.science/api/pith-number/P3F4R4TSE2AXBQGXWIH44QVQOI/graph.json","events_json":"https://pith.science/api/pith-number/P3F4R4TSE2AXBQGXWIH44QVQOI/events.json","paper":"https://pith.science/paper/P3F4R4TS"},"agent_actions":{"view_html":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI","download_json":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI.json","view_paper":"https://pith.science/paper/P3F4R4TS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07297&json=true","fetch_graph":"https://pith.science/api/pith-number/P3F4R4TSE2AXBQGXWIH44QVQOI/graph.json","fetch_events":"https://pith.science/api/pith-number/P3F4R4TSE2AXBQGXWIH44QVQOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI/action/storage_attestation","attest_author":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI/action/author_attestation","sign_citation":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI/action/citation_signature","submit_replication":"https://pith.science/pith/P3F4R4TSE2AXBQGXWIH44QVQOI/action/replication_record"}},"created_at":"2026-07-05T09:47:07.724222+00:00","updated_at":"2026-07-05T09:47:07.724222+00:00"}