{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZEOKRGZXIING3DZLLSIQPXLXTP","short_pith_number":"pith:ZEOKRGZX","schema_version":"1.0","canonical_sha256":"c91ca89b37421a6d8f2b5c9107dd779bc7f3fe59f7a92c72decb902ac2cb7319","source":{"kind":"arxiv","id":"1706.07292","version":1},"attestation_state":"computed","paper":{"title":"Decomposing $C_4$-free graphs under degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianchi Yang","submitted_at":"2017-06-22T12:46:36Z","abstract_excerpt":"A celebrated theorem of Stiebitz asserts that any graph with minimum degree at least $s+t+1$ can be partitioned into two parts which induce two subgraphs with minimum degree at least $s$ and $t$, respectively. This resolved a conjecture of Thomassen. In this paper, we prove that for $s,t\\geq 2$, if a graph $G$ contains no cycle of length four and has minimum degree at least $s+t-1$, then $G$ can be partitioned into two parts which induce two subgraphs with minimum degree at least $s$ and $t$, respectively. This improves the result of Diwan, who proved the same statement for graphs of girth at "},"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":"1706.07292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-22T12:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"d7ad5b288c3ab59170f3894dc6a7cd0c1561798ab23022958c5298fdc2ab1e0d","abstract_canon_sha256":"9516a88b81c420680df867fbdbc48e6e654d479b8dc4a06356467abb0faefe83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:52.042353Z","signature_b64":"tpiA+l8heJMmKQG60Lrwoiw5rr2xCKF06tkoPWp0gh10amVfNAlg2R7pCei8dPiK3sE1IDlDT0TxYmnAncSjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c91ca89b37421a6d8f2b5c9107dd779bc7f3fe59f7a92c72decb902ac2cb7319","last_reissued_at":"2026-05-18T00:41:52.041710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:52.041710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing $C_4$-free graphs under degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianchi Yang","submitted_at":"2017-06-22T12:46:36Z","abstract_excerpt":"A celebrated theorem of Stiebitz asserts that any graph with minimum degree at least $s+t+1$ can be partitioned into two parts which induce two subgraphs with minimum degree at least $s$ and $t$, respectively. This resolved a conjecture of Thomassen. In this paper, we prove that for $s,t\\geq 2$, if a graph $G$ contains no cycle of length four and has minimum degree at least $s+t-1$, then $G$ can be partitioned into two parts which induce two subgraphs with minimum degree at least $s$ and $t$, respectively. This improves the result of Diwan, who proved the same statement for graphs of girth at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07292","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":""},"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":"1706.07292","created_at":"2026-05-18T00:41:52.041801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07292v1","created_at":"2026-05-18T00:41:52.041801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07292","created_at":"2026-05-18T00:41:52.041801+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEOKRGZXIING","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEOKRGZXIING3DZL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEOKRGZX","created_at":"2026-05-18T12:31:59.375834+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/ZEOKRGZXIING3DZLLSIQPXLXTP","json":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP.json","graph_json":"https://pith.science/api/pith-number/ZEOKRGZXIING3DZLLSIQPXLXTP/graph.json","events_json":"https://pith.science/api/pith-number/ZEOKRGZXIING3DZLLSIQPXLXTP/events.json","paper":"https://pith.science/paper/ZEOKRGZX"},"agent_actions":{"view_html":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP","download_json":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP.json","view_paper":"https://pith.science/paper/ZEOKRGZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07292&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEOKRGZXIING3DZLLSIQPXLXTP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEOKRGZXIING3DZLLSIQPXLXTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP/action/storage_attestation","attest_author":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP/action/author_attestation","sign_citation":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP/action/citation_signature","submit_replication":"https://pith.science/pith/ZEOKRGZXIING3DZLLSIQPXLXTP/action/replication_record"}},"created_at":"2026-05-18T00:41:52.041801+00:00","updated_at":"2026-05-18T00:41:52.041801+00:00"}