{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YPQ545YLLNFGX2A63KNLNYGD4G","short_pith_number":"pith:YPQ545YL","schema_version":"1.0","canonical_sha256":"c3e1de770b5b4a6be81eda9ab6e0c3e1b6f007741a5adcfa1d61b2d96e9912f9","source":{"kind":"arxiv","id":"1308.6029","version":3},"attestation_state":"computed","paper":{"title":"Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","physics.comp-ph","quant-ph"],"primary_cat":"cs.MS","authors_text":"Peter Wittek","submitted_at":"2013-08-28T02:14:20Z","abstract_excerpt":"A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation, however, is a computationally demanding task, and only problems of commuting variables have efficient generators. We develop an implementation for problems of noncommuting problems that creates the relaxation to be solved by SDPA -- a high-performance solver that runs in a distributed environment. We further exploit the inherent sparsity of optimization problems in quantum physics to reduce the complexity of the resu"},"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":"1308.6029","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-08-28T02:14:20Z","cross_cats_sorted":["math.OC","physics.comp-ph","quant-ph"],"title_canon_sha256":"221bdc16ce317e258d7aebd4c99529c4d44dfb2c5c45b70771b3cd44933769e4","abstract_canon_sha256":"cce47c02db3a4b452f9ce2684cf3fb57f2cd686fd8b85a58f010b97f6cba909b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:25.368627Z","signature_b64":"bpsB1o7rLLr8hCk4C1xS1R3mmQINtQLmuCKy6DV3b10xiKd/oaE1rBHMRVCUI1GxgSlczoAKKoziyEQ9ys7WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3e1de770b5b4a6be81eda9ab6e0c3e1b6f007741a5adcfa1d61b2d96e9912f9","last_reissued_at":"2026-05-18T01:51:25.368039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:25.368039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","physics.comp-ph","quant-ph"],"primary_cat":"cs.MS","authors_text":"Peter Wittek","submitted_at":"2013-08-28T02:14:20Z","abstract_excerpt":"A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation, however, is a computationally demanding task, and only problems of commuting variables have efficient generators. We develop an implementation for problems of noncommuting problems that creates the relaxation to be solved by SDPA -- a high-performance solver that runs in a distributed environment. We further exploit the inherent sparsity of optimization problems in quantum physics to reduce the complexity of the resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6029","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":"1308.6029","created_at":"2026-05-18T01:51:25.368132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6029v3","created_at":"2026-05-18T01:51:25.368132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6029","created_at":"2026-05-18T01:51:25.368132+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPQ545YLLNFG","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPQ545YLLNFGX2A6","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPQ545YL","created_at":"2026-05-18T12:28:09.283467+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/YPQ545YLLNFGX2A63KNLNYGD4G","json":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G.json","graph_json":"https://pith.science/api/pith-number/YPQ545YLLNFGX2A63KNLNYGD4G/graph.json","events_json":"https://pith.science/api/pith-number/YPQ545YLLNFGX2A63KNLNYGD4G/events.json","paper":"https://pith.science/paper/YPQ545YL"},"agent_actions":{"view_html":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G","download_json":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G.json","view_paper":"https://pith.science/paper/YPQ545YL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6029&json=true","fetch_graph":"https://pith.science/api/pith-number/YPQ545YLLNFGX2A63KNLNYGD4G/graph.json","fetch_events":"https://pith.science/api/pith-number/YPQ545YLLNFGX2A63KNLNYGD4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G/action/storage_attestation","attest_author":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G/action/author_attestation","sign_citation":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G/action/citation_signature","submit_replication":"https://pith.science/pith/YPQ545YLLNFGX2A63KNLNYGD4G/action/replication_record"}},"created_at":"2026-05-18T01:51:25.368132+00:00","updated_at":"2026-05-18T01:51:25.368132+00:00"}