{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EWHXQW33YR5A64XUBVKWIBJC2P","short_pith_number":"pith:EWHXQW33","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"},"canonical_sha256":"258f785b7bc47a0f72f40d55640522d3e83989e79684383c401c43a38f222da8","source":{"kind":"arxiv","id":"2606.01817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01817","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01817v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01817","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"EWHXQW33YR5A","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"EWHXQW33YR5A64XU","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"EWHXQW33","created_at":"2026-06-02T02:04:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EWHXQW33YR5A64XUBVKWIBJC2P","target":"record","payload":{"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"},"canonical_sha256":"258f785b7bc47a0f72f40d55640522d3e83989e79684383c401c43a38f222da8","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"},"source_kind":"arxiv","source_id":"2606.01817","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":"JYrssZf8HYEkLhL2TFyaO/fNkr/uEUAOFq31YqAQsYryKC2zOGnQ9a2plB0qdyW+MSdk7mGXNnIEmtXmaIF6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:48:39.230444Z"},"content_sha256":"b6f2f65f07b0fe6d64af2e30800c7814248adc91a2101e74dc768cfd12bffe91","schema_version":"1.0","event_id":"sha256:b6f2f65f07b0fe6d64af2e30800c7814248adc91a2101e74dc768cfd12bffe91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EWHXQW33YR5A64XUBVKWIBJC2P","target":"graph","payload":{"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"},"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":"ZC8QUQxD2Yp38pyDa+RPG61xq/JB7aRAwis27+BEEx/sxNe5TNpHHsqDKdzmag6SHxHAX2wtT8dv6AhMJcGqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:48:39.230824Z"},"content_sha256":"f07b292758c2eec60d4515a4d6a8597247c4437633cd5e8fb2792254256b4363","schema_version":"1.0","event_id":"sha256:f07b292758c2eec60d4515a4d6a8597247c4437633cd5e8fb2792254256b4363"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/bundle.json","state_url":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWHXQW33YR5A64XUBVKWIBJC2P/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-03T06:48:39Z","links":{"resolver":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P","bundle":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/bundle.json","state":"https://pith.science/pith/EWHXQW33YR5A64XUBVKWIBJC2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWHXQW33YR5A64XUBVKWIBJC2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EWHXQW33YR5A64XUBVKWIBJC2P","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":"7cd1946ae4925be908bc1d6319e1d5e95e49be5d5f78f38d9896bf3e5d6c9584","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:32:10Z","title_canon_sha256":"a3c732d1ae707b6be0f8a4d5e56104450e3ad790ff6fb8299ca65a804fc79c5b"},"schema_version":"1.0","source":{"id":"2606.01817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01817","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01817v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01817","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"EWHXQW33YR5A","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"EWHXQW33YR5A64XU","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"EWHXQW33","created_at":"2026-06-02T02:04:57Z"}],"graph_snapshots":[{"event_id":"sha256:f07b292758c2eec60d4515a4d6a8597247c4437633cd5e8fb2792254256b4363","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.01817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","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:32:10Z","title":"On the product of cross-intersecting families with maximal covering number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01817","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:b6f2f65f07b0fe6d64af2e30800c7814248adc91a2101e74dc768cfd12bffe91","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":"7cd1946ae4925be908bc1d6319e1d5e95e49be5d5f78f38d9896bf3e5d6c9584","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T07:32:10Z","title_canon_sha256":"a3c732d1ae707b6be0f8a4d5e56104450e3ad790ff6fb8299ca65a804fc79c5b"},"schema_version":"1.0","source":{"id":"2606.01817","kind":"arxiv","version":1}},"canonical_sha256":"258f785b7bc47a0f72f40d55640522d3e83989e79684383c401c43a38f222da8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"258f785b7bc47a0f72f40d55640522d3e83989e79684383c401c43a38f222da8","first_computed_at":"2026-06-02T02:04:57.669956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:57.669956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hMWXtP9VFj3QOCUJALAivFgXJFcfpxV1qipl4NZIklVcWMiLOdUwfc7CdWPT+QGAYbIy2JxjECbnubzTJNj0Dw==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:57.670380Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6f2f65f07b0fe6d64af2e30800c7814248adc91a2101e74dc768cfd12bffe91","sha256:f07b292758c2eec60d4515a4d6a8597247c4437633cd5e8fb2792254256b4363"],"state_sha256":"f8abeaaa80e6758b8f08a237dd2384fe18a98b96addab0560b03d26ee8ca2e3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mr580oO3lWU2ffCPFSSKJDw9PaTNFzhPka/Z7hxERAc7DVx0gudHQafbKELJmBn5yfvX3dAGgzyJABvL05+HCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:48:39.232978Z","bundle_sha256":"a64eb915c02fb3fa3d576f8074638adb505be73429a59a30a290e69aad793316"}}