{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:7KRKCYPMQ3B5RRI2W7LPW5HYCR","short_pith_number":"pith:7KRKCYPM","schema_version":"1.0","canonical_sha256":"faa2a161ec86c3d8c51ab7d6fb74f81475ff042f03bf6f8298be5c9e2d4b2709","source":{"kind":"arxiv","id":"cs/0205040","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Minimum Equivalent Digraph","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-18T15:59:14Z","abstract_excerpt":"The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives an approximation algorithm with performance guarantee of pi^2/6 ~ 1.64. The algorithm and its analysis are based on the simple idea of contracting long cycles. (This result is strengthened slightly in ``On strongly connected digraphs with bounded cycle length'' (1996).) The analysis applies directly to 2-Exchange, a simple ``local improvement'' algorithm, showing that its performance guarante"},"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":"cs/0205040","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:59:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b4f644fe267550edbaa053f167255b83208c967db3f862e36829ae22123fef5f","abstract_canon_sha256":"06b9766756d34680c7a4c7046b0be0ec37b36c0ac209970d1e33b4408ebf6e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.949758Z","signature_b64":"p9S3xeDQgzH6hOcOjNAFMY1nkGpGsDooCKooSI0mddo/sSb1sUdx/br3uUfBS6omZ9VTapGe2COiD+A3tvj6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa2a161ec86c3d8c51ab7d6fb74f81475ff042f03bf6f8298be5c9e2d4b2709","last_reissued_at":"2026-05-18T01:59:53.949225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.949225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Minimum Equivalent Digraph","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-18T15:59:14Z","abstract_excerpt":"The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives an approximation algorithm with performance guarantee of pi^2/6 ~ 1.64. The algorithm and its analysis are based on the simple idea of contracting long cycles. (This result is strengthened slightly in ``On strongly connected digraphs with bounded cycle length'' (1996).) The analysis applies directly to 2-Exchange, a simple ``local improvement'' algorithm, showing that its performance guarante"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205040","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":"cs/0205040","created_at":"2026-05-18T01:59:53.949305+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205040v1","created_at":"2026-05-18T01:59:53.949305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205040","created_at":"2026-05-18T01:59:53.949305+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KRKCYPMQ3B5","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KRKCYPMQ3B5RRI2","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KRKCYPM","created_at":"2026-05-18T12:25:50.845339+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/7KRKCYPMQ3B5RRI2W7LPW5HYCR","json":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR.json","graph_json":"https://pith.science/api/pith-number/7KRKCYPMQ3B5RRI2W7LPW5HYCR/graph.json","events_json":"https://pith.science/api/pith-number/7KRKCYPMQ3B5RRI2W7LPW5HYCR/events.json","paper":"https://pith.science/paper/7KRKCYPM"},"agent_actions":{"view_html":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR","download_json":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR.json","view_paper":"https://pith.science/paper/7KRKCYPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205040&json=true","fetch_graph":"https://pith.science/api/pith-number/7KRKCYPMQ3B5RRI2W7LPW5HYCR/graph.json","fetch_events":"https://pith.science/api/pith-number/7KRKCYPMQ3B5RRI2W7LPW5HYCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/action/storage_attestation","attest_author":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/action/author_attestation","sign_citation":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/action/citation_signature","submit_replication":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/action/replication_record"}},"created_at":"2026-05-18T01:59:53.949305+00:00","updated_at":"2026-05-18T01:59:53.949305+00:00"}