{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5M33E4WJEBMXLDXTFOYGJGJ7ID","short_pith_number":"pith:5M33E4WJ","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"},"canonical_sha256":"eb37b272c92059758ef32bb064993f40e46c3af0c4727804defd17840c6b69c8","source":{"kind":"arxiv","id":"1201.6090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6090","created_at":"2026-05-18T04:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6090v1","created_at":"2026-05-18T04:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6090","created_at":"2026-05-18T04:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"5M33E4WJEBMX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5M33E4WJEBMXLDXT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5M33E4WJ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5M33E4WJEBMXLDXTFOYGJGJ7ID","target":"record","payload":{"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"},"canonical_sha256":"eb37b272c92059758ef32bb064993f40e46c3af0c4727804defd17840c6b69c8","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"},"source_kind":"arxiv","source_id":"1201.6090","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBCLWvGVQZ5WKQbTJmKP+RjtwnY72mVOtLMLPzdOJa0exKkFljZI3jDPrNDdA8l5wxFTw9ZDgmBCPdGg9Am2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:08:26.849028Z"},"content_sha256":"4160c6754adeca79e5fed422fe4bc8b0c4cbbcd9685efc1e7c888c7cc50a029a","schema_version":"1.0","event_id":"sha256:4160c6754adeca79e5fed422fe4bc8b0c4cbbcd9685efc1e7c888c7cc50a029a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5M33E4WJEBMXLDXTFOYGJGJ7ID","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqI8uBpTKZ14n7bXHHWxJ7DHz7FiAEp+6cJ60oVhwiKcr0MvQOU3rllD1Bzg7GccqI8PrBuFto3QVaNJAZb4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:08:26.849741Z"},"content_sha256":"00a05e05b01da55ca25a1cbd12441b4a222661458396a09ea69e061b68ae451e","schema_version":"1.0","event_id":"sha256:00a05e05b01da55ca25a1cbd12441b4a222661458396a09ea69e061b68ae451e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/bundle.json","state_url":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T15:08:26Z","links":{"resolver":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID","bundle":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/bundle.json","state":"https://pith.science/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5M33E4WJEBMXLDXTFOYGJGJ7ID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5M33E4WJEBMXLDXTFOYGJGJ7ID","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f31a95988364be35989e029c77973e47b9d6644a888f7908398296c448732fa0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-29T23:00:30Z","title_canon_sha256":"3cfb3fcc382000b4b635d31b7f14b862906b5b45bfcac656a626a86eb8bb6fba"},"schema_version":"1.0","source":{"id":"1201.6090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6090","created_at":"2026-05-18T04:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6090v1","created_at":"2026-05-18T04:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6090","created_at":"2026-05-18T04:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"5M33E4WJEBMX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5M33E4WJEBMXLDXT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5M33E4WJ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:00a05e05b01da55ca25a1cbd12441b4a222661458396a09ea69e061b68ae451e","target":"graph","created_at":"2026-05-18T04:03:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Penghui Yao, Rahul Jain","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-29T23:00:30Z","title":"A parallel approximation algorithm for mixed packing and covering semidefinite programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6090","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4160c6754adeca79e5fed422fe4bc8b0c4cbbcd9685efc1e7c888c7cc50a029a","target":"record","created_at":"2026-05-18T04:03:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f31a95988364be35989e029c77973e47b9d6644a888f7908398296c448732fa0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-29T23:00:30Z","title_canon_sha256":"3cfb3fcc382000b4b635d31b7f14b862906b5b45bfcac656a626a86eb8bb6fba"},"schema_version":"1.0","source":{"id":"1201.6090","kind":"arxiv","version":1}},"canonical_sha256":"eb37b272c92059758ef32bb064993f40e46c3af0c4727804defd17840c6b69c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb37b272c92059758ef32bb064993f40e46c3af0c4727804defd17840c6b69c8","first_computed_at":"2026-05-18T04:03:33.724575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:33.724575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Sh5MDf0SX/q9hlnT4/JrjmTplkRZSQnOie8hzZ04YecF9wWIa+X9AqspEh2zxn4KKPH1thEgbw4JEEO8eihCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:33.725491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4160c6754adeca79e5fed422fe4bc8b0c4cbbcd9685efc1e7c888c7cc50a029a","sha256:00a05e05b01da55ca25a1cbd12441b4a222661458396a09ea69e061b68ae451e"],"state_sha256":"a3043dda7e8a5384b1e06f64fa16fe6e8d03c5501e6ca4e45f6ac2fb8b7111d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3DyD5vuLtq1x9gj7kEdCb7LmCgl51Oj0X1n8pyK+Dj8jDbEOThagAGjBEFhYW51yDLtwxTHADL2sKyFcgHUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:08:26.853574Z","bundle_sha256":"9d0ab526dbfe2df3f550940c3e74c27f219e2e3e475e7901b6c8f429a934c75d"}}