{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:X7YPFKRACFEF663PWZT7TEHC7R","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":"0766cacf3d6fd28ad3e4c41e0611eeb3aebaa9df8ca67e2a05c5e821fbacacd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T18:17:08Z","title_canon_sha256":"0d9e877305faaa646502f2c9167c57e271dedf23d2d49533f7a3d11ed8b8c188"},"schema_version":"1.0","source":{"id":"2605.12634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12634","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12634v1","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12634","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"X7YPFKRACFEF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"X7YPFKRACFEF663P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"X7YPFKRA","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4b07003e167011954d09f2f59d64c5a6560af7eec08f9dcc06a425b0a90af2e8","target":"graph","created_at":"2026-05-18T03:10:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove t_s(G) = t(1, χ(G)) for any simple graph G."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The graph is simple with no isolated vertices when applying the trivial bound t(1,n) ≤ t(G) ≤ t(2,n); constructions for specific graphs assume standard combinatorial encodings like mixed-radix representations exist without hidden overlaps."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For any graph G, the minimum universe size for G-Sperner families equals the chromatic number of G, while G-cover-free families on paths and cycles satisfy log2(n) ≤ t ≤ 1.893 log2(n) + O(1)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For any simple graph G, the minimum t for a G-Sperner family equals t(1, χ(G))."}],"snapshot_sha256":"32b59b53e94e92bb10bc17a82bb88775969c0795085ff59e4c5525bf9456ea64"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A family of subsets of a $t$-set is a \\emph{$d$-cover-free family} or $d$-CFF if no subset in the family is contained in the union of any $d$ other subsets. Let $t(d, n)$ denote the minimum $t$ for which there exists a $d$-CFF on a $t$-set with $n$ subsets. Since a $1$-CFF is the same as a Sperner family, using Sperner's theorem, we get $t(1, n) \\sim \\log_{2}(n)$ as $n$ grows. Erd\\\"os, Frankl, and F\\\"uredi (JCTA, 1982) proved that $3.106\\log_{2}(n) < t(2,n) < 5.512\\log_{2}(n)$. This paper focuses on generalizing $1$-CFF and $2$-CFF using a graph $G$ where vertices correspond to subsets in the ","authors_text":"Lucia Moura, Prangya Parida","cross_cats":[],"headline":"For any simple graph G, the minimum t for a G-Sperner family equals t(1, χ(G)).","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T18:17:08Z","title":"Cover-free families on graphs"},"references":{"count":29,"internal_anchors":0,"resolved_work":29,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Linear time constructions of some-restriction problems","work_id":"01e2c079-9164-4151-bb16-590a28ddc0b0","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"An efficient algorithm for group testing with runlength constraints.Discrete Applied Mathematics, 360:181–187, 2025","work_id":"a318147e-dd5d-4b9f-9021-4e2b5833ef9a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A decomposition theorem for partially ordered sets.Classic papers in combinatorics, pages 139–144, 1987","work_id":"2ca86912-68f2-4bb1-bfe2-5aa1fd2674f0","year":1987},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Dingzhu Du and Frank Hwang.Combinatorial group testing and its applications, volume 12. World Scientific, 2000","work_id":"3d75fe96-f050-44f6-a726-f1b63dda69bc","year":2000},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Bounds on the length of disjunctive codes.Problemy Peredachi Informatsii, 18(3):7–13, 1982","work_id":"98b0c126-69f4-4fa4-a8bd-33958efda8e7","year":1982}],"snapshot_sha256":"e7602d2a41c277684dde2fc0bac205ff8c5d196a9265237656e81b57b79199f6"},"source":{"id":"2605.12634","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:25:35.930574Z","id":"060a1277-0dff-4f8e-b3d2-fb8ae21438c7","model_set":{"reader":"grok-4.3"},"one_line_summary":"For any graph G, the minimum universe size for G-Sperner families equals the chromatic number of G, while G-cover-free families on paths and cycles satisfy log2(n) ≤ t ≤ 1.893 log2(n) + O(1).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For any simple graph G, the minimum t for a G-Sperner family equals t(1, χ(G)).","strongest_claim":"We prove t_s(G) = t(1, χ(G)) for any simple graph G.","weakest_assumption":"The graph is simple with no isolated vertices when applying the trivial bound t(1,n) ≤ t(G) ≤ t(2,n); constructions for specific graphs assume standard combinatorial encodings like mixed-radix representations exist without hidden overlaps."}},"verdict_id":"060a1277-0dff-4f8e-b3d2-fb8ae21438c7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5330a0121bc4122b28d2baadd97d4036d7f96b67046723fccc5e02e622cd4847","target":"record","created_at":"2026-05-18T03:10:00Z","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":"0766cacf3d6fd28ad3e4c41e0611eeb3aebaa9df8ca67e2a05c5e821fbacacd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T18:17:08Z","title_canon_sha256":"0d9e877305faaa646502f2c9167c57e271dedf23d2d49533f7a3d11ed8b8c188"},"schema_version":"1.0","source":{"id":"2605.12634","kind":"arxiv","version":1}},"canonical_sha256":"bff0f2aa2011485f7b6fb667f990e2fc69ae67fe1fc50987757bcd7e3bd52609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff0f2aa2011485f7b6fb667f990e2fc69ae67fe1fc50987757bcd7e3bd52609","first_computed_at":"2026-05-18T03:10:00.116258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:00.116258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GhQQ1Aw0krjDv/Pm1fbadOgl/n7YcyPheYSeXvTuE7MH1gvE7MUX+ibcWRbimxQWxfRG44dTJ+R+vj2e+5gFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:00.116844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5330a0121bc4122b28d2baadd97d4036d7f96b67046723fccc5e02e622cd4847","sha256:4b07003e167011954d09f2f59d64c5a6560af7eec08f9dcc06a425b0a90af2e8"],"state_sha256":"edc0670fcb94d56b89ff8e20fc4de6317cba1b8a09527de9f709b31da94b2ab2"}