{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E7IX5AAA7S6GRSR3QGR54IP4SU","short_pith_number":"pith:E7IX5AAA","canonical_record":{"source":{"id":"1811.07482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-19T03:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"d3d61eefcc50216127856b96063dabe90e9496a47bba1b1d9e1151631b234b77","abstract_canon_sha256":"c9e6bd16f4ea8063611c134800cc42c08641728adb3a32d118e18041ea34e77e"},"schema_version":"1.0"},"canonical_sha256":"27d17e8000fcbc68ca3b81a3de21fc953b50e9d9d12d511e44e53c3ad4304849","source":{"kind":"arxiv","id":"1811.07482","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E7IX5AAA7S6GRSR3QGR54IP4SU","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-19T03:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"d3d61eefcc50216127856b96063dabe90e9496a47bba1b1d9e1151631b234b77","abstract_canon_sha256":"c9e6bd16f4ea8063611c134800cc42c08641728adb3a32d118e18041ea34e77e"},"schema_version":"1.0"},"canonical_sha256":"27d17e8000fcbc68ca3b81a3de21fc953b50e9d9d12d511e44e53c3ad4304849","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:50.489479Z","signature_b64":"Ju7fYRoOcQQfyi0PHjlf34tz7Hy0OTOtHW9MpGQVtzHl3H2eSUwJM+wY3ElaSKeSxNHmOtJt7m9e0EwM/KKMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d17e8000fcbc68ca3b81a3de21fc953b50e9d9d12d511e44e53c3ad4304849","last_reissued_at":"2026-05-17T23:43:50.488876Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:50.488876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07482","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9N9csfM+Qp0d3drwil9lIshA+jjqIhkIA0JxYPH7pwzuK2Bq9A8Epx7FBj2BJCZdN0E19vI+w46MTyAlR4cCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:44:54.213202Z"},"content_sha256":"f12bfecd9d86f3e16f401c27cbaae0bb4bb12bd8ca032a0d9e366a46306ff372","schema_version":"1.0","event_id":"sha256:f12bfecd9d86f3e16f401c27cbaae0bb4bb12bd8ca032a0d9e366a46306ff372"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E7IX5AAA7S6GRSR3QGR54IP4SU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum degree condition for a graph to be knitted","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Martin Rolek, Runrun Liu","submitted_at":"2018-11-19T03:34:21Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07482","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+aOGv2b24k7rwKZKRh5uRjEMWJIXv8LA+lD3/ytGo1KajR79raY8QanudZJgmgg9jL28KKxlVlXb6LsCRW2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:44:54.213548Z"},"content_sha256":"45e2cc2005addce0c27fb739e4f76ca900b90806429a3226969e600bc4ffb75f","schema_version":"1.0","event_id":"sha256:45e2cc2005addce0c27fb739e4f76ca900b90806429a3226969e600bc4ffb75f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7IX5AAA7S6GRSR3QGR54IP4SU/bundle.json","state_url":"https://pith.science/pith/E7IX5AAA7S6GRSR3QGR54IP4SU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7IX5AAA7S6GRSR3QGR54IP4SU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T09:44:54Z","links":{"resolver":"https://pith.science/pith/E7IX5AAA7S6GRSR3QGR54IP4SU","bundle":"https://pith.science/pith/E7IX5AAA7S6GRSR3QGR54IP4SU/bundle.json","state":"https://pith.science/pith/E7IX5AAA7S6GRSR3QGR54IP4SU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7IX5AAA7S6GRSR3QGR54IP4SU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nd6Teec6Y60MNZihL+H/62HcmepJSjrQFIP6RZnItAcZoiSJ4fx0B3Zr1r/tVq4oowrjbHk1ea99qKz/GTifBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:44:54.225009Z","bundle_sha256":"f209d0e681a7f7dd9716d69916a9b8251ad1ebbb2d377b748f5874713b13552a"}}