{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UAGVBPHCOPD574LHAZW3SQKITW","short_pith_number":"pith:UAGVBPHC","schema_version":"1.0","canonical_sha256":"a00d50bce273c7dff167066db941489d8efd94099643e255eec4998d52669fce","source":{"kind":"arxiv","id":"1406.5665","version":1},"attestation_state":"computed","paper":{"title":"Constant Factor Approximation for Balanced Cut in the PIE model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","submitted_at":"2014-06-22T03:00:32Z","abstract_excerpt":"We propose and study a new semi-random semi-adversarial model for Balanced Cut, a planted model with permutation-invariant random edges (PIE). Our model is much more general than planted models considered previously. Consider a set of vertices V partitioned into two clusters $L$ and $R$ of equal size. Let $G$ be an arbitrary graph on $V$ with no edges between $L$ and $R$. Let $E_{random}$ be a set of edges sampled from an arbitrary permutation-invariant distribution (a distribution that is invariant under permutation of vertices in $L$ and in $R$). Then we say that $G + E_{random}$ is a graph "},"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":"1406.5665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-22T03:00:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c6ae4785a34d8368099af9358b6bdd3e8e6c842b54c2f4d38f5541eca3bc0649","abstract_canon_sha256":"4bbe531a8b1b2257177dec5a66fd76fdd9fd21542042cde68a7b27248794f7ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:11.031915Z","signature_b64":"5pAu/IMJCfV22BAOS+ymX9TY1XNGU17vLrJbUuNRXpXNjH9qYLXUOM4hiwZFxV3SkgmaoanR1vAJN2WGnf8gCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a00d50bce273c7dff167066db941489d8efd94099643e255eec4998d52669fce","last_reissued_at":"2026-05-18T02:49:11.031222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:11.031222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Factor Approximation for Balanced Cut in the PIE model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","submitted_at":"2014-06-22T03:00:32Z","abstract_excerpt":"We propose and study a new semi-random semi-adversarial model for Balanced Cut, a planted model with permutation-invariant random edges (PIE). Our model is much more general than planted models considered previously. Consider a set of vertices V partitioned into two clusters $L$ and $R$ of equal size. Let $G$ be an arbitrary graph on $V$ with no edges between $L$ and $R$. Let $E_{random}$ be a set of edges sampled from an arbitrary permutation-invariant distribution (a distribution that is invariant under permutation of vertices in $L$ and in $R$). Then we say that $G + E_{random}$ is a graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5665","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":"1406.5665","created_at":"2026-05-18T02:49:11.031356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5665v1","created_at":"2026-05-18T02:49:11.031356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5665","created_at":"2026-05-18T02:49:11.031356+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAGVBPHCOPD5","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAGVBPHCOPD574LH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAGVBPHC","created_at":"2026-05-18T12:28:52.271510+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/UAGVBPHCOPD574LHAZW3SQKITW","json":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW.json","graph_json":"https://pith.science/api/pith-number/UAGVBPHCOPD574LHAZW3SQKITW/graph.json","events_json":"https://pith.science/api/pith-number/UAGVBPHCOPD574LHAZW3SQKITW/events.json","paper":"https://pith.science/paper/UAGVBPHC"},"agent_actions":{"view_html":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW","download_json":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW.json","view_paper":"https://pith.science/paper/UAGVBPHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5665&json=true","fetch_graph":"https://pith.science/api/pith-number/UAGVBPHCOPD574LHAZW3SQKITW/graph.json","fetch_events":"https://pith.science/api/pith-number/UAGVBPHCOPD574LHAZW3SQKITW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW/action/storage_attestation","attest_author":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW/action/author_attestation","sign_citation":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW/action/citation_signature","submit_replication":"https://pith.science/pith/UAGVBPHCOPD574LHAZW3SQKITW/action/replication_record"}},"created_at":"2026-05-18T02:49:11.031356+00:00","updated_at":"2026-05-18T02:49:11.031356+00:00"}