{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QJK7Y7BUZUKVLE3MEZO546FLTA","short_pith_number":"pith:QJK7Y7BU","schema_version":"1.0","canonical_sha256":"8255fc7c34cd1555936c265dde78ab981106cdeba56808c07b676889401ce94d","source":{"kind":"arxiv","id":"1104.4680","version":1},"attestation_state":"computed","paper":{"title":"Rounding Semidefinite Programming Hierarchies via Global Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Boaz Barak, David Steurer, Prasad Raghavendra","submitted_at":"2011-04-25T04:58:50Z","abstract_excerpt":"We show a new way to round vector solutions of semidefinite programming (SDP) hierarchies into integral solutions, based on a connection between these hierarchies and the spectrum of the input graph. We demonstrate the utility of our method by providing a new SDP-hierarchy based algorithm for constraint satisfaction problems with 2-variable constraints (2-CSP's).\n  More concretely, we show for every 2-CSP instance I a rounding algorithm for r rounds of the Lasserre SDP hierarchy for I that obtains an integral solution that is at most \\eps worse than the relaxation's value (normalized to lie in"},"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":"1104.4680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-25T04:58:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ebb68282b3537d475f006f57461707c2e8a4f50883b3145d09606e669d157e95","abstract_canon_sha256":"12749adb540dc4120aa3d1293934366afe070c70c8a936371c3ea60483c7c5bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:33.639105Z","signature_b64":"y3Ld9sVDIn3R59EIJCL1/YhN7kEIwJLkHwQ1cErSfZ+y94aAQkKLnBwI+tx+edY1IxhpP4rxoQDms8Dge9ajDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8255fc7c34cd1555936c265dde78ab981106cdeba56808c07b676889401ce94d","last_reissued_at":"2026-05-18T04:23:33.638504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:33.638504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rounding Semidefinite Programming Hierarchies via Global Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Boaz Barak, David Steurer, Prasad Raghavendra","submitted_at":"2011-04-25T04:58:50Z","abstract_excerpt":"We show a new way to round vector solutions of semidefinite programming (SDP) hierarchies into integral solutions, based on a connection between these hierarchies and the spectrum of the input graph. We demonstrate the utility of our method by providing a new SDP-hierarchy based algorithm for constraint satisfaction problems with 2-variable constraints (2-CSP's).\n  More concretely, we show for every 2-CSP instance I a rounding algorithm for r rounds of the Lasserre SDP hierarchy for I that obtains an integral solution that is at most \\eps worse than the relaxation's value (normalized to lie in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4680","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":"1104.4680","created_at":"2026-05-18T04:23:33.638596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4680v1","created_at":"2026-05-18T04:23:33.638596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4680","created_at":"2026-05-18T04:23:33.638596+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJK7Y7BUZUKV","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJK7Y7BUZUKVLE3M","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJK7Y7BU","created_at":"2026-05-18T12:26:39.201973+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/QJK7Y7BUZUKVLE3MEZO546FLTA","json":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA.json","graph_json":"https://pith.science/api/pith-number/QJK7Y7BUZUKVLE3MEZO546FLTA/graph.json","events_json":"https://pith.science/api/pith-number/QJK7Y7BUZUKVLE3MEZO546FLTA/events.json","paper":"https://pith.science/paper/QJK7Y7BU"},"agent_actions":{"view_html":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA","download_json":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA.json","view_paper":"https://pith.science/paper/QJK7Y7BU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4680&json=true","fetch_graph":"https://pith.science/api/pith-number/QJK7Y7BUZUKVLE3MEZO546FLTA/graph.json","fetch_events":"https://pith.science/api/pith-number/QJK7Y7BUZUKVLE3MEZO546FLTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA/action/storage_attestation","attest_author":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA/action/author_attestation","sign_citation":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA/action/citation_signature","submit_replication":"https://pith.science/pith/QJK7Y7BUZUKVLE3MEZO546FLTA/action/replication_record"}},"created_at":"2026-05-18T04:23:33.638596+00:00","updated_at":"2026-05-18T04:23:33.638596+00:00"}