{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NSYVXMBML3SIDCEPXTUOS23NX7","short_pith_number":"pith:NSYVXMBM","schema_version":"1.0","canonical_sha256":"6cb15bb02c5ee481888fbce8e96b6dbfd63e0e575bd057788b5cfcea4e0ff872","source":{"kind":"arxiv","id":"1205.6847","version":1},"attestation_state":"computed","paper":{"title":"On the Maximum Number of Edges in a Hypergraph with Given Matching Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Frankl","submitted_at":"2012-05-30T22:16:23Z","abstract_excerpt":"The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{\\binom(3s+2,3), \\binom(n,3) - \\binom(n-s,3)} for all n,s, n >= 3s+2."},"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":"1205.6847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-30T22:16:23Z","cross_cats_sorted":[],"title_canon_sha256":"46f9adabfadbee942d656acd72725d2aa78df43772c7ed3c2ffded154712cb59","abstract_canon_sha256":"bf9e56eb435bccd9e331e132ab95c180e16f05f032dd5b475bcc69c77a418ff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:36.736449Z","signature_b64":"Xy8LJurE+BL8YvFDizjodJP9BKZiphQkK4aHvdM47ErRMKW7qvPCEj7Zc04om9iakBpHJQuG8URU9CWvx+bAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cb15bb02c5ee481888fbce8e96b6dbfd63e0e575bd057788b5cfcea4e0ff872","last_reissued_at":"2026-05-18T03:54:36.735761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:36.735761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximum Number of Edges in a Hypergraph with Given Matching Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Frankl","submitted_at":"2012-05-30T22:16:23Z","abstract_excerpt":"The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{\\binom(3s+2,3), \\binom(n,3) - \\binom(n-s,3)} for all n,s, n >= 3s+2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6847","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":""},"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":"1205.6847","created_at":"2026-05-18T03:54:36.735859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6847v1","created_at":"2026-05-18T03:54:36.735859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6847","created_at":"2026-05-18T03:54:36.735859+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/NSYVXMBML3SIDCEPXTUOS23NX7","json":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7.json","graph_json":"https://pith.science/api/pith-number/NSYVXMBML3SIDCEPXTUOS23NX7/graph.json","events_json":"https://pith.science/api/pith-number/NSYVXMBML3SIDCEPXTUOS23NX7/events.json","paper":"https://pith.science/paper/NSYVXMBM"},"agent_actions":{"view_html":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7","download_json":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7.json","view_paper":"https://pith.science/paper/NSYVXMBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6847&json=true","fetch_graph":"https://pith.science/api/pith-number/NSYVXMBML3SIDCEPXTUOS23NX7/graph.json","fetch_events":"https://pith.science/api/pith-number/NSYVXMBML3SIDCEPXTUOS23NX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7/action/storage_attestation","attest_author":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7/action/author_attestation","sign_citation":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7/action/citation_signature","submit_replication":"https://pith.science/pith/NSYVXMBML3SIDCEPXTUOS23NX7/action/replication_record"}},"created_at":"2026-05-18T03:54:36.735859+00:00","updated_at":"2026-05-18T03:54:36.735859+00:00"}