{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FMULV3ZCJKWAEGHHGBHRLFVOZT","short_pith_number":"pith:FMULV3ZC","canonical_record":{"source":{"id":"2606.01798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"9e61a0550d8e9c2207537f40b3943fab7160d98b4538fa84b93d35023bf4b064","abstract_canon_sha256":"be0aa9c0972a5ec859e986c44d1905dc37cb98ce18df4bec275c6f93f205169f"},"schema_version":"1.0"},"canonical_sha256":"2b28baef224aac0218e7304f1596aeccdb0da805ff8ef8d16d39787435ccd15a","source":{"kind":"arxiv","id":"2606.01798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01798","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01798v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01798","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"FMULV3ZCJKWA","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"FMULV3ZCJKWAEGHH","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"FMULV3ZC","created_at":"2026-06-02T02:04:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FMULV3ZCJKWAEGHHGBHRLFVOZT","target":"record","payload":{"canonical_record":{"source":{"id":"2606.01798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"9e61a0550d8e9c2207537f40b3943fab7160d98b4538fa84b93d35023bf4b064","abstract_canon_sha256":"be0aa9c0972a5ec859e986c44d1905dc37cb98ce18df4bec275c6f93f205169f"},"schema_version":"1.0"},"canonical_sha256":"2b28baef224aac0218e7304f1596aeccdb0da805ff8ef8d16d39787435ccd15a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:57.110069Z","signature_b64":"fCg63JQDqtSjHyYK1zVqKF/F7P1/38UfCL+cvp8IvoqChDN6DCDC8OdD1kf2C9cfIKPVflbIsZvoPo+pTFchAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b28baef224aac0218e7304f1596aeccdb0da805ff8ef8d16d39787435ccd15a","last_reissued_at":"2026-06-02T02:04:57.109701Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:57.109701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.01798","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5G8p71Lv6KBYjeSJnUrafbeY1Hoiv6RKH+SZNQ4Xs8BlcaSs2OazaEOhpuxfZR8AIpbvyaDESB9l1SI9nluBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:11:48.142194Z"},"content_sha256":"10af80595fd92cbef0b00151ee53e011433c2606293647d5be78d423974b49b4","schema_version":"1.0","event_id":"sha256:10af80595fd92cbef0b00151ee53e011433c2606293647d5be78d423974b49b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FMULV3ZCJKWAEGHHGBHRLFVOZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the product of cross-intersecting families with small 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:17:15Z","abstract_excerpt":"A central problem in extremal set theory is to determine or estimate $m(n,k,t),n>2k\\geq 2t$, the maximum size of an intersecting $k$-graph and covering number at least $t$(see the paper for the definitions). For $t=1$ and $2$ the classical Erd\\H{o}s-Ko-Rado Theorem and the Hilton-Milner Theorem provide the answer.The complete solution for $t=3$ was only achieved recently . There are some partial results for $t=4,5$ but for the general case even to determine the asymptotic appears to be hopelessly difficult .\n  Denoting by $\\widetilde{m}(n,k,t)$ the maximum of $|\\mathcal{F}||\\mathcal{G}|$ for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01798","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.01798/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Et5xgJD41Hxh/chKLXO9WF71LXmKS7lGxcNmESUwwNilOETInVKRJqLZeYSh44TjHGIJ2cejQbHk/fmuS93MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:11:48.142590Z"},"content_sha256":"2710ea550dc60427951a53158f6af5c4052797f8b2bd30a3dd36496762cc37e4","schema_version":"1.0","event_id":"sha256:2710ea550dc60427951a53158f6af5c4052797f8b2bd30a3dd36496762cc37e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMULV3ZCJKWAEGHHGBHRLFVOZT/bundle.json","state_url":"https://pith.science/pith/FMULV3ZCJKWAEGHHGBHRLFVOZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMULV3ZCJKWAEGHHGBHRLFVOZT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:11:48Z","links":{"resolver":"https://pith.science/pith/FMULV3ZCJKWAEGHHGBHRLFVOZT","bundle":"https://pith.science/pith/FMULV3ZCJKWAEGHHGBHRLFVOZT/bundle.json","state":"https://pith.science/pith/FMULV3ZCJKWAEGHHGBHRLFVOZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMULV3ZCJKWAEGHHGBHRLFVOZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FMULV3ZCJKWAEGHHGBHRLFVOZT","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":"be0aa9c0972a5ec859e986c44d1905dc37cb98ce18df4bec275c6f93f205169f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:17:15Z","title_canon_sha256":"9e61a0550d8e9c2207537f40b3943fab7160d98b4538fa84b93d35023bf4b064"},"schema_version":"1.0","source":{"id":"2606.01798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01798","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01798v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01798","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"FMULV3ZCJKWA","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"FMULV3ZCJKWAEGHH","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"FMULV3ZC","created_at":"2026-06-02T02:04:57Z"}],"graph_snapshots":[{"event_id":"sha256:2710ea550dc60427951a53158f6af5c4052797f8b2bd30a3dd36496762cc37e4","target":"graph","created_at":"2026-06-02T02:04:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.01798/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A central problem in extremal set theory is to determine or estimate $m(n,k,t),n>2k\\geq 2t$, the maximum size of an intersecting $k$-graph and covering number at least $t$(see the paper for the definitions). For $t=1$ and $2$ the classical Erd\\H{o}s-Ko-Rado Theorem and the Hilton-Milner Theorem provide the answer.The complete solution for $t=3$ was only achieved recently . There are some partial results for $t=4,5$ but for the general case even to determine the asymptotic appears to be hopelessly difficult .\n  Denoting by $\\widetilde{m}(n,k,t)$ the maximum of $|\\mathcal{F}||\\mathcal{G}|$ for a","authors_text":"Hehui Wu, Long Lin, Peter Frankl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:17:15Z","title":"On the product of cross-intersecting families with small covering number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01798","kind":"arxiv","version":1},"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:10af80595fd92cbef0b00151ee53e011433c2606293647d5be78d423974b49b4","target":"record","created_at":"2026-06-02T02:04:57Z","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":"be0aa9c0972a5ec859e986c44d1905dc37cb98ce18df4bec275c6f93f205169f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:17:15Z","title_canon_sha256":"9e61a0550d8e9c2207537f40b3943fab7160d98b4538fa84b93d35023bf4b064"},"schema_version":"1.0","source":{"id":"2606.01798","kind":"arxiv","version":1}},"canonical_sha256":"2b28baef224aac0218e7304f1596aeccdb0da805ff8ef8d16d39787435ccd15a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b28baef224aac0218e7304f1596aeccdb0da805ff8ef8d16d39787435ccd15a","first_computed_at":"2026-06-02T02:04:57.109701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:57.109701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fCg63JQDqtSjHyYK1zVqKF/F7P1/38UfCL+cvp8IvoqChDN6DCDC8OdD1kf2C9cfIKPVflbIsZvoPo+pTFchAQ==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:57.110069Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10af80595fd92cbef0b00151ee53e011433c2606293647d5be78d423974b49b4","sha256:2710ea550dc60427951a53158f6af5c4052797f8b2bd30a3dd36496762cc37e4"],"state_sha256":"82a56ae98fecfb311fc88cfb8fd5ece9a5d5af34b3572bc99c6e849b83997ef9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TiWuIMkAfYw72qdwOi2G0r/uCwE2COl5erVPCiX/4g0p7LruBL8A/E5Y+5zoPUhepj73FBY4fS1f+qir2Vj9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:11:48.144714Z","bundle_sha256":"5836b9e32009544b809dd34c269ed97b62aff59905a48e8fc1290596f9149a28"}}