{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SPFBOIJRG7CXAADV6N4NFTQWTT","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":"4b2b2f3e63c55f3652278216efada4062c145701d80933b7163c6508a80d2f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T04:17:44Z","title_canon_sha256":"74bfaf2ffc6a37cc679cc047052e0c8242f5eabd5e66fa5e36a674719e21e2d4"},"schema_version":"1.0","source":{"id":"2606.28727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28727","created_at":"2026-06-30T01:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28727v1","created_at":"2026-06-30T01:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28727","created_at":"2026-06-30T01:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"SPFBOIJRG7CX","created_at":"2026-06-30T01:16:49Z"},{"alias_kind":"pith_short_16","alias_value":"SPFBOIJRG7CXAADV","created_at":"2026-06-30T01:16:49Z"},{"alias_kind":"pith_short_8","alias_value":"SPFBOIJR","created_at":"2026-06-30T01:16:49Z"}],"graph_snapshots":[{"event_id":"sha256:0eae3de08186be18faa40a4672ed24a8df27793a3d13eee9482525675c136cb7","target":"graph","created_at":"2026-06-30T01:16:49Z","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.28727/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is said to be $F$-semi-saturated if the addition of any nonedge $e \\not \\in E(G)$ would create a new copy of $F$ in $G+e$. The semi-saturation number $ssat(n,F)$ is the minimum number of edges in an $F$-semi-saturated graph of order $n$. In this paper we investigate the semi-saturation number of $K_r$ on $n$ vertices with maximal degree at most $\\Delta$, denoted by $ssat^{\\Delta}(n,K_r)$. This investigation was suggested by Erd\\H os, R\\'enyi and S\\'os, who in 1966 considered the graph of diameter 2 with degree restrictions, equivalently $ssat^{\\Delta}(n,K_3)$.\n  The following are s","authors_text":"Mei Lu, Yanzhe Qiu, Yiduo Xu, Zhen He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T04:17:44Z","title":"Degree-restricted semi-saturation numbers of cliques and its applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28727","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:23e5d3489bbea13fda42f12fbf79d5c879bcbad74645aa35f1f000fb6ca228e4","target":"record","created_at":"2026-06-30T01:16:49Z","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":"4b2b2f3e63c55f3652278216efada4062c145701d80933b7163c6508a80d2f74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T04:17:44Z","title_canon_sha256":"74bfaf2ffc6a37cc679cc047052e0c8242f5eabd5e66fa5e36a674719e21e2d4"},"schema_version":"1.0","source":{"id":"2606.28727","kind":"arxiv","version":1}},"canonical_sha256":"93ca17213137c5700075f378d2ce169cdee944a1b8f0050821789c4e0576e130","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93ca17213137c5700075f378d2ce169cdee944a1b8f0050821789c4e0576e130","first_computed_at":"2026-06-30T01:16:49.537652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:16:49.537652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RpeSyuo8zZLWmVRwZC0qHK20qEVgZ0JKSO+O79pMKRuLmNmxbU2kCjwxSN9tily6WAF5t41nLp/RgvAwtWjgAw==","signature_status":"signed_v1","signed_at":"2026-06-30T01:16:49.538167Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23e5d3489bbea13fda42f12fbf79d5c879bcbad74645aa35f1f000fb6ca228e4","sha256:0eae3de08186be18faa40a4672ed24a8df27793a3d13eee9482525675c136cb7"],"state_sha256":"db5b4b70732bb3c7a865f7a783c895edefe9b8819ef9bb58cf7aac4d8e1307b3"}