{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YAHT2UNHEKYAW22VX35NE35RYS","short_pith_number":"pith:YAHT2UNH","schema_version":"1.0","canonical_sha256":"c00f3d51a722b00b6b55befad26fb1c4aa94f07ed26d12fc8e461b4b406e3e8e","source":{"kind":"arxiv","id":"2606.28903","version":1},"attestation_state":"computed","paper":{"title":"All minimum $C_4$-saturated multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mei Lu, Yanzhe Qiu, Yiduo Xu, Zhen He","submitted_at":"2026-06-27T13:18:08Z","abstract_excerpt":"A subgraph $H$ of $G$ is said to be $F$-saturated relative to $G$, if $H$ does not contain any copy of $F$, but the addition of any edge $e$ in $E(G)\\backslash E(H)$ would create a copy of $F$. The minimum size of an $F$-saturated graph relative to $G$ is denoted by $sat(G,F)$. Let $K_k^n$ be the complete $k$-partite graph with $n$ vertices in each part. In this paper, we determine $sat(K_4^n,C_4)$ for all $ n \\geq 2$. Moreover, we determine all extremal configurations of $sat(K_k^n,C_4)$ for all $n\\ge 2$ and $k\\ge 4 $."},"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":"2606.28903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T13:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"1107ffa2759e09fcbd3d7cb744561edcde7dbc981117bc5be76f10d804f4ccf6","abstract_canon_sha256":"e31b72155c7cf1ebd59307494978fb9eab98bcdd74e20079bc118b7fd8d1d79d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:44.461131Z","signature_b64":"fOAS2xOP6H8RLYBHjwabdn9qbwd7+jjLmhjxKwsGc068Vm2udSopi3imXT/DbUVfaHIyjrzW+DmbGQVnaYnpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c00f3d51a722b00b6b55befad26fb1c4aa94f07ed26d12fc8e461b4b406e3e8e","last_reissued_at":"2026-06-30T01:17:44.460587Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:44.460587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All minimum $C_4$-saturated multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mei Lu, Yanzhe Qiu, Yiduo Xu, Zhen He","submitted_at":"2026-06-27T13:18:08Z","abstract_excerpt":"A subgraph $H$ of $G$ is said to be $F$-saturated relative to $G$, if $H$ does not contain any copy of $F$, but the addition of any edge $e$ in $E(G)\\backslash E(H)$ would create a copy of $F$. The minimum size of an $F$-saturated graph relative to $G$ is denoted by $sat(G,F)$. Let $K_k^n$ be the complete $k$-partite graph with $n$ vertices in each part. In this paper, we determine $sat(K_4^n,C_4)$ for all $ n \\geq 2$. Moreover, we determine all extremal configurations of $sat(K_k^n,C_4)$ for all $n\\ge 2$ and $k\\ge 4 $."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28903","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/2606.28903/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":"2606.28903","created_at":"2026-06-30T01:17:44.460648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28903v1","created_at":"2026-06-30T01:17:44.460648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28903","created_at":"2026-06-30T01:17:44.460648+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAHT2UNHEKYA","created_at":"2026-06-30T01:17:44.460648+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAHT2UNHEKYAW22V","created_at":"2026-06-30T01:17:44.460648+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAHT2UNH","created_at":"2026-06-30T01:17:44.460648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS","json":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS.json","graph_json":"https://pith.science/api/pith-number/YAHT2UNHEKYAW22VX35NE35RYS/graph.json","events_json":"https://pith.science/api/pith-number/YAHT2UNHEKYAW22VX35NE35RYS/events.json","paper":"https://pith.science/paper/YAHT2UNH"},"agent_actions":{"view_html":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS","download_json":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS.json","view_paper":"https://pith.science/paper/YAHT2UNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28903&json=true","fetch_graph":"https://pith.science/api/pith-number/YAHT2UNHEKYAW22VX35NE35RYS/graph.json","fetch_events":"https://pith.science/api/pith-number/YAHT2UNHEKYAW22VX35NE35RYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS/action/storage_attestation","attest_author":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS/action/author_attestation","sign_citation":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS/action/citation_signature","submit_replication":"https://pith.science/pith/YAHT2UNHEKYAW22VX35NE35RYS/action/replication_record"}},"created_at":"2026-06-30T01:17:44.460648+00:00","updated_at":"2026-06-30T01:17:44.460648+00:00"}