{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4HE4AWD3XJMGZDBJLQZE57NEHN","short_pith_number":"pith:4HE4AWD3","schema_version":"1.0","canonical_sha256":"e1c9c0587bba586c8c295c324efda43b6b0316bb1724306be745f7570bfb9386","source":{"kind":"arxiv","id":"2606.20043","version":1},"attestation_state":"computed","paper":{"title":"Improved bound on symmetric differences of intersecting families","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lihua Feng, Qifan Wang, Yongjiang Wu","submitted_at":"2026-06-18T10:21:25Z","abstract_excerpt":"For a family $\\mathcal{F}$, it is called intersecting if $F\\cap F'\\neq \\emptyset$ for all $F,F'\\in\\mathcal{F}$.\n  We use $\\mathcal{SD}(\\mathcal{F}) = \\{F \\triangle G : F, G \\in \\mathcal{F}\\}$ to denote\n  the family of symmetric differences of $\\mathcal{F}$.\n  In 2023, Frankl, Kiselev and Kupavskii conjectured that for any intersecting family $\\mathcal{F} \\subseteq \\binom{[n]}{k}$ with $n > 10k$, the inequality $|\\mathcal{SD}(\\mathcal{F})| \\le \\sum_{\\ell=0}^{k-1} \\binom{n-1}{2\\ell}$ holds. They further observed that a proof for the range $n>3k^2$ could likely be obtained via arguments similar t"},"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.20043","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T10:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"6aade5c975c611b231a0ba5981045cf0317876dfd88048d7c92de51af922541a","abstract_canon_sha256":"cc87fffe55e5cf6cc67db7145886dc92d4d7d486025195b9b705024b0e9cbcaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:01.416985Z","signature_b64":"PEBQeCTAf9/OGVMbM0Nk9AS8u1ykv4TH0tnHAjCELI+81WKsb/MyJTnwDCS2avpw9vAC7mXFvDZ8GNnsRhpkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c9c0587bba586c8c295c324efda43b6b0316bb1724306be745f7570bfb9386","last_reissued_at":"2026-06-19T16:13:01.416641Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:01.416641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved bound on symmetric differences of intersecting families","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lihua Feng, Qifan Wang, Yongjiang Wu","submitted_at":"2026-06-18T10:21:25Z","abstract_excerpt":"For a family $\\mathcal{F}$, it is called intersecting if $F\\cap F'\\neq \\emptyset$ for all $F,F'\\in\\mathcal{F}$.\n  We use $\\mathcal{SD}(\\mathcal{F}) = \\{F \\triangle G : F, G \\in \\mathcal{F}\\}$ to denote\n  the family of symmetric differences of $\\mathcal{F}$.\n  In 2023, Frankl, Kiselev and Kupavskii conjectured that for any intersecting family $\\mathcal{F} \\subseteq \\binom{[n]}{k}$ with $n > 10k$, the inequality $|\\mathcal{SD}(\\mathcal{F})| \\le \\sum_{\\ell=0}^{k-1} \\binom{n-1}{2\\ell}$ holds. They further observed that a proof for the range $n>3k^2$ could likely be obtained via arguments similar t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20043","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.20043/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.20043","created_at":"2026-06-19T16:13:01.416705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20043v1","created_at":"2026-06-19T16:13:01.416705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20043","created_at":"2026-06-19T16:13:01.416705+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HE4AWD3XJMG","created_at":"2026-06-19T16:13:01.416705+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HE4AWD3XJMGZDBJ","created_at":"2026-06-19T16:13:01.416705+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HE4AWD3","created_at":"2026-06-19T16:13:01.416705+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/4HE4AWD3XJMGZDBJLQZE57NEHN","json":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN.json","graph_json":"https://pith.science/api/pith-number/4HE4AWD3XJMGZDBJLQZE57NEHN/graph.json","events_json":"https://pith.science/api/pith-number/4HE4AWD3XJMGZDBJLQZE57NEHN/events.json","paper":"https://pith.science/paper/4HE4AWD3"},"agent_actions":{"view_html":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN","download_json":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN.json","view_paper":"https://pith.science/paper/4HE4AWD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20043&json=true","fetch_graph":"https://pith.science/api/pith-number/4HE4AWD3XJMGZDBJLQZE57NEHN/graph.json","fetch_events":"https://pith.science/api/pith-number/4HE4AWD3XJMGZDBJLQZE57NEHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN/action/storage_attestation","attest_author":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN/action/author_attestation","sign_citation":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN/action/citation_signature","submit_replication":"https://pith.science/pith/4HE4AWD3XJMGZDBJLQZE57NEHN/action/replication_record"}},"created_at":"2026-06-19T16:13:01.416705+00:00","updated_at":"2026-06-19T16:13:01.416705+00:00"}