{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XSAEC7TU3LBQJKOIOY45C4WUGB","short_pith_number":"pith:XSAEC7TU","schema_version":"1.0","canonical_sha256":"bc80417e74dac304a9c87639d172d4304984cb88b545b53abd728b3ab1102972","source":{"kind":"arxiv","id":"1011.6495","version":3},"attestation_state":"computed","paper":{"title":"The Minimum-Rank Gram Matrix Completion via Modified Fixed Point Continuation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SY"],"primary_cat":"math.OC","authors_text":"Lihong Zhi, Yue Ma","submitted_at":"2010-11-30T09:31:52Z","abstract_excerpt":"The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix (Gram matrix) of minimum rank subject to linear equality constraints.\n  In this paper, we propose algorithms for solving the minimum-rank Gram matrix completion problem, and show the convergence of these algorithms. Our methods are based on the modified fixed point continuation (FPC) method. We also use the Barzilai-Borwein (BB) technique and a specific linear combination of two previous iterates to accelerat"},"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":"1011.6495","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-11-30T09:31:52Z","cross_cats_sorted":["cs.NA","cs.SY"],"title_canon_sha256":"d3edf1de9ccacfa1d591d7c6ada50219eb97757ecadffbcfdcaee0d73217cfae","abstract_canon_sha256":"9094277d60fa04e6d2b9d951502df92773e575a2b80f56845bd879e31725e497"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:36.108596Z","signature_b64":"fhzXW6PEMPXb+BVMp34SSGnoXiDHsYAHCBFULYFoNE48AnJ9XtYYfu4ULsA2pQ8smVwPWccTvVGVAn7DbJQAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc80417e74dac304a9c87639d172d4304984cb88b545b53abd728b3ab1102972","last_reissued_at":"2026-05-18T04:30:36.107998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:36.107998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Minimum-Rank Gram Matrix Completion via Modified Fixed Point Continuation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SY"],"primary_cat":"math.OC","authors_text":"Lihong Zhi, Yue Ma","submitted_at":"2010-11-30T09:31:52Z","abstract_excerpt":"The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix (Gram matrix) of minimum rank subject to linear equality constraints.\n  In this paper, we propose algorithms for solving the minimum-rank Gram matrix completion problem, and show the convergence of these algorithms. Our methods are based on the modified fixed point continuation (FPC) method. We also use the Barzilai-Borwein (BB) technique and a specific linear combination of two previous iterates to accelerat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6495","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.6495","created_at":"2026-05-18T04:30:36.108080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6495v3","created_at":"2026-05-18T04:30:36.108080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6495","created_at":"2026-05-18T04:30:36.108080+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSAEC7TU3LBQ","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSAEC7TU3LBQJKOI","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSAEC7TU","created_at":"2026-05-18T12:26:17.028572+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/XSAEC7TU3LBQJKOIOY45C4WUGB","json":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB.json","graph_json":"https://pith.science/api/pith-number/XSAEC7TU3LBQJKOIOY45C4WUGB/graph.json","events_json":"https://pith.science/api/pith-number/XSAEC7TU3LBQJKOIOY45C4WUGB/events.json","paper":"https://pith.science/paper/XSAEC7TU"},"agent_actions":{"view_html":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB","download_json":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB.json","view_paper":"https://pith.science/paper/XSAEC7TU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6495&json=true","fetch_graph":"https://pith.science/api/pith-number/XSAEC7TU3LBQJKOIOY45C4WUGB/graph.json","fetch_events":"https://pith.science/api/pith-number/XSAEC7TU3LBQJKOIOY45C4WUGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB/action/storage_attestation","attest_author":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB/action/author_attestation","sign_citation":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB/action/citation_signature","submit_replication":"https://pith.science/pith/XSAEC7TU3LBQJKOIOY45C4WUGB/action/replication_record"}},"created_at":"2026-05-18T04:30:36.108080+00:00","updated_at":"2026-05-18T04:30:36.108080+00:00"}