{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EFHGO47CY7HYPCX4MCZLHRMR26","short_pith_number":"pith:EFHGO47C","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"},"canonical_sha256":"214e6773e2c7cf878afc60b2b3c591d7a0b4c553dac8d2244813f2781e5daef5","source":{"kind":"arxiv","id":"2606.16087","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.16087","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"2606.16087v2","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.16087","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"EFHGO47CY7HY","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"pith_short_16","alias_value":"EFHGO47CY7HYPCX4","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"pith_short_8","alias_value":"EFHGO47C","created_at":"2026-06-19T16:10:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EFHGO47CY7HYPCX4MCZLHRMR26","target":"record","payload":{"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"},"canonical_sha256":"214e6773e2c7cf878afc60b2b3c591d7a0b4c553dac8d2244813f2781e5daef5","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"},"source_kind":"arxiv","source_id":"2606.16087","source_version":2,"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-06-19T16:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0J667CI1bfdqeXRHNPfqT0fOlKccul8V33b591a692m6M/Ef/NR0H4lYQ1gX6+4sFjPguXE8LQ5yNVK0YsRRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:55:39.729775Z"},"content_sha256":"de2c92cadcbfb94cec5c97436d8dd9621655468e8e8e69012fa6d5d7e44815f9","schema_version":"1.0","event_id":"sha256:de2c92cadcbfb94cec5c97436d8dd9621655468e8e8e69012fa6d5d7e44815f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EFHGO47CY7HYPCX4MCZLHRMR26","target":"graph","payload":{"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"},"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-06-19T16:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8MnkbGF9iubedkbQjyZz8SqBdxiF8DhMEw6XfwTBz52/v9YETWr7Djo8doWLU/UXs117C5hUhnxrCdPwXW6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:55:39.730146Z"},"content_sha256":"288755fa783d3583567b3d246e68944ec4f1a148cd6eaab2954d730be9ea138b","schema_version":"1.0","event_id":"sha256:288755fa783d3583567b3d246e68944ec4f1a148cd6eaab2954d730be9ea138b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/bundle.json","state_url":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFHGO47CY7HYPCX4MCZLHRMR26/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-26T04:55:39Z","links":{"resolver":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26","bundle":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/bundle.json","state":"https://pith.science/pith/EFHGO47CY7HYPCX4MCZLHRMR26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFHGO47CY7HYPCX4MCZLHRMR26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EFHGO47CY7HYPCX4MCZLHRMR26","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":"1545d5832b77480d7b5b14a9d00da9a54eae5925719e972febf5cc77c8602738","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-15T00:56:38Z","title_canon_sha256":"456d55c886d14e9d140361469abfeee07b1214882f10468509eb6b627c838d19"},"schema_version":"1.0","source":{"id":"2606.16087","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.16087","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"2606.16087v2","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.16087","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"EFHGO47CY7HY","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"pith_short_16","alias_value":"EFHGO47CY7HYPCX4","created_at":"2026-06-19T16:10:01Z"},{"alias_kind":"pith_short_8","alias_value":"EFHGO47C","created_at":"2026-06-19T16:10:01Z"}],"graph_snapshots":[{"event_id":"sha256:288755fa783d3583567b3d246e68944ec4f1a148cd6eaab2954d730be9ea138b","target":"graph","created_at":"2026-06-19T16:10:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.16087/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Raed Jaberi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-15T00:56:38Z","title":"Problems related to strong connectivity and strong biconnectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.16087","kind":"arxiv","version":2},"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:de2c92cadcbfb94cec5c97436d8dd9621655468e8e8e69012fa6d5d7e44815f9","target":"record","created_at":"2026-06-19T16:10:01Z","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":"1545d5832b77480d7b5b14a9d00da9a54eae5925719e972febf5cc77c8602738","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-15T00:56:38Z","title_canon_sha256":"456d55c886d14e9d140361469abfeee07b1214882f10468509eb6b627c838d19"},"schema_version":"1.0","source":{"id":"2606.16087","kind":"arxiv","version":2}},"canonical_sha256":"214e6773e2c7cf878afc60b2b3c591d7a0b4c553dac8d2244813f2781e5daef5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"214e6773e2c7cf878afc60b2b3c591d7a0b4c553dac8d2244813f2781e5daef5","first_computed_at":"2026-06-19T16:10:01.646438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:01.646438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tuUj9XFqoRjCmh9NwOyTQD57sKa2YZH/I67p9h4MKtUrA0wuK8ODFqm2iaElIuhRKxUZBOP+cG0sKtTbOYJ6CQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:01.646785Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.16087","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de2c92cadcbfb94cec5c97436d8dd9621655468e8e8e69012fa6d5d7e44815f9","sha256:288755fa783d3583567b3d246e68944ec4f1a148cd6eaab2954d730be9ea138b"],"state_sha256":"354d33c232237aa3363c020b13307f6ef8fcdb6fa948a126f17ac1bbde5b8737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wOc4ArIUFI+aNTpNTzqLewJiKIBUfQtq5PTFkv5cjK/UdolcN5bSCekQBWU0GcDA+X0kUYPSRltC7ExgwFsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T04:55:39.732148Z","bundle_sha256":"86cb9223eb26c611e35ca8f03231803e155cca0f5c2b003827791bd684b1759b"}}