{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4RSOCGOLTMWZFFJK2AZAA7KCS2","short_pith_number":"pith:4RSOCGOL","canonical_record":{"source":{"id":"2409.12945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T17:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"5c43b82c3b21ef719ee3f73d7483c581d7f47b3bdd5584c93cdc189ed7c9124d","abstract_canon_sha256":"c0cff4ec1b83fd4c781bf6724891528dffbc8c53bde97b9fca1f7675f7ced721"},"schema_version":"1.0"},"canonical_sha256":"e464e119cb9b2d92952ad032007d4296b1f5c60f91ea9a2f830846587c19f580","source":{"kind":"arxiv","id":"2409.12945","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12945","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12945v2","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12945","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"4RSOCGOLTMWZ","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"pith_short_16","alias_value":"4RSOCGOLTMWZFFJK","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"pith_short_8","alias_value":"4RSOCGOL","created_at":"2026-07-05T09:27:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4RSOCGOLTMWZFFJK2AZAA7KCS2","target":"record","payload":{"canonical_record":{"source":{"id":"2409.12945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T17:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"5c43b82c3b21ef719ee3f73d7483c581d7f47b3bdd5584c93cdc189ed7c9124d","abstract_canon_sha256":"c0cff4ec1b83fd4c781bf6724891528dffbc8c53bde97b9fca1f7675f7ced721"},"schema_version":"1.0"},"canonical_sha256":"e464e119cb9b2d92952ad032007d4296b1f5c60f91ea9a2f830846587c19f580","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:05.058944Z","signature_b64":"LIZp14Q9JvQaV4aA3fJDWP8jTUyBVsEf0BXhDxOk+MlyTKtnw901i7BdeHLBeXKjAvtB+EtdiwpCbCubyxxwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e464e119cb9b2d92952ad032007d4296b1f5c60f91ea9a2f830846587c19f580","last_reissued_at":"2026-07-05T09:27:05.058488Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:05.058488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.12945","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-05T09:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKDTkemUgg+Wz1FFVHRoYa6YUfoYA3PJpF1e/vqwXXQ3yBZ4Z0rxrsmTAGzzdEtGp002tzqTkQIffvHOP1HaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:52:42.271007Z"},"content_sha256":"1bc2d4e6d38bd42ac909fa0ad679c949fb92096b7ef5ab7f4c66d755824ebdfd","schema_version":"1.0","event_id":"sha256:1bc2d4e6d38bd42ac909fa0ad679c949fb92096b7ef5ab7f4c66d755824ebdfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4RSOCGOLTMWZFFJK2AZAA7KCS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum shattering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel G. Zhu, Noga Alon, Varun Sivashankar","submitted_at":"2024-09-19T17:55:10Z","abstract_excerpt":"A family $\\mathcal{F}$ of subsets of $[n]=\\{1,2,\\ldots,n\\}$ shatters a set $A \\subseteq [n]$ if for every $A' \\subseteq A$ there is an $F \\in \\mathcal{F}$ such that $F \\cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum possible number of subsets of $[n]$ of size $d$ that can be shattered by a family of size $k$. Among other results, we determine $f(n,k,d)$ exactly for $d \\leq 2$ and show that if $d$ and $n$ grow, with both $d$ and $n-d$ tending to infinity, then, for any $k$ satisfying $2^d \\leq k \\leq (1+o(1))2^d$, we have $f(n,k,d)=(1+o(1))c\\binom{n}{d}$, where $c$, roughl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12945","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/2409.12945/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-05T09:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/zmyUB2IsSXwDZGBuq1KjStDLGgqaTls9nBmkl43RzI34Pu4o0Sz0UoZ1/yzKic++Vs5DwaeiqlZMiQMctWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:52:42.271399Z"},"content_sha256":"98df7d6b8173110665cd3be257919b5519e61b81beb6b81b1edcdb6435899cbe","schema_version":"1.0","event_id":"sha256:98df7d6b8173110665cd3be257919b5519e61b81beb6b81b1edcdb6435899cbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/bundle.json","state_url":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/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-07T15:52:42Z","links":{"resolver":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2","bundle":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/bundle.json","state":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4RSOCGOLTMWZFFJK2AZAA7KCS2","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":"c0cff4ec1b83fd4c781bf6724891528dffbc8c53bde97b9fca1f7675f7ced721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T17:55:10Z","title_canon_sha256":"5c43b82c3b21ef719ee3f73d7483c581d7f47b3bdd5584c93cdc189ed7c9124d"},"schema_version":"1.0","source":{"id":"2409.12945","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12945","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12945v2","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12945","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"4RSOCGOLTMWZ","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"pith_short_16","alias_value":"4RSOCGOLTMWZFFJK","created_at":"2026-07-05T09:27:05Z"},{"alias_kind":"pith_short_8","alias_value":"4RSOCGOL","created_at":"2026-07-05T09:27:05Z"}],"graph_snapshots":[{"event_id":"sha256:98df7d6b8173110665cd3be257919b5519e61b81beb6b81b1edcdb6435899cbe","target":"graph","created_at":"2026-07-05T09:27:05Z","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/2409.12945/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A family $\\mathcal{F}$ of subsets of $[n]=\\{1,2,\\ldots,n\\}$ shatters a set $A \\subseteq [n]$ if for every $A' \\subseteq A$ there is an $F \\in \\mathcal{F}$ such that $F \\cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum possible number of subsets of $[n]$ of size $d$ that can be shattered by a family of size $k$. Among other results, we determine $f(n,k,d)$ exactly for $d \\leq 2$ and show that if $d$ and $n$ grow, with both $d$ and $n-d$ tending to infinity, then, for any $k$ satisfying $2^d \\leq k \\leq (1+o(1))2^d$, we have $f(n,k,d)=(1+o(1))c\\binom{n}{d}$, where $c$, roughl","authors_text":"Daniel G. Zhu, Noga Alon, Varun Sivashankar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T17:55:10Z","title":"Maximum shattering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12945","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:1bc2d4e6d38bd42ac909fa0ad679c949fb92096b7ef5ab7f4c66d755824ebdfd","target":"record","created_at":"2026-07-05T09:27:05Z","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":"c0cff4ec1b83fd4c781bf6724891528dffbc8c53bde97b9fca1f7675f7ced721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T17:55:10Z","title_canon_sha256":"5c43b82c3b21ef719ee3f73d7483c581d7f47b3bdd5584c93cdc189ed7c9124d"},"schema_version":"1.0","source":{"id":"2409.12945","kind":"arxiv","version":2}},"canonical_sha256":"e464e119cb9b2d92952ad032007d4296b1f5c60f91ea9a2f830846587c19f580","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e464e119cb9b2d92952ad032007d4296b1f5c60f91ea9a2f830846587c19f580","first_computed_at":"2026-07-05T09:27:05.058488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:27:05.058488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LIZp14Q9JvQaV4aA3fJDWP8jTUyBVsEf0BXhDxOk+MlyTKtnw901i7BdeHLBeXKjAvtB+EtdiwpCbCubyxxwDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:27:05.058944Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.12945","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bc2d4e6d38bd42ac909fa0ad679c949fb92096b7ef5ab7f4c66d755824ebdfd","sha256:98df7d6b8173110665cd3be257919b5519e61b81beb6b81b1edcdb6435899cbe"],"state_sha256":"6ea1d7d0d2ca9689eded61bc85f2b6f6505cbe165583c7402d1f79608e86036b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfK1lDaKiRV7QvHPLYpd7+E3n2ddFwVaIwesRG9nACWeoV9ZwOX3XNxlL5zSrS26gccQzx5adKfXynBDKSH4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:52:42.273417Z","bundle_sha256":"56df7c4ce9b31fac0157c8c3a74681989beb5c3ecb2426d677d18b3b0d2f09b8"}}