{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TMNME7N6MBYCSROZ5KJBF65I3S","short_pith_number":"pith:TMNME7N6","schema_version":"1.0","canonical_sha256":"9b1ac27dbe60702945d9ea9212fba8dcb92d0ceec1d73d125b8227e3840ed273","source":{"kind":"arxiv","id":"2607.07392","version":1},"attestation_state":"computed","paper":{"title":"A Spectral Confirmation of the Erd\\H{o}s Matching Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Junpeng Zhou, Liying Kang, Xiying Yuan, Yongchun Lu","submitted_at":"2026-07-08T13:24:14Z","abstract_excerpt":"The Erd\\H{o}s Matching Conjecture concerns the maximum number of hyperedges in an $r$-uniform hypergraph with bounded matching number. In this paper, we study a spectral counterpart of this conjecture. For sufficiently large $n$, we determine the maximum spectral radius over all $n$-vertex $r$-uniform hypergraphs whose matching number is less than $s$, and characterize the unique extremal hypergraph.\n  To establish the main theorem, we first apply the shifting method to reduce the problem to shifted hypergraphs. We then derive several spectral upper bounds through hypergraph decomposition and "},"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":"2607.07392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"f43da5eff186147c0bd6d9bed2bee1425f8c5723edf7c1bb61ec6948665fb802","abstract_canon_sha256":"c3cd1a77da962bbd8ab32666206ec726743cc306ab5c85a30471726866f94445"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:23.733280Z","signature_b64":"r3e/dNUjX3QTh2NDFAjGmQQ6dvwW511sypL5s5RGCzWl2MDBEjkgxJzsk+QImopp7buv8sLXCwJEdwIwkDsoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b1ac27dbe60702945d9ea9212fba8dcb92d0ceec1d73d125b8227e3840ed273","last_reissued_at":"2026-07-09T01:20:23.732867Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:23.732867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Spectral Confirmation of the Erd\\H{o}s Matching Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Junpeng Zhou, Liying Kang, Xiying Yuan, Yongchun Lu","submitted_at":"2026-07-08T13:24:14Z","abstract_excerpt":"The Erd\\H{o}s Matching Conjecture concerns the maximum number of hyperedges in an $r$-uniform hypergraph with bounded matching number. In this paper, we study a spectral counterpart of this conjecture. For sufficiently large $n$, we determine the maximum spectral radius over all $n$-vertex $r$-uniform hypergraphs whose matching number is less than $s$, and characterize the unique extremal hypergraph.\n  To establish the main theorem, we first apply the shifting method to reduce the problem to shifted hypergraphs. We then derive several spectral upper bounds through hypergraph decomposition and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07392","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/2607.07392/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":"2607.07392","created_at":"2026-07-09T01:20:23.732927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07392v1","created_at":"2026-07-09T01:20:23.732927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07392","created_at":"2026-07-09T01:20:23.732927+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMNME7N6MBYC","created_at":"2026-07-09T01:20:23.732927+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMNME7N6MBYCSROZ","created_at":"2026-07-09T01:20:23.732927+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMNME7N6","created_at":"2026-07-09T01:20:23.732927+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06810","citing_title":"A Spectral Hilton--Milner--Frankl Theorem for $t$-Intersecting Families","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S","json":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S.json","graph_json":"https://pith.science/api/pith-number/TMNME7N6MBYCSROZ5KJBF65I3S/graph.json","events_json":"https://pith.science/api/pith-number/TMNME7N6MBYCSROZ5KJBF65I3S/events.json","paper":"https://pith.science/paper/TMNME7N6"},"agent_actions":{"view_html":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S","download_json":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S.json","view_paper":"https://pith.science/paper/TMNME7N6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07392&json=true","fetch_graph":"https://pith.science/api/pith-number/TMNME7N6MBYCSROZ5KJBF65I3S/graph.json","fetch_events":"https://pith.science/api/pith-number/TMNME7N6MBYCSROZ5KJBF65I3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/action/storage_attestation","attest_author":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/action/author_attestation","sign_citation":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/action/citation_signature","submit_replication":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/action/replication_record"}},"created_at":"2026-07-09T01:20:23.732927+00:00","updated_at":"2026-07-09T01:20:23.732927+00:00"}