{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:66NOEDFPEEZE4AJMXNWI2CD5UW","short_pith_number":"pith:66NOEDFP","schema_version":"1.0","canonical_sha256":"f79ae20caf21324e012cbb6c8d087da5a5f0c3bebe7a646dafdd672a052540c5","source":{"kind":"arxiv","id":"2012.15142","version":1},"attestation_state":"computed","paper":{"title":"On the Maximum Number of Edges in Hypergraphs with Fixed Matching and Clique Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erica L.L. Liu, Jian Wang, Peter Frankl","submitted_at":"2020-12-30T13:07:23Z","abstract_excerpt":"For a $k$-graph $\\mathcal{F}\\subset \\binom{[n]}{k}$, the clique number of $\\mathcal{F}$ is defined to be the maximum size of a subset $Q$ of $[n]$ with $\\binom{Q}{k}\\subset \\mathcal{F}$. In the present paper, we determine the maximum number of edges in a $k$-graph on $[n]$ with matching number at most $s$ and clique number at least $q$ for $n\\geq 8k^2s$ and for $q \\geq (s+1)k-l$, $n\\leq (s+1)k+s/(3k)-l$. Two special cases that $q=(s+1)k-2$ and $k=2$ are solved completely."},"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":"2012.15142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T13:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"4148232d0de7bccd837649c39ac8ccdb12c730462e4e33fe594cb1cbd4e96b9b","abstract_canon_sha256":"fdc806782fe59c2623af3da42ba1e10178b2abd30cb39c3a026e5c55bd81c8a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:05.059732Z","signature_b64":"r6OPvX4LW8AR/lbgMeRkn+cF/kFZDNzgC2oUoMPful9hCi75tlJdF8Wp4b/mXaOcAe2Y32VWf57bzQyvZg5hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f79ae20caf21324e012cbb6c8d087da5a5f0c3bebe7a646dafdd672a052540c5","last_reissued_at":"2026-07-05T02:03:05.059367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:05.059367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximum Number of Edges in Hypergraphs with Fixed Matching and Clique Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erica L.L. Liu, Jian Wang, Peter Frankl","submitted_at":"2020-12-30T13:07:23Z","abstract_excerpt":"For a $k$-graph $\\mathcal{F}\\subset \\binom{[n]}{k}$, the clique number of $\\mathcal{F}$ is defined to be the maximum size of a subset $Q$ of $[n]$ with $\\binom{Q}{k}\\subset \\mathcal{F}$. In the present paper, we determine the maximum number of edges in a $k$-graph on $[n]$ with matching number at most $s$ and clique number at least $q$ for $n\\geq 8k^2s$ and for $q \\geq (s+1)k-l$, $n\\leq (s+1)k+s/(3k)-l$. Two special cases that $q=(s+1)k-2$ and $k=2$ are solved completely."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15142","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/2012.15142/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":"2012.15142","created_at":"2026-07-05T02:03:05.059430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.15142v1","created_at":"2026-07-05T02:03:05.059430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15142","created_at":"2026-07-05T02:03:05.059430+00:00"},{"alias_kind":"pith_short_12","alias_value":"66NOEDFPEEZE","created_at":"2026-07-05T02:03:05.059430+00:00"},{"alias_kind":"pith_short_16","alias_value":"66NOEDFPEEZE4AJM","created_at":"2026-07-05T02:03:05.059430+00:00"},{"alias_kind":"pith_short_8","alias_value":"66NOEDFP","created_at":"2026-07-05T02:03:05.059430+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/66NOEDFPEEZE4AJMXNWI2CD5UW","json":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW.json","graph_json":"https://pith.science/api/pith-number/66NOEDFPEEZE4AJMXNWI2CD5UW/graph.json","events_json":"https://pith.science/api/pith-number/66NOEDFPEEZE4AJMXNWI2CD5UW/events.json","paper":"https://pith.science/paper/66NOEDFP"},"agent_actions":{"view_html":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW","download_json":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW.json","view_paper":"https://pith.science/paper/66NOEDFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.15142&json=true","fetch_graph":"https://pith.science/api/pith-number/66NOEDFPEEZE4AJMXNWI2CD5UW/graph.json","fetch_events":"https://pith.science/api/pith-number/66NOEDFPEEZE4AJMXNWI2CD5UW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/action/storage_attestation","attest_author":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/action/author_attestation","sign_citation":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/action/citation_signature","submit_replication":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/action/replication_record"}},"created_at":"2026-07-05T02:03:05.059430+00:00","updated_at":"2026-07-05T02:03:05.059430+00:00"}