{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EFHGO47CY7HYPCX4MCZLHRMR26","short_pith_number":"pith:EFHGO47C","schema_version":"1.0","canonical_sha256":"214e6773e2c7cf878afc60b2b3c591d7a0b4c553dac8d2244813f2781e5daef5","source":{"kind":"arxiv","id":"2606.16087","version":2},"attestation_state":"computed","paper":{"title":"Problems related to strong connectivity and strong biconnectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2026-06-15T00:56:38Z","abstract_excerpt":"Let $G=(V,E)$ be a strong biconnected graph and let $B \\subseteq V$ such that for each vertex $w \\in B$, the subgraph $G \\setminus \\lbrace w\\rbrace$ is strongly connected. In this paper we study the problem of computing a subset $E_{\\beta} \\subseteq E$ of minimum size such that the subgraph $G_{\\beta}=(V,E_{\\beta})$ is strongly biconnected and for each vertex $w \\in B$, the subgraph $G_{\\beta} \\setminus \\lbrace w\\rbrace$ is strongly connected. We prove that there exists a polynomial time $7$-approximation algorithm for this problem."},"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":"2606.16087","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-15T00:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"456d55c886d14e9d140361469abfeee07b1214882f10468509eb6b627c838d19","abstract_canon_sha256":"1545d5832b77480d7b5b14a9d00da9a54eae5925719e972febf5cc77c8602738"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:01.646785Z","signature_b64":"tuUj9XFqoRjCmh9NwOyTQD57sKa2YZH/I67p9h4MKtUrA0wuK8ODFqm2iaElIuhRKxUZBOP+cG0sKtTbOYJ6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"214e6773e2c7cf878afc60b2b3c591d7a0b4c553dac8d2244813f2781e5daef5","last_reissued_at":"2026-06-19T16:10:01.646438Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:01.646438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Problems related to strong connectivity and strong biconnectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2026-06-15T00:56:38Z","abstract_excerpt":"Let $G=(V,E)$ be a strong biconnected graph and let $B \\subseteq V$ such that for each vertex $w \\in B$, the subgraph $G \\setminus \\lbrace w\\rbrace$ is strongly connected. In this paper we study the problem of computing a subset $E_{\\beta} \\subseteq E$ of minimum size such that the subgraph $G_{\\beta}=(V,E_{\\beta})$ is strongly biconnected and for each vertex $w \\in B$, the subgraph $G_{\\beta} \\setminus \\lbrace w\\rbrace$ is strongly connected. We prove that there exists a polynomial time $7$-approximation algorithm for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.16087","kind":"arxiv","version":2},"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.16087/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":"2606.16087","created_at":"2026-06-19T16:10:01.646493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.16087v2","created_at":"2026-06-19T16:10:01.646493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.16087","created_at":"2026-06-19T16:10:01.646493+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFHGO47CY7HY","created_at":"2026-06-19T16:10:01.646493+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFHGO47CY7HYPCX4","created_at":"2026-06-19T16:10:01.646493+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFHGO47C","created_at":"2026-06-19T16:10:01.646493+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/EFHGO47CY7HYPCX4MCZLHRMR26","json":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26.json","graph_json":"https://pith.science/api/pith-number/EFHGO47CY7HYPCX4MCZLHRMR26/graph.json","events_json":"https://pith.science/api/pith-number/EFHGO47CY7HYPCX4MCZLHRMR26/events.json","paper":"https://pith.science/paper/EFHGO47C"},"agent_actions":{"view_html":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26","download_json":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26.json","view_paper":"https://pith.science/paper/EFHGO47C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.16087&json=true","fetch_graph":"https://pith.science/api/pith-number/EFHGO47CY7HYPCX4MCZLHRMR26/graph.json","fetch_events":"https://pith.science/api/pith-number/EFHGO47CY7HYPCX4MCZLHRMR26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/action/storage_attestation","attest_author":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/action/author_attestation","sign_citation":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/action/citation_signature","submit_replication":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/action/replication_record"}},"created_at":"2026-06-19T16:10:01.646493+00:00","updated_at":"2026-06-19T16:10:01.646493+00:00"}