{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LBWBJ4DTLF3K3FSBL3XTAGD6R4","short_pith_number":"pith:LBWBJ4DT","schema_version":"1.0","canonical_sha256":"586c14f0735976ad96415eef30187e8f146ea57239b08429f7b981d0a92861e6","source":{"kind":"arxiv","id":"2210.11172","version":1},"attestation_state":"computed","paper":{"title":"Improved bounds concerning the maximum degree 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-10-20T11:20:16Z","abstract_excerpt":"For positive integers $n>k>t$ let $\\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\\{1,\\ldots,n\\}$. Subsets of $\\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\\mathcal{F}$ is called $t$-intersecting if $|F\\cap F'|\\geq t$ for all $F,F'\\in \\mathcal{F}$. One of the central results of extremal set theory is the Erd\\H{o}s-Ko-Rado Theorem which states that for $n\\geq (k-t+1)(t+1)$ no $t$-intersecting $k$-graph has more than $\\binom{n-t}{k-t}$ edges. For $n$ greater than this threshold the $t$-star (all $k$-sets containing a fixed $t$-set) is the onl"},"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":"2210.11172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T11:20:16Z","cross_cats_sorted":[],"title_canon_sha256":"52667feb2a8ec03e584449fb8be09096031a64860f521d957ea44081c2e45256","abstract_canon_sha256":"50e58ee9652cc00f85d0aba5c110eba2843efb8c72f5c046b0d22215113e9579"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:45.275384Z","signature_b64":"xC1WvQmSHkSL/r2IQQgGYYQ9ATWMnNcmThFFRGNXF67tZXXgmVMW11ktEf6BaJGNGwqdjr5MjQv2EWF/Itt/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"586c14f0735976ad96415eef30187e8f146ea57239b08429f7b981d0a92861e6","last_reissued_at":"2026-07-05T05:08:45.274991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:45.274991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved bounds concerning the maximum degree 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-10-20T11:20:16Z","abstract_excerpt":"For positive integers $n>k>t$ let $\\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\\{1,\\ldots,n\\}$. Subsets of $\\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\\mathcal{F}$ is called $t$-intersecting if $|F\\cap F'|\\geq t$ for all $F,F'\\in \\mathcal{F}$. One of the central results of extremal set theory is the Erd\\H{o}s-Ko-Rado Theorem which states that for $n\\geq (k-t+1)(t+1)$ no $t$-intersecting $k$-graph has more than $\\binom{n-t}{k-t}$ edges. For $n$ greater than this threshold the $t$-star (all $k$-sets containing a fixed $t$-set) is the onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.11172","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/2210.11172/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":"2210.11172","created_at":"2026-07-05T05:08:45.275047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.11172v1","created_at":"2026-07-05T05:08:45.275047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.11172","created_at":"2026-07-05T05:08:45.275047+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBWBJ4DTLF3K","created_at":"2026-07-05T05:08:45.275047+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBWBJ4DTLF3K3FSB","created_at":"2026-07-05T05:08:45.275047+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBWBJ4DT","created_at":"2026-07-05T05:08:45.275047+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/LBWBJ4DTLF3K3FSBL3XTAGD6R4","json":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4.json","graph_json":"https://pith.science/api/pith-number/LBWBJ4DTLF3K3FSBL3XTAGD6R4/graph.json","events_json":"https://pith.science/api/pith-number/LBWBJ4DTLF3K3FSBL3XTAGD6R4/events.json","paper":"https://pith.science/paper/LBWBJ4DT"},"agent_actions":{"view_html":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4","download_json":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4.json","view_paper":"https://pith.science/paper/LBWBJ4DT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.11172&json=true","fetch_graph":"https://pith.science/api/pith-number/LBWBJ4DTLF3K3FSBL3XTAGD6R4/graph.json","fetch_events":"https://pith.science/api/pith-number/LBWBJ4DTLF3K3FSBL3XTAGD6R4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/action/storage_attestation","attest_author":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/action/author_attestation","sign_citation":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/action/citation_signature","submit_replication":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/action/replication_record"}},"created_at":"2026-07-05T05:08:45.275047+00:00","updated_at":"2026-07-05T05:08:45.275047+00:00"}