{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FSXZNSC73ZZHK5WQOCU2NJSNOB","short_pith_number":"pith:FSXZNSC7","canonical_record":{"source":{"id":"1804.01026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-03T15:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"5d7d8314da8c662389e3f54e95d88a3470ff8d438b4b0ccd92074b4fcddb9d81","abstract_canon_sha256":"46d6aa7cb72b56eb086c31e90b8d5feb795260da8427261f36e8280ed0426d49"},"schema_version":"1.0"},"canonical_sha256":"2caf96c85fde727576d070a9a6a64d7046ad964149866646aff9636db996eb0c","source":{"kind":"arxiv","id":"1804.01026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01026","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01026v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01026","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"FSXZNSC73ZZH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FSXZNSC73ZZHK5WQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FSXZNSC7","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FSXZNSC73ZZHK5WQOCU2NJSNOB","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-03T15:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"5d7d8314da8c662389e3f54e95d88a3470ff8d438b4b0ccd92074b4fcddb9d81","abstract_canon_sha256":"46d6aa7cb72b56eb086c31e90b8d5feb795260da8427261f36e8280ed0426d49"},"schema_version":"1.0"},"canonical_sha256":"2caf96c85fde727576d070a9a6a64d7046ad964149866646aff9636db996eb0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:31.516651Z","signature_b64":"Bx62iWJkkOq2qp/oYfV7NHKlrRGr9hrdrkesvn43RyRvB0YN5/7MoKFm1fRluphm2BvFbrKX7fmmLw9zHkvsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2caf96c85fde727576d070a9a6a64d7046ad964149866646aff9636db996eb0c","last_reissued_at":"2026-05-18T00:19:31.516182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:31.516182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01026","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-05-18T00:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6GdctYQBx8/pRG0y5Ok10TBAI5ZGyCtVJ4ULNcO+C4wEBKlHjH4O8kFnM6BfrVQRPsu/4aAWrQx9gy8o/0RBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:46:14.502219Z"},"content_sha256":"56f13db10d6dbae41eaba34f893cfe45524a9bf44ccd278af50646b8e3a2db66","schema_version":"1.0","event_id":"sha256:56f13db10d6dbae41eaba34f893cfe45524a9bf44ccd278af50646b8e3a2db66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FSXZNSC73ZZHK5WQOCU2NJSNOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On set systems without a simplex-cluster and the Junta method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noam Lifshitz","submitted_at":"2018-04-03T15:10:56Z","abstract_excerpt":"A family $\\{A_{0},\\ldots,A_{d}\\}$ of $k$-element subsets of $[n]=\\{1,2,\\ldots,n\\}$ is called a simplex-cluster if $A_{0}\\cap\\cdots\\cap A_{d}=\\varnothing$, $|A_{0}\\cup\\cdots\\cup A_{d}|\\le2k$, and the intersection of any $d$ of the sets in $\\{A_{0},\\ldots,A_{d}\\}$ is nonempty. In 2006, Keevash and Mubayi conjectured that for any $d+1\\le k\\le\\frac{d}{d+1}n$, the largest family of $k$-element subsets of $[n]$ that does not contain a simplex-cluster is the family of all $k$-subsets that contain a given element. We prove the conjecture for all $k\\ge\\zeta n$ for an arbitrarily small $\\zeta>0$, provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01026","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":""},"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-05-18T00:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7h6ip7NqQ0L9Bl+9QADRHdbd1RY37m1Rcm0H74DyN6lNpDWm6hZF/bEC3KMENEqrlkWa0LQ9GAVRYxeJ6mFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:46:14.502577Z"},"content_sha256":"c82d10788636fb0bc2973ac94371ce5719b2a2071edc1c5307fc86142f44a355","schema_version":"1.0","event_id":"sha256:c82d10788636fb0bc2973ac94371ce5719b2a2071edc1c5307fc86142f44a355"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/bundle.json","state_url":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/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-06-25T18:46:14Z","links":{"resolver":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB","bundle":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/bundle.json","state":"https://pith.science/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSXZNSC73ZZHK5WQOCU2NJSNOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FSXZNSC73ZZHK5WQOCU2NJSNOB","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":"46d6aa7cb72b56eb086c31e90b8d5feb795260da8427261f36e8280ed0426d49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-03T15:10:56Z","title_canon_sha256":"5d7d8314da8c662389e3f54e95d88a3470ff8d438b4b0ccd92074b4fcddb9d81"},"schema_version":"1.0","source":{"id":"1804.01026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01026","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01026v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01026","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"FSXZNSC73ZZH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FSXZNSC73ZZHK5WQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FSXZNSC7","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:c82d10788636fb0bc2973ac94371ce5719b2a2071edc1c5307fc86142f44a355","target":"graph","created_at":"2026-05-18T00:19:31Z","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"},"paper":{"abstract_excerpt":"A family $\\{A_{0},\\ldots,A_{d}\\}$ of $k$-element subsets of $[n]=\\{1,2,\\ldots,n\\}$ is called a simplex-cluster if $A_{0}\\cap\\cdots\\cap A_{d}=\\varnothing$, $|A_{0}\\cup\\cdots\\cup A_{d}|\\le2k$, and the intersection of any $d$ of the sets in $\\{A_{0},\\ldots,A_{d}\\}$ is nonempty. In 2006, Keevash and Mubayi conjectured that for any $d+1\\le k\\le\\frac{d}{d+1}n$, the largest family of $k$-element subsets of $[n]$ that does not contain a simplex-cluster is the family of all $k$-subsets that contain a given element. We prove the conjecture for all $k\\ge\\zeta n$ for an arbitrarily small $\\zeta>0$, provid","authors_text":"Noam Lifshitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-03T15:10:56Z","title":"On set systems without a simplex-cluster and the Junta method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01026","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:56f13db10d6dbae41eaba34f893cfe45524a9bf44ccd278af50646b8e3a2db66","target":"record","created_at":"2026-05-18T00:19:31Z","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":"46d6aa7cb72b56eb086c31e90b8d5feb795260da8427261f36e8280ed0426d49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-03T15:10:56Z","title_canon_sha256":"5d7d8314da8c662389e3f54e95d88a3470ff8d438b4b0ccd92074b4fcddb9d81"},"schema_version":"1.0","source":{"id":"1804.01026","kind":"arxiv","version":1}},"canonical_sha256":"2caf96c85fde727576d070a9a6a64d7046ad964149866646aff9636db996eb0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2caf96c85fde727576d070a9a6a64d7046ad964149866646aff9636db996eb0c","first_computed_at":"2026-05-18T00:19:31.516182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:31.516182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bx62iWJkkOq2qp/oYfV7NHKlrRGr9hrdrkesvn43RyRvB0YN5/7MoKFm1fRluphm2BvFbrKX7fmmLw9zHkvsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:31.516651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56f13db10d6dbae41eaba34f893cfe45524a9bf44ccd278af50646b8e3a2db66","sha256:c82d10788636fb0bc2973ac94371ce5719b2a2071edc1c5307fc86142f44a355"],"state_sha256":"193a74262b985a576fff7cd85a6bc7a26a8fc68ab8de6d83ded0420b37e1b3bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Neh4aaUhVKYG5atTyU2pGH29QBsBURVkzsB7voObNsUYP7SrbxxdHW3EY7YWDjF9zAP5zAWMPqhqYH6VlCkbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:46:14.504504Z","bundle_sha256":"b184b11e96983cc7b7606c5b7d0e1e7172c2c77d1e5f2b3fa2404035d6e2b446"}}