{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FWQQXGRREFS5RM2DO5FENCCI7K","short_pith_number":"pith:FWQQXGRR","schema_version":"1.0","canonical_sha256":"2da10b9a312165d8b343774a468848fa936becb48f215190a56225c63b790e8c","source":{"kind":"arxiv","id":"2602.14129","version":3},"attestation_state":"computed","paper":{"title":"Extremal $t$-intersecting families for finite sets with $t$-covering number at least $t+2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dehai Liu, Kaishun Wang, Tian Yao","submitted_at":"2026-02-15T13:02:33Z","abstract_excerpt":"Let $\\mathcal{F}\\subseteq{[n]\\choose k}$ be a $t$-intersecting family. Define the $t$-covering number $\\tau_t(\\mathcal{F})$ of $\\mathcal{F}$ as the minimum size of a subset $S$ of $[n]$ with $|S\\cap F|\\geqslant t$ for each $F\\in\\mathcal{F}$. In this paper, we characterize $\\mathcal{F}$ for which $|\\mathcal{F}|$ takes the maximum value under the condition that $\\tau_t(\\mathcal{F})\\geqslant t+2$ and $n$ is sufficiently large, thereby generalizing two results by Frankl."},"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":"2602.14129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-02-15T13:02:33Z","cross_cats_sorted":[],"title_canon_sha256":"33e2034e6cd3efe54c1da5aba712ac4383b99be0a447260f5e702c9a5be9a997","abstract_canon_sha256":"f6e4845467036b2e982e3d5de7316a53c69910e3b215682bda53a164238b8788"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:25:34.802671Z","signature_b64":"MSvy7HNjbLmE5zG9cX8cIPP/B94fWfHNYxKaJLRvND4KIH8QZtSF4g1FnI+HvnM6enFvwz3PR2NsaopfNGL8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2da10b9a312165d8b343774a468848fa936becb48f215190a56225c63b790e8c","last_reissued_at":"2026-07-29T01:25:34.801668Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:25:34.801668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal $t$-intersecting families for finite sets with $t$-covering number at least $t+2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dehai Liu, Kaishun Wang, Tian Yao","submitted_at":"2026-02-15T13:02:33Z","abstract_excerpt":"Let $\\mathcal{F}\\subseteq{[n]\\choose k}$ be a $t$-intersecting family. Define the $t$-covering number $\\tau_t(\\mathcal{F})$ of $\\mathcal{F}$ as the minimum size of a subset $S$ of $[n]$ with $|S\\cap F|\\geqslant t$ for each $F\\in\\mathcal{F}$. In this paper, we characterize $\\mathcal{F}$ for which $|\\mathcal{F}|$ takes the maximum value under the condition that $\\tau_t(\\mathcal{F})\\geqslant t+2$ and $n$ is sufficiently large, thereby generalizing two results by Frankl."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.14129","kind":"arxiv","version":3},"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/2602.14129/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":"2602.14129","created_at":"2026-07-29T01:25:34.802138+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.14129v3","created_at":"2026-07-29T01:25:34.802138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14129","created_at":"2026-07-29T01:25:34.802138+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWQQXGRREFS5","created_at":"2026-07-29T01:25:34.802138+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWQQXGRREFS5RM2D","created_at":"2026-07-29T01:25:34.802138+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWQQXGRR","created_at":"2026-07-29T01:25:34.802138+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19424","citing_title":"On extremal cross $t$-intersecting families with $t$-covering number conditions","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K","json":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K.json","graph_json":"https://pith.science/api/pith-number/FWQQXGRREFS5RM2DO5FENCCI7K/graph.json","events_json":"https://pith.science/api/pith-number/FWQQXGRREFS5RM2DO5FENCCI7K/events.json","paper":"https://pith.science/paper/FWQQXGRR"},"agent_actions":{"view_html":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K","download_json":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K.json","view_paper":"https://pith.science/paper/FWQQXGRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.14129&json=true","fetch_graph":"https://pith.science/api/pith-number/FWQQXGRREFS5RM2DO5FENCCI7K/graph.json","fetch_events":"https://pith.science/api/pith-number/FWQQXGRREFS5RM2DO5FENCCI7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K/action/storage_attestation","attest_author":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K/action/author_attestation","sign_citation":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K/action/citation_signature","submit_replication":"https://pith.science/pith/FWQQXGRREFS5RM2DO5FENCCI7K/action/replication_record"}},"created_at":"2026-07-29T01:25:34.802138+00:00","updated_at":"2026-07-29T01:25:34.802138+00:00"}