{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4OWERZXW76R24SW4CUVDP3QQZN","short_pith_number":"pith:4OWERZXW","schema_version":"1.0","canonical_sha256":"e3ac48e6f6ffa3ae4adc152a37ee10cb78902416623b4a2717ed6221babbaea3","source":{"kind":"arxiv","id":"1407.4308","version":1},"attestation_state":"computed","paper":{"title":"Some upper and lower bounds on PSD-rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","quant-ph"],"primary_cat":"cs.CC","authors_text":"Ronald de Wolf, Troy Lee, Zhaohui Wei","submitted_at":"2014-07-16T13:49:17Z","abstract_excerpt":"Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All of these bounds are based on viewing a positive semidefinite factorization of a matrix $M$ as a quantum communication protocol. These lower bounds depend on the entries of the matrix and not only on its support (the zero/nonzero pattern), overcoming a limitation of some previous techniques. We compare these new lower bound"},"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.4308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-16T13:49:17Z","cross_cats_sorted":["math.CO","quant-ph"],"title_canon_sha256":"c9557fe8dff71c307696d47da06f22d81f98e393995bcac14e88423a082751f2","abstract_canon_sha256":"9bb1252f7b572ac46077cf3c49e534144641ac3aec246d1779850227a2acf541"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:30.738831Z","signature_b64":"HHimt91x07z1kqzDAzz0uJYBtQTZjpxGZy/h7TdRwheBMdK5tRcZIlJ14GWtmaAZbWtdpD2gNQ96R9ztu6NwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ac48e6f6ffa3ae4adc152a37ee10cb78902416623b4a2717ed6221babbaea3","last_reissued_at":"2026-05-18T02:47:30.738222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:30.738222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some upper and lower bounds on PSD-rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","quant-ph"],"primary_cat":"cs.CC","authors_text":"Ronald de Wolf, Troy Lee, Zhaohui Wei","submitted_at":"2014-07-16T13:49:17Z","abstract_excerpt":"Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All of these bounds are based on viewing a positive semidefinite factorization of a matrix $M$ as a quantum communication protocol. These lower bounds depend on the entries of the matrix and not only on its support (the zero/nonzero pattern), overcoming a limitation of some previous techniques. We compare these new lower bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4308","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.4308","created_at":"2026-05-18T02:47:30.738309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4308v1","created_at":"2026-05-18T02:47:30.738309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4308","created_at":"2026-05-18T02:47:30.738309+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OWERZXW76R2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OWERZXW76R24SW4","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OWERZXW","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN","json":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN.json","graph_json":"https://pith.science/api/pith-number/4OWERZXW76R24SW4CUVDP3QQZN/graph.json","events_json":"https://pith.science/api/pith-number/4OWERZXW76R24SW4CUVDP3QQZN/events.json","paper":"https://pith.science/paper/4OWERZXW"},"agent_actions":{"view_html":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN","download_json":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN.json","view_paper":"https://pith.science/paper/4OWERZXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4308&json=true","fetch_graph":"https://pith.science/api/pith-number/4OWERZXW76R24SW4CUVDP3QQZN/graph.json","fetch_events":"https://pith.science/api/pith-number/4OWERZXW76R24SW4CUVDP3QQZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN/action/storage_attestation","attest_author":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN/action/author_attestation","sign_citation":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN/action/citation_signature","submit_replication":"https://pith.science/pith/4OWERZXW76R24SW4CUVDP3QQZN/action/replication_record"}},"created_at":"2026-05-18T02:47:30.738309+00:00","updated_at":"2026-05-18T02:47:30.738309+00:00"}