{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:CJAT57EGN4MJFWKSQDLIR5JPLD","short_pith_number":"pith:CJAT57EG","canonical_record":{"source":{"id":"0909.5577","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-30T11:47:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"08ce2661d4b7c5d8de22749c2dbe85907390d226e36a7cf3d200a3028df868ac","abstract_canon_sha256":"baa5b6832780e6bd0d228d0106adb51d214cb0161dcfc4a78b4806774ff2bad2"},"schema_version":"1.0"},"canonical_sha256":"12413efc866f1892d95280d688f52f58c343fe9cb4300fc3329ebdcff06092f5","source":{"kind":"arxiv","id":"0909.5577","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.5577","created_at":"2026-05-18T04:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"0909.5577v4","created_at":"2026-05-18T04:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5577","created_at":"2026-05-18T04:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"CJAT57EGN4MJ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CJAT57EGN4MJFWKS","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CJAT57EG","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:CJAT57EGN4MJFWKSQDLIR5JPLD","target":"record","payload":{"canonical_record":{"source":{"id":"0909.5577","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-30T11:47:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"08ce2661d4b7c5d8de22749c2dbe85907390d226e36a7cf3d200a3028df868ac","abstract_canon_sha256":"baa5b6832780e6bd0d228d0106adb51d214cb0161dcfc4a78b4806774ff2bad2"},"schema_version":"1.0"},"canonical_sha256":"12413efc866f1892d95280d688f52f58c343fe9cb4300fc3329ebdcff06092f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:46.275292Z","signature_b64":"FqkSUDdNBsmmXlvHb45QsRCX81T272x1oEdTrjheH27XwT8/uitQRkbK44eEQSti1dkFfh0gaGu8SPzocNLHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12413efc866f1892d95280d688f52f58c343fe9cb4300fc3329ebdcff06092f5","last_reissued_at":"2026-05-18T04:34:46.274777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:46.274777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.5577","source_version":4,"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:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AXE2g/jAqHeH5KIzwoldOxajZQivt3LL6d5i43l1N2kKt68WSkxZvp1WS7ZCN5VYI1tFEAgG9Nndp8e+X+oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:36:53.894534Z"},"content_sha256":"cd59112d1a747a84aecce17300787ae544fd218e25a2a9f87cb7ec6cd6725937","schema_version":"1.0","event_id":"sha256:cd59112d1a747a84aecce17300787ae544fd218e25a2a9f87cb7ec6cd6725937"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:CJAT57EGN4MJFWKSQDLIR5JPLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Class of Semidefinite Programs with rank-one solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Guillaume Sagnol","submitted_at":"2009-09-30T11:47:32Z","abstract_excerpt":"We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems of this class are semidefinite packing problems, which are the SDP analogs to vector packing problems. Of particular interest is the case in which our result guarantees the existence of a solution of rank one: we show that the computation of this solution actually reduces to a Second Order Cone Program (SOCP). We point out an application in statistics, in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5577","kind":"arxiv","version":4},"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:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2uod87JYTBFEaVnvJmNIM6Mi41ukb8AvLTwBpwi0czIBAcl1K9IlBFM/8hYdg9GRb4ZrgQMDwxYv96nbyKHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:36:53.895058Z"},"content_sha256":"806e98683fb629e4cd41893863a7b0e55a06639304efb236d45593983505786d","schema_version":"1.0","event_id":"sha256:806e98683fb629e4cd41893863a7b0e55a06639304efb236d45593983505786d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJAT57EGN4MJFWKSQDLIR5JPLD/bundle.json","state_url":"https://pith.science/pith/CJAT57EGN4MJFWKSQDLIR5JPLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJAT57EGN4MJFWKSQDLIR5JPLD/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-27T05:36:53Z","links":{"resolver":"https://pith.science/pith/CJAT57EGN4MJFWKSQDLIR5JPLD","bundle":"https://pith.science/pith/CJAT57EGN4MJFWKSQDLIR5JPLD/bundle.json","state":"https://pith.science/pith/CJAT57EGN4MJFWKSQDLIR5JPLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJAT57EGN4MJFWKSQDLIR5JPLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:CJAT57EGN4MJFWKSQDLIR5JPLD","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":"baa5b6832780e6bd0d228d0106adb51d214cb0161dcfc4a78b4806774ff2bad2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-30T11:47:32Z","title_canon_sha256":"08ce2661d4b7c5d8de22749c2dbe85907390d226e36a7cf3d200a3028df868ac"},"schema_version":"1.0","source":{"id":"0909.5577","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.5577","created_at":"2026-05-18T04:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"0909.5577v4","created_at":"2026-05-18T04:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5577","created_at":"2026-05-18T04:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"CJAT57EGN4MJ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CJAT57EGN4MJFWKS","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CJAT57EG","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:806e98683fb629e4cd41893863a7b0e55a06639304efb236d45593983505786d","target":"graph","created_at":"2026-05-18T04:34:46Z","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 show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems of this class are semidefinite packing problems, which are the SDP analogs to vector packing problems. Of particular interest is the case in which our result guarantees the existence of a solution of rank one: we show that the computation of this solution actually reduces to a Second Order Cone Program (SOCP). We point out an application in statistics, in the","authors_text":"Guillaume Sagnol","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-30T11:47:32Z","title":"A Class of Semidefinite Programs with rank-one solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5577","kind":"arxiv","version":4},"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:cd59112d1a747a84aecce17300787ae544fd218e25a2a9f87cb7ec6cd6725937","target":"record","created_at":"2026-05-18T04:34:46Z","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":"baa5b6832780e6bd0d228d0106adb51d214cb0161dcfc4a78b4806774ff2bad2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-09-30T11:47:32Z","title_canon_sha256":"08ce2661d4b7c5d8de22749c2dbe85907390d226e36a7cf3d200a3028df868ac"},"schema_version":"1.0","source":{"id":"0909.5577","kind":"arxiv","version":4}},"canonical_sha256":"12413efc866f1892d95280d688f52f58c343fe9cb4300fc3329ebdcff06092f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12413efc866f1892d95280d688f52f58c343fe9cb4300fc3329ebdcff06092f5","first_computed_at":"2026-05-18T04:34:46.274777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:46.274777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FqkSUDdNBsmmXlvHb45QsRCX81T272x1oEdTrjheH27XwT8/uitQRkbK44eEQSti1dkFfh0gaGu8SPzocNLHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:46.275292Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.5577","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd59112d1a747a84aecce17300787ae544fd218e25a2a9f87cb7ec6cd6725937","sha256:806e98683fb629e4cd41893863a7b0e55a06639304efb236d45593983505786d"],"state_sha256":"28a6b1424bb6d8d230bfef2637ff5fad349a3462e6ce0f846bb5a1cebcb963d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SCjeBr3j9r3CIpyp+IASoyPzDcOhoHuk4CgHr8njC8sew2JF9idn1k7GnnHz7GnfSm/oQIKOTrNydb+9p9EAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:36:53.897914Z","bundle_sha256":"2d348550392f14e14ad74b9077fcb8db45622fb76855e0196c719f37404ceba1"}}