{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5M33E4WJEBMXLDXTFOYGJGJ7ID","short_pith_number":"pith:5M33E4WJ","schema_version":"1.0","canonical_sha256":"eb37b272c92059758ef32bb064993f40e46c3af0c4727804defd17840c6b69c8","source":{"kind":"arxiv","id":"1201.6090","version":1},"attestation_state":"computed","paper":{"title":"A parallel approximation algorithm for mixed packing and covering semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Penghui Yao, Rahul Jain","submitted_at":"2012-01-29T23:00:30Z","abstract_excerpt":"We present a parallel approximation algorithm for a class of mixed packing and covering semidefinite programs which generalize on the class of positive semidefinite programs as considered by Jain and Yao [2011]. As a corollary we get a faster approximation algorithm for positive semidefinite programs with better dependence of the parallel running time on the approximation factor, as compared to that of Jain and Yao [2011]. Our algorithm and analysis is on similar lines as that of Young [2001] who considered analogous linear programs."},"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":"1201.6090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-29T23:00:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3cfb3fcc382000b4b635d31b7f14b862906b5b45bfcac656a626a86eb8bb6fba","abstract_canon_sha256":"f31a95988364be35989e029c77973e47b9d6644a888f7908398296c448732fa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:33.725491Z","signature_b64":"1Sh5MDf0SX/q9hlnT4/JrjmTplkRZSQnOie8hzZ04YecF9wWIa+X9AqspEh2zxn4KKPH1thEgbw4JEEO8eihCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb37b272c92059758ef32bb064993f40e46c3af0c4727804defd17840c6b69c8","last_reissued_at":"2026-05-18T04:03:33.724575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:33.724575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A parallel approximation algorithm for mixed packing and covering semidefinite programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Penghui Yao, Rahul Jain","submitted_at":"2012-01-29T23:00:30Z","abstract_excerpt":"We present a parallel approximation algorithm for a class of mixed packing and covering semidefinite programs which generalize on the class of positive semidefinite programs as considered by Jain and Yao [2011]. As a corollary we get a faster approximation algorithm for positive semidefinite programs with better dependence of the parallel running time on the approximation factor, as compared to that of Jain and Yao [2011]. Our algorithm and analysis is on similar lines as that of Young [2001] who considered analogous linear programs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6090","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":"1201.6090","created_at":"2026-05-18T04:03:33.724728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6090v1","created_at":"2026-05-18T04:03:33.724728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6090","created_at":"2026-05-18T04:03:33.724728+00:00"},{"alias_kind":"pith_short_12","alias_value":"5M33E4WJEBMX","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5M33E4WJEBMXLDXT","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5M33E4WJ","created_at":"2026-05-18T12:26:56.085431+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/5M33E4WJEBMXLDXTFOYGJGJ7ID","json":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID.json","graph_json":"https://pith.science/api/pith-number/5M33E4WJEBMXLDXTFOYGJGJ7ID/graph.json","events_json":"https://pith.science/api/pith-number/5M33E4WJEBMXLDXTFOYGJGJ7ID/events.json","paper":"https://pith.science/paper/5M33E4WJ"},"agent_actions":{"view_html":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID","download_json":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID.json","view_paper":"https://pith.science/paper/5M33E4WJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6090&json=true","fetch_graph":"https://pith.science/api/pith-number/5M33E4WJEBMXLDXTFOYGJGJ7ID/graph.json","fetch_events":"https://pith.science/api/pith-number/5M33E4WJEBMXLDXTFOYGJGJ7ID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/action/storage_attestation","attest_author":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/action/author_attestation","sign_citation":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/action/citation_signature","submit_replication":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/action/replication_record"}},"created_at":"2026-05-18T04:03:33.724728+00:00","updated_at":"2026-05-18T04:03:33.724728+00:00"}