{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6WH6Z3FRY7PUB7BP2VKTXXB7ID","short_pith_number":"pith:6WH6Z3FR","schema_version":"1.0","canonical_sha256":"f58fececb1c7df40fc2fd5553bdc3f40d54b6f3213c57f17d1e66bbf96f13ad2","source":{"kind":"arxiv","id":"2606.20367","version":1},"attestation_state":"computed","paper":{"title":"On the maximum density of $r$-graphs in which every $(r+1)$-set spans $0$ or $2$ edges","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Haoran Luo, Vishesh Jain","submitted_at":"2026-06-18T15:30:49Z","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\\}$."},"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":"2606.20367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T15:30:49Z","cross_cats_sorted":[],"title_canon_sha256":"71484471253a24c0f506939a77146668f2017fc311586b5a0f26414889ed7e04","abstract_canon_sha256":"0798b02083bf6394a68accb0f9c71db9f377375b7f36b2f6a4ae01e364dfef44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:10.178476Z","signature_b64":"sVBUhJnmO/1bBxQNliLOeVxBmoRK0ZWgkwn9VEchstAYEkOaqLhyE19+hftTywFB6Zko6eH36yCwDoLzXsSnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f58fececb1c7df40fc2fd5553bdc3f40d54b6f3213c57f17d1e66bbf96f13ad2","last_reissued_at":"2026-06-19T16:13:10.178087Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:10.178087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum density of $r$-graphs in which every $(r+1)$-set spans $0$ or $2$ edges","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Haoran Luo, Vishesh Jain","submitted_at":"2026-06-18T15:30:49Z","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\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20367","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/2606.20367/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":"2606.20367","created_at":"2026-06-19T16:13:10.178147+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20367v1","created_at":"2026-06-19T16:13:10.178147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20367","created_at":"2026-06-19T16:13:10.178147+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WH6Z3FRY7PU","created_at":"2026-06-19T16:13:10.178147+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WH6Z3FRY7PUB7BP","created_at":"2026-06-19T16:13:10.178147+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WH6Z3FR","created_at":"2026-06-19T16:13:10.178147+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/6WH6Z3FRY7PUB7BP2VKTXXB7ID","json":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID.json","graph_json":"https://pith.science/api/pith-number/6WH6Z3FRY7PUB7BP2VKTXXB7ID/graph.json","events_json":"https://pith.science/api/pith-number/6WH6Z3FRY7PUB7BP2VKTXXB7ID/events.json","paper":"https://pith.science/paper/6WH6Z3FR"},"agent_actions":{"view_html":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID","download_json":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID.json","view_paper":"https://pith.science/paper/6WH6Z3FR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20367&json=true","fetch_graph":"https://pith.science/api/pith-number/6WH6Z3FRY7PUB7BP2VKTXXB7ID/graph.json","fetch_events":"https://pith.science/api/pith-number/6WH6Z3FRY7PUB7BP2VKTXXB7ID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/action/storage_attestation","attest_author":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/action/author_attestation","sign_citation":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/action/citation_signature","submit_replication":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/action/replication_record"}},"created_at":"2026-06-19T16:13:10.178147+00:00","updated_at":"2026-06-19T16:13:10.178147+00:00"}