{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6LQX2IORPLTK33ODC7NCFLJYUY","short_pith_number":"pith:6LQX2IOR","canonical_record":{"source":{"id":"2504.21220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T23:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"06c60d5af87e4a68791876fff5d412dd6fbf926f8ca5eb07164522741bb73789","abstract_canon_sha256":"8f055582ca15e48f9b6cc6001bfca53ae0f0de66b0984db8d6fdd70d30d9e056"},"schema_version":"1.0"},"canonical_sha256":"f2e17d21d17ae6adedc317da22ad38a60353ec1db4e052c948e9882f0c2d1716","source":{"kind":"arxiv","id":"2504.21220","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21220","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21220v2","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21220","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"6LQX2IORPLTK","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"pith_short_16","alias_value":"6LQX2IORPLTK33OD","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"pith_short_8","alias_value":"6LQX2IOR","created_at":"2026-07-05T11:01:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6LQX2IORPLTK33ODC7NCFLJYUY","target":"record","payload":{"canonical_record":{"source":{"id":"2504.21220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T23:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"06c60d5af87e4a68791876fff5d412dd6fbf926f8ca5eb07164522741bb73789","abstract_canon_sha256":"8f055582ca15e48f9b6cc6001bfca53ae0f0de66b0984db8d6fdd70d30d9e056"},"schema_version":"1.0"},"canonical_sha256":"f2e17d21d17ae6adedc317da22ad38a60353ec1db4e052c948e9882f0c2d1716","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:04.575935Z","signature_b64":"aledgd5r/zZG7TUWcNS/iN3uGFl33OCm+Uw/77FZ0aZHisS68FPRVgmGJfXB9aWpLtmR5r/9YkQ0hP9DQWOVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2e17d21d17ae6adedc317da22ad38a60353ec1db4e052c948e9882f0c2d1716","last_reissued_at":"2026-07-05T11:01:04.575397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:04.575397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.21220","source_version":2,"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-07-05T11:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZ1F3mGMJusuTlp6zP/U+JAFAE5HJDHyN1Vd7jhAUVmcGt6cKA0Ze+eYTb/Mx7dFd5IvcN4RPkDUQ641r7esAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:14:23.141914Z"},"content_sha256":"f9f33e9d967dfc5256efc4e700e932af85ca84fd440a92a8c93da826dfbe82fb","schema_version":"1.0","event_id":"sha256:f9f33e9d967dfc5256efc4e700e932af85ca84fd440a92a8c93da826dfbe82fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6LQX2IORPLTK33ODC7NCFLJYUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On possible 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, Sim\\'on Piga","submitted_at":"2025-04-29T23:13:17Z","abstract_excerpt":"Given a family of $3$-graphs $\\mathcal{F}$, the uniform Tur\\'{a}n density $\\pi_{\\therefore}(\\mathcal{F})$ is defined as the infimum $d\\in[0,1]$ for which any sufficiently large uniformly $d$-dense $3$-graph - that is, a $3$-graph which has edge-density at least $d$ on all linearly sized subsets - contains a copy of some $F \\in \\mathcal{F}$. Let $\\Pi_{\\therefore,\\text{fin}}$ denote the set of all possible uniform Tur\\'{a}n densities of finite families. Erd\\H{o}s, Hajnal, and R\\\"{o}dl introduced a family of constructions for lower bounds on uniform Tur\\'an densities called palette constructions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21220","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.21220/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"},"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-07-05T11:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A870XoH11PABllspeTqAWlkM1wvQWnN8m6afDyPUFhsNbO/bGsJEWV7s9rpTS811c6oWFpXTVGOrxOSYO79DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:14:23.142528Z"},"content_sha256":"35d1144774835027bdcdae15872be47267d0b36f742c722f6ec0f01e9372f7b8","schema_version":"1.0","event_id":"sha256:35d1144774835027bdcdae15872be47267d0b36f742c722f6ec0f01e9372f7b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LQX2IORPLTK33ODC7NCFLJYUY/bundle.json","state_url":"https://pith.science/pith/6LQX2IORPLTK33ODC7NCFLJYUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LQX2IORPLTK33ODC7NCFLJYUY/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-07-07T05:14:23Z","links":{"resolver":"https://pith.science/pith/6LQX2IORPLTK33ODC7NCFLJYUY","bundle":"https://pith.science/pith/6LQX2IORPLTK33ODC7NCFLJYUY/bundle.json","state":"https://pith.science/pith/6LQX2IORPLTK33ODC7NCFLJYUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LQX2IORPLTK33ODC7NCFLJYUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6LQX2IORPLTK33ODC7NCFLJYUY","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":"8f055582ca15e48f9b6cc6001bfca53ae0f0de66b0984db8d6fdd70d30d9e056","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T23:13:17Z","title_canon_sha256":"06c60d5af87e4a68791876fff5d412dd6fbf926f8ca5eb07164522741bb73789"},"schema_version":"1.0","source":{"id":"2504.21220","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21220","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21220v2","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21220","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"6LQX2IORPLTK","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"pith_short_16","alias_value":"6LQX2IORPLTK33OD","created_at":"2026-07-05T11:01:04Z"},{"alias_kind":"pith_short_8","alias_value":"6LQX2IOR","created_at":"2026-07-05T11:01:04Z"}],"graph_snapshots":[{"event_id":"sha256:35d1144774835027bdcdae15872be47267d0b36f742c722f6ec0f01e9372f7b8","target":"graph","created_at":"2026-07-05T11:01:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.21220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a family of $3$-graphs $\\mathcal{F}$, the uniform Tur\\'{a}n density $\\pi_{\\therefore}(\\mathcal{F})$ is defined as the infimum $d\\in[0,1]$ for which any sufficiently large uniformly $d$-dense $3$-graph - that is, a $3$-graph which has edge-density at least $d$ on all linearly sized subsets - contains a copy of some $F \\in \\mathcal{F}$. Let $\\Pi_{\\therefore,\\text{fin}}$ denote the set of all possible uniform Tur\\'{a}n densities of finite families. Erd\\H{o}s, Hajnal, and R\\\"{o}dl introduced a family of constructions for lower bounds on uniform Tur\\'an densities called palette constructions.","authors_text":"Bjarne Sch\\\"ulke, Dylan King, Marcelo Sales, Sim\\'on Piga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T23:13:17Z","title":"On possible uniform Tur\\'an densities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21220","kind":"arxiv","version":2},"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:f9f33e9d967dfc5256efc4e700e932af85ca84fd440a92a8c93da826dfbe82fb","target":"record","created_at":"2026-07-05T11:01:04Z","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":"8f055582ca15e48f9b6cc6001bfca53ae0f0de66b0984db8d6fdd70d30d9e056","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T23:13:17Z","title_canon_sha256":"06c60d5af87e4a68791876fff5d412dd6fbf926f8ca5eb07164522741bb73789"},"schema_version":"1.0","source":{"id":"2504.21220","kind":"arxiv","version":2}},"canonical_sha256":"f2e17d21d17ae6adedc317da22ad38a60353ec1db4e052c948e9882f0c2d1716","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2e17d21d17ae6adedc317da22ad38a60353ec1db4e052c948e9882f0c2d1716","first_computed_at":"2026-07-05T11:01:04.575397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:01:04.575397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aledgd5r/zZG7TUWcNS/iN3uGFl33OCm+Uw/77FZ0aZHisS68FPRVgmGJfXB9aWpLtmR5r/9YkQ0hP9DQWOVBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:01:04.575935Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.21220","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9f33e9d967dfc5256efc4e700e932af85ca84fd440a92a8c93da826dfbe82fb","sha256:35d1144774835027bdcdae15872be47267d0b36f742c722f6ec0f01e9372f7b8"],"state_sha256":"44a59ebb217be999ef661903cf4a5768924f42e74d49c9675e03b39f42076c64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VeTp1hJn9bdTuJdf3wbZL/niK9P1dyurTSsBJZVXFd4DD7z70Yb1Cuvd16BzTNt4d1uUpAUzEzedgixOer+GDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:14:23.145955Z","bundle_sha256":"a7adf711077c82851a10806d0ee0e58cb5df01f4aa26b57bd910f9293ca37542"}}