{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:V4OPRJYRA4LEJDG3PCHVSQJDO2","short_pith_number":"pith:V4OPRJYR","schema_version":"1.0","canonical_sha256":"af1cf8a7110716448cdb788f594123768986f626918d27811a357a6b6edc54ec","source":{"kind":"arxiv","id":"2207.03401","version":2},"attestation_state":"computed","paper":{"title":"Minimum $2$-edge strongly biconnected spanning directed subgraph problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2022-07-07T16:11:43Z","abstract_excerpt":"Wu and Grumbach introduced the concept of strongly biconnected directed graphs. A directed graph $G=(V,E)$ is called strongly biconnected if the directed graph $G$ is strongly connected and the underlying undirected graph of $G$ is biconnected. A strongly biconnected directed graph $G=(V,E)$ is said to be $2$- edge strongly biconnected if it has at least three vertices and the directed subgraph $(V,E\\setminus\\left\\lbrace e\\right\\rbrace )$ is strongly biconnected for all $e \\in E$. Let $G=(V,E)$ be a $2$-edge-strongly biconnected directed graph. In this paper we study the problem of computing a"},"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":"2207.03401","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-07T16:11:43Z","cross_cats_sorted":[],"title_canon_sha256":"64330dceca1258e2d680014b156c5605974b9e1afa5a2e933560265699011d96","abstract_canon_sha256":"7a77efa472d8bce78ae58203dcb7de7bbf5aa0fb7b6de7126465b570686ef067"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:57.104607Z","signature_b64":"bdnPs0hZBrBB0diBm9dMEZQS38cePgp4RmTa0YFiJcfUH66lcjHPyCgOiv5yCHMd/ZkTOE69q00sp5FiPj1qCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af1cf8a7110716448cdb788f594123768986f626918d27811a357a6b6edc54ec","last_reissued_at":"2026-07-05T04:41:57.104164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:57.104164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum $2$-edge strongly biconnected spanning directed subgraph problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2022-07-07T16:11:43Z","abstract_excerpt":"Wu and Grumbach introduced the concept of strongly biconnected directed graphs. A directed graph $G=(V,E)$ is called strongly biconnected if the directed graph $G$ is strongly connected and the underlying undirected graph of $G$ is biconnected. A strongly biconnected directed graph $G=(V,E)$ is said to be $2$- edge strongly biconnected if it has at least three vertices and the directed subgraph $(V,E\\setminus\\left\\lbrace e\\right\\rbrace )$ is strongly biconnected for all $e \\in E$. Let $G=(V,E)$ be a $2$-edge-strongly biconnected directed graph. In this paper we study the problem of computing a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03401","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/2207.03401/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":"2207.03401","created_at":"2026-07-05T04:41:57.104228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.03401v2","created_at":"2026-07-05T04:41:57.104228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03401","created_at":"2026-07-05T04:41:57.104228+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4OPRJYRA4LE","created_at":"2026-07-05T04:41:57.104228+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4OPRJYRA4LEJDG3","created_at":"2026-07-05T04:41:57.104228+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4OPRJYR","created_at":"2026-07-05T04:41:57.104228+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":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2","json":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2.json","graph_json":"https://pith.science/api/pith-number/V4OPRJYRA4LEJDG3PCHVSQJDO2/graph.json","events_json":"https://pith.science/api/pith-number/V4OPRJYRA4LEJDG3PCHVSQJDO2/events.json","paper":"https://pith.science/paper/V4OPRJYR"},"agent_actions":{"view_html":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2","download_json":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2.json","view_paper":"https://pith.science/paper/V4OPRJYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.03401&json=true","fetch_graph":"https://pith.science/api/pith-number/V4OPRJYRA4LEJDG3PCHVSQJDO2/graph.json","fetch_events":"https://pith.science/api/pith-number/V4OPRJYRA4LEJDG3PCHVSQJDO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/action/storage_attestation","attest_author":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/action/author_attestation","sign_citation":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/action/citation_signature","submit_replication":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/action/replication_record"}},"created_at":"2026-07-05T04:41:57.104228+00:00","updated_at":"2026-07-05T04:41:57.104228+00:00"}