{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RQZT2AHZQYVHQWVRECKTRYWV4R","short_pith_number":"pith:RQZT2AHZ","schema_version":"1.0","canonical_sha256":"8c333d00f9862a785ab1209538e2d5e464707a63aff2e848310215855acd02c8","source":{"kind":"arxiv","id":"2306.08217","version":1},"attestation_state":"computed","paper":{"title":"Partitioning graphs with linear minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Jie Ma","submitted_at":"2023-06-14T03:11:55Z","abstract_excerpt":"We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at least $k$, and every vertex in $S$ has at least $k$ neighbors in $T$. This confirms a question posted by K\\\"uhn and Osthus and is tight up to a constant factor. Our proof combines probabilistic methods with structural arguments based on Ore's Theorem on $f$-factors of bipartite graphs."},"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":"2306.08217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-14T03:11:55Z","cross_cats_sorted":[],"title_canon_sha256":"c93a78316f333bfae85ac30b565d6778ee16cf838493a4a5f849b8bc54da8459","abstract_canon_sha256":"0fa5f188d21c3c06f7111ce18748e251701127aa50b6dc2a3b646d02b969849c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:49.440076Z","signature_b64":"hNTN/o0nedctPu5fPXWp3ZS2LJBo/WHtglbGZ/he/qEjRFcpVLhdAodVH1ABKjG5BrlIbQMSKa8argv4wyi1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c333d00f9862a785ab1209538e2d5e464707a63aff2e848310215855acd02c8","last_reissued_at":"2026-07-05T06:20:49.439606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:49.439606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning graphs with linear minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Jie Ma","submitted_at":"2023-06-14T03:11:55Z","abstract_excerpt":"We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at least $k$, and every vertex in $S$ has at least $k$ neighbors in $T$. This confirms a question posted by K\\\"uhn and Osthus and is tight up to a constant factor. Our proof combines probabilistic methods with structural arguments based on Ore's Theorem on $f$-factors of bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08217","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/2306.08217/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":"2306.08217","created_at":"2026-07-05T06:20:49.439666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08217v1","created_at":"2026-07-05T06:20:49.439666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08217","created_at":"2026-07-05T06:20:49.439666+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQZT2AHZQYVH","created_at":"2026-07-05T06:20:49.439666+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQZT2AHZQYVHQWVR","created_at":"2026-07-05T06:20:49.439666+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQZT2AHZ","created_at":"2026-07-05T06:20:49.439666+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/RQZT2AHZQYVHQWVRECKTRYWV4R","json":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R.json","graph_json":"https://pith.science/api/pith-number/RQZT2AHZQYVHQWVRECKTRYWV4R/graph.json","events_json":"https://pith.science/api/pith-number/RQZT2AHZQYVHQWVRECKTRYWV4R/events.json","paper":"https://pith.science/paper/RQZT2AHZ"},"agent_actions":{"view_html":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R","download_json":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R.json","view_paper":"https://pith.science/paper/RQZT2AHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08217&json=true","fetch_graph":"https://pith.science/api/pith-number/RQZT2AHZQYVHQWVRECKTRYWV4R/graph.json","fetch_events":"https://pith.science/api/pith-number/RQZT2AHZQYVHQWVRECKTRYWV4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/action/storage_attestation","attest_author":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/action/author_attestation","sign_citation":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/action/citation_signature","submit_replication":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/action/replication_record"}},"created_at":"2026-07-05T06:20:49.439666+00:00","updated_at":"2026-07-05T06:20:49.439666+00:00"}