{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6WH6Z3FRY7PUB7BP2VKTXXB7ID","short_pith_number":"pith:6WH6Z3FR","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"},"canonical_sha256":"f58fececb1c7df40fc2fd5553bdc3f40d54b6f3213c57f17d1e66bbf96f13ad2","source":{"kind":"arxiv","id":"2606.20367","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6WH6Z3FRY7PUB7BP2VKTXXB7ID","target":"record","payload":{"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"},"canonical_sha256":"f58fececb1c7df40fc2fd5553bdc3f40d54b6f3213c57f17d1e66bbf96f13ad2","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"},"source_kind":"arxiv","source_id":"2606.20367","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-06-19T16:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUpDfTnbwV86K8/xYG7gRXs56G1sR6R3FGFQTy76JB8zp45bzceWl2ZyEnKD4BWWO1v1zxEQWcXODv4LEO3JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:40:29.748247Z"},"content_sha256":"bae8ade48db20817f8762b44631b1bf9ef32ec5fd3745393e53aa67386630a96","schema_version":"1.0","event_id":"sha256:bae8ade48db20817f8762b44631b1bf9ef32ec5fd3745393e53aa67386630a96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6WH6Z3FRY7PUB7BP2VKTXXB7ID","target":"graph","payload":{"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"},"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-06-19T16:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhePurTg62vVkwJwpEbPJlm9/8RYwCiVwLtan6giZBpPoJX1whofUu6uTaELIaMdB8ZHP4ykDL11jLtanokYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:40:29.748639Z"},"content_sha256":"f63fc0bd506f93e79be8856f3ce576dd04ee87119488f3276c5c5f1701581f2d","schema_version":"1.0","event_id":"sha256:f63fc0bd506f93e79be8856f3ce576dd04ee87119488f3276c5c5f1701581f2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/bundle.json","state_url":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/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-02T07:40:29Z","links":{"resolver":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID","bundle":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/bundle.json","state":"https://pith.science/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WH6Z3FRY7PUB7BP2VKTXXB7ID/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tERTFKyXofYUYaekcfRHu2SOsBKcEUIuQ/THr4fOWkUNEggn3F254/ij8mTv/+t76V7cnLGcTIcTbOhSV2+IAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T07:40:29.750770Z","bundle_sha256":"933ccf8066ea67191bc8da0cab60ed555082065416d230489798dc0d3942f72b"}}