{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SXMPSRLID3A2Q66KNUNAKZ25ER","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":"5657e033349330a65cef5688c6ac33c3634480d0248706fa6d63feee196f5d18","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T10:31:16Z","title_canon_sha256":"e574360ca9c0ffb4f76dc949bcd6a2362217bad728c20fdc9f0272ccb6aef749"},"schema_version":"1.0","source":{"id":"1008.3691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3691","created_at":"2026-05-18T04:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3691v2","created_at":"2026-05-18T04:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3691","created_at":"2026-05-18T04:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"SXMPSRLID3A2","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SXMPSRLID3A2Q66K","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SXMPSRLI","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:5bd036be537264e032b56a13eba3fd0269238cbe0b29cb23e0945e954815f1f0","target":"graph","created_at":"2026-05-18T04:16:02Z","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"},"paper":{"abstract_excerpt":"An $(r,w;d)$ cover-free family $(CFF)$ is a family of subsets of a finite set such that the intersection of any $r$ members of the family contains at least $d$ elements that are not in the union of any other $w$ members. The minimum number of elements for which there exists an $(r,w;d)-CFF$ with $t$ blocks is denoted by $N((r,w;d),t)$.\n  In this paper, we show that the value of $N((r,w;d),t)$ is equal to the $d$-biclique covering number of the bipartite graph $I_t(r,w)$ whose vertices are all $w$- and $r$-subsets of a $t$-element set, where a $w$-subset is adjacent to an $r$-subset if their in","authors_text":"Farokhlagha Moazami, Hossein Hajiabolhassan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T10:31:16Z","title":"Some New Bounds For Cover-Free Families Through Biclique Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3691","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:72a856d50c4090bd370565a3291bc5d22a5834592436025d7b218f399365ca4d","target":"record","created_at":"2026-05-18T04:16:02Z","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":"5657e033349330a65cef5688c6ac33c3634480d0248706fa6d63feee196f5d18","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T10:31:16Z","title_canon_sha256":"e574360ca9c0ffb4f76dc949bcd6a2362217bad728c20fdc9f0272ccb6aef749"},"schema_version":"1.0","source":{"id":"1008.3691","kind":"arxiv","version":2}},"canonical_sha256":"95d8f945681ec1a87bca6d1a05675d24634e7b95264e37b7aa7d30ac883342a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95d8f945681ec1a87bca6d1a05675d24634e7b95264e37b7aa7d30ac883342a3","first_computed_at":"2026-05-18T04:16:02.418637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:02.418637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F1OtjmXyhKf3vawOEVmOaH6nhf6hKsSptHDzXjYeIFoYjrvDBj/7WFecbL8DVH95okslC2UXHXR3+WWTJd5yDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:02.419333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72a856d50c4090bd370565a3291bc5d22a5834592436025d7b218f399365ca4d","sha256:5bd036be537264e032b56a13eba3fd0269238cbe0b29cb23e0945e954815f1f0"],"state_sha256":"a9e554106c4a9630eb47f5555fac70d4467447c5f6cf609949984f49a8532b6a"}