{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KIMZOKRIGIAQNA5KRSWOCJLPZL","short_pith_number":"pith:KIMZOKRI","canonical_record":{"source":{"id":"2503.14844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-19T02:58:50Z","cross_cats_sorted":[],"title_canon_sha256":"0ffe733e6c1b38e2aa67d18a32d007ff73753db86d95d5a463127c2b2eb9a4df","abstract_canon_sha256":"b41992ef2c58e6abb7efc54b29d10a15a2d1fe650f8b4a1524c3f432ccc2b87d"},"schema_version":"1.0"},"canonical_sha256":"5219972a2832010683aa8cace1256fcafce8993c92ba18b7c045033c9ae0da66","source":{"kind":"arxiv","id":"2503.14844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.14844","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"2503.14844v1","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14844","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"KIMZOKRIGIAQ","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"KIMZOKRIGIAQNA5K","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"KIMZOKRI","created_at":"2026-07-05T10:34:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KIMZOKRIGIAQNA5KRSWOCJLPZL","target":"record","payload":{"canonical_record":{"source":{"id":"2503.14844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-19T02:58:50Z","cross_cats_sorted":[],"title_canon_sha256":"0ffe733e6c1b38e2aa67d18a32d007ff73753db86d95d5a463127c2b2eb9a4df","abstract_canon_sha256":"b41992ef2c58e6abb7efc54b29d10a15a2d1fe650f8b4a1524c3f432ccc2b87d"},"schema_version":"1.0"},"canonical_sha256":"5219972a2832010683aa8cace1256fcafce8993c92ba18b7c045033c9ae0da66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:34:25.738220Z","signature_b64":"lBpEe0kGWIeTzW6dKfVtXlAyWsqq5uFD6iOQnu3aLq0rLQlo1c/3a/zeJXW6wdh/y9vmlPscdQmvjpOfgVZ/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5219972a2832010683aa8cace1256fcafce8993c92ba18b7c045033c9ae0da66","last_reissued_at":"2026-07-05T10:34:25.737592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:34:25.737592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.14844","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-07-05T10:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PpnJuwSOVjLABBUgMS8aMReellTEsS3UMT8FUSbS68nRjEFsG4zsMI2+fauAREiivo+uFA3CoNRboqzDkUFdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:41:53.294478Z"},"content_sha256":"70b8cc633648969d724c995feb73d2638ef6d60cf846c7e68e4fe04dcf11a361","schema_version":"1.0","event_id":"sha256:70b8cc633648969d724c995feb73d2638ef6d60cf846c7e68e4fe04dcf11a361"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KIMZOKRIGIAQNA5KRSWOCJLPZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A semidefinite programming approach to cross $2$-intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hajime Tanaka, Norihide Tokushige","submitted_at":"2025-03-19T02:58:50Z","abstract_excerpt":"Let $k\\geq 2$ and $n\\geq 3(k-1)$. Let $\\mathcal{F}$ and $\\mathcal{G}$ be families of $k$-element subsets of an $n$-element set. Suppose that $|F\\cap G|\\geq 2$ for all $F\\in\\mathcal{F}$ and $G\\in\\mathcal{G}$. We show that $|\\mathcal{F}||\\mathcal{G}|\\leq\\binom{n-2}{k-2}^2$, and determine the extremal configurations. This settles the last unsolved case of a recent result by Zhang and Wu (J. Combin. Theory Ser. B, 2025). We also obtain the corresponding result in the product measure setting. Our proof is done by solving semidefinite programming problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14844","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/2503.14844/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-07-05T10:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wN0fN+mOV91ZlNRiZ6CHD2QI2tqPUoRDAr/6Kr0P01SKktkYFuP3lCLpdvIgvoItxVmRZDakIBMpaWz8Z1X7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:41:53.295329Z"},"content_sha256":"3b0e7b7c97e9d3e51922733da7f3598213a8223134ae03499310f563af0d4fdc","schema_version":"1.0","event_id":"sha256:3b0e7b7c97e9d3e51922733da7f3598213a8223134ae03499310f563af0d4fdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIMZOKRIGIAQNA5KRSWOCJLPZL/bundle.json","state_url":"https://pith.science/pith/KIMZOKRIGIAQNA5KRSWOCJLPZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIMZOKRIGIAQNA5KRSWOCJLPZL/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-08-05T17:41:53Z","links":{"resolver":"https://pith.science/pith/KIMZOKRIGIAQNA5KRSWOCJLPZL","bundle":"https://pith.science/pith/KIMZOKRIGIAQNA5KRSWOCJLPZL/bundle.json","state":"https://pith.science/pith/KIMZOKRIGIAQNA5KRSWOCJLPZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIMZOKRIGIAQNA5KRSWOCJLPZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KIMZOKRIGIAQNA5KRSWOCJLPZL","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":"b41992ef2c58e6abb7efc54b29d10a15a2d1fe650f8b4a1524c3f432ccc2b87d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-19T02:58:50Z","title_canon_sha256":"0ffe733e6c1b38e2aa67d18a32d007ff73753db86d95d5a463127c2b2eb9a4df"},"schema_version":"1.0","source":{"id":"2503.14844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.14844","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"2503.14844v1","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14844","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"KIMZOKRIGIAQ","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"pith_short_16","alias_value":"KIMZOKRIGIAQNA5K","created_at":"2026-07-05T10:34:25Z"},{"alias_kind":"pith_short_8","alias_value":"KIMZOKRI","created_at":"2026-07-05T10:34:25Z"}],"graph_snapshots":[{"event_id":"sha256:3b0e7b7c97e9d3e51922733da7f3598213a8223134ae03499310f563af0d4fdc","target":"graph","created_at":"2026-07-05T10:34:25Z","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/2503.14844/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $k\\geq 2$ and $n\\geq 3(k-1)$. Let $\\mathcal{F}$ and $\\mathcal{G}$ be families of $k$-element subsets of an $n$-element set. Suppose that $|F\\cap G|\\geq 2$ for all $F\\in\\mathcal{F}$ and $G\\in\\mathcal{G}$. We show that $|\\mathcal{F}||\\mathcal{G}|\\leq\\binom{n-2}{k-2}^2$, and determine the extremal configurations. This settles the last unsolved case of a recent result by Zhang and Wu (J. Combin. Theory Ser. B, 2025). We also obtain the corresponding result in the product measure setting. Our proof is done by solving semidefinite programming problems.","authors_text":"Hajime Tanaka, Norihide Tokushige","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-19T02:58:50Z","title":"A semidefinite programming approach to cross $2$-intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14844","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:70b8cc633648969d724c995feb73d2638ef6d60cf846c7e68e4fe04dcf11a361","target":"record","created_at":"2026-07-05T10:34:25Z","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":"b41992ef2c58e6abb7efc54b29d10a15a2d1fe650f8b4a1524c3f432ccc2b87d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-19T02:58:50Z","title_canon_sha256":"0ffe733e6c1b38e2aa67d18a32d007ff73753db86d95d5a463127c2b2eb9a4df"},"schema_version":"1.0","source":{"id":"2503.14844","kind":"arxiv","version":1}},"canonical_sha256":"5219972a2832010683aa8cace1256fcafce8993c92ba18b7c045033c9ae0da66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5219972a2832010683aa8cace1256fcafce8993c92ba18b7c045033c9ae0da66","first_computed_at":"2026-07-05T10:34:25.737592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:34:25.737592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lBpEe0kGWIeTzW6dKfVtXlAyWsqq5uFD6iOQnu3aLq0rLQlo1c/3a/zeJXW6wdh/y9vmlPscdQmvjpOfgVZ/CA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:34:25.738220Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.14844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70b8cc633648969d724c995feb73d2638ef6d60cf846c7e68e4fe04dcf11a361","sha256:3b0e7b7c97e9d3e51922733da7f3598213a8223134ae03499310f563af0d4fdc"],"state_sha256":"d724fc3d96723bd3722605b743839bd7fe2a8b747c4126fba2364b617e8fcbd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7V3xSb+m4ftRmNDjwNyEAzct/QpyQpIHYSaiFKRfug9HWSPYTgnFHK+ydZTLXC+YOSxm6dnxRKwbriTe/3ZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T17:41:53.301123Z","bundle_sha256":"f5ca5f9b2c83d3f7840766df6e3e9b49ea52d618293460050a3e5ac3745109bd"}}