{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MG7RNZKEC2BMDX3ND2GFUCMLU4","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":"e4fd61bf75bbefbce5bca4a459d7fecfc8a16c56912d6632fdeaa65f70beae1a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-26T19:16:02Z","title_canon_sha256":"5cce70669f2078b9b7d3d2aef5bd74a05acb70fb2c830b3c8f9104cf0856b7d7"},"schema_version":"1.0","source":{"id":"2302.13389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.13389","created_at":"2026-07-05T05:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"2302.13389v1","created_at":"2026-07-05T05:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13389","created_at":"2026-07-05T05:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"MG7RNZKEC2BM","created_at":"2026-07-05T05:45:46Z"},{"alias_kind":"pith_short_16","alias_value":"MG7RNZKEC2BMDX3N","created_at":"2026-07-05T05:45:46Z"},{"alias_kind":"pith_short_8","alias_value":"MG7RNZKE","created_at":"2026-07-05T05:45:46Z"}],"graph_snapshots":[{"event_id":"sha256:c8c19a1643424601b7b25e8c086c167c2bbedcfcb9033eb939f839b4edc8a4cf","target":"graph","created_at":"2026-07-05T05:45:46Z","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/2302.13389/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $H$, we say that a graph $G$ is $H$-saturated if $G$ contains no copy of $H$ but adding any new edge to $G$ creates a copy of $H$. Let $sat(n,K_r,t)$ be the minimum number of edges in a $K_r$-saturated graph on $n$ vertices with minimum degree at least $t$. Day showed that for fixed $r \\geq 3$ and $t \\geq r-2$, $sat(n,K_r,t)=tn-c(r,t)$ for large enough $n$, where $c(r,t)$ is a constant depending on $r$ and $t$, and proved the bounds\n  $$ 2^t t^{3/2} \\ll_r c(r,t) \\leq t^{t^{2t^2}} $$\n  for fixed $r$ and large $t$. In this paper we show that for fixed $r$ and large $t$, the order o","authors_text":"Asier Calbet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-26T19:16:02Z","title":"$K_r$-saturated Graphs and the Two Families Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13389","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:2c4af75c0bd445e7397ee208194a9c2197a7338d21dd9778e59a3963b2e57141","target":"record","created_at":"2026-07-05T05:45:46Z","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":"e4fd61bf75bbefbce5bca4a459d7fecfc8a16c56912d6632fdeaa65f70beae1a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-26T19:16:02Z","title_canon_sha256":"5cce70669f2078b9b7d3d2aef5bd74a05acb70fb2c830b3c8f9104cf0856b7d7"},"schema_version":"1.0","source":{"id":"2302.13389","kind":"arxiv","version":1}},"canonical_sha256":"61bf16e5441682c1df6d1e8c5a098ba73929210ee902484f813bc78478bd8a31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61bf16e5441682c1df6d1e8c5a098ba73929210ee902484f813bc78478bd8a31","first_computed_at":"2026-07-05T05:45:46.401815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:46.401815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F/CXIoimX5NxbtxVGlC5fN0wWEbSw7gQ/ZwYunrxNtEy+Cj/ZQXNegLBPvfjIg4BurMFt6INnNxOFeDr5MGeBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:46.402202Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.13389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c4af75c0bd445e7397ee208194a9c2197a7338d21dd9778e59a3963b2e57141","sha256:c8c19a1643424601b7b25e8c086c167c2bbedcfcb9033eb939f839b4edc8a4cf"],"state_sha256":"2f102a9094b885523e2b6a5db04f249465b673cfc6e183b6556ccaebb3446118"}