{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NLUVDGDJYWI72HREHGLFHZKVRN","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":"07baa98cbc5ec88a16f067a307e3777b4ba95db4495601a315407b9ea772315b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T02:10:39Z","title_canon_sha256":"70a463be5cd1249e38d9a66d8df08f7401fca9778e282e6d101075bf5c1cae89"},"schema_version":"1.0","source":{"id":"1401.2696","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2696","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2696v2","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2696","created_at":"2026-05-18T01:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"NLUVDGDJYWI7","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NLUVDGDJYWI72HRE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NLUVDGDJ","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:e13d3ce422cdc6f17c1bab102147cab45d0a7bc3f31b343539665d100cc9e742","target":"graph","created_at":"2026-05-18T01:36:20Z","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":"Given $k\\ge 1$, a $k$-proper partition of a graph $G$ is a partition ${\\mathcal P}$ of $V(G)$ such that each part $P$ of ${\\mathcal P}$ induces a $k$-connected subgraph of $G$. We prove that if $G$ is a graph of order $n$ such that $\\delta(G)\\ge \\sqrt{n}$, then $G$ has a $2$-proper partition with at most $n/\\delta(G)$ parts. The bounds on the number of parts and the minimum degree are both best possible. We then prove that If $G$ is a graph of order $n$ with minimum degree $\\delta(G)\\ge\\sqrt{c(k-1)n}$, where $c=\\frac{2123}{180}$, then $G$ has a $k$-proper partition into at most $\\frac{cn}{\\del","authors_text":"Derrick Stolee, Michael Ferrara, Michitaka Furuya, N. Narayanan, Shinya Fujita, Valentin Borozan, Yannis Manoussakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T02:10:39Z","title":"Partitioning a graph into highly connected subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2696","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:873fe03488da0f2e2413c86eefe3e4c5a9aa830ed4155d0f6b2a1e05047871e0","target":"record","created_at":"2026-05-18T01:36:20Z","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":"07baa98cbc5ec88a16f067a307e3777b4ba95db4495601a315407b9ea772315b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T02:10:39Z","title_canon_sha256":"70a463be5cd1249e38d9a66d8df08f7401fca9778e282e6d101075bf5c1cae89"},"schema_version":"1.0","source":{"id":"1401.2696","kind":"arxiv","version":2}},"canonical_sha256":"6ae9519869c591fd1e24399653e5558b6662e4ab476b48803a7d69cfc6a0c641","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ae9519869c591fd1e24399653e5558b6662e4ab476b48803a7d69cfc6a0c641","first_computed_at":"2026-05-18T01:36:20.896742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:20.896742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cjIZRQzaqycu7Z43tsbbTWk833hxr3A34LHl/bXUTK0ObnrZhxMxiL/d8mw62kvE2JIL6ruYaiJ5ipSq1ttyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:20.897275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2696","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:873fe03488da0f2e2413c86eefe3e4c5a9aa830ed4155d0f6b2a1e05047871e0","sha256:e13d3ce422cdc6f17c1bab102147cab45d0a7bc3f31b343539665d100cc9e742"],"state_sha256":"a0f0a24f673d7c3f3ab392f634c468104922ea60d4227b70433d7833297ed2e7"}