{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:V4OPRJYRA4LEJDG3PCHVSQJDO2","short_pith_number":"pith:V4OPRJYR","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"},"canonical_sha256":"af1cf8a7110716448cdb788f594123768986f626918d27811a357a6b6edc54ec","source":{"kind":"arxiv","id":"2207.03401","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03401","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03401v2","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03401","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"V4OPRJYRA4LE","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"pith_short_16","alias_value":"V4OPRJYRA4LEJDG3","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"pith_short_8","alias_value":"V4OPRJYR","created_at":"2026-07-05T04:41:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:V4OPRJYRA4LEJDG3PCHVSQJDO2","target":"record","payload":{"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"},"canonical_sha256":"af1cf8a7110716448cdb788f594123768986f626918d27811a357a6b6edc54ec","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"},"source_kind":"arxiv","source_id":"2207.03401","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-07-05T04:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XvB3mWgSiAa2RufSYLadlafd3Ca1vf2udbI1AP7gpbI5QsF9QaKL5y6DiP5GCuUgHne333yJx7mt5W/E4t2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:42:39.162913Z"},"content_sha256":"beecb2c85e416c5407567735c21a3f0a0b67a75d1ef8ce4e021ff08d448139ac","schema_version":"1.0","event_id":"sha256:beecb2c85e416c5407567735c21a3f0a0b67a75d1ef8ce4e021ff08d448139ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:V4OPRJYRA4LEJDG3PCHVSQJDO2","target":"graph","payload":{"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"},"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-07-05T04:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"if2hmG2Bz3F2rmYbms3sqIcsdeRJ3piKhGw3tRYSXJElHnYWu58cOA2rtoKLvGL7oHQAcJ+0KpMl8p8baXU+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:42:39.163554Z"},"content_sha256":"3763c5a9c50a47162ff8315020efdf652139faa3936f5746cdfcd6894046e0a9","schema_version":"1.0","event_id":"sha256:3763c5a9c50a47162ff8315020efdf652139faa3936f5746cdfcd6894046e0a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/bundle.json","state_url":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/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-08-15T05:42:39Z","links":{"resolver":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2","bundle":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/bundle.json","state":"https://pith.science/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4OPRJYRA4LEJDG3PCHVSQJDO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:V4OPRJYRA4LEJDG3PCHVSQJDO2","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":"7a77efa472d8bce78ae58203dcb7de7bbf5aa0fb7b6de7126465b570686ef067","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-07T16:11:43Z","title_canon_sha256":"64330dceca1258e2d680014b156c5605974b9e1afa5a2e933560265699011d96"},"schema_version":"1.0","source":{"id":"2207.03401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03401","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03401v2","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03401","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"V4OPRJYRA4LE","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"pith_short_16","alias_value":"V4OPRJYRA4LEJDG3","created_at":"2026-07-05T04:41:57Z"},{"alias_kind":"pith_short_8","alias_value":"V4OPRJYR","created_at":"2026-07-05T04:41:57Z"}],"graph_snapshots":[{"event_id":"sha256:3763c5a9c50a47162ff8315020efdf652139faa3936f5746cdfcd6894046e0a9","target":"graph","created_at":"2026-07-05T04:41:57Z","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/2207.03401/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Raed Jaberi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-07T16:11:43Z","title":"Minimum $2$-edge strongly biconnected spanning directed subgraph problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03401","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:beecb2c85e416c5407567735c21a3f0a0b67a75d1ef8ce4e021ff08d448139ac","target":"record","created_at":"2026-07-05T04:41:57Z","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":"7a77efa472d8bce78ae58203dcb7de7bbf5aa0fb7b6de7126465b570686ef067","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-07T16:11:43Z","title_canon_sha256":"64330dceca1258e2d680014b156c5605974b9e1afa5a2e933560265699011d96"},"schema_version":"1.0","source":{"id":"2207.03401","kind":"arxiv","version":2}},"canonical_sha256":"af1cf8a7110716448cdb788f594123768986f626918d27811a357a6b6edc54ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af1cf8a7110716448cdb788f594123768986f626918d27811a357a6b6edc54ec","first_computed_at":"2026-07-05T04:41:57.104164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:41:57.104164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bdnPs0hZBrBB0diBm9dMEZQS38cePgp4RmTa0YFiJcfUH66lcjHPyCgOiv5yCHMd/ZkTOE69q00sp5FiPj1qCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:41:57.104607Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.03401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beecb2c85e416c5407567735c21a3f0a0b67a75d1ef8ce4e021ff08d448139ac","sha256:3763c5a9c50a47162ff8315020efdf652139faa3936f5746cdfcd6894046e0a9"],"state_sha256":"67099d331af87c053fde804da4700565669a63a3472754e1156dddf8591152d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grWY/H+m/sX2tEMkWnbPdpIOl+3kTSPzmbw1ih8Ca5w3Rr4FJQmWI9useMz5Jz8tEU+x/HKSZX2HvESfhmbZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:42:39.168302Z","bundle_sha256":"5c049119afbb859735f97f8021f037df7f8a253d1fbdcae5bfb4af3009a836c5"}}