{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C3D5SPI6HB45BA4NIXBUEUZNPL","short_pith_number":"pith:C3D5SPI6","canonical_record":{"source":{"id":"1301.2506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T14:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"e4239be3f798c11a09d57077cd5b1c290bb92e84275452ffdc6e710e2810668c","abstract_canon_sha256":"cc55b7b523446c7dc3a9c598a99cd33fba9ae8127b4ac310008a2ad9ab3e5b1d"},"schema_version":"1.0"},"canonical_sha256":"16c7d93d1e3879d0838d45c342532d7ac4cd62daee7958e838f161f41e93ba17","source":{"kind":"arxiv","id":"1301.2506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2506","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2506v1","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2506","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"C3D5SPI6HB45","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C3D5SPI6HB45BA4N","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C3D5SPI6","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C3D5SPI6HB45BA4NIXBUEUZNPL","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T14:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"e4239be3f798c11a09d57077cd5b1c290bb92e84275452ffdc6e710e2810668c","abstract_canon_sha256":"cc55b7b523446c7dc3a9c598a99cd33fba9ae8127b4ac310008a2ad9ab3e5b1d"},"schema_version":"1.0"},"canonical_sha256":"16c7d93d1e3879d0838d45c342532d7ac4cd62daee7958e838f161f41e93ba17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:37.715204Z","signature_b64":"zztvVSh0wOVX5LKRX9Gupbr42tDFrz8fPfMBgA+WcWO9vCsuCp98ythgurH7GzR6oPseJWRY4EvDnWKQdLaEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16c7d93d1e3879d0838d45c342532d7ac4cd62daee7958e838f161f41e93ba17","last_reissued_at":"2026-05-18T03:36:37.714417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:37.714417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2506","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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NO4BrMsGjHadsgLBHeh39tnpyW4pmCWcOWYQnEa50dcyLJee1vpj8AuuN+HqL+dlvyidzDVP/VoOjIVDmJQhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:49:30.492187Z"},"content_sha256":"d198dad4da5bccb1a39d0e3c0f3962106fbeea20eda4ddce7ac1bb9a50dcc926","schema_version":"1.0","event_id":"sha256:d198dad4da5bccb1a39d0e3c0f3962106fbeea20eda4ddce7ac1bb9a50dcc926"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C3D5SPI6HB45BA4NIXBUEUZNPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connecting Terminals and 2-Disjoint Connected Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Arne Telle, Yngve Villanger","submitted_at":"2013-01-11T14:27:13Z","abstract_excerpt":"Given a graph $G=(V,E)$ and a set of terminal vertices $T$ we say that a superset $S$ of $T$ is $T$-connecting if $S$ induces a connected graph, and $S$ is minimal if no strict subset of $S$ is $T$-connecting. In this paper we prove that there are at most ${|V \\setminus T| \\choose |T|-2} \\cdot 3^{\\frac{|V \\setminus T|}{3}}$ minimal $T$-connecting sets when $|T| \\leq n/3$ and that these can be enumerated within a polynomial factor of this bound. This generalizes the algorithm for enumerating all induced paths between a pair of vertices, corresponding to the case $|T|=2$. We apply our enumeratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2506","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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18t/Rb6J9h1SaAi/Hv2pBuegBH5EOjzKnBassgdVjSTbchXY6EFs6I56paAyHy8dYYg+POXznlIkNd9GWX8VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:49:30.492545Z"},"content_sha256":"2e0915f8fabd70d5a20f5a2e4429d359e51e37c1b25700421bc3f26c9a6c0beb","schema_version":"1.0","event_id":"sha256:2e0915f8fabd70d5a20f5a2e4429d359e51e37c1b25700421bc3f26c9a6c0beb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/bundle.json","state_url":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/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-23T16:49:30Z","links":{"resolver":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL","bundle":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/bundle.json","state":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C3D5SPI6HB45BA4NIXBUEUZNPL","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":"cc55b7b523446c7dc3a9c598a99cd33fba9ae8127b4ac310008a2ad9ab3e5b1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T14:27:13Z","title_canon_sha256":"e4239be3f798c11a09d57077cd5b1c290bb92e84275452ffdc6e710e2810668c"},"schema_version":"1.0","source":{"id":"1301.2506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2506","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2506v1","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2506","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"C3D5SPI6HB45","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C3D5SPI6HB45BA4N","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C3D5SPI6","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:2e0915f8fabd70d5a20f5a2e4429d359e51e37c1b25700421bc3f26c9a6c0beb","target":"graph","created_at":"2026-05-18T03:36: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"},"paper":{"abstract_excerpt":"Given a graph $G=(V,E)$ and a set of terminal vertices $T$ we say that a superset $S$ of $T$ is $T$-connecting if $S$ induces a connected graph, and $S$ is minimal if no strict subset of $S$ is $T$-connecting. In this paper we prove that there are at most ${|V \\setminus T| \\choose |T|-2} \\cdot 3^{\\frac{|V \\setminus T|}{3}}$ minimal $T$-connecting sets when $|T| \\leq n/3$ and that these can be enumerated within a polynomial factor of this bound. This generalizes the algorithm for enumerating all induced paths between a pair of vertices, corresponding to the case $|T|=2$. We apply our enumeratio","authors_text":"Jan Arne Telle, Yngve Villanger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T14:27:13Z","title":"Connecting Terminals and 2-Disjoint Connected Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2506","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:d198dad4da5bccb1a39d0e3c0f3962106fbeea20eda4ddce7ac1bb9a50dcc926","target":"record","created_at":"2026-05-18T03:36: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":"cc55b7b523446c7dc3a9c598a99cd33fba9ae8127b4ac310008a2ad9ab3e5b1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-11T14:27:13Z","title_canon_sha256":"e4239be3f798c11a09d57077cd5b1c290bb92e84275452ffdc6e710e2810668c"},"schema_version":"1.0","source":{"id":"1301.2506","kind":"arxiv","version":1}},"canonical_sha256":"16c7d93d1e3879d0838d45c342532d7ac4cd62daee7958e838f161f41e93ba17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16c7d93d1e3879d0838d45c342532d7ac4cd62daee7958e838f161f41e93ba17","first_computed_at":"2026-05-18T03:36:37.714417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:37.714417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zztvVSh0wOVX5LKRX9Gupbr42tDFrz8fPfMBgA+WcWO9vCsuCp98ythgurH7GzR6oPseJWRY4EvDnWKQdLaEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:37.715204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d198dad4da5bccb1a39d0e3c0f3962106fbeea20eda4ddce7ac1bb9a50dcc926","sha256:2e0915f8fabd70d5a20f5a2e4429d359e51e37c1b25700421bc3f26c9a6c0beb"],"state_sha256":"9a40fdcd8d3fa87ff7d46e9d8a73762070799b54b69fa684c45aed93efc0aacc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uiRgMoYcDO6DGJiki/gr5O52MSqJew85bBHlViKbCerS6uEAljxyVMupziMgZoOvJ+KQbtjmJ1hJQTLxc4UAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:49:30.494500Z","bundle_sha256":"4951731e22226323e287211a57046ba42eba59dad452576299fb6eaed966fc1d"}}