{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VADJQWPFWCP2KNSV2C5M5NTRDM","short_pith_number":"pith:VADJQWPF","schema_version":"1.0","canonical_sha256":"a8069859e5b09fa53655d0baceb6711b151d259b348c54543d21a55f221f9cc2","source":{"kind":"arxiv","id":"2001.03788","version":1},"attestation_state":"computed","paper":{"title":"Minimum $2$-vertex-twinless connected spanning subgraph problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2020-01-11T19:35:08Z","abstract_excerpt":"Given a $2$-vertex-twinless connected directed graph $G=(V,E)$, the minimum $2$-vertex-twinless connected spanning subgraph problem is to find a minimum cardinality edge subset $E^{t} \\subseteq E$ such that the subgraph $(V,E^{t})$ is $2$-vertex-twinless connected. Let $G^{1}$ be a minimal $2$-vertex-connected subgraph of $G$. In this paper we present a $(2+a_{t}/2)$-approximation algorithm for the minimum $2$-vertex-twinless connected spanning subgraph problem, where $a_{t}$ is the number of twinless articulation points in $G^{1}$."},"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":"2001.03788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-11T19:35:08Z","cross_cats_sorted":[],"title_canon_sha256":"664558881831fead1b898bbdd9da50259160c8010bcca8ebf7be0f669b4ecf15","abstract_canon_sha256":"f85a88e68e690ee33e83b51494fc585da3429bd61f4f417931bffdaeb4e8911a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:55.965184Z","signature_b64":"t9JLL8f971DhhKIO/JlMxlZ1TC/r3hY008lVL5I+q/Yv6xzz6CZ8rEqSRS6yC+hYV9rsUEQTd9zc1QREg7bNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8069859e5b09fa53655d0baceb6711b151d259b348c54543d21a55f221f9cc2","last_reissued_at":"2026-07-05T00:32:55.964777Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:55.964777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum $2$-vertex-twinless connected spanning subgraph problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2020-01-11T19:35:08Z","abstract_excerpt":"Given a $2$-vertex-twinless connected directed graph $G=(V,E)$, the minimum $2$-vertex-twinless connected spanning subgraph problem is to find a minimum cardinality edge subset $E^{t} \\subseteq E$ such that the subgraph $(V,E^{t})$ is $2$-vertex-twinless connected. Let $G^{1}$ be a minimal $2$-vertex-connected subgraph of $G$. In this paper we present a $(2+a_{t}/2)$-approximation algorithm for the minimum $2$-vertex-twinless connected spanning subgraph problem, where $a_{t}$ is the number of twinless articulation points in $G^{1}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03788","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/2001.03788/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2001.03788","created_at":"2026-07-05T00:32:55.964842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.03788v1","created_at":"2026-07-05T00:32:55.964842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03788","created_at":"2026-07-05T00:32:55.964842+00:00"},{"alias_kind":"pith_short_12","alias_value":"VADJQWPFWCP2","created_at":"2026-07-05T00:32:55.964842+00:00"},{"alias_kind":"pith_short_16","alias_value":"VADJQWPFWCP2KNSV","created_at":"2026-07-05T00:32:55.964842+00:00"},{"alias_kind":"pith_short_8","alias_value":"VADJQWPF","created_at":"2026-07-05T00:32:55.964842+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.16087","citing_title":"Problems related to strong connectivity and strong biconnectivity","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM","json":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM.json","graph_json":"https://pith.science/api/pith-number/VADJQWPFWCP2KNSV2C5M5NTRDM/graph.json","events_json":"https://pith.science/api/pith-number/VADJQWPFWCP2KNSV2C5M5NTRDM/events.json","paper":"https://pith.science/paper/VADJQWPF"},"agent_actions":{"view_html":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM","download_json":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM.json","view_paper":"https://pith.science/paper/VADJQWPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.03788&json=true","fetch_graph":"https://pith.science/api/pith-number/VADJQWPFWCP2KNSV2C5M5NTRDM/graph.json","fetch_events":"https://pith.science/api/pith-number/VADJQWPFWCP2KNSV2C5M5NTRDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM/action/storage_attestation","attest_author":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM/action/author_attestation","sign_citation":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM/action/citation_signature","submit_replication":"https://pith.science/pith/VADJQWPFWCP2KNSV2C5M5NTRDM/action/replication_record"}},"created_at":"2026-07-05T00:32:55.964842+00:00","updated_at":"2026-07-05T00:32:55.964842+00:00"}