{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VXA3FS2XDN7VPTUEUYZW3HUPKJ","short_pith_number":"pith:VXA3FS2X","canonical_record":{"source":{"id":"2110.12708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-25T07:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"3e83fd575c192fa5b7b2685814f7fb36f3ed9fd7e869c923cc05aedc266b5cd8","abstract_canon_sha256":"cc9087ac70c28f0db89b5014a48e33c7fc9c2c867e04b434418d3a3cfc2fe58c"},"schema_version":"1.0"},"canonical_sha256":"adc1b2cb571b7f57ce84a6336d9e8f525ebbe8b59a4a979a128b80b94af8d76f","source":{"kind":"arxiv","id":"2110.12708","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.12708","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"2110.12708v2","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.12708","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"VXA3FS2XDN7V","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXA3FS2XDN7VPTUE","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXA3FS2X","created_at":"2026-07-05T05:45:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VXA3FS2XDN7VPTUEUYZW3HUPKJ","target":"record","payload":{"canonical_record":{"source":{"id":"2110.12708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-25T07:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"3e83fd575c192fa5b7b2685814f7fb36f3ed9fd7e869c923cc05aedc266b5cd8","abstract_canon_sha256":"cc9087ac70c28f0db89b5014a48e33c7fc9c2c867e04b434418d3a3cfc2fe58c"},"schema_version":"1.0"},"canonical_sha256":"adc1b2cb571b7f57ce84a6336d9e8f525ebbe8b59a4a979a128b80b94af8d76f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:25.438647Z","signature_b64":"XevvzUPNhD2vfGZyezM6F6UOkJGle6+bYLG8oAVtUV9BTDDgulnV+xSpiHmpt1TFiGlrDAba1rVvtcH8uxuBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc1b2cb571b7f57ce84a6336d9e8f525ebbe8b59a4a979a128b80b94af8d76f","last_reissued_at":"2026-07-05T05:45:25.438196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:25.438196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.12708","source_version":2,"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-05T05:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRxY/5vzdoEHTwDO6C6C6dnGlanrz7r3hBLFQTW5Iu+USN++P6rlPgUyMJkMnwYlr9/ZL6gXG2emiY2RrjpsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:14:21.410593Z"},"content_sha256":"e2aef3513738dd007f0f83810282a77662714cb4053aa5882cf485f85e5cfeb8","schema_version":"1.0","event_id":"sha256:e2aef3513738dd007f0f83810282a77662714cb4053aa5882cf485f85e5cfeb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VXA3FS2XDN7VPTUEUYZW3HUPKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal $3$-wise intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Lund, Casey Tompkins, Ce Chen, Haoran Luo, J\\'ozsef Balogh, Kevin Hendrey, Tuan Tran","submitted_at":"2021-10-25T07:40:16Z","abstract_excerpt":"A family $\\mathcal{F}$ on ground set $[n]:=\\{1,2,\\ldots, n\\}$ is maximal $k$-wise intersecting if every collection of at most $k$ sets in $\\mathcal{F}$ has non-empty intersection, and no other set can be added to $\\mathcal{F}$ while maintaining this property. In 1974, Erd\\H{o}s and Kleitman asked for the minimum size of a maximal $k$-wise intersecting family. We answer their question for $k=3$ and sufficiently large $n$. We show that the unique minimum family is obtained by partitioning the ground set $[n]$ into two sets $A$ and $B$ with almost equal sizes and taking the family consisting of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.12708","kind":"arxiv","version":2},"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/2110.12708/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-05T05:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7tE1upEXNfzK0e2ZPHYF5p6MIJreSIYdjxHDbADFVUZLDhcih/QydmgmdDnJDGfXgSyRZCpRqhgAWZ/7fgIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:14:21.411085Z"},"content_sha256":"f37f3e1de58bd3054aa138da7b5b792da2d7519eb0f318e73e419057f693a2fc","schema_version":"1.0","event_id":"sha256:f37f3e1de58bd3054aa138da7b5b792da2d7519eb0f318e73e419057f693a2fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/bundle.json","state_url":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/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-03T22:14:21Z","links":{"resolver":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ","bundle":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/bundle.json","state":"https://pith.science/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXA3FS2XDN7VPTUEUYZW3HUPKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VXA3FS2XDN7VPTUEUYZW3HUPKJ","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":"cc9087ac70c28f0db89b5014a48e33c7fc9c2c867e04b434418d3a3cfc2fe58c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-25T07:40:16Z","title_canon_sha256":"3e83fd575c192fa5b7b2685814f7fb36f3ed9fd7e869c923cc05aedc266b5cd8"},"schema_version":"1.0","source":{"id":"2110.12708","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.12708","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"2110.12708v2","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.12708","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"VXA3FS2XDN7V","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXA3FS2XDN7VPTUE","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXA3FS2X","created_at":"2026-07-05T05:45:25Z"}],"graph_snapshots":[{"event_id":"sha256:f37f3e1de58bd3054aa138da7b5b792da2d7519eb0f318e73e419057f693a2fc","target":"graph","created_at":"2026-07-05T05:45:25Z","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/2110.12708/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A family $\\mathcal{F}$ on ground set $[n]:=\\{1,2,\\ldots, n\\}$ is maximal $k$-wise intersecting if every collection of at most $k$ sets in $\\mathcal{F}$ has non-empty intersection, and no other set can be added to $\\mathcal{F}$ while maintaining this property. In 1974, Erd\\H{o}s and Kleitman asked for the minimum size of a maximal $k$-wise intersecting family. We answer their question for $k=3$ and sufficiently large $n$. We show that the unique minimum family is obtained by partitioning the ground set $[n]$ into two sets $A$ and $B$ with almost equal sizes and taking the family consisting of a","authors_text":"Ben Lund, Casey Tompkins, Ce Chen, Haoran Luo, J\\'ozsef Balogh, Kevin Hendrey, Tuan Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-25T07:40:16Z","title":"Maximal $3$-wise intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.12708","kind":"arxiv","version":2},"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:e2aef3513738dd007f0f83810282a77662714cb4053aa5882cf485f85e5cfeb8","target":"record","created_at":"2026-07-05T05:45:25Z","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":"cc9087ac70c28f0db89b5014a48e33c7fc9c2c867e04b434418d3a3cfc2fe58c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-25T07:40:16Z","title_canon_sha256":"3e83fd575c192fa5b7b2685814f7fb36f3ed9fd7e869c923cc05aedc266b5cd8"},"schema_version":"1.0","source":{"id":"2110.12708","kind":"arxiv","version":2}},"canonical_sha256":"adc1b2cb571b7f57ce84a6336d9e8f525ebbe8b59a4a979a128b80b94af8d76f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adc1b2cb571b7f57ce84a6336d9e8f525ebbe8b59a4a979a128b80b94af8d76f","first_computed_at":"2026-07-05T05:45:25.438196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:25.438196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XevvzUPNhD2vfGZyezM6F6UOkJGle6+bYLG8oAVtUV9BTDDgulnV+xSpiHmpt1TFiGlrDAba1rVvtcH8uxuBBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:25.438647Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.12708","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2aef3513738dd007f0f83810282a77662714cb4053aa5882cf485f85e5cfeb8","sha256:f37f3e1de58bd3054aa138da7b5b792da2d7519eb0f318e73e419057f693a2fc"],"state_sha256":"0fa4846165cbed4cd2124ebf4dd43fc65e4493ca875ccb5fbdb2ecae41ccfdaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ylQ/Z9Ol5VnLoeoqcdGFwwP5ILoGQT6UcXZt4pTdRfvOX+Ly1wX9+oajanNEIQPaKW41t/nxWjh5sqh0FItDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:14:21.415098Z","bundle_sha256":"94d29a8ab600e3535adb18534b6ce71f86d043431a3d2e2fad2d02ce56904204"}}