{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:66NOEDFPEEZE4AJMXNWI2CD5UW","short_pith_number":"pith:66NOEDFP","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"},"canonical_sha256":"f79ae20caf21324e012cbb6c8d087da5a5f0c3bebe7a646dafdd672a052540c5","source":{"kind":"arxiv","id":"2012.15142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15142","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15142v1","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15142","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"pith_short_12","alias_value":"66NOEDFPEEZE","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"pith_short_16","alias_value":"66NOEDFPEEZE4AJM","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"pith_short_8","alias_value":"66NOEDFP","created_at":"2026-07-05T02:03:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:66NOEDFPEEZE4AJMXNWI2CD5UW","target":"record","payload":{"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"},"canonical_sha256":"f79ae20caf21324e012cbb6c8d087da5a5f0c3bebe7a646dafdd672a052540c5","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"},"source_kind":"arxiv","source_id":"2012.15142","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-05T02:03:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oe1OF2MbteynyBXQG7CtoFvswZ/L1apUSqD0zJd14qtNV9HuQgZ7xHlb0GVK0CJgzL+ku8fOky5zp5beJzhLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:30:48.834648Z"},"content_sha256":"19d6178b4da21784372337515e10a4e649bfa71b3cff8c8d1f10f234f37c62ec","schema_version":"1.0","event_id":"sha256:19d6178b4da21784372337515e10a4e649bfa71b3cff8c8d1f10f234f37c62ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:66NOEDFPEEZE4AJMXNWI2CD5UW","target":"graph","payload":{"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"},"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-05T02:03:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ldGEbUKoPesN5+Vw19Lgm0exI7iNso6QEOFboKbUkJ8HdPKPTVj+uY0Hkx1G3e6dQ/GqpvB/sS2jsfrY44DAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:30:48.834938Z"},"content_sha256":"592a20d3a5a81c59182da472eba9ef50847f6cae16f5c0bfe64958f746559db3","schema_version":"1.0","event_id":"sha256:592a20d3a5a81c59182da472eba9ef50847f6cae16f5c0bfe64958f746559db3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/bundle.json","state_url":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/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-01T01:30:48Z","links":{"resolver":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW","bundle":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/bundle.json","state":"https://pith.science/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66NOEDFPEEZE4AJMXNWI2CD5UW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:66NOEDFPEEZE4AJMXNWI2CD5UW","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":"fdc806782fe59c2623af3da42ba1e10178b2abd30cb39c3a026e5c55bd81c8a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T13:07:23Z","title_canon_sha256":"4148232d0de7bccd837649c39ac8ccdb12c730462e4e33fe594cb1cbd4e96b9b"},"schema_version":"1.0","source":{"id":"2012.15142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.15142","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"arxiv_version","alias_value":"2012.15142v1","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15142","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"pith_short_12","alias_value":"66NOEDFPEEZE","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"pith_short_16","alias_value":"66NOEDFPEEZE4AJM","created_at":"2026-07-05T02:03:05Z"},{"alias_kind":"pith_short_8","alias_value":"66NOEDFP","created_at":"2026-07-05T02:03:05Z"}],"graph_snapshots":[{"event_id":"sha256:592a20d3a5a81c59182da472eba9ef50847f6cae16f5c0bfe64958f746559db3","target":"graph","created_at":"2026-07-05T02:03:05Z","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/2012.15142/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Erica L.L. Liu, Jian Wang, Peter Frankl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T13:07:23Z","title":"On the Maximum Number of Edges in Hypergraphs with Fixed Matching and Clique Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15142","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:19d6178b4da21784372337515e10a4e649bfa71b3cff8c8d1f10f234f37c62ec","target":"record","created_at":"2026-07-05T02:03:05Z","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":"fdc806782fe59c2623af3da42ba1e10178b2abd30cb39c3a026e5c55bd81c8a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T13:07:23Z","title_canon_sha256":"4148232d0de7bccd837649c39ac8ccdb12c730462e4e33fe594cb1cbd4e96b9b"},"schema_version":"1.0","source":{"id":"2012.15142","kind":"arxiv","version":1}},"canonical_sha256":"f79ae20caf21324e012cbb6c8d087da5a5f0c3bebe7a646dafdd672a052540c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f79ae20caf21324e012cbb6c8d087da5a5f0c3bebe7a646dafdd672a052540c5","first_computed_at":"2026-07-05T02:03:05.059367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:03:05.059367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6OPvX4LW8AR/lbgMeRkn+cF/kFZDNzgC2oUoMPful9hCi75tlJdF8Wp4b/mXaOcAe2Y32VWf57bzQyvZg5hCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:03:05.059732Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.15142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19d6178b4da21784372337515e10a4e649bfa71b3cff8c8d1f10f234f37c62ec","sha256:592a20d3a5a81c59182da472eba9ef50847f6cae16f5c0bfe64958f746559db3"],"state_sha256":"dcb7c5443c1e08837cea300757943bf147bdb7bf630c40fc89e20732e6ad6a31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2wEfUXaujgocgrjN4HRGGg79Kju3+ALeBlWeLDtC72Iw4Vca9UEoCpfUvUns/3SY79ER7zEZFfR5QMH6e5WBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T01:30:48.838806Z","bundle_sha256":"eb4ddc99cbdc104a52c8aa84c1f76b0948f30af1f35f39ac2cc3a3e93718021b"}}