{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OTHGJJ4LIRG6YK4P2IRB5F4IX4","short_pith_number":"pith:OTHGJJ4L","schema_version":"1.0","canonical_sha256":"74ce64a78b444dec2b8fd2221e9788bf0d67625ff7b73f44a9197264925cec34","source":{"kind":"arxiv","id":"1703.10973","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.10973","created_at":"2026-05-18T00:16:09.211119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10973v2","created_at":"2026-05-18T00:16:09.211119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10973","created_at":"2026-05-18T00:16:09.211119+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTHGJJ4LIRG6","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTHGJJ4LIRG6YK4P","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTHGJJ4L","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4","json":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4.json","graph_json":"https://pith.science/api/pith-number/OTHGJJ4LIRG6YK4P2IRB5F4IX4/graph.json","events_json":"https://pith.science/api/pith-number/OTHGJJ4LIRG6YK4P2IRB5F4IX4/events.json","paper":"https://pith.science/paper/OTHGJJ4L"},"agent_actions":{"view_html":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4","download_json":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4.json","view_paper":"https://pith.science/paper/OTHGJJ4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10973&json=true","fetch_graph":"https://pith.science/api/pith-number/OTHGJJ4LIRG6YK4P2IRB5F4IX4/graph.json","fetch_events":"https://pith.science/api/pith-number/OTHGJJ4LIRG6YK4P2IRB5F4IX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/action/storage_attestation","attest_author":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/action/author_attestation","sign_citation":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/action/citation_signature","submit_replication":"https://pith.science/pith/OTHGJJ4LIRG6YK4P2IRB5F4IX4/action/replication_record"}},"created_at":"2026-05-18T00:16:09.211119+00:00","updated_at":"2026-05-18T00:16:09.211119+00:00"}