{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:C7ZFIHI5N6BJCN6ONGW6FF74T5","short_pith_number":"pith:C7ZFIHI5","canonical_record":{"source":{"id":"2606.01586","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T02:30:58Z","cross_cats_sorted":[],"title_canon_sha256":"f8241e35f57584c89ee477288c67544ae5777b2665864a3de68014d65f0e1995","abstract_canon_sha256":"90788332aaa3aec33453fc8e43fda1c0de9b444ee56a8af7264ce037c0b8496d"},"schema_version":"1.0"},"canonical_sha256":"17f2541d1d6f829137ce69ade297fc9f4b49624066d52559c27eb2e725c55d96","source":{"kind":"arxiv","id":"2606.01586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01586","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01586v1","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01586","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"C7ZFIHI5N6BJ","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"C7ZFIHI5N6BJCN6O","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"C7ZFIHI5","created_at":"2026-06-02T02:04:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:C7ZFIHI5N6BJCN6ONGW6FF74T5","target":"record","payload":{"canonical_record":{"source":{"id":"2606.01586","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T02:30:58Z","cross_cats_sorted":[],"title_canon_sha256":"f8241e35f57584c89ee477288c67544ae5777b2665864a3de68014d65f0e1995","abstract_canon_sha256":"90788332aaa3aec33453fc8e43fda1c0de9b444ee56a8af7264ce037c0b8496d"},"schema_version":"1.0"},"canonical_sha256":"17f2541d1d6f829137ce69ade297fc9f4b49624066d52559c27eb2e725c55d96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:37.311880Z","signature_b64":"kDOguhQk06gwy5OQY+k3xyl2kwMzysWJGtDkS1p7mv5YANYWBCcw0Wwa7Zi4sT4lo0cx//KgLE3NDT75LRfxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17f2541d1d6f829137ce69ade297fc9f4b49624066d52559c27eb2e725c55d96","last_reissued_at":"2026-06-02T02:04:37.311467Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:37.311467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.01586","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-06-02T02:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12UzFQSPMdrCnBxGPrPBLXC2UG3Buyh2XjfvkcQCPK2L4pd5GiYoplMt+3OT1Tun0yhlcTdDmkGfXSCfv51FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:52:14.152927Z"},"content_sha256":"d396e20fc07d849aa1e0a0795635931417ae1b7d8e26340ce175942f7fdbf51c","schema_version":"1.0","event_id":"sha256:d396e20fc07d849aa1e0a0795635931417ae1b7d8e26340ce175942f7fdbf51c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:C7ZFIHI5N6BJCN6ONGW6FF74T5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Ken-ichi Kawarabayashi","submitted_at":"2026-06-01T02:30:58Z","abstract_excerpt":"For a given subset $S\\subseteq V(G)$ of a graph $G$, the pair $(G,S)$ is \\emph{knitted} if for every partition of $S$ into non-empty subsets $S_1, S_2, \\ldots, S_t$, there exist pairwise disjoint connected subgraphs $C_1, C_2, \\ldots, C_t$ in $G$ such that $S_i\\subseteq V(C_i)$ for all $1 \\le i \\le t$. A graph $G$ is \\emph{$\\ell$-knitted} if $(G,S)$ is knitted for every subset $S\\subseteq V(G)$ of size $\\ell$. In this paper, we prove that every $8\\ell$-connected graph is $\\ell$-knitted. We subsequently apply this result to Hadwiger's Conjecture, which states that every $k$-chromatic graph cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01586","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/2606.01586/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"},"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-06-02T02:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfkSc0rKjcxJnafweOp54KG+Piuy8bYokC3R8xr5XKdbciml4XtYoEsFpRRbyWEluYmWEl8T7F75YYdLYjswDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:52:14.153306Z"},"content_sha256":"a34bbec5f40f173a7dd4e1eeb72f5001cf0de16c6cb942b1fa84e39f09c662a2","schema_version":"1.0","event_id":"sha256:a34bbec5f40f173a7dd4e1eeb72f5001cf0de16c6cb942b1fa84e39f09c662a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7ZFIHI5N6BJCN6ONGW6FF74T5/bundle.json","state_url":"https://pith.science/pith/C7ZFIHI5N6BJCN6ONGW6FF74T5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7ZFIHI5N6BJCN6ONGW6FF74T5/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-03T04:52:14Z","links":{"resolver":"https://pith.science/pith/C7ZFIHI5N6BJCN6ONGW6FF74T5","bundle":"https://pith.science/pith/C7ZFIHI5N6BJCN6ONGW6FF74T5/bundle.json","state":"https://pith.science/pith/C7ZFIHI5N6BJCN6ONGW6FF74T5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7ZFIHI5N6BJCN6ONGW6FF74T5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:C7ZFIHI5N6BJCN6ONGW6FF74T5","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":"90788332aaa3aec33453fc8e43fda1c0de9b444ee56a8af7264ce037c0b8496d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T02:30:58Z","title_canon_sha256":"f8241e35f57584c89ee477288c67544ae5777b2665864a3de68014d65f0e1995"},"schema_version":"1.0","source":{"id":"2606.01586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01586","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01586v1","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01586","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"C7ZFIHI5N6BJ","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"C7ZFIHI5N6BJCN6O","created_at":"2026-06-02T02:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"C7ZFIHI5","created_at":"2026-06-02T02:04:37Z"}],"graph_snapshots":[{"event_id":"sha256:a34bbec5f40f173a7dd4e1eeb72f5001cf0de16c6cb942b1fa84e39f09c662a2","target":"graph","created_at":"2026-06-02T02:04:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.01586/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a given subset $S\\subseteq V(G)$ of a graph $G$, the pair $(G,S)$ is \\emph{knitted} if for every partition of $S$ into non-empty subsets $S_1, S_2, \\ldots, S_t$, there exist pairwise disjoint connected subgraphs $C_1, C_2, \\ldots, C_t$ in $G$ such that $S_i\\subseteq V(C_i)$ for all $1 \\le i \\le t$. A graph $G$ is \\emph{$\\ell$-knitted} if $(G,S)$ is knitted for every subset $S\\subseteq V(G)$ of size $\\ell$. In this paper, we prove that every $8\\ell$-connected graph is $\\ell$-knitted. We subsequently apply this result to Hadwiger's Conjecture, which states that every $k$-chromatic graph cont","authors_text":"Gexin Yu, Ken-ichi Kawarabayashi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T02:30:58Z","title":"Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01586","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:d396e20fc07d849aa1e0a0795635931417ae1b7d8e26340ce175942f7fdbf51c","target":"record","created_at":"2026-06-02T02:04:37Z","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":"90788332aaa3aec33453fc8e43fda1c0de9b444ee56a8af7264ce037c0b8496d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T02:30:58Z","title_canon_sha256":"f8241e35f57584c89ee477288c67544ae5777b2665864a3de68014d65f0e1995"},"schema_version":"1.0","source":{"id":"2606.01586","kind":"arxiv","version":1}},"canonical_sha256":"17f2541d1d6f829137ce69ade297fc9f4b49624066d52559c27eb2e725c55d96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17f2541d1d6f829137ce69ade297fc9f4b49624066d52559c27eb2e725c55d96","first_computed_at":"2026-06-02T02:04:37.311467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:37.311467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kDOguhQk06gwy5OQY+k3xyl2kwMzysWJGtDkS1p7mv5YANYWBCcw0Wwa7Zi4sT4lo0cx//KgLE3NDT75LRfxDA==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:37.311880Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d396e20fc07d849aa1e0a0795635931417ae1b7d8e26340ce175942f7fdbf51c","sha256:a34bbec5f40f173a7dd4e1eeb72f5001cf0de16c6cb942b1fa84e39f09c662a2"],"state_sha256":"e4d865297f0a7c421b57b22cb3621fae81b3b8aac00b04971a071d133bb7d471"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VKxn+Nt2CEwDaPeW9kdnEsyuNSQXqTugi0sE35G0ujWqRQa3cMb5gHbwjdVrIQAQAEo8/Z2DEVKXTKbIXyyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:52:14.155369Z","bundle_sha256":"c0f8b590c5a2691465ae8d04684457cff140a1773ae4d9d4a02987ddcd75798c"}}