{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5LSGYVTW5IXXQZHRXFOIZHPV63","short_pith_number":"pith:5LSGYVTW","schema_version":"1.0","canonical_sha256":"eae46c5676ea2f7864f1b95c8c9df5f6d1ac3affc5f1e3e1eca1e6f394833ad7","source":{"kind":"arxiv","id":"2212.11650","version":1},"attestation_state":"computed","paper":{"title":"Best possible bounds on the double-diversity of intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2022-12-22T12:42:38Z","abstract_excerpt":"For a family $\\mathcal{F}\\subset \\binom{[n]}{k}$ and two elements $x,y\\in [n]$ define $\\mathcal{F}(\\bar{x},\\bar{y})=\\{F\\in \\mathcal{F}\\colon x\\notin F,\\ y\\notin F\\}$. The double-diversity $\\gamma_2(\\mathcal{F})$ is defined as the minimum of $|\\mathcal{F}(\\bar{x},\\bar{y})|$ over all pairs $x,y$. Let $\\mathcal{L}\\subset\\binom{[7]}{3}$ consist of the seven lines of the Fano plane. For $n\\geq 7$, $k\\geq 3$ one defines the Fano $k$-graph $\\mathcal{F}_{\\mathcal{L}}$ as the collection of all $k$-subsets of $[n]$ that contain at least one line. It is proven that for $n\\geq 13k^2$ the Fano $k$-graph is"},"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":"2212.11650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-22T12:42:38Z","cross_cats_sorted":[],"title_canon_sha256":"b41f20ba4310d36cc637aa5ed27469ced9738ea388c35ab94a0711374b16f34d","abstract_canon_sha256":"c0930fcbe5e591aeab03ecf65924390c3f25eff035190230a36879812d8d0f19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:19.006115Z","signature_b64":"lc8mJfZkG4Zfov0dt4xBGrtfu3zbf1FI9EU0aor1YXaJ436mmxvKZti1D1PDpL45dpkWEUJtl3IvFRFUzjKSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eae46c5676ea2f7864f1b95c8c9df5f6d1ac3affc5f1e3e1eca1e6f394833ad7","last_reissued_at":"2026-07-05T10:19:19.005595Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:19.005595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best possible bounds on the double-diversity of intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2022-12-22T12:42:38Z","abstract_excerpt":"For a family $\\mathcal{F}\\subset \\binom{[n]}{k}$ and two elements $x,y\\in [n]$ define $\\mathcal{F}(\\bar{x},\\bar{y})=\\{F\\in \\mathcal{F}\\colon x\\notin F,\\ y\\notin F\\}$. The double-diversity $\\gamma_2(\\mathcal{F})$ is defined as the minimum of $|\\mathcal{F}(\\bar{x},\\bar{y})|$ over all pairs $x,y$. Let $\\mathcal{L}\\subset\\binom{[7]}{3}$ consist of the seven lines of the Fano plane. For $n\\geq 7$, $k\\geq 3$ one defines the Fano $k$-graph $\\mathcal{F}_{\\mathcal{L}}$ as the collection of all $k$-subsets of $[n]$ that contain at least one line. It is proven that for $n\\geq 13k^2$ the Fano $k$-graph is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11650","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/2212.11650/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":"2212.11650","created_at":"2026-07-05T10:19:19.005660+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.11650v1","created_at":"2026-07-05T10:19:19.005660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11650","created_at":"2026-07-05T10:19:19.005660+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LSGYVTW5IXX","created_at":"2026-07-05T10:19:19.005660+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LSGYVTW5IXXQZHR","created_at":"2026-07-05T10:19:19.005660+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LSGYVTW","created_at":"2026-07-05T10:19:19.005660+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.19723","citing_title":"Two results on set families: sturdiness and intersection","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63","json":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63.json","graph_json":"https://pith.science/api/pith-number/5LSGYVTW5IXXQZHRXFOIZHPV63/graph.json","events_json":"https://pith.science/api/pith-number/5LSGYVTW5IXXQZHRXFOIZHPV63/events.json","paper":"https://pith.science/paper/5LSGYVTW"},"agent_actions":{"view_html":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63","download_json":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63.json","view_paper":"https://pith.science/paper/5LSGYVTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.11650&json=true","fetch_graph":"https://pith.science/api/pith-number/5LSGYVTW5IXXQZHRXFOIZHPV63/graph.json","fetch_events":"https://pith.science/api/pith-number/5LSGYVTW5IXXQZHRXFOIZHPV63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63/action/storage_attestation","attest_author":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63/action/author_attestation","sign_citation":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63/action/citation_signature","submit_replication":"https://pith.science/pith/5LSGYVTW5IXXQZHRXFOIZHPV63/action/replication_record"}},"created_at":"2026-07-05T10:19:19.005660+00:00","updated_at":"2026-07-05T10:19:19.005660+00:00"}