{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PYCLHRLUDCNUYNWLDN5C3EFR2D","short_pith_number":"pith:PYCLHRLU","schema_version":"1.0","canonical_sha256":"7e04b3c574189b4c36cb1b7a2d90b1d0ce3a19b56be88731bb3261ed03cac031","source":{"kind":"arxiv","id":"1305.1681","version":3},"attestation_state":"computed","paper":{"title":"Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","submitted_at":"2013-05-07T23:54:03Z","abstract_excerpt":"We investigate the notion of stability proposed by Bilu and Linial. We obtain an exact polynomial-time algorithm for $\\gamma$-stable Max Cut instances with $\\gamma \\geq c\\sqrt{\\log n}\\log\\log n$ for some absolute constant $c > 0$. Our algorithm is robust: it never returns an incorrect answer; if the instance is $\\gamma$-stable, it finds the maximum cut, otherwise, it either finds the maximum cut or certifies that the instance is not $\\gamma$-stable. We prove that there is no robust polynomial-time algorithm for $\\gamma$-stable instances of Max Cut when $\\gamma < \\alpha_{SC}(n/2)$, where $\\alph"},"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":"1305.1681","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-07T23:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"a76eda5623aad5910fa63a7ff77853d8328e66fffec2e9dad4cbbd511f4ce5e9","abstract_canon_sha256":"9ae035e3f2b414aace0e952d98e6f0a0aefb78d319208caa484461c37338ea9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:23.385649Z","signature_b64":"EYuGYQIeKR+IW/z+ECDcjGsQ2jdK7gOpxUCoOYTGF2WLiXpmypCibclL88685vcKzGXANh6jo1pSyvxMpzXNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e04b3c574189b4c36cb1b7a2d90b1d0ce3a19b56be88731bb3261ed03cac031","last_reissued_at":"2026-05-18T03:07:23.385101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:23.385101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev","submitted_at":"2013-05-07T23:54:03Z","abstract_excerpt":"We investigate the notion of stability proposed by Bilu and Linial. We obtain an exact polynomial-time algorithm for $\\gamma$-stable Max Cut instances with $\\gamma \\geq c\\sqrt{\\log n}\\log\\log n$ for some absolute constant $c > 0$. Our algorithm is robust: it never returns an incorrect answer; if the instance is $\\gamma$-stable, it finds the maximum cut, otherwise, it either finds the maximum cut or certifies that the instance is not $\\gamma$-stable. We prove that there is no robust polynomial-time algorithm for $\\gamma$-stable instances of Max Cut when $\\gamma < \\alpha_{SC}(n/2)$, where $\\alph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1681","kind":"arxiv","version":3},"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":"1305.1681","created_at":"2026-05-18T03:07:23.385187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1681v3","created_at":"2026-05-18T03:07:23.385187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1681","created_at":"2026-05-18T03:07:23.385187+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYCLHRLUDCNU","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYCLHRLUDCNUYNWL","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYCLHRLU","created_at":"2026-05-18T12:27:57.521954+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/PYCLHRLUDCNUYNWLDN5C3EFR2D","json":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D.json","graph_json":"https://pith.science/api/pith-number/PYCLHRLUDCNUYNWLDN5C3EFR2D/graph.json","events_json":"https://pith.science/api/pith-number/PYCLHRLUDCNUYNWLDN5C3EFR2D/events.json","paper":"https://pith.science/paper/PYCLHRLU"},"agent_actions":{"view_html":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D","download_json":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D.json","view_paper":"https://pith.science/paper/PYCLHRLU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1681&json=true","fetch_graph":"https://pith.science/api/pith-number/PYCLHRLUDCNUYNWLDN5C3EFR2D/graph.json","fetch_events":"https://pith.science/api/pith-number/PYCLHRLUDCNUYNWLDN5C3EFR2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D/action/storage_attestation","attest_author":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D/action/author_attestation","sign_citation":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D/action/citation_signature","submit_replication":"https://pith.science/pith/PYCLHRLUDCNUYNWLDN5C3EFR2D/action/replication_record"}},"created_at":"2026-05-18T03:07:23.385187+00:00","updated_at":"2026-05-18T03:07:23.385187+00:00"}