{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4M6NMCTMODVCFT23THA3NMIPQW","short_pith_number":"pith:4M6NMCTM","schema_version":"1.0","canonical_sha256":"e33cd60a6c70ea22cf5b99c1b6b10f85926bbd2150c4de2604ba83c1f87c3970","source":{"kind":"arxiv","id":"1104.2502","version":1},"attestation_state":"computed","paper":{"title":"A Parallel Approximation Algorithm for Positive Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Penghui Yao, Rahul Jain","submitted_at":"2011-04-13T14:13:02Z","abstract_excerpt":"Positive semidefinite programs are an important subclass of semidefinite programs in which all matrices involved in the specification of the problem are positive semidefinite and all scalars involved are non-negative. We present a parallel algorithm, which given an instance of a positive semidefinite program of size N and an approximation factor eps > 0, runs in (parallel) time poly(1/eps) \\cdot polylog(N), using poly(N) processors, and outputs a value which is within multiplicative factor of (1 + eps) to the optimal. Our result generalizes analogous result of Luby and Nisan [1993] for positiv"},"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.2502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-13T14:13:02Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"de12186a7539decaed1a2d4d1ec760f961aa1483737610c4463ce80128f16f8d","abstract_canon_sha256":"35219a6f4974f9d478eb5fa5228b5d8ce507a86cfc6710a8e0264bcf4329a816"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:34.728655Z","signature_b64":"/dIF8Z+jgLkdqNjexF3rEG8ucZQQBK8dwGrnnn+CW11LQM8umjc32YtQ6nDZyjkZqvlqyoewoEHHqeYYywarCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e33cd60a6c70ea22cf5b99c1b6b10f85926bbd2150c4de2604ba83c1f87c3970","last_reissued_at":"2026-05-18T04:24:34.728265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:34.728265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Approximation Algorithm for Positive Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Penghui Yao, Rahul Jain","submitted_at":"2011-04-13T14:13:02Z","abstract_excerpt":"Positive semidefinite programs are an important subclass of semidefinite programs in which all matrices involved in the specification of the problem are positive semidefinite and all scalars involved are non-negative. We present a parallel algorithm, which given an instance of a positive semidefinite program of size N and an approximation factor eps > 0, runs in (parallel) time poly(1/eps) \\cdot polylog(N), using poly(N) processors, and outputs a value which is within multiplicative factor of (1 + eps) to the optimal. Our result generalizes analogous result of Luby and Nisan [1993] for positiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2502","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.2502","created_at":"2026-05-18T04:24:34.728323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2502v1","created_at":"2026-05-18T04:24:34.728323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2502","created_at":"2026-05-18T04:24:34.728323+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M6NMCTMODVC","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M6NMCTMODVCFT23","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M6NMCTM","created_at":"2026-05-18T12:26:20.644004+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/4M6NMCTMODVCFT23THA3NMIPQW","json":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW.json","graph_json":"https://pith.science/api/pith-number/4M6NMCTMODVCFT23THA3NMIPQW/graph.json","events_json":"https://pith.science/api/pith-number/4M6NMCTMODVCFT23THA3NMIPQW/events.json","paper":"https://pith.science/paper/4M6NMCTM"},"agent_actions":{"view_html":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW","download_json":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW.json","view_paper":"https://pith.science/paper/4M6NMCTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2502&json=true","fetch_graph":"https://pith.science/api/pith-number/4M6NMCTMODVCFT23THA3NMIPQW/graph.json","fetch_events":"https://pith.science/api/pith-number/4M6NMCTMODVCFT23THA3NMIPQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW/action/storage_attestation","attest_author":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW/action/author_attestation","sign_citation":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW/action/citation_signature","submit_replication":"https://pith.science/pith/4M6NMCTMODVCFT23THA3NMIPQW/action/replication_record"}},"created_at":"2026-05-18T04:24:34.728323+00:00","updated_at":"2026-05-18T04:24:34.728323+00:00"}