{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NUGZUWU3I2AKWZGCIKERU2JZOX","short_pith_number":"pith:NUGZUWU3","canonical_record":{"source":{"id":"1605.09527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-31T08:43:44Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"37d004cde7ede77d6f19c88c6113d455d5a1507d33132cc6cb0857008ebb551c","abstract_canon_sha256":"c39429dab863a6bd42fb041ffb5d8a2c1e348e69d841c415213da5bc18fb24e3"},"schema_version":"1.0"},"canonical_sha256":"6d0d9a5a9b4680ab64c242891a693975f4b341ad7492982d2016a2b755e944ab","source":{"kind":"arxiv","id":"1605.09527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09527","created_at":"2026-05-18T01:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09527v2","created_at":"2026-05-18T01:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09527","created_at":"2026-05-18T01:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"NUGZUWU3I2AK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NUGZUWU3I2AKWZGC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NUGZUWU3","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NUGZUWU3I2AKWZGCIKERU2JZOX","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-31T08:43:44Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"37d004cde7ede77d6f19c88c6113d455d5a1507d33132cc6cb0857008ebb551c","abstract_canon_sha256":"c39429dab863a6bd42fb041ffb5d8a2c1e348e69d841c415213da5bc18fb24e3"},"schema_version":"1.0"},"canonical_sha256":"6d0d9a5a9b4680ab64c242891a693975f4b341ad7492982d2016a2b755e944ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:34.316935Z","signature_b64":"3cOX3l85GfhhY4XznePIzuNrAG0UzZjUc/3S0nB3wE2ork+xw1BE866NskZgNdkxtnYmgOIP+XU3rrjpTKG6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0d9a5a9b4680ab64c242891a693975f4b341ad7492982d2016a2b755e944ab","last_reissued_at":"2026-05-18T01:09:34.316443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:34.316443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09527","source_version":2,"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-18T01:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WD7cTF4I7Kq/O4bGKXmu1qauibBMWv0S2bpRijlNhg5a/pIW6WNlLFpitEJVaEX32BSl+tkgyZ2NBGFAOEDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:04:32.709654Z"},"content_sha256":"2917ccc0cd73e6f6fc2459512beeb7293f82bc96abdbd96a43de9f09e9fe1ac6","schema_version":"1.0","event_id":"sha256:2917ccc0cd73e6f6fc2459512beeb7293f82bc96abdbd96a43de9f09e9fe1ac6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NUGZUWU3I2AKWZGCIKERU2JZOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Biconvex Relaxation for Semidefinite Programming in Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.CV","authors_text":"Abhay Kumar, Carlos Castillo, Christoph Studer, David Jacobs, Sohil Shah, Tom Goldstein","submitted_at":"2016-05-31T08:43:44Z","abstract_excerpt":"Semidefinite programming is an indispensable tool in computer vision, but general-purpose solvers for semidefinite programs are often too slow and memory intensive for large-scale problems. We propose a general framework to approximately solve large-scale semidefinite problems (SDPs) at low complexity. Our approach, referred to as biconvex relaxation (BCR), transforms a general SDP into a specific biconvex optimization problem, which can then be solved in the original, low-dimensional variable space at low complexity. The resulting biconvex problem is solved using an efficient alternating mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09527","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"},"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-18T01:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmSrk6HQiSyYTp8ajU8PUvhDd1GF8K/dyBmFlAtIKENalS9sKO23VsWTLnSBqkCA1RtNb6XQZ4wTxNEwY3PPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:04:32.710002Z"},"content_sha256":"efa009a99fbc2ce0d10260ba23f9fb4789ef4f93409f82ad3b3e1a73d3c25770","schema_version":"1.0","event_id":"sha256:efa009a99fbc2ce0d10260ba23f9fb4789ef4f93409f82ad3b3e1a73d3c25770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUGZUWU3I2AKWZGCIKERU2JZOX/bundle.json","state_url":"https://pith.science/pith/NUGZUWU3I2AKWZGCIKERU2JZOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUGZUWU3I2AKWZGCIKERU2JZOX/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-06-04T16:04:32Z","links":{"resolver":"https://pith.science/pith/NUGZUWU3I2AKWZGCIKERU2JZOX","bundle":"https://pith.science/pith/NUGZUWU3I2AKWZGCIKERU2JZOX/bundle.json","state":"https://pith.science/pith/NUGZUWU3I2AKWZGCIKERU2JZOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUGZUWU3I2AKWZGCIKERU2JZOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NUGZUWU3I2AKWZGCIKERU2JZOX","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":"c39429dab863a6bd42fb041ffb5d8a2c1e348e69d841c415213da5bc18fb24e3","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-31T08:43:44Z","title_canon_sha256":"37d004cde7ede77d6f19c88c6113d455d5a1507d33132cc6cb0857008ebb551c"},"schema_version":"1.0","source":{"id":"1605.09527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09527","created_at":"2026-05-18T01:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09527v2","created_at":"2026-05-18T01:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09527","created_at":"2026-05-18T01:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"NUGZUWU3I2AK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NUGZUWU3I2AKWZGC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NUGZUWU3","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:efa009a99fbc2ce0d10260ba23f9fb4789ef4f93409f82ad3b3e1a73d3c25770","target":"graph","created_at":"2026-05-18T01:09:34Z","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":"Semidefinite programming is an indispensable tool in computer vision, but general-purpose solvers for semidefinite programs are often too slow and memory intensive for large-scale problems. We propose a general framework to approximately solve large-scale semidefinite problems (SDPs) at low complexity. Our approach, referred to as biconvex relaxation (BCR), transforms a general SDP into a specific biconvex optimization problem, which can then be solved in the original, low-dimensional variable space at low complexity. The resulting biconvex problem is solved using an efficient alternating mini","authors_text":"Abhay Kumar, Carlos Castillo, Christoph Studer, David Jacobs, Sohil Shah, Tom Goldstein","cross_cats":["cs.NA","math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-31T08:43:44Z","title":"Biconvex Relaxation for Semidefinite Programming in Computer Vision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09527","kind":"arxiv","version":2},"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:2917ccc0cd73e6f6fc2459512beeb7293f82bc96abdbd96a43de9f09e9fe1ac6","target":"record","created_at":"2026-05-18T01:09:34Z","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":"c39429dab863a6bd42fb041ffb5d8a2c1e348e69d841c415213da5bc18fb24e3","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-31T08:43:44Z","title_canon_sha256":"37d004cde7ede77d6f19c88c6113d455d5a1507d33132cc6cb0857008ebb551c"},"schema_version":"1.0","source":{"id":"1605.09527","kind":"arxiv","version":2}},"canonical_sha256":"6d0d9a5a9b4680ab64c242891a693975f4b341ad7492982d2016a2b755e944ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d0d9a5a9b4680ab64c242891a693975f4b341ad7492982d2016a2b755e944ab","first_computed_at":"2026-05-18T01:09:34.316443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:34.316443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3cOX3l85GfhhY4XznePIzuNrAG0UzZjUc/3S0nB3wE2ork+xw1BE866NskZgNdkxtnYmgOIP+XU3rrjpTKG6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:34.316935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2917ccc0cd73e6f6fc2459512beeb7293f82bc96abdbd96a43de9f09e9fe1ac6","sha256:efa009a99fbc2ce0d10260ba23f9fb4789ef4f93409f82ad3b3e1a73d3c25770"],"state_sha256":"798feec0a423822b2e6cce1e5ee6e2dead7175af3c34b7f35695bf0eb481802b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34SmnRWyl/iFM8o7r9I1oU5UZ4u8HEfd7gMbG43mBG7+1+cWn1A/+zgh2pEMmoMrYVaTARqN6G4N/etWnWg1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:04:32.712005Z","bundle_sha256":"9f85f182e33dafb25b43ac399415e3deba6bdec4eb73f9c867d1054705bcb2df"}}