{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E7IX5AAA7S6GRSR3QGR54IP4SU","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":"c9e6bd16f4ea8063611c134800cc42c08641728adb3a32d118e18041ea34e77e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-19T03:34:21Z","title_canon_sha256":"d3d61eefcc50216127856b96063dabe90e9496a47bba1b1d9e1151631b234b77"},"schema_version":"1.0","source":{"id":"1811.07482","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07482","created_at":"2026-05-17T23:43:50Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07482v2","created_at":"2026-05-17T23:43:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07482","created_at":"2026-05-17T23:43:50Z"},{"alias_kind":"pith_short_12","alias_value":"E7IX5AAA7S6G","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"E7IX5AAA7S6GRSR3","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"E7IX5AAA","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:45e2cc2005addce0c27fb739e4f76ca900b90806429a3226969e600bc4ffb75f","target":"graph","created_at":"2026-05-17T23:43:50Z","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"},"paper":{"abstract_excerpt":"For a positive integer $k$, a graph is $k$-knitted if for each $k$-subset $S$ of vertices, and every partition of $S$ into disjoint parts $S_1, \\ldots, S_t$ for some $t\\ge 1$, one can find disjoint connected subgraphs $C_1, \\ldots, C_t$ such that $C_i$ contains $S_i$ for each $i$. In this article, we show that if the minimum degree of an $n$-vertex graph $G$ is at least $n/2+k/2-1$ when $n\\ge 2k+3$, then $G$ is $k$-knitted. The minimum degree is sharp. As a corollary, we obtain that $k$-contraction-critical graphs are $\\left\\lceil\\frac{k}{8}\\right\\rceil$-connected.","authors_text":"Gexin Yu, Martin Rolek, Runrun Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-19T03:34:21Z","title":"Minimum degree condition for a graph to be knitted"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07482","kind":"arxiv","version":2},"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:f12bfecd9d86f3e16f401c27cbaae0bb4bb12bd8ca032a0d9e366a46306ff372","target":"record","created_at":"2026-05-17T23:43:50Z","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":"c9e6bd16f4ea8063611c134800cc42c08641728adb3a32d118e18041ea34e77e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-19T03:34:21Z","title_canon_sha256":"d3d61eefcc50216127856b96063dabe90e9496a47bba1b1d9e1151631b234b77"},"schema_version":"1.0","source":{"id":"1811.07482","kind":"arxiv","version":2}},"canonical_sha256":"27d17e8000fcbc68ca3b81a3de21fc953b50e9d9d12d511e44e53c3ad4304849","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d17e8000fcbc68ca3b81a3de21fc953b50e9d9d12d511e44e53c3ad4304849","first_computed_at":"2026-05-17T23:43:50.488876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:50.488876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ju7fYRoOcQQfyi0PHjlf34tz7Hy0OTOtHW9MpGQVtzHl3H2eSUwJM+wY3ElaSKeSxNHmOtJt7m9e0EwM/KKMDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:50.489479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07482","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f12bfecd9d86f3e16f401c27cbaae0bb4bb12bd8ca032a0d9e366a46306ff372","sha256:45e2cc2005addce0c27fb739e4f76ca900b90806429a3226969e600bc4ffb75f"],"state_sha256":"2ea864c4e81cb6e1ca4f24f3adabc23d16079d5ac3098240e5e2f2084dfba89a"}