{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OTHGJJ4LIRG6YK4P2IRB5F4IX4","short_pith_number":"pith:OTHGJJ4L","canonical_record":{"source":{"id":"1703.10973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-31T16:34:14Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"d18c88d7b719f44d43030d8f5f60ff58b622a423577f1a295f753f419f22fbeb","abstract_canon_sha256":"59cb3bcc35ebf166c2d514852a13776adce9bf94ce1eb92a242d56cec75a525f"},"schema_version":"1.0"},"canonical_sha256":"74ce64a78b444dec2b8fd2221e9788bf0d67625ff7b73f44a9197264925cec34","source":{"kind":"arxiv","id":"1703.10973","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10973","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10973v2","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10973","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"OTHGJJ4LIRG6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OTHGJJ4LIRG6YK4P","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OTHGJJ4L","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OTHGJJ4LIRG6YK4P2IRB5F4IX4","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-31T16:34:14Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"d18c88d7b719f44d43030d8f5f60ff58b622a423577f1a295f753f419f22fbeb","abstract_canon_sha256":"59cb3bcc35ebf166c2d514852a13776adce9bf94ce1eb92a242d56cec75a525f"},"schema_version":"1.0"},"canonical_sha256":"74ce64a78b444dec2b8fd2221e9788bf0d67625ff7b73f44a9197264925cec34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:09.211677Z","signature_b64":"KHBa4f/lfsWbaZD3Jh+wUwSIrA/o9hg9+ncCzFB/4SCsZfUyf06FfvyAZFmNLA5VWrrM0W521EMGRSTGYiP7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ce64a78b444dec2b8fd2221e9788bf0d67625ff7b73f44a9197264925cec34","last_reissued_at":"2026-05-18T00:16:09.211022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:09.211022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10973","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-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LM0L5V4Tpj9fVOH9ImhMv921Gxj4jb35dyWwpLHLnfdGGpKeUxphG2Rf/PXyjEAIuS5PmnpnQREUz5oosShGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:55:48.766087Z"},"content_sha256":"1d56abfd5da0cd3713ce0f2e53541555f2ebdd51955338dd22c0c17848e13aea","schema_version":"1.0","event_id":"sha256:1d56abfd5da0cd3713ce0f2e53541555f2ebdd51955338dd22c0c17848e13aea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OTHGJJ4LIRG6YK4P2IRB5F4IX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modified Interior-Point Method for Large-and-Sparse Low-Rank Semidefinite Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Javad Lavaei, Richard Y. Zhang","submitted_at":"2017-03-31T16:34:14Z","abstract_excerpt":"Semidefinite programs (SDPs) are powerful theoretical tools that have been studied for over two decades, but their practical use remains limited due to computational difficulties in solving large-scale, realistic-sized problems. In this paper, we describe a modified interior-point method for the efficient solution of large-and-sparse low-rank SDPs, which finds applications in graph theory, approximation theory, control theory, sum-of-squares, etc. Given that the problem data is large-and-sparse, conjugate gradients (CG) can be used to avoid forming, storing, and factoring the large and fully-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10973","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-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tO8Z69bhJxWrP5M0KXQ8XeyW8HqRhLNLy5GnJyLPYTsAkQGkclKAhAncDnEzmB031NyYp8SQ0f0WoqWvKYrHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:55:48.766740Z"},"content_sha256":"1810d740679e24ef8898bde4e11a394b08184c74815546b958d38a561bb0c9c6","schema_version":"1.0","event_id":"sha256:1810d740679e24ef8898bde4e11a394b08184c74815546b958d38a561bb0c9c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/bundle.json","state_url":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/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-26T05:55:48Z","links":{"resolver":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4","bundle":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/bundle.json","state":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OTHGJJ4LIRG6YK4P2IRB5F4IX4","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":"59cb3bcc35ebf166c2d514852a13776adce9bf94ce1eb92a242d56cec75a525f","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-31T16:34:14Z","title_canon_sha256":"d18c88d7b719f44d43030d8f5f60ff58b622a423577f1a295f753f419f22fbeb"},"schema_version":"1.0","source":{"id":"1703.10973","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10973","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10973v2","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10973","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"OTHGJJ4LIRG6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OTHGJJ4LIRG6YK4P","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OTHGJJ4L","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:1810d740679e24ef8898bde4e11a394b08184c74815546b958d38a561bb0c9c6","target":"graph","created_at":"2026-05-18T00:16:09Z","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 programs (SDPs) are powerful theoretical tools that have been studied for over two decades, but their practical use remains limited due to computational difficulties in solving large-scale, realistic-sized problems. In this paper, we describe a modified interior-point method for the efficient solution of large-and-sparse low-rank SDPs, which finds applications in graph theory, approximation theory, control theory, sum-of-squares, etc. Given that the problem data is large-and-sparse, conjugate gradients (CG) can be used to avoid forming, storing, and factoring the large and fully-d","authors_text":"Javad Lavaei, Richard Y. Zhang","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-31T16:34:14Z","title":"Modified Interior-Point Method for Large-and-Sparse Low-Rank Semidefinite Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10973","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:1d56abfd5da0cd3713ce0f2e53541555f2ebdd51955338dd22c0c17848e13aea","target":"record","created_at":"2026-05-18T00:16:09Z","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":"59cb3bcc35ebf166c2d514852a13776adce9bf94ce1eb92a242d56cec75a525f","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-31T16:34:14Z","title_canon_sha256":"d18c88d7b719f44d43030d8f5f60ff58b622a423577f1a295f753f419f22fbeb"},"schema_version":"1.0","source":{"id":"1703.10973","kind":"arxiv","version":2}},"canonical_sha256":"74ce64a78b444dec2b8fd2221e9788bf0d67625ff7b73f44a9197264925cec34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74ce64a78b444dec2b8fd2221e9788bf0d67625ff7b73f44a9197264925cec34","first_computed_at":"2026-05-18T00:16:09.211022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:09.211022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHBa4f/lfsWbaZD3Jh+wUwSIrA/o9hg9+ncCzFB/4SCsZfUyf06FfvyAZFmNLA5VWrrM0W521EMGRSTGYiP7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:09.211677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10973","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d56abfd5da0cd3713ce0f2e53541555f2ebdd51955338dd22c0c17848e13aea","sha256:1810d740679e24ef8898bde4e11a394b08184c74815546b958d38a561bb0c9c6"],"state_sha256":"731f2cf19e35ae0f732468aeda80809f08989446357fd87a5097e53a9e343e04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PowcWtDhReR1nwsjpJa3eKOe2J+KKa/r4Pl0FJUL9RABdDlFtNwZ0UxH6kbca883Wi2yJvq2wE5tDzEVZWhKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:55:48.771628Z","bundle_sha256":"f882418df7fc9f1e3ab5fa6ea97717f749a9be7fec266d4a0c67a20e6a069a2f"}}