{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TMNME7N6MBYCSROZ5KJBF65I3S","short_pith_number":"pith:TMNME7N6","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"},"canonical_sha256":"9b1ac27dbe60702945d9ea9212fba8dcb92d0ceec1d73d125b8227e3840ed273","source":{"kind":"arxiv","id":"2607.07392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07392","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07392v1","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07392","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"TMNME7N6MBYC","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_16","alias_value":"TMNME7N6MBYCSROZ","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_8","alias_value":"TMNME7N6","created_at":"2026-07-09T01:20:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TMNME7N6MBYCSROZ5KJBF65I3S","target":"record","payload":{"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"},"canonical_sha256":"9b1ac27dbe60702945d9ea9212fba8dcb92d0ceec1d73d125b8227e3840ed273","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"},"source_kind":"arxiv","source_id":"2607.07392","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-09T01:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbPaTMJBs6B+j94J9FSEKa/4pJIbUhneAE6iGNVbjPH2u872tfv/V/m4rpn1fPOsJVWaPsEXzwftZdtKD1tdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:47:46.857780Z"},"content_sha256":"2b40352f17cc62446b2df58c80c199c134408d812733410f8fe298ea00cd1574","schema_version":"1.0","event_id":"sha256:2b40352f17cc62446b2df58c80c199c134408d812733410f8fe298ea00cd1574"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TMNME7N6MBYCSROZ5KJBF65I3S","target":"graph","payload":{"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"},"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-09T01:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgnEL0t5A27+pCdR1Vk5njFv/awScfYuqHDputt2U8oJ0O5v6u3L//+4GbU/shEo/ha74+dAKAZEeG6TdXEyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:47:46.858740Z"},"content_sha256":"ea8f29f086d375b4218fc7d61eb15f01facaa611f2fc1024f307f64266ecef5e","schema_version":"1.0","event_id":"sha256:ea8f29f086d375b4218fc7d61eb15f01facaa611f2fc1024f307f64266ecef5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/bundle.json","state_url":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMNME7N6MBYCSROZ5KJBF65I3S/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-13T18:47:46Z","links":{"resolver":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S","bundle":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/bundle.json","state":"https://pith.science/pith/TMNME7N6MBYCSROZ5KJBF65I3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMNME7N6MBYCSROZ5KJBF65I3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TMNME7N6MBYCSROZ5KJBF65I3S","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":"c3cd1a77da962bbd8ab32666206ec726743cc306ab5c85a30471726866f94445","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:24:14Z","title_canon_sha256":"f43da5eff186147c0bd6d9bed2bee1425f8c5723edf7c1bb61ec6948665fb802"},"schema_version":"1.0","source":{"id":"2607.07392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07392","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07392v1","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07392","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"TMNME7N6MBYC","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_16","alias_value":"TMNME7N6MBYCSROZ","created_at":"2026-07-09T01:20:23Z"},{"alias_kind":"pith_short_8","alias_value":"TMNME7N6","created_at":"2026-07-09T01:20:23Z"}],"graph_snapshots":[{"event_id":"sha256:ea8f29f086d375b4218fc7d61eb15f01facaa611f2fc1024f307f64266ecef5e","target":"graph","created_at":"2026-07-09T01:20:23Z","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/2607.07392/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Junpeng Zhou, Liying Kang, Xiying Yuan, Yongchun Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:24:14Z","title":"A Spectral Confirmation of the Erd\\H{o}s Matching Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07392","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:2b40352f17cc62446b2df58c80c199c134408d812733410f8fe298ea00cd1574","target":"record","created_at":"2026-07-09T01:20:23Z","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":"c3cd1a77da962bbd8ab32666206ec726743cc306ab5c85a30471726866f94445","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T13:24:14Z","title_canon_sha256":"f43da5eff186147c0bd6d9bed2bee1425f8c5723edf7c1bb61ec6948665fb802"},"schema_version":"1.0","source":{"id":"2607.07392","kind":"arxiv","version":1}},"canonical_sha256":"9b1ac27dbe60702945d9ea9212fba8dcb92d0ceec1d73d125b8227e3840ed273","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b1ac27dbe60702945d9ea9212fba8dcb92d0ceec1d73d125b8227e3840ed273","first_computed_at":"2026-07-09T01:20:23.732867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:23.732867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r3e/dNUjX3QTh2NDFAjGmQQ6dvwW511sypL5s5RGCzWl2MDBEjkgxJzsk+QImopp7buv8sLXCwJEdwIwkDsoBw==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:23.733280Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b40352f17cc62446b2df58c80c199c134408d812733410f8fe298ea00cd1574","sha256:ea8f29f086d375b4218fc7d61eb15f01facaa611f2fc1024f307f64266ecef5e"],"state_sha256":"41f070d030099e1a20edbcdb0cd226a10b1511f6a77bfe58c20ef2dd392dedc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Azcjp8UdfnkJQ+XUEEHUQGTDV/kKjQr1G9Nqx5NU0DEWDck/nORR/dwTTMl5WDMFgK5sHHh6T+iOdS2q3HR5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T18:47:46.889937Z","bundle_sha256":"bec52b0c87a033321bd2c144aea424bc79fc5bb40d10e96403e2c64d1ac55322"}}