{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZRXDWXBA5OQVJOYTCZ7BNM7TF5","short_pith_number":"pith:ZRXDWXBA","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"},"canonical_sha256":"cc6e3b5c20eba154bb13167e16b3f32f6ed65263acf82b7eeba8c6e279719539","source":{"kind":"arxiv","id":"2508.20696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20696","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20696v1","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20696","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZRXDWXBA5OQV","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZRXDWXBA5OQVJOYT","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZRXDWXBA","created_at":"2026-07-05T12:00:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZRXDWXBA5OQVJOYTCZ7BNM7TF5","target":"record","payload":{"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"},"canonical_sha256":"cc6e3b5c20eba154bb13167e16b3f32f6ed65263acf82b7eeba8c6e279719539","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"},"source_kind":"arxiv","source_id":"2508.20696","source_version":1,"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-05T12:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsmtUFNXkwJwOsdHn04uPDwYD7pRTuuC3l9T62ED0YfcW/lAnqbUzUDG4RA+xUb3rN7RSKgynTP2ZHeUs4yGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:22:50.681996Z"},"content_sha256":"9ebf202d61a90d9a10b95c7d4b91c041002d1f22b2f6fd0cfada5df1f37169d2","schema_version":"1.0","event_id":"sha256:9ebf202d61a90d9a10b95c7d4b91c041002d1f22b2f6fd0cfada5df1f37169d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZRXDWXBA5OQVJOYTCZ7BNM7TF5","target":"graph","payload":{"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"},"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-05T12:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvUuP1DmW4CMg5FyFwzU7crWpIfEROzX0iPHPVA7W9+RSn/FWkeT44+kHhoD9w1l1C3S2Kde2xBVAXhkZ8dMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:22:50.682493Z"},"content_sha256":"e2395c1cce13a7683bcef0acbd0231f3c638909260103e73c8fe9835088a7bd2","schema_version":"1.0","event_id":"sha256:e2395c1cce13a7683bcef0acbd0231f3c638909260103e73c8fe9835088a7bd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/bundle.json","state_url":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/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-08-18T20:22:50Z","links":{"resolver":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5","bundle":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/bundle.json","state":"https://pith.science/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRXDWXBA5OQVJOYTCZ7BNM7TF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZRXDWXBA5OQVJOYTCZ7BNM7TF5","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":"07cd5c9e096f27971ea83b003794c12a6003a5318a4632430bcb2cea80d7f4a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-28T11:58:58Z","title_canon_sha256":"eec8b6995ebbe6d299dfdd9b3ed2419d90e8348499f0ee58188ee4c6a399a69e"},"schema_version":"1.0","source":{"id":"2508.20696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20696","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20696v1","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20696","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZRXDWXBA5OQV","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZRXDWXBA5OQVJOYT","created_at":"2026-07-05T12:00:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZRXDWXBA","created_at":"2026-07-05T12:00:58Z"}],"graph_snapshots":[{"event_id":"sha256:e2395c1cce13a7683bcef0acbd0231f3c638909260103e73c8fe9835088a7bd2","target":"graph","created_at":"2026-07-05T12:00:58Z","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/2508.20696/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ander Lamaison","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-28T11:58:58Z","title":"Uniform Tur\\'an density beyond 3-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20696","kind":"arxiv","version":1},"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:9ebf202d61a90d9a10b95c7d4b91c041002d1f22b2f6fd0cfada5df1f37169d2","target":"record","created_at":"2026-07-05T12:00:58Z","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":"07cd5c9e096f27971ea83b003794c12a6003a5318a4632430bcb2cea80d7f4a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-28T11:58:58Z","title_canon_sha256":"eec8b6995ebbe6d299dfdd9b3ed2419d90e8348499f0ee58188ee4c6a399a69e"},"schema_version":"1.0","source":{"id":"2508.20696","kind":"arxiv","version":1}},"canonical_sha256":"cc6e3b5c20eba154bb13167e16b3f32f6ed65263acf82b7eeba8c6e279719539","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc6e3b5c20eba154bb13167e16b3f32f6ed65263acf82b7eeba8c6e279719539","first_computed_at":"2026-07-05T12:00:58.147188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:00:58.147188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ZMfQlE+UQFkcQ2BxOjgnxOwj+ifSUNZBVEV1NvkUcMDr7PmgyNODz1QERZxkkeaXLeZAPlgCKtarnZuw5HAAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:00:58.147681Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ebf202d61a90d9a10b95c7d4b91c041002d1f22b2f6fd0cfada5df1f37169d2","sha256:e2395c1cce13a7683bcef0acbd0231f3c638909260103e73c8fe9835088a7bd2"],"state_sha256":"178d4a0b3bd3b111947474650afcff5b87e4f2fa9dcb02463bb81f78c5a0a27c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8PhtM1sDWcTkkuxCZSNg4r4G/ZC/SM7Q73t2azBRRVdNUz0QgKh5Am0Ww3yiWG+vX6EAnAAzdfdxf0rRv97Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T20:22:50.687919Z","bundle_sha256":"d543a17f03a20b15609d3887ff47de2d7a7bc2e876d61fdd02ea6e9e72db26bc"}}