{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D3TAEHGUN3YOH5XS77HQBDZ67H","short_pith_number":"pith:D3TAEHGU","canonical_record":{"source":{"id":"1602.00431","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-02-01T08:58:49Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"139fc10b19914d37c8868fc3e55e1de0d1ea6ac5207f6a449f03583b509c9bb6","abstract_canon_sha256":"c73106e335f5673ee744a87b1f41f9e63cf79f7fd0497faafdc953f662099ffb"},"schema_version":"1.0"},"canonical_sha256":"1ee6021cd46ef0e3f6f2ffcf008f3ef9fe8159b906d8f3e24f771ac667afded3","source":{"kind":"arxiv","id":"1602.00431","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00431","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00431v3","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00431","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"D3TAEHGUN3YO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3TAEHGUN3YOH5XS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3TAEHGU","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D3TAEHGUN3YOH5XS77HQBDZ67H","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00431","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-02-01T08:58:49Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"139fc10b19914d37c8868fc3e55e1de0d1ea6ac5207f6a449f03583b509c9bb6","abstract_canon_sha256":"c73106e335f5673ee744a87b1f41f9e63cf79f7fd0497faafdc953f662099ffb"},"schema_version":"1.0"},"canonical_sha256":"1ee6021cd46ef0e3f6f2ffcf008f3ef9fe8159b906d8f3e24f771ac667afded3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:38.047026Z","signature_b64":"c2a7EEKPAu9RrXTP1PZG869jlXFgKeN+gMCFByErQTyNHDoC50wncoLK22NkC7UECikvhQ5EVdqsXfUfY0HcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee6021cd46ef0e3f6f2ffcf008f3ef9fe8159b906d8f3e24f771ac667afded3","last_reissued_at":"2026-05-18T00:57:38.046597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:38.046597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00431","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:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jj/SbcELdABAlOdk1YIEmfcGRi+7z9LqlJnKd6WPzdeUOTmyxnJ7f21EnyVcWipl4p2Qd6Ffhc+kJNy80/LoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T06:00:09.092502Z"},"content_sha256":"41cda4e55fd55b738f6f03c41ac225e38424edfafec5bc446b092e0fae0f9a0b","schema_version":"1.0","event_id":"sha256:41cda4e55fd55b738f6f03c41ac225e38424edfafec5bc446b092e0fae0f9a0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D3TAEHGUN3YOH5XS77HQBDZ67H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving rank-constrained semidefinite programs in exact arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.SY","authors_text":"Simone Naldi","submitted_at":"2016-02-01T08:58:49Z","abstract_excerpt":"We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active, this is a non-convex optimization problem, otherwise it is a semidefinite program. Both find numerous applications especially in systems control theory and combinatorial optimization, but even in more general contexts such as polynomial optimization or real algebra. While numerical algorithms exist for solving this problem, such as interior-point or Newton-li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00431","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:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gz/wwm070lCip31irsc2IyOOP0LyfiqV06dWA7h0rnNhFkayprMXmyMYG9Q4VECFwqnQJNVciV6kiIq0F+zNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T06:00:09.092871Z"},"content_sha256":"d36c40fcdd27c1ab82689328e05aec256c6bd2fa6b87825fc56139d9d45a72b5","schema_version":"1.0","event_id":"sha256:d36c40fcdd27c1ab82689328e05aec256c6bd2fa6b87825fc56139d9d45a72b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3TAEHGUN3YOH5XS77HQBDZ67H/bundle.json","state_url":"https://pith.science/pith/D3TAEHGUN3YOH5XS77HQBDZ67H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3TAEHGUN3YOH5XS77HQBDZ67H/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-07-04T06:00:09Z","links":{"resolver":"https://pith.science/pith/D3TAEHGUN3YOH5XS77HQBDZ67H","bundle":"https://pith.science/pith/D3TAEHGUN3YOH5XS77HQBDZ67H/bundle.json","state":"https://pith.science/pith/D3TAEHGUN3YOH5XS77HQBDZ67H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3TAEHGUN3YOH5XS77HQBDZ67H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D3TAEHGUN3YOH5XS77HQBDZ67H","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":"c73106e335f5673ee744a87b1f41f9e63cf79f7fd0497faafdc953f662099ffb","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-02-01T08:58:49Z","title_canon_sha256":"139fc10b19914d37c8868fc3e55e1de0d1ea6ac5207f6a449f03583b509c9bb6"},"schema_version":"1.0","source":{"id":"1602.00431","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00431","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00431v3","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00431","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"D3TAEHGUN3YO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3TAEHGUN3YOH5XS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3TAEHGU","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:d36c40fcdd27c1ab82689328e05aec256c6bd2fa6b87825fc56139d9d45a72b5","target":"graph","created_at":"2026-05-18T00:57:38Z","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 consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active, this is a non-convex optimization problem, otherwise it is a semidefinite program. Both find numerous applications especially in systems control theory and combinatorial optimization, but even in more general contexts such as polynomial optimization or real algebra. While numerical algorithms exist for solving this problem, such as interior-point or Newton-li","authors_text":"Simone Naldi","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-02-01T08:58:49Z","title":"Solving rank-constrained semidefinite programs in exact arithmetic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00431","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:41cda4e55fd55b738f6f03c41ac225e38424edfafec5bc446b092e0fae0f9a0b","target":"record","created_at":"2026-05-18T00:57:38Z","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":"c73106e335f5673ee744a87b1f41f9e63cf79f7fd0497faafdc953f662099ffb","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-02-01T08:58:49Z","title_canon_sha256":"139fc10b19914d37c8868fc3e55e1de0d1ea6ac5207f6a449f03583b509c9bb6"},"schema_version":"1.0","source":{"id":"1602.00431","kind":"arxiv","version":3}},"canonical_sha256":"1ee6021cd46ef0e3f6f2ffcf008f3ef9fe8159b906d8f3e24f771ac667afded3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee6021cd46ef0e3f6f2ffcf008f3ef9fe8159b906d8f3e24f771ac667afded3","first_computed_at":"2026-05-18T00:57:38.046597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:38.046597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c2a7EEKPAu9RrXTP1PZG869jlXFgKeN+gMCFByErQTyNHDoC50wncoLK22NkC7UECikvhQ5EVdqsXfUfY0HcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:38.047026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00431","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41cda4e55fd55b738f6f03c41ac225e38424edfafec5bc446b092e0fae0f9a0b","sha256:d36c40fcdd27c1ab82689328e05aec256c6bd2fa6b87825fc56139d9d45a72b5"],"state_sha256":"afe502a570ccef2dd264d7cd905d4b3cc030c3ae705c2189d6b8d8eb3296b52c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8stXwGeoTpNqJf0IzdtFmQosAFtV/elxlh9uJptJQzcQH4IwxdNLDrXVHfZi4JDcjjs172bJQ2rJHFJSTdGqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T06:00:09.095002Z","bundle_sha256":"85bf89f101fb3311061da942fa933ec12f70b73ac6df0a44b6d54a6ac03b6a4e"}}