{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QTYK55RJU4MMWP5VCJ427DIPGW","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":"45e3717546734790e43b117b55ebed9db9512cfc93c80f86c42373d62fc07afd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-09T16:31:24Z","title_canon_sha256":"edc7b0a930efdf33cdb30e9ed247aca059adcc5be76c08e7ab158b5f0f46da3a"},"schema_version":"1.0","source":{"id":"1509.02841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02841","created_at":"2026-05-18T01:33:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02841v1","created_at":"2026-05-18T01:33:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02841","created_at":"2026-05-18T01:33:33Z"},{"alias_kind":"pith_short_12","alias_value":"QTYK55RJU4MM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QTYK55RJU4MMWP5V","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QTYK55RJ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:33dd4c9eb4607fc052c462dadd12eeaa64083b2661b96e1f7895b5329b6db990","target":"graph","created_at":"2026-05-18T01:33:33Z","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":"Let $G$ be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of $G$ that maintains respectively: the $2$-edge-connected blocks of $G$ (\\textsf{2EC-B}); the $2$-edge-connected components of $G$ (\\textsf{2EC-C}); both the $2$-edge-connected blocks and the $2$-edge-connected components of $G$ (\\textsf{2EC-B-C}). All three problems are NP-hard, and thus we are interested in efficient approximation algorithms. For \\textsf{2EC-C} we can obtain a $3/2$-approximation by combining previously known re","authors_text":"Charis Papadopoulos, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-09T16:31:24Z","title":"Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02841","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:1a4fd99d94c7f9495dc34603063de4e8f27621403f9d5f83b7c60f7107cbb916","target":"record","created_at":"2026-05-18T01:33:33Z","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":"45e3717546734790e43b117b55ebed9db9512cfc93c80f86c42373d62fc07afd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-09T16:31:24Z","title_canon_sha256":"edc7b0a930efdf33cdb30e9ed247aca059adcc5be76c08e7ab158b5f0f46da3a"},"schema_version":"1.0","source":{"id":"1509.02841","kind":"arxiv","version":1}},"canonical_sha256":"84f0aef629a718cb3fb51279af8d0f3589fa6178a1b7dafcd3f18482d109fe48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84f0aef629a718cb3fb51279af8d0f3589fa6178a1b7dafcd3f18482d109fe48","first_computed_at":"2026-05-18T01:33:33.106799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:33.106799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PX8n+3uzdZBIPB+hMlK1p7M4cmDDHL+AZkePjz+OuAXIU8smGPEgv01YPFdw/6qdV7LB0d6M1XjmuvgZOxyIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:33.107430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a4fd99d94c7f9495dc34603063de4e8f27621403f9d5f83b7c60f7107cbb916","sha256:33dd4c9eb4607fc052c462dadd12eeaa64083b2661b96e1f7895b5329b6db990"],"state_sha256":"284294cc49aaa074c876a3b8e80892274d58e45f3f12f815cef84130bc222b9e"}