{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VECIEBBIV2GX4EPOWMZY7EVWLH","short_pith_number":"pith:VECIEBBI","schema_version":"1.0","canonical_sha256":"a904820428ae8d7e11eeb3338f92b659fe4c8295f239874e555e0fcf75cbe693","source":{"kind":"arxiv","id":"1407.4095","version":1},"attestation_state":"computed","paper":{"title":"Positive semidefinite rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Hamza Fawzi, Jo\\~ao Gouveia, Pablo A. Parrilo, Rekha R. Thomas, Richard Z. Robinson","submitted_at":"2014-07-15T18:56:01Z","abstract_excerpt":"Let M be a p-by-q matrix with nonnegative entries. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices $A_i, B_j$ of size $k \\times k$ such that $M_{ij} = \\text{trace}(A_i B_j)$. The psd rank has many appealing geometric interpretations, including semidefinite representations of polyhedra and information-theoretic applications. In this paper we develop and survey the main mathematical properties of psd rank, including its geometry, relationships with other rank notions, and computational and algorithmic aspects."},"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":"1407.4095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-15T18:56:01Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7df2fdf40a68a0ae623fbd88f23608a84e3e77fad58c7f0a85a88a4bfaeeafbf","abstract_canon_sha256":"4b19ea833e84865fe60afb55cabc75b23c3bbbb2806254332a6fed26830b8198"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:06.840821Z","signature_b64":"nskn1xh//O3yqSfbLOMIU4JgJTvNu/cgWLyxFH8eH//yyaDQlDjJmtQaxLxwyLqYVh6jTCFQNu/cPL0anGUHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a904820428ae8d7e11eeb3338f92b659fe4c8295f239874e555e0fcf75cbe693","last_reissued_at":"2026-05-18T01:33:06.840212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:06.840212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positive semidefinite rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Hamza Fawzi, Jo\\~ao Gouveia, Pablo A. Parrilo, Rekha R. Thomas, Richard Z. Robinson","submitted_at":"2014-07-15T18:56:01Z","abstract_excerpt":"Let M be a p-by-q matrix with nonnegative entries. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices $A_i, B_j$ of size $k \\times k$ such that $M_{ij} = \\text{trace}(A_i B_j)$. The psd rank has many appealing geometric interpretations, including semidefinite representations of polyhedra and information-theoretic applications. In this paper we develop and survey the main mathematical properties of psd rank, including its geometry, relationships with other rank notions, and computational and algorithmic aspects."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4095","kind":"arxiv","version":1},"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":"1407.4095","created_at":"2026-05-18T01:33:06.840323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4095v1","created_at":"2026-05-18T01:33:06.840323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4095","created_at":"2026-05-18T01:33:06.840323+00:00"},{"alias_kind":"pith_short_12","alias_value":"VECIEBBIV2GX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VECIEBBIV2GX4EPO","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VECIEBBI","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23869","citing_title":"Representability for Quantum Theory beyond Particle-Number Conservation","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH","json":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH.json","graph_json":"https://pith.science/api/pith-number/VECIEBBIV2GX4EPOWMZY7EVWLH/graph.json","events_json":"https://pith.science/api/pith-number/VECIEBBIV2GX4EPOWMZY7EVWLH/events.json","paper":"https://pith.science/paper/VECIEBBI"},"agent_actions":{"view_html":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH","download_json":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH.json","view_paper":"https://pith.science/paper/VECIEBBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4095&json=true","fetch_graph":"https://pith.science/api/pith-number/VECIEBBIV2GX4EPOWMZY7EVWLH/graph.json","fetch_events":"https://pith.science/api/pith-number/VECIEBBIV2GX4EPOWMZY7EVWLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH/action/storage_attestation","attest_author":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH/action/author_attestation","sign_citation":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH/action/citation_signature","submit_replication":"https://pith.science/pith/VECIEBBIV2GX4EPOWMZY7EVWLH/action/replication_record"}},"created_at":"2026-05-18T01:33:06.840323+00:00","updated_at":"2026-05-18T01:33:06.840323+00:00"}