{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:OTUK77X2CFWFSMXCW3SXLVEED4","short_pith_number":"pith:OTUK77X2","schema_version":"1.0","canonical_sha256":"74e8affefa116c5932e2b6e575d4841f0be756ab35f04f3b7592a445325a5af8","source":{"kind":"arxiv","id":"math/0512139","version":1},"attestation_state":"computed","paper":{"title":"Partial covering arrays and a generalized Erdos-Ko-Rado property","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant P. Godbole, Patricia A. Carey","submitted_at":"2005-12-06T21:51:47Z","abstract_excerpt":"The classical Erd\\H os-Ko-Rado theorem states that if $k\\le\\floor{n/2}$ then the largest family of pairwise intersecting $k$-subsets of $[n]=\\{0,1,...,n\\}$ is of size ${{n-1}\\choose{k-1}}$. A family of $k$ subsets satisfying this pairwise intersecting property is called an EKR family. We generalize the EKR property and provide asymptotic lower bounds on the size of the largest family ${\\cal A}$ of $k$-subsets of $[n]$ that satisfies the following property: For each $A,B,C\\in{\\cal A}$, each of the four sets $A\\cap B\\cap C;A\\cap B\\cap C^C; A\\cap B^C\\cap C; A^C\\cap B\\cap C$ are non-empty. This ge"},"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":"math/0512139","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-12-06T21:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"d4a96b494c1138e230221db8fb37ee408bc358996b702fc348b519e31c37a33c","abstract_canon_sha256":"3f39cfa741da9f2b78c07018fb4e1f143372300d8bae253114ef613a5634112a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:04.806957Z","signature_b64":"8ADywhEoW6LQ5PA3KclYM6JQDruE8XRbohn1uzmNjAibWi0a0gIfmhGA1zLIi//alJhrJDIhBXh6CIkaVoU0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74e8affefa116c5932e2b6e575d4841f0be756ab35f04f3b7592a445325a5af8","last_reissued_at":"2026-05-18T03:58:04.806351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:04.806351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial covering arrays and a generalized Erdos-Ko-Rado property","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant P. Godbole, Patricia A. Carey","submitted_at":"2005-12-06T21:51:47Z","abstract_excerpt":"The classical Erd\\H os-Ko-Rado theorem states that if $k\\le\\floor{n/2}$ then the largest family of pairwise intersecting $k$-subsets of $[n]=\\{0,1,...,n\\}$ is of size ${{n-1}\\choose{k-1}}$. A family of $k$ subsets satisfying this pairwise intersecting property is called an EKR family. We generalize the EKR property and provide asymptotic lower bounds on the size of the largest family ${\\cal A}$ of $k$-subsets of $[n]$ that satisfies the following property: For each $A,B,C\\in{\\cal A}$, each of the four sets $A\\cap B\\cap C;A\\cap B\\cap C^C; A\\cap B^C\\cap C; A^C\\cap B\\cap C$ are non-empty. This ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0512139","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":"math/0512139","created_at":"2026-05-18T03:58:04.806458+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0512139v1","created_at":"2026-05-18T03:58:04.806458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0512139","created_at":"2026-05-18T03:58:04.806458+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTUK77X2CFWF","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTUK77X2CFWFSMXC","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTUK77X2","created_at":"2026-05-18T12:25:53.335082+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/OTUK77X2CFWFSMXCW3SXLVEED4","json":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4.json","graph_json":"https://pith.science/api/pith-number/OTUK77X2CFWFSMXCW3SXLVEED4/graph.json","events_json":"https://pith.science/api/pith-number/OTUK77X2CFWFSMXCW3SXLVEED4/events.json","paper":"https://pith.science/paper/OTUK77X2"},"agent_actions":{"view_html":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4","download_json":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4.json","view_paper":"https://pith.science/paper/OTUK77X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0512139&json=true","fetch_graph":"https://pith.science/api/pith-number/OTUK77X2CFWFSMXCW3SXLVEED4/graph.json","fetch_events":"https://pith.science/api/pith-number/OTUK77X2CFWFSMXCW3SXLVEED4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4/action/storage_attestation","attest_author":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4/action/author_attestation","sign_citation":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4/action/citation_signature","submit_replication":"https://pith.science/pith/OTUK77X2CFWFSMXCW3SXLVEED4/action/replication_record"}},"created_at":"2026-05-18T03:58:04.806458+00:00","updated_at":"2026-05-18T03:58:04.806458+00:00"}