{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:7KRKCYPMQ3B5RRI2W7LPW5HYCR","short_pith_number":"pith:7KRKCYPM","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"},"canonical_sha256":"faa2a161ec86c3d8c51ab7d6fb74f81475ff042f03bf6f8298be5c9e2d4b2709","source":{"kind":"arxiv","id":"cs/0205040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205040","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205040v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205040","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"7KRKCYPMQ3B5","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"7KRKCYPMQ3B5RRI2","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"7KRKCYPM","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:7KRKCYPMQ3B5RRI2W7LPW5HYCR","target":"record","payload":{"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"},"canonical_sha256":"faa2a161ec86c3d8c51ab7d6fb74f81475ff042f03bf6f8298be5c9e2d4b2709","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"},"source_kind":"arxiv","source_id":"cs/0205040","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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HuRuQB0LFFe/eNxn01YVF4zRh9zUyVZu/ZxYAud5bxXUpNWnfSIwOp70ws7RWDCQHaKM1x0sAPjQ7/S2D5wAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:00:09.990744Z"},"content_sha256":"aa86d0d89b20187de62adb3cb4c1a919cf4e49f28af8a0eb4c0106b2973ce3d3","schema_version":"1.0","event_id":"sha256:aa86d0d89b20187de62adb3cb4c1a919cf4e49f28af8a0eb4c0106b2973ce3d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:7KRKCYPMQ3B5RRI2W7LPW5HYCR","target":"graph","payload":{"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"},"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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkZYkGmyLpGge+NV2SDlz3l8b2Y6UdGh8IZG7nkUrLOwytKyFW/vVSKjooBwF03rqzi3rpLNN03eyQ3NCUSnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:00:09.991418Z"},"content_sha256":"59b396cef5d1b60525d8da5e00a78570c06115fa2bde13776b5862ecbfced496","schema_version":"1.0","event_id":"sha256:59b396cef5d1b60525d8da5e00a78570c06115fa2bde13776b5862ecbfced496"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/bundle.json","state_url":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/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-05-27T18:00:09Z","links":{"resolver":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR","bundle":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/bundle.json","state":"https://pith.science/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KRKCYPMQ3B5RRI2W7LPW5HYCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:7KRKCYPMQ3B5RRI2W7LPW5HYCR","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":"06b9766756d34680c7a4c7046b0be0ec37b36c0ac209970d1e33b4408ebf6e65","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:59:14Z","title_canon_sha256":"b4f644fe267550edbaa053f167255b83208c967db3f862e36829ae22123fef5f"},"schema_version":"1.0","source":{"id":"cs/0205040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205040","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205040v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205040","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"7KRKCYPMQ3B5","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"7KRKCYPMQ3B5RRI2","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"7KRKCYPM","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:59b396cef5d1b60525d8da5e00a78570c06115fa2bde13776b5862ecbfced496","target":"graph","created_at":"2026-05-18T01:59:53Z","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":"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","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:59:14Z","title":"Approximating the Minimum Equivalent Digraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205040","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:aa86d0d89b20187de62adb3cb4c1a919cf4e49f28af8a0eb4c0106b2973ce3d3","target":"record","created_at":"2026-05-18T01:59:53Z","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":"06b9766756d34680c7a4c7046b0be0ec37b36c0ac209970d1e33b4408ebf6e65","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:59:14Z","title_canon_sha256":"b4f644fe267550edbaa053f167255b83208c967db3f862e36829ae22123fef5f"},"schema_version":"1.0","source":{"id":"cs/0205040","kind":"arxiv","version":1}},"canonical_sha256":"faa2a161ec86c3d8c51ab7d6fb74f81475ff042f03bf6f8298be5c9e2d4b2709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faa2a161ec86c3d8c51ab7d6fb74f81475ff042f03bf6f8298be5c9e2d4b2709","first_computed_at":"2026-05-18T01:59:53.949225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.949225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9S3xeDQgzH6hOcOjNAFMY1nkGpGsDooCKooSI0mddo/sSb1sUdx/br3uUfBS6omZ9VTapGe2COiD+A3tvj6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.949758Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa86d0d89b20187de62adb3cb4c1a919cf4e49f28af8a0eb4c0106b2973ce3d3","sha256:59b396cef5d1b60525d8da5e00a78570c06115fa2bde13776b5862ecbfced496"],"state_sha256":"9700169c3f05dcd049e6f4e7a84dfcf3a45f0f52142e8f1236126cd91dec5ea7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSrlghrtuNXzRKsviKEyutGBwv5bXbceOxWGzqrHGz8/C8tP5ut/YjXSXNcuTnZdyu1JUD1m0/Z1JPjxed/bDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:00:09.994890Z","bundle_sha256":"961538524bf895e897bd6ca18baba2f328c45b06a98fcd3ba5f553b765b53d8a"}}