{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2N4T5LKSTUQ5MMC62APSUIFRYS","short_pith_number":"pith:2N4T5LKS","schema_version":"1.0","canonical_sha256":"d3793ead529d21d6305ed01f2a20b1c489aa3c8ac08eb18d90c8b85dcfc36fd0","source":{"kind":"arxiv","id":"2602.01471","version":6},"attestation_state":"computed","paper":{"title":"Erd\\H{o}s Matching (Conjecture) Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Tapas Kumar Mishra","submitted_at":"2026-02-01T22:30:13Z","abstract_excerpt":"Let $\\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets.\n  The Erd\\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum cardinality of $\\mathcal{F}$ is upper bounded by\n  $\\max\\left\\{\\binom{sk-1}{k}, \\binom{n}{k}-\\allowbreak \\binom{n-s+1}{k}\\right\\}$.\n  These two bounds correspond to the sizes of two canonical extremal families: one in which all subsets are contained within a ground set of $sk-1$ elements, and one in which every subset intersects a fixed set of $s-1$ element"},"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":"2602.01471","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-02-01T22:30:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4e38fcef007361c97e59d1c769e5c022d3d679dfb7b73f22a5683e60685157d6","abstract_canon_sha256":"b5c6742cbaa03234f5823ccf97e6d7ef8cc036dca140eabea7da9def67ae27de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:50.505048Z","signature_b64":"u/mBzWLhS5l2IltHc9684I53d8ROIc3t2EIE3n/bt3zCiSV7V5rHoUNp7KYeReBJkuT2olj4WTTfF1UnBrqEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3793ead529d21d6305ed01f2a20b1c489aa3c8ac08eb18d90c8b85dcfc36fd0","last_reissued_at":"2026-06-02T02:04:50.504548Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:50.504548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H{o}s Matching (Conjecture) Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Tapas Kumar Mishra","submitted_at":"2026-02-01T22:30:13Z","abstract_excerpt":"Let $\\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets.\n  The Erd\\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum cardinality of $\\mathcal{F}$ is upper bounded by\n  $\\max\\left\\{\\binom{sk-1}{k}, \\binom{n}{k}-\\allowbreak \\binom{n-s+1}{k}\\right\\}$.\n  These two bounds correspond to the sizes of two canonical extremal families: one in which all subsets are contained within a ground set of $sk-1$ elements, and one in which every subset intersects a fixed set of $s-1$ element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.01471","kind":"arxiv","version":6},"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/2602.01471/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":"2602.01471","created_at":"2026-06-02T02:04:50.504608+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.01471v6","created_at":"2026-06-02T02:04:50.504608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.01471","created_at":"2026-06-02T02:04:50.504608+00:00"},{"alias_kind":"pith_short_12","alias_value":"2N4T5LKSTUQ5","created_at":"2026-06-02T02:04:50.504608+00:00"},{"alias_kind":"pith_short_16","alias_value":"2N4T5LKSTUQ5MMC6","created_at":"2026-06-02T02:04:50.504608+00:00"},{"alias_kind":"pith_short_8","alias_value":"2N4T5LKS","created_at":"2026-06-02T02:04:50.504608+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/2N4T5LKSTUQ5MMC62APSUIFRYS","json":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS.json","graph_json":"https://pith.science/api/pith-number/2N4T5LKSTUQ5MMC62APSUIFRYS/graph.json","events_json":"https://pith.science/api/pith-number/2N4T5LKSTUQ5MMC62APSUIFRYS/events.json","paper":"https://pith.science/paper/2N4T5LKS"},"agent_actions":{"view_html":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS","download_json":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS.json","view_paper":"https://pith.science/paper/2N4T5LKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.01471&json=true","fetch_graph":"https://pith.science/api/pith-number/2N4T5LKSTUQ5MMC62APSUIFRYS/graph.json","fetch_events":"https://pith.science/api/pith-number/2N4T5LKSTUQ5MMC62APSUIFRYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS/action/storage_attestation","attest_author":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS/action/author_attestation","sign_citation":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS/action/citation_signature","submit_replication":"https://pith.science/pith/2N4T5LKSTUQ5MMC62APSUIFRYS/action/replication_record"}},"created_at":"2026-06-02T02:04:50.504608+00:00","updated_at":"2026-06-02T02:04:50.504608+00:00"}