{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JKYLTSWVVBEHZZSONFKFOAHLWG","short_pith_number":"pith:JKYLTSWV","schema_version":"1.0","canonical_sha256":"4ab0b9cad5a8487ce64e69545700ebb1b619dd69dcfc012a04b272da1c98daba","source":{"kind":"arxiv","id":"2408.09643","version":1},"attestation_state":"computed","paper":{"title":"Palettes determine uniform Tur\\'an density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison","submitted_at":"2024-08-19T02:06:19Z","abstract_excerpt":"Tur\\'an problems, which concern the minimum density threshold required for the existence of a particular substructure, are among the most fundamental problems in extremal combinatorics. We study Tur\\'an problems for hypergraphs with an additional uniformity condition on the edge distribution. This kind of Tur\\'an problems was introduced by Erd\\H{o}s and S\\'os in the 1980s but it took more than 30 years until the first non-trivial exact results were obtained when Glebov, Kr\\'al' and Volec [Israel J. Math. 211 (2016), 349--366] and Reiher, R\\\"odl and Schacht [J. Eur. Math. Soc. 20 (2018), 1139--"},"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":"2408.09643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-19T02:06:19Z","cross_cats_sorted":[],"title_canon_sha256":"46878d6c501cbb121b097d965a1c9250c08fe025af78f0349c2688e802e60b99","abstract_canon_sha256":"7674422266cb896164d3b51a39626d9f0c4fbaf2bfba1ebec5cdd604455ab51f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:34.978199Z","signature_b64":"+s/yis5fHg9QmZc7RJN3ebXIw/X0RR7+mWEWyEJ2EWGezbmdvE5tjy+xXh9EELHFdEj4sW6H9b/gh+Bd3l/cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ab0b9cad5a8487ce64e69545700ebb1b619dd69dcfc012a04b272da1c98daba","last_reissued_at":"2026-07-05T08:56:34.977784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:34.977784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Palettes determine uniform Tur\\'an density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison","submitted_at":"2024-08-19T02:06:19Z","abstract_excerpt":"Tur\\'an problems, which concern the minimum density threshold required for the existence of a particular substructure, are among the most fundamental problems in extremal combinatorics. We study Tur\\'an problems for hypergraphs with an additional uniformity condition on the edge distribution. This kind of Tur\\'an problems was introduced by Erd\\H{o}s and S\\'os in the 1980s but it took more than 30 years until the first non-trivial exact results were obtained when Glebov, Kr\\'al' and Volec [Israel J. Math. 211 (2016), 349--366] and Reiher, R\\\"odl and Schacht [J. Eur. Math. Soc. 20 (2018), 1139--"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09643","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/2408.09643/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":"2408.09643","created_at":"2026-07-05T08:56:34.977847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.09643v1","created_at":"2026-07-05T08:56:34.977847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09643","created_at":"2026-07-05T08:56:34.977847+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKYLTSWVVBEH","created_at":"2026-07-05T08:56:34.977847+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKYLTSWVVBEHZZSO","created_at":"2026-07-05T08:56:34.977847+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKYLTSWV","created_at":"2026-07-05T08:56:34.977847+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03520","citing_title":"Finite palette endpoints and degree-square Tur\\'an problems","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25914","citing_title":"Intervals of hypergraph Tur\\'an densities","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21877","citing_title":"A single $3$-graph with infinite stability number","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12576","citing_title":"Tur\\'an density of stars in uniformly dense hypergraphs","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15105","citing_title":"Uniform Tur\\'an densities of $k$-uniform hypergraphs","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG","json":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG.json","graph_json":"https://pith.science/api/pith-number/JKYLTSWVVBEHZZSONFKFOAHLWG/graph.json","events_json":"https://pith.science/api/pith-number/JKYLTSWVVBEHZZSONFKFOAHLWG/events.json","paper":"https://pith.science/paper/JKYLTSWV"},"agent_actions":{"view_html":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG","download_json":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG.json","view_paper":"https://pith.science/paper/JKYLTSWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.09643&json=true","fetch_graph":"https://pith.science/api/pith-number/JKYLTSWVVBEHZZSONFKFOAHLWG/graph.json","fetch_events":"https://pith.science/api/pith-number/JKYLTSWVVBEHZZSONFKFOAHLWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG/action/storage_attestation","attest_author":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG/action/author_attestation","sign_citation":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG/action/citation_signature","submit_replication":"https://pith.science/pith/JKYLTSWVVBEHZZSONFKFOAHLWG/action/replication_record"}},"created_at":"2026-07-05T08:56:34.977847+00:00","updated_at":"2026-07-05T08:56:34.977847+00:00"}