{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6WH6Z3FRY7PUB7BP2VKTXXB7ID","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":"0798b02083bf6394a68accb0f9c71db9f377375b7f36b2f6a4ae01e364dfef44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T15:30:49Z","title_canon_sha256":"71484471253a24c0f506939a77146668f2017fc311586b5a0f26414889ed7e04"},"schema_version":"1.0","source":{"id":"2606.20367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20367","created_at":"2026-06-19T16:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20367v1","created_at":"2026-06-19T16:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20367","created_at":"2026-06-19T16:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"6WH6Z3FRY7PU","created_at":"2026-06-19T16:13:10Z"},{"alias_kind":"pith_short_16","alias_value":"6WH6Z3FRY7PUB7BP","created_at":"2026-06-19T16:13:10Z"},{"alias_kind":"pith_short_8","alias_value":"6WH6Z3FR","created_at":"2026-06-19T16:13:10Z"}],"graph_snapshots":[{"event_id":"sha256:f63fc0bd506f93e79be8856f3ce576dd04ee87119488f3276c5c5f1701581f2d","target":"graph","created_at":"2026-06-19T16:13:10Z","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/2606.20367/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1984, Frankl and F\\\"uredi asked for the maximum density of an $n$-vertex $r$-graph in which every $(r+1)$-set of vertices spans $0$ or $2$ edges. They gave a construction with asymptotic density $2^{1-r}$. We significantly improve this bound by constructing such $r$-graphs with density $\\Omega(r^{-3})$, thereby improving the dependence on $r$ from exponential to polynomial. We also obtain lower bounds for the more general problem in which every $(r+1)$-set spans an even number of edges from $\\{0,2,\\ldots,2k\\}$.","authors_text":"Dhruv Mubayi, Haoran Luo, Vishesh Jain","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T15:30:49Z","title":"On the maximum density of $r$-graphs in which every $(r+1)$-set spans $0$ or $2$ edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20367","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:bae8ade48db20817f8762b44631b1bf9ef32ec5fd3745393e53aa67386630a96","target":"record","created_at":"2026-06-19T16:13:10Z","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":"0798b02083bf6394a68accb0f9c71db9f377375b7f36b2f6a4ae01e364dfef44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T15:30:49Z","title_canon_sha256":"71484471253a24c0f506939a77146668f2017fc311586b5a0f26414889ed7e04"},"schema_version":"1.0","source":{"id":"2606.20367","kind":"arxiv","version":1}},"canonical_sha256":"f58fececb1c7df40fc2fd5553bdc3f40d54b6f3213c57f17d1e66bbf96f13ad2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f58fececb1c7df40fc2fd5553bdc3f40d54b6f3213c57f17d1e66bbf96f13ad2","first_computed_at":"2026-06-19T16:13:10.178087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:10.178087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sVBUhJnmO/1bBxQNliLOeVxBmoRK0ZWgkwn9VEchstAYEkOaqLhyE19+hftTywFB6Zko6eH36yCwDoLzXsSnCg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:10.178476Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bae8ade48db20817f8762b44631b1bf9ef32ec5fd3745393e53aa67386630a96","sha256:f63fc0bd506f93e79be8856f3ce576dd04ee87119488f3276c5c5f1701581f2d"],"state_sha256":"9bcb449c4b5ea712333cfd7f97b79929f6b276566a7c1bb636ef0e80e1d94443"}