{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L3VFMKKMZEFDLF3CQGNK2FQ6OL","short_pith_number":"pith:L3VFMKKM","schema_version":"1.0","canonical_sha256":"5eea56294cc90a359762819aad161e72df7e693ba00bb8d5cb14f2318c61c756","source":{"kind":"arxiv","id":"1406.7279","version":1},"attestation_state":"computed","paper":{"title":"Guruswami-Sinop Rounding without Higher Level Lasserre","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Deshpande, Rakesh Venkat","submitted_at":"2014-06-27T19:31:33Z","abstract_excerpt":"Guruswami and Sinop give a $O(1/\\delta)$ approximation guarantee for the non-uniform Sparsest Cut problem by solving $O(r)$-level Lasserre semidefinite constraints, provided that the generalized eigenvalues of the Laplacians of the cost and demand graphs satisfy a certain spectral condition, namely, $\\lambda_{r+1} \\geq \\Phi^{*}/(1-\\delta)$. Their key idea is a rounding technique that first maps a vector-valued solution to $[0, 1]$ using appropriately scaled projections onto Lasserre vectors. In this paper, we show that similar projections and analysis can be obtained using only $\\ell_{2}^{2}$ "},"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.7279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-27T19:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"96bb473e34f72e7f6832cb8f23fa6ca8430b3a254131fd06b8a792b69ae84168","abstract_canon_sha256":"1ebe6be3b1149d2216bfc23310b4ab071e05e62595110eb3edd893f81b0d2c11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:53.693945Z","signature_b64":"F5a0zkaDouISGvLTAtWffwMVbexps1HhsmejIo99gg+SGu9riDOkgAKIGmD+QQdCZPQDPeNv8OH0DN/6KClCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eea56294cc90a359762819aad161e72df7e693ba00bb8d5cb14f2318c61c756","last_reissued_at":"2026-05-18T02:48:53.693427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:53.693427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guruswami-Sinop Rounding without Higher Level Lasserre","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Deshpande, Rakesh Venkat","submitted_at":"2014-06-27T19:31:33Z","abstract_excerpt":"Guruswami and Sinop give a $O(1/\\delta)$ approximation guarantee for the non-uniform Sparsest Cut problem by solving $O(r)$-level Lasserre semidefinite constraints, provided that the generalized eigenvalues of the Laplacians of the cost and demand graphs satisfy a certain spectral condition, namely, $\\lambda_{r+1} \\geq \\Phi^{*}/(1-\\delta)$. Their key idea is a rounding technique that first maps a vector-valued solution to $[0, 1]$ using appropriately scaled projections onto Lasserre vectors. In this paper, we show that similar projections and analysis can be obtained using only $\\ell_{2}^{2}$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7279","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.7279","created_at":"2026-05-18T02:48:53.693503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7279v1","created_at":"2026-05-18T02:48:53.693503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7279","created_at":"2026-05-18T02:48:53.693503+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3VFMKKMZEFD","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3VFMKKMZEFDLF3C","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3VFMKKM","created_at":"2026-05-18T12:28:35.611951+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/L3VFMKKMZEFDLF3CQGNK2FQ6OL","json":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL.json","graph_json":"https://pith.science/api/pith-number/L3VFMKKMZEFDLF3CQGNK2FQ6OL/graph.json","events_json":"https://pith.science/api/pith-number/L3VFMKKMZEFDLF3CQGNK2FQ6OL/events.json","paper":"https://pith.science/paper/L3VFMKKM"},"agent_actions":{"view_html":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL","download_json":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL.json","view_paper":"https://pith.science/paper/L3VFMKKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7279&json=true","fetch_graph":"https://pith.science/api/pith-number/L3VFMKKMZEFDLF3CQGNK2FQ6OL/graph.json","fetch_events":"https://pith.science/api/pith-number/L3VFMKKMZEFDLF3CQGNK2FQ6OL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL/action/storage_attestation","attest_author":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL/action/author_attestation","sign_citation":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL/action/citation_signature","submit_replication":"https://pith.science/pith/L3VFMKKMZEFDLF3CQGNK2FQ6OL/action/replication_record"}},"created_at":"2026-05-18T02:48:53.693503+00:00","updated_at":"2026-05-18T02:48:53.693503+00:00"}