{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PSPW7BWAB3DVY5E5UVNWV6VJ7Z","short_pith_number":"pith:PSPW7BWA","canonical_record":{"source":{"id":"1708.01573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-04T16:28:23Z","cross_cats_sorted":[],"title_canon_sha256":"44e22a8039b33a8a2f34c11f7ad778caa8a3f4adc34be056e5757b43e52513eb","abstract_canon_sha256":"ea2ad0bb96a300c11fb2c5199ed4986c036834f7057f34b72f6e1db3465f5c8f"},"schema_version":"1.0"},"canonical_sha256":"7c9f6f86c00ec75c749da55b6afaa9fe6930930d54cc6b2f62626e6e8d01b5ff","source":{"kind":"arxiv","id":"1708.01573","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01573","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01573v3","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01573","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"PSPW7BWAB3DV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSPW7BWAB3DVY5E5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSPW7BWA","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PSPW7BWAB3DVY5E5UVNWV6VJ7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-04T16:28:23Z","cross_cats_sorted":[],"title_canon_sha256":"44e22a8039b33a8a2f34c11f7ad778caa8a3f4adc34be056e5757b43e52513eb","abstract_canon_sha256":"ea2ad0bb96a300c11fb2c5199ed4986c036834f7057f34b72f6e1db3465f5c8f"},"schema_version":"1.0"},"canonical_sha256":"7c9f6f86c00ec75c749da55b6afaa9fe6930930d54cc6b2f62626e6e8d01b5ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.068555Z","signature_b64":"a+btx5YoyhGNrLgb97hdxdP0rub03rBVQvxhhJdOI4OjgakOy9LbTgZEbeMX2aiF33tkcoqPR1Ra0IY01lE2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c9f6f86c00ec75c749da55b6afaa9fe6930930d54cc6b2f62626e6e8d01b5ff","last_reissued_at":"2026-05-18T00:01:39.068041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.068041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01573","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9kHiAFGqXNDBS1Dle/tImp+bgdAHD7TxQmWPt+NXoSJUCW6nUh4NcTUv5kJNlse4XFySqy1sfkqZQporTFuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:02:43.211219Z"},"content_sha256":"98705bf93d00a5ccf8138482fa15900fd3e1f9d37e0a1889b70a97d32dbf0f1a","schema_version":"1.0","event_id":"sha256:98705bf93d00a5ccf8138482fa15900fd3e1f9d37e0a1889b70a97d32dbf0f1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PSPW7BWAB3DVY5E5UVNWV6VJ7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on matrix factorization ranks via noncommutative polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David de Laat, Monique Laurent, Sander Gribling","submitted_at":"2017-08-04T16:28:23Z","abstract_excerpt":"We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogues: the completely positive rank and the completely positive semidefinite rank. We study the convergence properties of our hierarchies, compare them extensively to known lower bounds, and provide some (numerical) examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01573","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwIQC60EL6ESUXSaBXkQu+d8/0iGR02WNApZq/+BDHjmNILwaviJugGgvg0NNYkNOkoh6IEdzYBBRSXiLrhzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:02:43.211562Z"},"content_sha256":"e92fef9dd10bf68c4a0f82ddd241abe8267fe0caa6d69abd948a9f8012265cb6","schema_version":"1.0","event_id":"sha256:e92fef9dd10bf68c4a0f82ddd241abe8267fe0caa6d69abd948a9f8012265cb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSPW7BWAB3DVY5E5UVNWV6VJ7Z/bundle.json","state_url":"https://pith.science/pith/PSPW7BWAB3DVY5E5UVNWV6VJ7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSPW7BWAB3DVY5E5UVNWV6VJ7Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T09:02:43Z","links":{"resolver":"https://pith.science/pith/PSPW7BWAB3DVY5E5UVNWV6VJ7Z","bundle":"https://pith.science/pith/PSPW7BWAB3DVY5E5UVNWV6VJ7Z/bundle.json","state":"https://pith.science/pith/PSPW7BWAB3DVY5E5UVNWV6VJ7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSPW7BWAB3DVY5E5UVNWV6VJ7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PSPW7BWAB3DVY5E5UVNWV6VJ7Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ea2ad0bb96a300c11fb2c5199ed4986c036834f7057f34b72f6e1db3465f5c8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-04T16:28:23Z","title_canon_sha256":"44e22a8039b33a8a2f34c11f7ad778caa8a3f4adc34be056e5757b43e52513eb"},"schema_version":"1.0","source":{"id":"1708.01573","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01573","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01573v3","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01573","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"PSPW7BWAB3DV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSPW7BWAB3DVY5E5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSPW7BWA","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:e92fef9dd10bf68c4a0f82ddd241abe8267fe0caa6d69abd948a9f8012265cb6","target":"graph","created_at":"2026-05-18T00:01:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogues: the completely positive rank and the completely positive semidefinite rank. We study the convergence properties of our hierarchies, compare them extensively to known lower bounds, and provide some (numerical) examples.","authors_text":"David de Laat, Monique Laurent, Sander Gribling","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-04T16:28:23Z","title":"Lower bounds on matrix factorization ranks via noncommutative polynomial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01573","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:98705bf93d00a5ccf8138482fa15900fd3e1f9d37e0a1889b70a97d32dbf0f1a","target":"record","created_at":"2026-05-18T00:01:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ea2ad0bb96a300c11fb2c5199ed4986c036834f7057f34b72f6e1db3465f5c8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-04T16:28:23Z","title_canon_sha256":"44e22a8039b33a8a2f34c11f7ad778caa8a3f4adc34be056e5757b43e52513eb"},"schema_version":"1.0","source":{"id":"1708.01573","kind":"arxiv","version":3}},"canonical_sha256":"7c9f6f86c00ec75c749da55b6afaa9fe6930930d54cc6b2f62626e6e8d01b5ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c9f6f86c00ec75c749da55b6afaa9fe6930930d54cc6b2f62626e6e8d01b5ff","first_computed_at":"2026-05-18T00:01:39.068041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:39.068041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+btx5YoyhGNrLgb97hdxdP0rub03rBVQvxhhJdOI4OjgakOy9LbTgZEbeMX2aiF33tkcoqPR1Ra0IY01lE2DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:39.068555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01573","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98705bf93d00a5ccf8138482fa15900fd3e1f9d37e0a1889b70a97d32dbf0f1a","sha256:e92fef9dd10bf68c4a0f82ddd241abe8267fe0caa6d69abd948a9f8012265cb6"],"state_sha256":"0b71ce5eb77f21512943c983f21749ae5b83f60f1962e4122920d483836b4a7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ut8J1AtkwpHCyFdxqt/X3FRGfDs+XR+qjBM65JZpBP1GIrp0w2ElDqCmXjeFf7l88DXXJNt/QGOnhiwlaJeJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T09:02:43.213523Z","bundle_sha256":"58c128da8514932a3c8a8e335b2b1e00d996d56bbe70f33b61bc572572c7f82b"}}