{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QNWLQWA7LXPYVNQP2NKVH2RWGX","short_pith_number":"pith:QNWLQWA7","canonical_record":{"source":{"id":"1408.4685","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T15:00:36Z","cross_cats_sorted":[],"title_canon_sha256":"50235e395337b39e4ed8253a0ac459039f7cebee67ea5b143670cfebfeb710f2","abstract_canon_sha256":"4af9824ee3a92e05f80b38dd514650b22b4eadba3d8891dfa42de0c16c8e3593"},"schema_version":"1.0"},"canonical_sha256":"836cb8581f5ddf8ab60fd35553ea3635d6150f08347a4a6edb8ffc49e0db16d1","source":{"kind":"arxiv","id":"1408.4685","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4685","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4685v3","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4685","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"QNWLQWA7LXPY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QNWLQWA7LXPYVNQP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QNWLQWA7","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QNWLQWA7LXPYVNQP2NKVH2RWGX","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4685","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T15:00:36Z","cross_cats_sorted":[],"title_canon_sha256":"50235e395337b39e4ed8253a0ac459039f7cebee67ea5b143670cfebfeb710f2","abstract_canon_sha256":"4af9824ee3a92e05f80b38dd514650b22b4eadba3d8891dfa42de0c16c8e3593"},"schema_version":"1.0"},"canonical_sha256":"836cb8581f5ddf8ab60fd35553ea3635d6150f08347a4a6edb8ffc49e0db16d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:21.489053Z","signature_b64":"AddXGs6Gzx3sbTPw2WslLp5Q14JfuV9UgxvI173YEN4ruyaaH+EPFne7wxMo6DrMERTe5sIKCr4ioc5u418kAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"836cb8581f5ddf8ab60fd35553ea3635d6150f08347a4a6edb8ffc49e0db16d1","last_reissued_at":"2026-05-18T00:29:21.488534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:21.488534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4685","source_version":3,"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-18T00:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQ+XqugjtcL8kdUpHz+aGL4VA7Jpj994K/6xJ3knZYmYkwqwLTe6dzItwePRCvTDnxh2Sfzn90xV6jXu5reODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:08:04.763536Z"},"content_sha256":"2833ddb93fc3ca10a8e2911cc73539f86a059de81cea8b06c6ad73c08ecabbd7","schema_version":"1.0","event_id":"sha256:2833ddb93fc3ca10a8e2911cc73539f86a059de81cea8b06c6ad73c08ecabbd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QNWLQWA7LXPYVNQP2NKVH2RWGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Frank Permenter, Pablo Parrilo","submitted_at":"2014-08-20T15:00:36Z","abstract_excerpt":"We develop a practical semidefinite programming (SDP) facial reduction procedure that utilizes computationally efficient approximations of the positive semidefinite cone. The proposed method simplifies SDPs with no strictly feasible solution (a frequent output of parsers) by solving a sequence of easier optimization problems and could be a useful pre-processing technique for SDP solvers. We demonstrate effectiveness of the method on SDPs arising in practice, and describe our publicly-available software implementation. We also show how to find maximum rank matrices in our PSD cone approximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4685","kind":"arxiv","version":3},"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-18T00:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/TRWb3XMF/1TFdxclNly8DmmUUbai4KKR1w/dJCP0Y3rx6xzdh3aahrFap3QPw+cNMD2147G8g43g5RhWSfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:08:04.764029Z"},"content_sha256":"c31ee7fa15dc7e053dfd643f574c7de187b459c662244749e877a78f9921f010","schema_version":"1.0","event_id":"sha256:c31ee7fa15dc7e053dfd643f574c7de187b459c662244749e877a78f9921f010"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNWLQWA7LXPYVNQP2NKVH2RWGX/bundle.json","state_url":"https://pith.science/pith/QNWLQWA7LXPYVNQP2NKVH2RWGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNWLQWA7LXPYVNQP2NKVH2RWGX/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-08-19T00:08:04Z","links":{"resolver":"https://pith.science/pith/QNWLQWA7LXPYVNQP2NKVH2RWGX","bundle":"https://pith.science/pith/QNWLQWA7LXPYVNQP2NKVH2RWGX/bundle.json","state":"https://pith.science/pith/QNWLQWA7LXPYVNQP2NKVH2RWGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNWLQWA7LXPYVNQP2NKVH2RWGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QNWLQWA7LXPYVNQP2NKVH2RWGX","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":"4af9824ee3a92e05f80b38dd514650b22b4eadba3d8891dfa42de0c16c8e3593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T15:00:36Z","title_canon_sha256":"50235e395337b39e4ed8253a0ac459039f7cebee67ea5b143670cfebfeb710f2"},"schema_version":"1.0","source":{"id":"1408.4685","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4685","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4685v3","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4685","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"QNWLQWA7LXPY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QNWLQWA7LXPYVNQP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QNWLQWA7","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:c31ee7fa15dc7e053dfd643f574c7de187b459c662244749e877a78f9921f010","target":"graph","created_at":"2026-05-18T00:29:21Z","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 develop a practical semidefinite programming (SDP) facial reduction procedure that utilizes computationally efficient approximations of the positive semidefinite cone. The proposed method simplifies SDPs with no strictly feasible solution (a frequent output of parsers) by solving a sequence of easier optimization problems and could be a useful pre-processing technique for SDP solvers. We demonstrate effectiveness of the method on SDPs arising in practice, and describe our publicly-available software implementation. We also show how to find maximum rank matrices in our PSD cone approximation","authors_text":"Frank Permenter, Pablo Parrilo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T15:00:36Z","title":"Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4685","kind":"arxiv","version":3},"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:2833ddb93fc3ca10a8e2911cc73539f86a059de81cea8b06c6ad73c08ecabbd7","target":"record","created_at":"2026-05-18T00:29:21Z","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":"4af9824ee3a92e05f80b38dd514650b22b4eadba3d8891dfa42de0c16c8e3593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-20T15:00:36Z","title_canon_sha256":"50235e395337b39e4ed8253a0ac459039f7cebee67ea5b143670cfebfeb710f2"},"schema_version":"1.0","source":{"id":"1408.4685","kind":"arxiv","version":3}},"canonical_sha256":"836cb8581f5ddf8ab60fd35553ea3635d6150f08347a4a6edb8ffc49e0db16d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"836cb8581f5ddf8ab60fd35553ea3635d6150f08347a4a6edb8ffc49e0db16d1","first_computed_at":"2026-05-18T00:29:21.488534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:21.488534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AddXGs6Gzx3sbTPw2WslLp5Q14JfuV9UgxvI173YEN4ruyaaH+EPFne7wxMo6DrMERTe5sIKCr4ioc5u418kAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:21.489053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4685","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2833ddb93fc3ca10a8e2911cc73539f86a059de81cea8b06c6ad73c08ecabbd7","sha256:c31ee7fa15dc7e053dfd643f574c7de187b459c662244749e877a78f9921f010"],"state_sha256":"b2ab342fd3077ebbbac90e56452b89d930be018792384150526da29e70b9e0d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63yAIh/NUseBXGwM/ANawyeRiwK5Q1mBlMM07TqLd2I4IY2H/UUbzKhoXYPBjLOUNjUUxFtzit1ETVRBZVlJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T00:08:04.767777Z","bundle_sha256":"057dd68e8c87a6ca3f544b21b8e44ef6f193be278d7a44445a30ff69091f24ce"}}