{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OTY27QIJ4GEW5VZ2BLESBDS6H7","short_pith_number":"pith:OTY27QIJ","canonical_record":{"source":{"id":"1406.1671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T12:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"4ad04f3d1f83997bd54806c4438b6244694e7fdf0a86a87740e03a6e683cf7f6","abstract_canon_sha256":"d4b1685e2e3080f5847af6a79a13235a671cde08c2324501d924e6f23be86c1b"},"schema_version":"1.0"},"canonical_sha256":"74f1afc109e1896ed73a0ac9208e5e3fe4c93a59f5f7594b39c903b9ed8f18b7","source":{"kind":"arxiv","id":"1406.1671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1671","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1671v1","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1671","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"OTY27QIJ4GEW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTY27QIJ4GEW5VZ2","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTY27QIJ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OTY27QIJ4GEW5VZ2BLESBDS6H7","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T12:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"4ad04f3d1f83997bd54806c4438b6244694e7fdf0a86a87740e03a6e683cf7f6","abstract_canon_sha256":"d4b1685e2e3080f5847af6a79a13235a671cde08c2324501d924e6f23be86c1b"},"schema_version":"1.0"},"canonical_sha256":"74f1afc109e1896ed73a0ac9208e5e3fe4c93a59f5f7594b39c903b9ed8f18b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:20.526216Z","signature_b64":"LLzVa7mWWz5jFGPmh9UkIfDBHsgCdefJ1uRCfb34RkMz3AHzyrwT0OYQpx4GB6up+ea3ybfQltBRCdZc7QuXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74f1afc109e1896ed73a0ac9208e5e3fe4c93a59f5f7594b39c903b9ed8f18b7","last_reissued_at":"2026-05-18T01:00:20.525474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:20.525474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1671","source_version":1,"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-18T01:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kmrs92bVimElx3JbPSwQMV+Y61GGhba5fHPwAKQuesDv8g5zIN4KYTTB0N+Bhs6DUEmlbGJQWLwQ85cRVIENCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:16:31.177464Z"},"content_sha256":"6cd16200354ac8b44b904222d404beefc3059b58a986f02b8f10e27370ea06a5","schema_version":"1.0","event_id":"sha256:6cd16200354ac8b44b904222d404beefc3059b58a986f02b8f10e27370ea06a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OTY27QIJ4GEW5VZ2BLESBDS6H7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Isolating highly connected induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irena Penev, Nicolas Trotignon, St\\'ephan Thomass\\'e","submitted_at":"2014-06-06T12:53:13Z","abstract_excerpt":"We prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+1)$-connected induced subgraph $H$ such that the number of vertices of $H$ that have neighbors outside of $H$ is at most $2k^2-1$. This generalizes a classical result of Mader, which states that a high minimum degree implies the existence of a highly connected subgraph. We give several variants of our result, and for each of these variants, we give asymptotics for the bounds. We also we compute optimal values for the case when $k=2$. Alon, Kleitman, Saks, Seymour, and Thomassen proved that in a graph of high chromati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1671","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"},"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-18T01:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKp3R9naoJYYvGPmvY2fhZaOSmf9yUqGJJF+9XEV0h0zuX9xoZZr9b32nKCQNOWo5M1JGchBEDkq9Jo8X73PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:16:31.177813Z"},"content_sha256":"a98c16303d7bb92b44e25cfcb53dd1582b884ad836961ee5c16f274a54893be4","schema_version":"1.0","event_id":"sha256:a98c16303d7bb92b44e25cfcb53dd1582b884ad836961ee5c16f274a54893be4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTY27QIJ4GEW5VZ2BLESBDS6H7/bundle.json","state_url":"https://pith.science/pith/OTY27QIJ4GEW5VZ2BLESBDS6H7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTY27QIJ4GEW5VZ2BLESBDS6H7/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-07-04T18:16:31Z","links":{"resolver":"https://pith.science/pith/OTY27QIJ4GEW5VZ2BLESBDS6H7","bundle":"https://pith.science/pith/OTY27QIJ4GEW5VZ2BLESBDS6H7/bundle.json","state":"https://pith.science/pith/OTY27QIJ4GEW5VZ2BLESBDS6H7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTY27QIJ4GEW5VZ2BLESBDS6H7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OTY27QIJ4GEW5VZ2BLESBDS6H7","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":"d4b1685e2e3080f5847af6a79a13235a671cde08c2324501d924e6f23be86c1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T12:53:13Z","title_canon_sha256":"4ad04f3d1f83997bd54806c4438b6244694e7fdf0a86a87740e03a6e683cf7f6"},"schema_version":"1.0","source":{"id":"1406.1671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1671","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1671v1","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1671","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"OTY27QIJ4GEW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTY27QIJ4GEW5VZ2","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTY27QIJ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:a98c16303d7bb92b44e25cfcb53dd1582b884ad836961ee5c16f274a54893be4","target":"graph","created_at":"2026-05-18T01:00: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":"We prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+1)$-connected induced subgraph $H$ such that the number of vertices of $H$ that have neighbors outside of $H$ is at most $2k^2-1$. This generalizes a classical result of Mader, which states that a high minimum degree implies the existence of a highly connected subgraph. We give several variants of our result, and for each of these variants, we give asymptotics for the bounds. We also we compute optimal values for the case when $k=2$. Alon, Kleitman, Saks, Seymour, and Thomassen proved that in a graph of high chromati","authors_text":"Irena Penev, Nicolas Trotignon, St\\'ephan Thomass\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T12:53:13Z","title":"Isolating highly connected induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1671","kind":"arxiv","version":1},"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:6cd16200354ac8b44b904222d404beefc3059b58a986f02b8f10e27370ea06a5","target":"record","created_at":"2026-05-18T01:00: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":"d4b1685e2e3080f5847af6a79a13235a671cde08c2324501d924e6f23be86c1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T12:53:13Z","title_canon_sha256":"4ad04f3d1f83997bd54806c4438b6244694e7fdf0a86a87740e03a6e683cf7f6"},"schema_version":"1.0","source":{"id":"1406.1671","kind":"arxiv","version":1}},"canonical_sha256":"74f1afc109e1896ed73a0ac9208e5e3fe4c93a59f5f7594b39c903b9ed8f18b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74f1afc109e1896ed73a0ac9208e5e3fe4c93a59f5f7594b39c903b9ed8f18b7","first_computed_at":"2026-05-18T01:00:20.525474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:20.525474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LLzVa7mWWz5jFGPmh9UkIfDBHsgCdefJ1uRCfb34RkMz3AHzyrwT0OYQpx4GB6up+ea3ybfQltBRCdZc7QuXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:20.526216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cd16200354ac8b44b904222d404beefc3059b58a986f02b8f10e27370ea06a5","sha256:a98c16303d7bb92b44e25cfcb53dd1582b884ad836961ee5c16f274a54893be4"],"state_sha256":"9ce73514d9efefd63c7c388569240a1e295a8b97ed1f79822b64408206528206"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iF0GhpchCQhM0PmBmGZMR7bAqILt1dwnp2P051OFX5cTThYroNgnMuSrW9pXdChnqrOukZU3yXWfRP0vkRADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:16:31.179850Z","bundle_sha256":"0487ffdec6108d65e0249cfb221df7e7074113887a066d20a348f26a7b915b43"}}