{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZRXDWXBA5OQVJOYTCZ7BNM7TF5","short_pith_number":"pith:ZRXDWXBA","schema_version":"1.0","canonical_sha256":"cc6e3b5c20eba154bb13167e16b3f32f6ed65263acf82b7eeba8c6e279719539","source":{"kind":"arxiv","id":"2508.20696","version":1},"attestation_state":"computed","paper":{"title":"Uniform Tur\\'an density beyond 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison","submitted_at":"2025-08-28T11:58:58Z","abstract_excerpt":"In the 1980s, Erd\\H{o}s and S\\'os first introduced an extremal problem on hypergraphs with density constraints. Given an $r$-uniform hypergraph $F$ (or $r$-graph for short), its uniform Tur\\'an density $\\pi_u(F)$ is the smallest value of $d$ in which every hypergraph $H$ in which every linear-sized subhypergraph of $H$ has edge density at least $d$ contains $F$ as a subgraph. The first non-zero value of $\\pi_u(F)$ was not found until 30 years later.\n  Progress in studying the set of values of the uniform Tur\\'an density of $r$-graphs has been uneven in terms of $r$: to this day there are infin"},"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":"2508.20696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-28T11:58:58Z","cross_cats_sorted":[],"title_canon_sha256":"eec8b6995ebbe6d299dfdd9b3ed2419d90e8348499f0ee58188ee4c6a399a69e","abstract_canon_sha256":"07cd5c9e096f27971ea83b003794c12a6003a5318a4632430bcb2cea80d7f4a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:58.147681Z","signature_b64":"1ZMfQlE+UQFkcQ2BxOjgnxOwj+ifSUNZBVEV1NvkUcMDr7PmgyNODz1QERZxkkeaXLeZAPlgCKtarnZuw5HAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc6e3b5c20eba154bb13167e16b3f32f6ed65263acf82b7eeba8c6e279719539","last_reissued_at":"2026-07-05T12:00:58.147188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:58.147188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform Tur\\'an density beyond 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison","submitted_at":"2025-08-28T11:58:58Z","abstract_excerpt":"In the 1980s, Erd\\H{o}s and S\\'os first introduced an extremal problem on hypergraphs with density constraints. Given an $r$-uniform hypergraph $F$ (or $r$-graph for short), its uniform Tur\\'an density $\\pi_u(F)$ is the smallest value of $d$ in which every hypergraph $H$ in which every linear-sized subhypergraph of $H$ has edge density at least $d$ contains $F$ as a subgraph. The first non-zero value of $\\pi_u(F)$ was not found until 30 years later.\n  Progress in studying the set of values of the uniform Tur\\'an density of $r$-graphs has been uneven in terms of $r$: to this day there are infin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20696","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/2508.20696/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":"2508.20696","created_at":"2026-07-05T12:00:58.147245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.20696v1","created_at":"2026-07-05T12:00:58.147245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20696","created_at":"2026-07-05T12:00:58.147245+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRXDWXBA5OQV","created_at":"2026-07-05T12:00:58.147245+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRXDWXBA5OQVJOYT","created_at":"2026-07-05T12:00:58.147245+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRXDWXBA","created_at":"2026-07-05T12:00:58.147245+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/ZRXDWXBA5OQVJOYTCZ7BNM7TF5","json":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5.json","graph_json":"https://pith.science/api/pith-number/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/graph.json","events_json":"https://pith.science/api/pith-number/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/events.json","paper":"https://pith.science/paper/ZRXDWXBA"},"agent_actions":{"view_html":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5","download_json":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5.json","view_paper":"https://pith.science/paper/ZRXDWXBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.20696&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/action/storage_attestation","attest_author":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/action/author_attestation","sign_citation":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/action/citation_signature","submit_replication":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/action/replication_record"}},"created_at":"2026-07-05T12:00:58.147245+00:00","updated_at":"2026-07-05T12:00:58.147245+00:00"}