{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4RSOCGOLTMWZFFJK2AZAA7KCS2","short_pith_number":"pith:4RSOCGOL","schema_version":"1.0","canonical_sha256":"e464e119cb9b2d92952ad032007d4296b1f5c60f91ea9a2f830846587c19f580","source":{"kind":"arxiv","id":"2409.12945","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.12945","created_at":"2026-07-05T09:27:05.058539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12945v2","created_at":"2026-07-05T09:27:05.058539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12945","created_at":"2026-07-05T09:27:05.058539+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RSOCGOLTMWZ","created_at":"2026-07-05T09:27:05.058539+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RSOCGOLTMWZFFJK","created_at":"2026-07-05T09:27:05.058539+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RSOCGOL","created_at":"2026-07-05T09:27:05.058539+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/4RSOCGOLTMWZFFJK2AZAA7KCS2","json":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2.json","graph_json":"https://pith.science/api/pith-number/4RSOCGOLTMWZFFJK2AZAA7KCS2/graph.json","events_json":"https://pith.science/api/pith-number/4RSOCGOLTMWZFFJK2AZAA7KCS2/events.json","paper":"https://pith.science/paper/4RSOCGOL"},"agent_actions":{"view_html":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2","download_json":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2.json","view_paper":"https://pith.science/paper/4RSOCGOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12945&json=true","fetch_graph":"https://pith.science/api/pith-number/4RSOCGOLTMWZFFJK2AZAA7KCS2/graph.json","fetch_events":"https://pith.science/api/pith-number/4RSOCGOLTMWZFFJK2AZAA7KCS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/action/storage_attestation","attest_author":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/action/author_attestation","sign_citation":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/action/citation_signature","submit_replication":"https://pith.science/pith/4RSOCGOLTMWZFFJK2AZAA7KCS2/action/replication_record"}},"created_at":"2026-07-05T09:27:05.058539+00:00","updated_at":"2026-07-05T09:27:05.058539+00:00"}