{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KGPTEIORWEVB3MZGBDXRU56TDF","short_pith_number":"pith:KGPTEIOR","canonical_record":{"source":{"id":"1010.1047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-06T02:14:09Z","cross_cats_sorted":[],"title_canon_sha256":"cc97ee2ad40dee82b2251c886a9201865d04d5209f26d2db4fcb30e4f9120465","abstract_canon_sha256":"4bcb68ff6d0265c610a2f0658c76c0319e53ec61dc743e1bcd4ef2d09793a46b"},"schema_version":"1.0"},"canonical_sha256":"519f3221d1b12a1db32608ef1a77d31975513cb0c6c2f7ed6748845eaed0797a","source":{"kind":"arxiv","id":"1010.1047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1047","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1047v1","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1047","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"KGPTEIORWEVB","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KGPTEIORWEVB3MZG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KGPTEIOR","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KGPTEIORWEVB3MZGBDXRU56TDF","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-06T02:14:09Z","cross_cats_sorted":[],"title_canon_sha256":"cc97ee2ad40dee82b2251c886a9201865d04d5209f26d2db4fcb30e4f9120465","abstract_canon_sha256":"4bcb68ff6d0265c610a2f0658c76c0319e53ec61dc743e1bcd4ef2d09793a46b"},"schema_version":"1.0"},"canonical_sha256":"519f3221d1b12a1db32608ef1a77d31975513cb0c6c2f7ed6748845eaed0797a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:46.494639Z","signature_b64":"ebN55As9yuRuZeYI6MCkegiQO4OMu82erZr5Vs/m3Dcs3CdRgaIWhWoB5zVvt7FmXNT9hPzuLgP2bBNeHmGbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"519f3221d1b12a1db32608ef1a77d31975513cb0c6c2f7ed6748845eaed0797a","last_reissued_at":"2026-05-18T02:23:46.493984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:46.493984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1047","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-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+O1N5yGqEO6N4r3gQbmrqm20Sy7mW6XtoKCpWV4zKRsxYMpFbywDKjSr2VuaryVY6D2hJ6HFWIIh3xTVBrIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:16:12.435861Z"},"content_sha256":"fbeceff02cd6e07afe15fd340ee2828ef80c86b50eb108784b1a55503fe18307","schema_version":"1.0","event_id":"sha256:fbeceff02cd6e07afe15fd340ee2828ef80c86b50eb108784b1a55503fe18307"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KGPTEIORWEVB3MZGBDXRU56TDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cut-Matching Games on Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Louis","submitted_at":"2010-10-06T02:14:09Z","abstract_excerpt":"We give O(log^2 n)-approximation algorithm based on the cut-matching framework of [10, 13, 14] for computing the sparsest cut on directed graphs. Our algorithm uses only O(log^2 n) single commodity max-flow computations and thus breaks the multicommodity-flow barrier for computing the sparsest cut on directed graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1047","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-18T02:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DzsurjN9XmK3Kfc17FSPpYi0O5L9c6s4E4dquMeSOjbJ15AA7wKae5eW4Lxjcyc2UVYqOpstjiHY7UTEkboDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:16:12.436478Z"},"content_sha256":"e43294243b591c8bc6eb76d9223a08bcbdb3e47bec82e065e60e333a943afebd","schema_version":"1.0","event_id":"sha256:e43294243b591c8bc6eb76d9223a08bcbdb3e47bec82e065e60e333a943afebd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/bundle.json","state_url":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGPTEIORWEVB3MZGBDXRU56TDF/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-24T08:16:12Z","links":{"resolver":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF","bundle":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/bundle.json","state":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGPTEIORWEVB3MZGBDXRU56TDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KGPTEIORWEVB3MZGBDXRU56TDF","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":"4bcb68ff6d0265c610a2f0658c76c0319e53ec61dc743e1bcd4ef2d09793a46b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-06T02:14:09Z","title_canon_sha256":"cc97ee2ad40dee82b2251c886a9201865d04d5209f26d2db4fcb30e4f9120465"},"schema_version":"1.0","source":{"id":"1010.1047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1047","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1047v1","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1047","created_at":"2026-05-18T02:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"KGPTEIORWEVB","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KGPTEIORWEVB3MZG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KGPTEIOR","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:e43294243b591c8bc6eb76d9223a08bcbdb3e47bec82e065e60e333a943afebd","target":"graph","created_at":"2026-05-18T02:23:46Z","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":"We give O(log^2 n)-approximation algorithm based on the cut-matching framework of [10, 13, 14] for computing the sparsest cut on directed graphs. Our algorithm uses only O(log^2 n) single commodity max-flow computations and thus breaks the multicommodity-flow barrier for computing the sparsest cut on directed graphs","authors_text":"Anand Louis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-06T02:14:09Z","title":"Cut-Matching Games on Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1047","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:fbeceff02cd6e07afe15fd340ee2828ef80c86b50eb108784b1a55503fe18307","target":"record","created_at":"2026-05-18T02:23:46Z","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":"4bcb68ff6d0265c610a2f0658c76c0319e53ec61dc743e1bcd4ef2d09793a46b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-06T02:14:09Z","title_canon_sha256":"cc97ee2ad40dee82b2251c886a9201865d04d5209f26d2db4fcb30e4f9120465"},"schema_version":"1.0","source":{"id":"1010.1047","kind":"arxiv","version":1}},"canonical_sha256":"519f3221d1b12a1db32608ef1a77d31975513cb0c6c2f7ed6748845eaed0797a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"519f3221d1b12a1db32608ef1a77d31975513cb0c6c2f7ed6748845eaed0797a","first_computed_at":"2026-05-18T02:23:46.493984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:46.493984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ebN55As9yuRuZeYI6MCkegiQO4OMu82erZr5Vs/m3Dcs3CdRgaIWhWoB5zVvt7FmXNT9hPzuLgP2bBNeHmGbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:46.494639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbeceff02cd6e07afe15fd340ee2828ef80c86b50eb108784b1a55503fe18307","sha256:e43294243b591c8bc6eb76d9223a08bcbdb3e47bec82e065e60e333a943afebd"],"state_sha256":"d9a136fd9788dedef2da9739378bd5daeaf8d089cc0735e1d5765444a656d552"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XaFZruYso5s8BbPkK0v2QuWrYnDBEWB0OWcgMfDGm0EaLIcMxODqi7J2VGxTfq99Y+0cH7Um7S7r+RY9Dt1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T08:16:12.439429Z","bundle_sha256":"8eba546eed74af43fb1b44b444e24607696a41ceae2b00c5775e6264f5ea9460"}}