{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5JSJDPVX4XZGTCTVGW7UGI5O37","short_pith_number":"pith:5JSJDPVX","canonical_record":{"source":{"id":"1705.10709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T15:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"aecaf729cf165925e5247cf33b940e1f298923db19243afe83433e7588805f52","abstract_canon_sha256":"de8b2bd88738144ad3f3236c31825041f75ed6f72a9c9d22ef1399ef7ec97f9b"},"schema_version":"1.0"},"canonical_sha256":"ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb","source":{"kind":"arxiv","id":"1705.10709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10709","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10709v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10709","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"5JSJDPVX4XZG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5JSJDPVX4XZGTCTV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5JSJDPVX","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5JSJDPVX4XZGTCTVGW7UGI5O37","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T15:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"aecaf729cf165925e5247cf33b940e1f298923db19243afe83433e7588805f52","abstract_canon_sha256":"de8b2bd88738144ad3f3236c31825041f75ed6f72a9c9d22ef1399ef7ec97f9b"},"schema_version":"1.0"},"canonical_sha256":"ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:23.720895Z","signature_b64":"w4SNllEkO6qfDwjt7TD5gX4aQwf05/oSWYYt9L9fNrymwliBEGSzYWD0MJlwSKwXaZ4zMygCDcD2uO4fQmlWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb","last_reissued_at":"2026-05-18T00:43:23.720297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:23.720297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10709","source_version":1,"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-05-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgA2hLFwCBfsE0qZdZhhkOP+NvnCGFkVhjNAihne5BU9SL3jEQ+HDWO1G/kcFmrSMxfdOWBOwvB/W3FAzdyBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:10:35.661083Z"},"content_sha256":"d2e703403d0783d2d346ce02dbd249c74efcf7d5b7570bd98e2ee77a6de91da0","schema_version":"1.0","event_id":"sha256:d2e703403d0783d2d346ce02dbd249c74efcf7d5b7570bd98e2ee77a6de91da0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5JSJDPVX4XZGTCTVGW7UGI5O37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Nikos Parotsidis, Shiri Chechik, Thomas Dueholm Hansen, Veronika Loitzenbauer","submitted_at":"2017-05-30T15:46:20Z","abstract_excerpt":"Connectivity related concepts are of fundamental interest in graph theory. The area has received extensive attention over four decades, but many problems remain unsolved, especially for directed graphs. A directed graph is 2-edge-connected (resp., 2-vertex-connected) if the removal of any edge (resp., vertex) leaves the graph strongly connected. In this paper we present improved algorithms for computing the maximal 2-edge- and 2-vertex-connected subgraphs of a given directed graph. These problems were first studied more than 35 years ago, with $\\widetilde{O}(mn)$ time algorithms for graphs wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10709","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":""},"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-05-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt2QW++n6eJ9UxNId/nhIaPpOshZ3SNAF3PXr+KYZUZVe81e25tWXDE6oc5Rz8YEYvYWBYjzULq6xfinB4WBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:10:35.661789Z"},"content_sha256":"83a0eb4dc504c6a5e072ce27c31889e0cc3acf1f4f0ad34fdb4fb7a49e9c855e","schema_version":"1.0","event_id":"sha256:83a0eb4dc504c6a5e072ce27c31889e0cc3acf1f4f0ad34fdb4fb7a49e9c855e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/bundle.json","state_url":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/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-09T06:10:35Z","links":{"resolver":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37","bundle":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/bundle.json","state":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5JSJDPVX4XZGTCTVGW7UGI5O37","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":"de8b2bd88738144ad3f3236c31825041f75ed6f72a9c9d22ef1399ef7ec97f9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T15:46:20Z","title_canon_sha256":"aecaf729cf165925e5247cf33b940e1f298923db19243afe83433e7588805f52"},"schema_version":"1.0","source":{"id":"1705.10709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10709","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10709v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10709","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"5JSJDPVX4XZG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5JSJDPVX4XZGTCTV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5JSJDPVX","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:83a0eb4dc504c6a5e072ce27c31889e0cc3acf1f4f0ad34fdb4fb7a49e9c855e","target":"graph","created_at":"2026-05-18T00:43:23Z","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"},"paper":{"abstract_excerpt":"Connectivity related concepts are of fundamental interest in graph theory. The area has received extensive attention over four decades, but many problems remain unsolved, especially for directed graphs. A directed graph is 2-edge-connected (resp., 2-vertex-connected) if the removal of any edge (resp., vertex) leaves the graph strongly connected. In this paper we present improved algorithms for computing the maximal 2-edge- and 2-vertex-connected subgraphs of a given directed graph. These problems were first studied more than 35 years ago, with $\\widetilde{O}(mn)$ time algorithms for graphs wit","authors_text":"Giuseppe F. Italiano, Nikos Parotsidis, Shiri Chechik, Thomas Dueholm Hansen, Veronika Loitzenbauer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T15:46:20Z","title":"Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10709","kind":"arxiv","version":1},"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:d2e703403d0783d2d346ce02dbd249c74efcf7d5b7570bd98e2ee77a6de91da0","target":"record","created_at":"2026-05-18T00:43:23Z","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":"de8b2bd88738144ad3f3236c31825041f75ed6f72a9c9d22ef1399ef7ec97f9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T15:46:20Z","title_canon_sha256":"aecaf729cf165925e5247cf33b940e1f298923db19243afe83433e7588805f52"},"schema_version":"1.0","source":{"id":"1705.10709","kind":"arxiv","version":1}},"canonical_sha256":"ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb","first_computed_at":"2026-05-18T00:43:23.720297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:23.720297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w4SNllEkO6qfDwjt7TD5gX4aQwf05/oSWYYt9L9fNrymwliBEGSzYWD0MJlwSKwXaZ4zMygCDcD2uO4fQmlWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:23.720895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2e703403d0783d2d346ce02dbd249c74efcf7d5b7570bd98e2ee77a6de91da0","sha256:83a0eb4dc504c6a5e072ce27c31889e0cc3acf1f4f0ad34fdb4fb7a49e9c855e"],"state_sha256":"bca2b71c8c08b50cf6e2caf17d445bf86fab7ede408abbf430b75510052185b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+FhOeQLZF9/rWFLtrIUwTQjCqnyGvAJi5eFW0fCTMSFfPaf3Ak7bTF6UKqDSAGCZyshozgETkdG+6MTgr+MBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:10:35.665803Z","bundle_sha256":"3d09bba329fb0e961c8d8e4a6cb9a9bdd2d49335b33bc4fb091f1d7b377efdd6"}}