{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SXMPSRLID3A2Q66KNUNAKZ25ER","short_pith_number":"pith:SXMPSRLI","schema_version":"1.0","canonical_sha256":"95d8f945681ec1a87bca6d1a05675d24634e7b95264e37b7aa7d30ac883342a3","source":{"kind":"arxiv","id":"1008.3691","version":2},"attestation_state":"computed","paper":{"title":"Some New Bounds For Cover-Free Families Through Biclique Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Farokhlagha Moazami, Hossein Hajiabolhassan","submitted_at":"2010-08-22T10:31:16Z","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"},"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":"1008.3691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T10:31:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e574360ca9c0ffb4f76dc949bcd6a2362217bad728c20fdc9f0272ccb6aef749","abstract_canon_sha256":"5657e033349330a65cef5688c6ac33c3634480d0248706fa6d63feee196f5d18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:02.419333Z","signature_b64":"F1OtjmXyhKf3vawOEVmOaH6nhf6hKsSptHDzXjYeIFoYjrvDBj/7WFecbL8DVH95okslC2UXHXR3+WWTJd5yDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d8f945681ec1a87bca6d1a05675d24634e7b95264e37b7aa7d30ac883342a3","last_reissued_at":"2026-05-18T04:16:02.418637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:02.418637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some New Bounds For Cover-Free Families Through Biclique Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Farokhlagha Moazami, Hossein Hajiabolhassan","submitted_at":"2010-08-22T10:31:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3691","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":""},"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":"1008.3691","created_at":"2026-05-18T04:16:02.418756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3691v2","created_at":"2026-05-18T04:16:02.418756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3691","created_at":"2026-05-18T04:16:02.418756+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXMPSRLID3A2","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXMPSRLID3A2Q66K","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXMPSRLI","created_at":"2026-05-18T12:26:13.927090+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/SXMPSRLID3A2Q66KNUNAKZ25ER","json":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER.json","graph_json":"https://pith.science/api/pith-number/SXMPSRLID3A2Q66KNUNAKZ25ER/graph.json","events_json":"https://pith.science/api/pith-number/SXMPSRLID3A2Q66KNUNAKZ25ER/events.json","paper":"https://pith.science/paper/SXMPSRLI"},"agent_actions":{"view_html":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER","download_json":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER.json","view_paper":"https://pith.science/paper/SXMPSRLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3691&json=true","fetch_graph":"https://pith.science/api/pith-number/SXMPSRLID3A2Q66KNUNAKZ25ER/graph.json","fetch_events":"https://pith.science/api/pith-number/SXMPSRLID3A2Q66KNUNAKZ25ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER/action/storage_attestation","attest_author":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER/action/author_attestation","sign_citation":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER/action/citation_signature","submit_replication":"https://pith.science/pith/SXMPSRLID3A2Q66KNUNAKZ25ER/action/replication_record"}},"created_at":"2026-05-18T04:16:02.418756+00:00","updated_at":"2026-05-18T04:16:02.418756+00:00"}