{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KYH6GFMBXGTWSWO6H4KXBW2X33","short_pith_number":"pith:KYH6GFMB","canonical_record":{"source":{"id":"1304.4553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-16T19:00:48Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fcd7ffb6be6ec58c91debc95564c20114d80352d45395910fc7d2fae23c918ee","abstract_canon_sha256":"9208209ae22f0e95673c8289bedaa48070692b5ff89424046423862bfde91c99"},"schema_version":"1.0"},"canonical_sha256":"560fe31581b9a76959de3f1570db57dec33162296332d2d9851c543cb821748c","source":{"kind":"arxiv","id":"1304.4553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4553","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4553v1","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4553","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"pith_short_12","alias_value":"KYH6GFMBXGTW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KYH6GFMBXGTWSWO6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KYH6GFMB","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KYH6GFMBXGTWSWO6H4KXBW2X33","target":"record","payload":{"canonical_record":{"source":{"id":"1304.4553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-16T19:00:48Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fcd7ffb6be6ec58c91debc95564c20114d80352d45395910fc7d2fae23c918ee","abstract_canon_sha256":"9208209ae22f0e95673c8289bedaa48070692b5ff89424046423862bfde91c99"},"schema_version":"1.0"},"canonical_sha256":"560fe31581b9a76959de3f1570db57dec33162296332d2d9851c543cb821748c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:52.665699Z","signature_b64":"SkVX60evCsxCAuWfM4Ru+Bzp/5mdYJRCu1lCqjqwN3/M+2wcBvKZKVKr2+WhYxQad9MtbB80MRr6WlNrpRgLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"560fe31581b9a76959de3f1570db57dec33162296332d2d9851c543cb821748c","last_reissued_at":"2026-05-18T03:27:52.664939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:52.664939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.4553","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-18T03:27:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNImFMJxuM8VpFdLo/mFtJ8ndgI5G3cML8PNvN+/KBWrZpGMT/OPO3TDduN98O2KeFU02ZoaR2bClmsSCx8lCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:03:32.162341Z"},"content_sha256":"7cf70cb944c04d9f3db656fdf370b14448720ab41dda4077bb0153c485a06444","schema_version":"1.0","event_id":"sha256:7cf70cb944c04d9f3db656fdf370b14448720ab41dda4077bb0153c485a06444"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KYH6GFMBXGTWSWO6H4KXBW2X33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Perspective on Vertex Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Fabian Kuhn, Keren Censor-Hillel, Mohsen Ghaffari","submitted_at":"2013-04-16T19:00:48Z","abstract_excerpt":"Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex connectivity is much more limited. An essential tool in capturing edge connectivity are edge-disjoint spanning trees. The famous results of Tutte and Nash-Williams show that a graph with edge connectivity $\\lambda$ contains $\\floor{\\lambda/2}$ edge-disjoint spanning trees.\n  We present connected dominating set (CDS) partition and packing as tools that are analogous t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4553","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-18T03:27:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NymskyOZtA7ztELRzgmaJOSu4PZq7Q8OyWtjJ/b36701XZESW1WnATm+SU0Nz0107kFw8uW6CEhY8FB+zseTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:03:32.163061Z"},"content_sha256":"8d1849bcdef37c920610b03ce32d73db42d7827c567547e7eca1cd54565b1560","schema_version":"1.0","event_id":"sha256:8d1849bcdef37c920610b03ce32d73db42d7827c567547e7eca1cd54565b1560"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYH6GFMBXGTWSWO6H4KXBW2X33/bundle.json","state_url":"https://pith.science/pith/KYH6GFMBXGTWSWO6H4KXBW2X33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYH6GFMBXGTWSWO6H4KXBW2X33/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-05-26T16:03:32Z","links":{"resolver":"https://pith.science/pith/KYH6GFMBXGTWSWO6H4KXBW2X33","bundle":"https://pith.science/pith/KYH6GFMBXGTWSWO6H4KXBW2X33/bundle.json","state":"https://pith.science/pith/KYH6GFMBXGTWSWO6H4KXBW2X33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYH6GFMBXGTWSWO6H4KXBW2X33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KYH6GFMBXGTWSWO6H4KXBW2X33","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":"9208209ae22f0e95673c8289bedaa48070692b5ff89424046423862bfde91c99","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-16T19:00:48Z","title_canon_sha256":"fcd7ffb6be6ec58c91debc95564c20114d80352d45395910fc7d2fae23c918ee"},"schema_version":"1.0","source":{"id":"1304.4553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4553","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4553v1","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4553","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"pith_short_12","alias_value":"KYH6GFMBXGTW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KYH6GFMBXGTWSWO6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KYH6GFMB","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:8d1849bcdef37c920610b03ce32d73db42d7827c567547e7eca1cd54565b1560","target":"graph","created_at":"2026-05-18T03:27:52Z","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":"Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex connectivity is much more limited. An essential tool in capturing edge connectivity are edge-disjoint spanning trees. The famous results of Tutte and Nash-Williams show that a graph with edge connectivity $\\lambda$ contains $\\floor{\\lambda/2}$ edge-disjoint spanning trees.\n  We present connected dominating set (CDS) partition and packing as tools that are analogous t","authors_text":"Fabian Kuhn, Keren Censor-Hillel, Mohsen Ghaffari","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-16T19:00:48Z","title":"A New Perspective on Vertex Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4553","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:7cf70cb944c04d9f3db656fdf370b14448720ab41dda4077bb0153c485a06444","target":"record","created_at":"2026-05-18T03:27:52Z","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":"9208209ae22f0e95673c8289bedaa48070692b5ff89424046423862bfde91c99","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-16T19:00:48Z","title_canon_sha256":"fcd7ffb6be6ec58c91debc95564c20114d80352d45395910fc7d2fae23c918ee"},"schema_version":"1.0","source":{"id":"1304.4553","kind":"arxiv","version":1}},"canonical_sha256":"560fe31581b9a76959de3f1570db57dec33162296332d2d9851c543cb821748c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"560fe31581b9a76959de3f1570db57dec33162296332d2d9851c543cb821748c","first_computed_at":"2026-05-18T03:27:52.664939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:52.664939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SkVX60evCsxCAuWfM4Ru+Bzp/5mdYJRCu1lCqjqwN3/M+2wcBvKZKVKr2+WhYxQad9MtbB80MRr6WlNrpRgLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:52.665699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cf70cb944c04d9f3db656fdf370b14448720ab41dda4077bb0153c485a06444","sha256:8d1849bcdef37c920610b03ce32d73db42d7827c567547e7eca1cd54565b1560"],"state_sha256":"d9891f387ce81c4761f610be959079ae2acf4d510657d0b67f8de48b64a2a7da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/tBsliXsn9M6HWa8s1x5J7DSVWoByYa8l3uOzim35mPQWiKYo29Vfla5EifbOMv4oCbtz+a6gI/64W9KzwRrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:03:32.166786Z","bundle_sha256":"5531e5ab124471e62fb8960be13a10996cf621ba9eee8fb4bb35abcdf4ae02ed"}}