{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C3D5SPI6HB45BA4NIXBUEUZNPL","short_pith_number":"pith:C3D5SPI6","schema_version":"1.0","canonical_sha256":"16c7d93d1e3879d0838d45c342532d7ac4cd62daee7958e838f161f41e93ba17","source":{"kind":"arxiv","id":"1301.2506","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.2506","created_at":"2026-05-18T03:36:37.714544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2506v1","created_at":"2026-05-18T03:36:37.714544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2506","created_at":"2026-05-18T03:36:37.714544+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3D5SPI6HB45","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3D5SPI6HB45BA4N","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3D5SPI6","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL","json":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL.json","graph_json":"https://pith.science/api/pith-number/C3D5SPI6HB45BA4NIXBUEUZNPL/graph.json","events_json":"https://pith.science/api/pith-number/C3D5SPI6HB45BA4NIXBUEUZNPL/events.json","paper":"https://pith.science/paper/C3D5SPI6"},"agent_actions":{"view_html":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL","download_json":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL.json","view_paper":"https://pith.science/paper/C3D5SPI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2506&json=true","fetch_graph":"https://pith.science/api/pith-number/C3D5SPI6HB45BA4NIXBUEUZNPL/graph.json","fetch_events":"https://pith.science/api/pith-number/C3D5SPI6HB45BA4NIXBUEUZNPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/action/storage_attestation","attest_author":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/action/author_attestation","sign_citation":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/action/citation_signature","submit_replication":"https://pith.science/pith/C3D5SPI6HB45BA4NIXBUEUZNPL/action/replication_record"}},"created_at":"2026-05-18T03:36:37.714544+00:00","updated_at":"2026-05-18T03:36:37.714544+00:00"}