{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EWHXQW33YR5A64XUBVKWIBJC2P","short_pith_number":"pith:EWHXQW33","schema_version":"1.0","canonical_sha256":"258f785b7bc47a0f72f40d55640522d3e83989e79684383c401c43a38f222da8","source":{"kind":"arxiv","id":"2606.01817","version":1},"attestation_state":"computed","paper":{"title":"On the product of cross-intersecting families with maximal covering number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Long Lin, Peter Frankl","submitted_at":"2026-06-01T07:32:10Z","abstract_excerpt":"For integers $k ,\\ell \\geq 2$ let $m(k,\\ell)$ denote the maximum of $|\\mathcal{F}| |\\mathcal{G}|$ where the maximum is taken over all pairs of cross-intersecting families, $\\mathcal{F}$ being a $k$-graph with covering number $\\ell$ and $\\mathcal{G}$ a $\\ell$-graph with covering number $k$ (see the paper for the definitions). Erdos and Lovasz initiated the study of the one family version. That is, they provided lower and upper bounds on the maximal size $m(k)=|\\mathcal{F}|$ where $\\mathcal{F}$ is an intersecting k-graph with covering number $k$. In many similar situations $m(k,k)=m(k)^2$ holds."},"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":"2606.01817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"a3c732d1ae707b6be0f8a4d5e56104450e3ad790ff6fb8299ca65a804fc79c5b","abstract_canon_sha256":"7cd1946ae4925be908bc1d6319e1d5e95e49be5d5f78f38d9896bf3e5d6c9584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:57.670380Z","signature_b64":"hMWXtP9VFj3QOCUJALAivFgXJFcfpxV1qipl4NZIklVcWMiLOdUwfc7CdWPT+QGAYbIy2JxjECbnubzTJNj0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"258f785b7bc47a0f72f40d55640522d3e83989e79684383c401c43a38f222da8","last_reissued_at":"2026-06-02T02:04:57.669956Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:57.669956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the product of cross-intersecting families with maximal covering number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Long Lin, Peter Frankl","submitted_at":"2026-06-01T07:32:10Z","abstract_excerpt":"For integers $k ,\\ell \\geq 2$ let $m(k,\\ell)$ denote the maximum of $|\\mathcal{F}| |\\mathcal{G}|$ where the maximum is taken over all pairs of cross-intersecting families, $\\mathcal{F}$ being a $k$-graph with covering number $\\ell$ and $\\mathcal{G}$ a $\\ell$-graph with covering number $k$ (see the paper for the definitions). Erdos and Lovasz initiated the study of the one family version. That is, they provided lower and upper bounds on the maximal size $m(k)=|\\mathcal{F}|$ where $\\mathcal{F}$ is an intersecting k-graph with covering number $k$. In many similar situations $m(k,k)=m(k)^2$ holds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01817","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01817/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.01817","created_at":"2026-06-02T02:04:57.670017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01817v1","created_at":"2026-06-02T02:04:57.670017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01817","created_at":"2026-06-02T02:04:57.670017+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWHXQW33YR5A","created_at":"2026-06-02T02:04:57.670017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWHXQW33YR5A64XU","created_at":"2026-06-02T02:04:57.670017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWHXQW33","created_at":"2026-06-02T02:04:57.670017+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/EWHXQW33YR5A64XUBVKWIBJC2P","json":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P.json","graph_json":"https://pith.science/api/pith-number/EWHXQW33YR5A64XUBVKWIBJC2P/graph.json","events_json":"https://pith.science/api/pith-number/EWHXQW33YR5A64XUBVKWIBJC2P/events.json","paper":"https://pith.science/paper/EWHXQW33"},"agent_actions":{"view_html":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P","download_json":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P.json","view_paper":"https://pith.science/paper/EWHXQW33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01817&json=true","fetch_graph":"https://pith.science/api/pith-number/EWHXQW33YR5A64XUBVKWIBJC2P/graph.json","fetch_events":"https://pith.science/api/pith-number/EWHXQW33YR5A64XUBVKWIBJC2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/action/storage_attestation","attest_author":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/action/author_attestation","sign_citation":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/action/citation_signature","submit_replication":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/action/replication_record"}},"created_at":"2026-06-02T02:04:57.670017+00:00","updated_at":"2026-06-02T02:04:57.670017+00:00"}