{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:O4BLI3NGMNQJCNPTEROPW3IHPT","short_pith_number":"pith:O4BLI3NG","schema_version":"1.0","canonical_sha256":"7702b46da663609135f3245cfb6d077cd37b5544f50c04ba6d587ae4cfb7f67c","source":{"kind":"arxiv","id":"1410.4361","version":1},"attestation_state":"computed","paper":{"title":"A Generalization of Cover Free Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Farokhlagha Moazami, Mehdi Azadi Motlagh","submitted_at":"2014-10-16T10:17:28Z","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). In this paper, we determine the exact value of N((r;w; d); t) for some special parameters. Also, we present two constructions for (2; 1; d)- CFF and (2; 2; d)-CFF which improve the existing constructions. Moreover, we introduce a generalization of cover-free families which"},"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":"1410.4361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-16T10:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"47e85029d9a75ac9893f849b33cf8a27c429885e125ee6b25be7f1c0352d0e30","abstract_canon_sha256":"4b22b4b3e9d7a07053ca3b89353ced33ab1aecbbf48be14615a5df5aeb0680da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:56.340386Z","signature_b64":"GqGQ3+SYKorYdRymB9DDVGJUI2rXnr/033S/OsQ4aKWyNDCKXjpppKunMCquYqgtHRP5eOB+QvCAxiTM+ULeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7702b46da663609135f3245cfb6d077cd37b5544f50c04ba6d587ae4cfb7f67c","last_reissued_at":"2026-05-18T02:39:56.339749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:56.339749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalization of Cover Free Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Farokhlagha Moazami, Mehdi Azadi Motlagh","submitted_at":"2014-10-16T10:17:28Z","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). In this paper, we determine the exact value of N((r;w; d); t) for some special parameters. Also, we present two constructions for (2; 1; d)- CFF and (2; 2; d)-CFF which improve the existing constructions. Moreover, we introduce a generalization of cover-free families which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4361","kind":"arxiv","version":1},"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":"1410.4361","created_at":"2026-05-18T02:39:56.339845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4361v1","created_at":"2026-05-18T02:39:56.339845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4361","created_at":"2026-05-18T02:39:56.339845+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4BLI3NGMNQJ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4BLI3NGMNQJCNPT","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4BLI3NG","created_at":"2026-05-18T12:28:41.024544+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/O4BLI3NGMNQJCNPTEROPW3IHPT","json":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT.json","graph_json":"https://pith.science/api/pith-number/O4BLI3NGMNQJCNPTEROPW3IHPT/graph.json","events_json":"https://pith.science/api/pith-number/O4BLI3NGMNQJCNPTEROPW3IHPT/events.json","paper":"https://pith.science/paper/O4BLI3NG"},"agent_actions":{"view_html":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT","download_json":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT.json","view_paper":"https://pith.science/paper/O4BLI3NG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4361&json=true","fetch_graph":"https://pith.science/api/pith-number/O4BLI3NGMNQJCNPTEROPW3IHPT/graph.json","fetch_events":"https://pith.science/api/pith-number/O4BLI3NGMNQJCNPTEROPW3IHPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT/action/storage_attestation","attest_author":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT/action/author_attestation","sign_citation":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT/action/citation_signature","submit_replication":"https://pith.science/pith/O4BLI3NGMNQJCNPTEROPW3IHPT/action/replication_record"}},"created_at":"2026-05-18T02:39:56.339845+00:00","updated_at":"2026-05-18T02:39:56.339845+00:00"}