{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QTYK55RJU4MMWP5VCJ427DIPGW","short_pith_number":"pith:QTYK55RJ","schema_version":"1.0","canonical_sha256":"84f0aef629a718cb3fb51279af8d0f3589fa6178a1b7dafcd3f18482d109fe48","source":{"kind":"arxiv","id":"1509.02841","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Charis Papadopoulos, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis","submitted_at":"2015-09-09T16:31:24Z","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"},"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":"1509.02841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-09T16:31:24Z","cross_cats_sorted":[],"title_canon_sha256":"edc7b0a930efdf33cdb30e9ed247aca059adcc5be76c08e7ab158b5f0f46da3a","abstract_canon_sha256":"45e3717546734790e43b117b55ebed9db9512cfc93c80f86c42373d62fc07afd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:33.107430Z","signature_b64":"PX8n+3uzdZBIPB+hMlK1p7M4cmDDHL+AZkePjz+OuAXIU8smGPEgv01YPFdw/6qdV7LB0d6M1XjmuvgZOxyIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84f0aef629a718cb3fb51279af8d0f3589fa6178a1b7dafcd3f18482d109fe48","last_reissued_at":"2026-05-18T01:33:33.106799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:33.106799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Charis Papadopoulos, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis","submitted_at":"2015-09-09T16:31:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02841","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.02841","created_at":"2026-05-18T01:33:33.106884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02841v1","created_at":"2026-05-18T01:33:33.106884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02841","created_at":"2026-05-18T01:33:33.106884+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTYK55RJU4MM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTYK55RJU4MMWP5V","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTYK55RJ","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW","json":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW.json","graph_json":"https://pith.science/api/pith-number/QTYK55RJU4MMWP5VCJ427DIPGW/graph.json","events_json":"https://pith.science/api/pith-number/QTYK55RJU4MMWP5VCJ427DIPGW/events.json","paper":"https://pith.science/paper/QTYK55RJ"},"agent_actions":{"view_html":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW","download_json":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW.json","view_paper":"https://pith.science/paper/QTYK55RJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02841&json=true","fetch_graph":"https://pith.science/api/pith-number/QTYK55RJU4MMWP5VCJ427DIPGW/graph.json","fetch_events":"https://pith.science/api/pith-number/QTYK55RJU4MMWP5VCJ427DIPGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW/action/storage_attestation","attest_author":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW/action/author_attestation","sign_citation":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW/action/citation_signature","submit_replication":"https://pith.science/pith/QTYK55RJU4MMWP5VCJ427DIPGW/action/replication_record"}},"created_at":"2026-05-18T01:33:33.106884+00:00","updated_at":"2026-05-18T01:33:33.106884+00:00"}