{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2HYX5LO3RLFYSWCL2ZNB25NSIZ","short_pith_number":"pith:2HYX5LO3","schema_version":"1.0","canonical_sha256":"d1f17eaddb8acb89584bd65a1d75b24669e123400539befb5d84069bd5c33001","source":{"kind":"arxiv","id":"2209.01826","version":1},"attestation_state":"computed","paper":{"title":"On the maximum of the sum of the sizes of non-trivial cross-intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Frankl","submitted_at":"2022-09-05T08:20:26Z","abstract_excerpt":"We consider families of k-subsets of the standard n-set.\n  Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all its members is empty. Supposing that F and G are non-trivial and cross-intersecting, we determine the maximum of |F|+|G|. For the proof a strengthened version of the so-called shifting technique is introduced. The corresponding problem for families of different uniformities is solved as well."},"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":"2209.01826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-05T08:20:26Z","cross_cats_sorted":[],"title_canon_sha256":"93dabf7729bd43a16b51936149ff22733ff0a5d49f33ecfec61944a1b5d1e49b","abstract_canon_sha256":"6be875192234ed24eb09c864f90d069b1db0196a9513e509cc9534c04c797011"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:54:34.391767Z","signature_b64":"aTc7zxyUvwiMguf2uiPPVvKUq/iRA7uO7ZZqW8sdNEz0snX6EO51HfxjadkzK9klMTiHsZqgjdFLxOj5V5OgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1f17eaddb8acb89584bd65a1d75b24669e123400539befb5d84069bd5c33001","last_reissued_at":"2026-07-05T04:54:34.391425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:54:34.391425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum of the sum of the sizes of non-trivial cross-intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Frankl","submitted_at":"2022-09-05T08:20:26Z","abstract_excerpt":"We consider families of k-subsets of the standard n-set.\n  Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all its members is empty. Supposing that F and G are non-trivial and cross-intersecting, we determine the maximum of |F|+|G|. For the proof a strengthened version of the so-called shifting technique is introduced. The corresponding problem for families of different uniformities is solved as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01826","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/2209.01826/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":"2209.01826","created_at":"2026-07-05T04:54:34.391486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.01826v1","created_at":"2026-07-05T04:54:34.391486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01826","created_at":"2026-07-05T04:54:34.391486+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HYX5LO3RLFY","created_at":"2026-07-05T04:54:34.391486+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HYX5LO3RLFYSWCL","created_at":"2026-07-05T04:54:34.391486+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HYX5LO3","created_at":"2026-07-05T04:54:34.391486+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/2HYX5LO3RLFYSWCL2ZNB25NSIZ","json":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ.json","graph_json":"https://pith.science/api/pith-number/2HYX5LO3RLFYSWCL2ZNB25NSIZ/graph.json","events_json":"https://pith.science/api/pith-number/2HYX5LO3RLFYSWCL2ZNB25NSIZ/events.json","paper":"https://pith.science/paper/2HYX5LO3"},"agent_actions":{"view_html":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ","download_json":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ.json","view_paper":"https://pith.science/paper/2HYX5LO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.01826&json=true","fetch_graph":"https://pith.science/api/pith-number/2HYX5LO3RLFYSWCL2ZNB25NSIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2HYX5LO3RLFYSWCL2ZNB25NSIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ/action/storage_attestation","attest_author":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ/action/author_attestation","sign_citation":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ/action/citation_signature","submit_replication":"https://pith.science/pith/2HYX5LO3RLFYSWCL2ZNB25NSIZ/action/replication_record"}},"created_at":"2026-07-05T04:54:34.391486+00:00","updated_at":"2026-07-05T04:54:34.391486+00:00"}