{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ROUFVNCK2BPFKRL27EPYL7TP2B","short_pith_number":"pith:ROUFVNCK","schema_version":"1.0","canonical_sha256":"8ba85ab44ad05e55457af91f85fe6fd05e5e553b3b9db48c8c760b23340d7903","source":{"kind":"arxiv","id":"1207.4372","version":2},"attestation_state":"computed","paper":{"title":"Faster SDP hierarchy solvers for local rounding algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2012-07-18T13:21:26Z","abstract_excerpt":"Convex relaxations based on different hierarchies of linear/semi-definite programs have been used recently to devise approximation algorithms for various optimization problems. The approximation guarantee of these algorithms improves with the number of {\\em rounds} $r$ in the hierarchy, though the complexity of solving (or even writing down the solution for) the $r$'th level program grows as $n^{\\Omega(r)}$ where $n$ is the input size.\n  In this work, we observe that many of these algorithms are based on {\\em local} rounding procedures that only use a small part of the SDP solution (of size $n"},"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":"1207.4372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-18T13:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"c8c17ccd8f5631cf75197768c5ad505b821664fd1d16230be0d8cd1e952dbaf2","abstract_canon_sha256":"66d36c4f35d2384d4b004be49d528d3ec4fadbd48b42b55a8900ebb12a3e8471"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.231475Z","signature_b64":"nWWswSx7SBCeABC239nfwF6+m1QzQkFR6mRy3ivPySLjOLT9NlOHXpYrlv5xgPXz1Bu9kc/tWMN6oxlqB+y/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ba85ab44ad05e55457af91f85fe6fd05e5e553b3b9db48c8c760b23340d7903","last_reissued_at":"2026-05-18T02:21:08.230982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.230982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster SDP hierarchy solvers for local rounding algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2012-07-18T13:21:26Z","abstract_excerpt":"Convex relaxations based on different hierarchies of linear/semi-definite programs have been used recently to devise approximation algorithms for various optimization problems. The approximation guarantee of these algorithms improves with the number of {\\em rounds} $r$ in the hierarchy, though the complexity of solving (or even writing down the solution for) the $r$'th level program grows as $n^{\\Omega(r)}$ where $n$ is the input size.\n  In this work, we observe that many of these algorithms are based on {\\em local} rounding procedures that only use a small part of the SDP solution (of size $n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4372","kind":"arxiv","version":2},"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":"1207.4372","created_at":"2026-05-18T02:21:08.231060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4372v2","created_at":"2026-05-18T02:21:08.231060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4372","created_at":"2026-05-18T02:21:08.231060+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROUFVNCK2BPF","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROUFVNCK2BPFKRL2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROUFVNCK","created_at":"2026-05-18T12:27:20.899486+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/ROUFVNCK2BPFKRL27EPYL7TP2B","json":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B.json","graph_json":"https://pith.science/api/pith-number/ROUFVNCK2BPFKRL27EPYL7TP2B/graph.json","events_json":"https://pith.science/api/pith-number/ROUFVNCK2BPFKRL27EPYL7TP2B/events.json","paper":"https://pith.science/paper/ROUFVNCK"},"agent_actions":{"view_html":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B","download_json":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B.json","view_paper":"https://pith.science/paper/ROUFVNCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4372&json=true","fetch_graph":"https://pith.science/api/pith-number/ROUFVNCK2BPFKRL27EPYL7TP2B/graph.json","fetch_events":"https://pith.science/api/pith-number/ROUFVNCK2BPFKRL27EPYL7TP2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B/action/storage_attestation","attest_author":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B/action/author_attestation","sign_citation":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B/action/citation_signature","submit_replication":"https://pith.science/pith/ROUFVNCK2BPFKRL27EPYL7TP2B/action/replication_record"}},"created_at":"2026-05-18T02:21:08.231060+00:00","updated_at":"2026-05-18T02:21:08.231060+00:00"}