{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KGPTEIORWEVB3MZGBDXRU56TDF","short_pith_number":"pith:KGPTEIOR","schema_version":"1.0","canonical_sha256":"519f3221d1b12a1db32608ef1a77d31975513cb0c6c2f7ed6748845eaed0797a","source":{"kind":"arxiv","id":"1010.1047","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.1047","created_at":"2026-05-18T02:23:46.494088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1047v1","created_at":"2026-05-18T02:23:46.494088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1047","created_at":"2026-05-18T02:23:46.494088+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGPTEIORWEVB","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGPTEIORWEVB3MZG","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGPTEIOR","created_at":"2026-05-18T12:26:09.077623+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/KGPTEIORWEVB3MZGBDXRU56TDF","json":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF.json","graph_json":"https://pith.science/api/pith-number/KGPTEIORWEVB3MZGBDXRU56TDF/graph.json","events_json":"https://pith.science/api/pith-number/KGPTEIORWEVB3MZGBDXRU56TDF/events.json","paper":"https://pith.science/paper/KGPTEIOR"},"agent_actions":{"view_html":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF","download_json":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF.json","view_paper":"https://pith.science/paper/KGPTEIOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1047&json=true","fetch_graph":"https://pith.science/api/pith-number/KGPTEIORWEVB3MZGBDXRU56TDF/graph.json","fetch_events":"https://pith.science/api/pith-number/KGPTEIORWEVB3MZGBDXRU56TDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/action/storage_attestation","attest_author":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/action/author_attestation","sign_citation":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/action/citation_signature","submit_replication":"https://pith.science/pith/KGPTEIORWEVB3MZGBDXRU56TDF/action/replication_record"}},"created_at":"2026-05-18T02:23:46.494088+00:00","updated_at":"2026-05-18T02:23:46.494088+00:00"}