{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MG7RNZKEC2BMDX3ND2GFUCMLU4","short_pith_number":"pith:MG7RNZKE","schema_version":"1.0","canonical_sha256":"61bf16e5441682c1df6d1e8c5a098ba73929210ee902484f813bc78478bd8a31","source":{"kind":"arxiv","id":"2302.13389","version":1},"attestation_state":"computed","paper":{"title":"$K_r$-saturated Graphs and the Two Families Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asier Calbet","submitted_at":"2023-02-26T19:16:02Z","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"},"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":"2302.13389","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-26T19:16:02Z","cross_cats_sorted":[],"title_canon_sha256":"5cce70669f2078b9b7d3d2aef5bd74a05acb70fb2c830b3c8f9104cf0856b7d7","abstract_canon_sha256":"e4fd61bf75bbefbce5bca4a459d7fecfc8a16c56912d6632fdeaa65f70beae1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:46.402202Z","signature_b64":"F/CXIoimX5NxbtxVGlC5fN0wWEbSw7gQ/ZwYunrxNtEy+Cj/ZQXNegLBPvfjIg4BurMFt6INnNxOFeDr5MGeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61bf16e5441682c1df6d1e8c5a098ba73929210ee902484f813bc78478bd8a31","last_reissued_at":"2026-07-05T05:45:46.401815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:46.401815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$K_r$-saturated Graphs and the Two Families Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asier Calbet","submitted_at":"2023-02-26T19:16:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13389","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/2302.13389/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":"2302.13389","created_at":"2026-07-05T05:45:46.401876+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.13389v1","created_at":"2026-07-05T05:45:46.401876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13389","created_at":"2026-07-05T05:45:46.401876+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG7RNZKEC2BM","created_at":"2026-07-05T05:45:46.401876+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG7RNZKEC2BMDX3N","created_at":"2026-07-05T05:45:46.401876+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG7RNZKE","created_at":"2026-07-05T05:45:46.401876+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.19267","citing_title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4","json":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4.json","graph_json":"https://pith.science/api/pith-number/MG7RNZKEC2BMDX3ND2GFUCMLU4/graph.json","events_json":"https://pith.science/api/pith-number/MG7RNZKEC2BMDX3ND2GFUCMLU4/events.json","paper":"https://pith.science/paper/MG7RNZKE"},"agent_actions":{"view_html":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4","download_json":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4.json","view_paper":"https://pith.science/paper/MG7RNZKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.13389&json=true","fetch_graph":"https://pith.science/api/pith-number/MG7RNZKEC2BMDX3ND2GFUCMLU4/graph.json","fetch_events":"https://pith.science/api/pith-number/MG7RNZKEC2BMDX3ND2GFUCMLU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4/action/storage_attestation","attest_author":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4/action/author_attestation","sign_citation":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4/action/citation_signature","submit_replication":"https://pith.science/pith/MG7RNZKEC2BMDX3ND2GFUCMLU4/action/replication_record"}},"created_at":"2026-07-05T05:45:46.401876+00:00","updated_at":"2026-07-05T05:45:46.401876+00:00"}