{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OUWLGZSHA5GY2CMZKAYM7U62QX","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":"b916f182bba20c17324f1927153d6708b09fe761e2f465bb5baf9720634223a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T16:59:24Z","title_canon_sha256":"ef543d033e09e22a29fe3eea68810e0080b6ba92fca3d64f9b81a33922e21409"},"schema_version":"1.0","source":{"id":"2606.09733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09733","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09733v1","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09733","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"OUWLGZSHA5GY","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"OUWLGZSHA5GY2CMZ","created_at":"2026-06-09T02:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"OUWLGZSH","created_at":"2026-06-09T02:09:06Z"}],"graph_snapshots":[{"event_id":"sha256:847053ba4ad507cee2f12ca0d193e6c3e42465015764b90e822b9bf97d974760","target":"graph","created_at":"2026-06-09T02:09:06Z","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/2606.09733/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a clique $K_r$, a graph is $K_r$-saturated if it contains no copy of $K_r$ and the addition of any edge from its complement creates a $K_r$. A classical result of Erd\\H{o}s-Hajnal-Moon and Zykov shows that the number of edges of an $n$-vertex $K_r$-saturated graph is at least $(r-2)n-\\binom{r-1}{2}$. In this paper, we focus on the number of edges of the $K_r$-saturated graphs with a fixed matching number. Let $G$ be an $n$-vertex $K_r$-saturated graph with matching number $\\nu(G) = s$. For sufficiently large $n$, we prove that the number of edges \\begin{equation*}\n  e(G)\\geq \\left\\{\\begin{","authors_text":"Guorong Gao, Jianfeng Hou, Yue Ma, Zian Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T16:59:24Z","title":"On saturation problems involving clique number and matching number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09733","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:0358ed37790e216b12cb6e60e08aceeea3980a642586d022535c99540037380d","target":"record","created_at":"2026-06-09T02:09:06Z","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":"b916f182bba20c17324f1927153d6708b09fe761e2f465bb5baf9720634223a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T16:59:24Z","title_canon_sha256":"ef543d033e09e22a29fe3eea68810e0080b6ba92fca3d64f9b81a33922e21409"},"schema_version":"1.0","source":{"id":"2606.09733","kind":"arxiv","version":1}},"canonical_sha256":"752cb36647074d8d09995030cfd3da85d8f0f8c10c9f506e9c58161ba0f5871c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"752cb36647074d8d09995030cfd3da85d8f0f8c10c9f506e9c58161ba0f5871c","first_computed_at":"2026-06-09T02:09:06.650436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:09:06.650436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7BZxa8/g4g28qIqOH5roUC4l2YXNt9hDRsUuksdMGv5lZ14q32GVJAzVBe0tK9gCjp2At9Q+3VjJoqHwRR5QBQ==","signature_status":"signed_v1","signed_at":"2026-06-09T02:09:06.651400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0358ed37790e216b12cb6e60e08aceeea3980a642586d022535c99540037380d","sha256:847053ba4ad507cee2f12ca0d193e6c3e42465015764b90e822b9bf97d974760"],"state_sha256":"e3d345c179720058716feaf7f35eda70e7d9216026b7587693c0d2d64be283f4"}