{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7O3N4KUTR7NFYGPLWNOBWUIROB","short_pith_number":"pith:7O3N4KUT","canonical_record":{"source":{"id":"1707.07953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-25T12:32:57Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6223b19522cfd968d93953394d8f7dd346d3915ad0230f759a613e0c9e823242","abstract_canon_sha256":"3dc8dc1c2c9390adfb42070166048752396e82fce90ecaa6433333a660078a83"},"schema_version":"1.0"},"canonical_sha256":"fbb6de2a938fda5c19ebb35c1b511170607fb32527811d50976c2f065d746e84","source":{"kind":"arxiv","id":"1707.07953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07953","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07953v1","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07953","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"7O3N4KUTR7NF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7O3N4KUTR7NFYGPL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7O3N4KUT","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7O3N4KUTR7NFYGPLWNOBWUIROB","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-25T12:32:57Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6223b19522cfd968d93953394d8f7dd346d3915ad0230f759a613e0c9e823242","abstract_canon_sha256":"3dc8dc1c2c9390adfb42070166048752396e82fce90ecaa6433333a660078a83"},"schema_version":"1.0"},"canonical_sha256":"fbb6de2a938fda5c19ebb35c1b511170607fb32527811d50976c2f065d746e84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:12.062381Z","signature_b64":"TK4n4V3ajNMVaX6KbeGjMnWtRR8pMeSBgk7FWSrtd0PBhGsqvByrAts4wCG9QLxm4PJydeDI7fM58b1pgvHeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbb6de2a938fda5c19ebb35c1b511170607fb32527811d50976c2f065d746e84","last_reissued_at":"2026-05-18T00:07:12.061715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:12.061715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07953","source_version":1,"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:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0p91tMs63tkusFo0AfN8FoWqolu/s2md8/p+sRsZ1hR5R7ekKXZRxQWKDjuSRxPsTQi8khKTvGx9GqRgghkWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:50.498125Z"},"content_sha256":"71139d782094788eb6ebdd09c4feda401d0cf06c26764cb422c47d2380b76fdf","schema_version":"1.0","event_id":"sha256:71139d782094788eb6ebdd09c4feda401d0cf06c26764cb422c47d2380b76fdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7O3N4KUTR7NFYGPLWNOBWUIROB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Positive Semidefinite Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Arnaud Vandaele, Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2017-07-25T12:32:57Z","abstract_excerpt":"This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an $m$-by-$n$ nonnegative matrix $X$ and an integer $k$, the PSD factorization problem consists in finding, if possible, symmetric $k$-by-$k$ positive semidefinite matrices $\\{A^1,...,A^m\\}$ and $\\{B^1,...,B^n\\}$ such that $X_{i,j}=\\text{trace}(A^iB^j)$ for $i=1,...,m$, and $j=1,...n$. PSD factorization is NP-hard. In this work, we introduce several local optimization schemes to tackle this problem: a fast projected gradient method and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07953","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"},"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:07:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNpiTvfpo8reJSJOaWVvaW2mEAppG3hb57YPhmClE7MJamAdpg6m8ATBxrKdZbxQhNX8FJUROcfjnl6PWrYLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:50.498516Z"},"content_sha256":"ec7854f8f84abf52051fe7434f6135785a3f92addb1118b0fa53bdc7e6254f96","schema_version":"1.0","event_id":"sha256:ec7854f8f84abf52051fe7434f6135785a3f92addb1118b0fa53bdc7e6254f96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7O3N4KUTR7NFYGPLWNOBWUIROB/bundle.json","state_url":"https://pith.science/pith/7O3N4KUTR7NFYGPLWNOBWUIROB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7O3N4KUTR7NFYGPLWNOBWUIROB/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-05-27T07:34:50Z","links":{"resolver":"https://pith.science/pith/7O3N4KUTR7NFYGPLWNOBWUIROB","bundle":"https://pith.science/pith/7O3N4KUTR7NFYGPLWNOBWUIROB/bundle.json","state":"https://pith.science/pith/7O3N4KUTR7NFYGPLWNOBWUIROB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7O3N4KUTR7NFYGPLWNOBWUIROB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7O3N4KUTR7NFYGPLWNOBWUIROB","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":"3dc8dc1c2c9390adfb42070166048752396e82fce90ecaa6433333a660078a83","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-25T12:32:57Z","title_canon_sha256":"6223b19522cfd968d93953394d8f7dd346d3915ad0230f759a613e0c9e823242"},"schema_version":"1.0","source":{"id":"1707.07953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07953","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07953v1","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07953","created_at":"2026-05-18T00:07:12Z"},{"alias_kind":"pith_short_12","alias_value":"7O3N4KUTR7NF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7O3N4KUTR7NFYGPL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7O3N4KUT","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:ec7854f8f84abf52051fe7434f6135785a3f92addb1118b0fa53bdc7e6254f96","target":"graph","created_at":"2026-05-18T00:07:12Z","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":"This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an $m$-by-$n$ nonnegative matrix $X$ and an integer $k$, the PSD factorization problem consists in finding, if possible, symmetric $k$-by-$k$ positive semidefinite matrices $\\{A^1,...,A^m\\}$ and $\\{B^1,...,B^n\\}$ such that $X_{i,j}=\\text{trace}(A^iB^j)$ for $i=1,...,m$, and $j=1,...n$. PSD factorization is NP-hard. In this work, we introduce several local optimization schemes to tackle this problem: a fast projected gradient method and t","authors_text":"Arnaud Vandaele, Fran\\c{c}ois Glineur, Nicolas Gillis","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-25T12:32:57Z","title":"Algorithms for Positive Semidefinite Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07953","kind":"arxiv","version":1},"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:71139d782094788eb6ebdd09c4feda401d0cf06c26764cb422c47d2380b76fdf","target":"record","created_at":"2026-05-18T00:07:12Z","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":"3dc8dc1c2c9390adfb42070166048752396e82fce90ecaa6433333a660078a83","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-25T12:32:57Z","title_canon_sha256":"6223b19522cfd968d93953394d8f7dd346d3915ad0230f759a613e0c9e823242"},"schema_version":"1.0","source":{"id":"1707.07953","kind":"arxiv","version":1}},"canonical_sha256":"fbb6de2a938fda5c19ebb35c1b511170607fb32527811d50976c2f065d746e84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbb6de2a938fda5c19ebb35c1b511170607fb32527811d50976c2f065d746e84","first_computed_at":"2026-05-18T00:07:12.061715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:12.061715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TK4n4V3ajNMVaX6KbeGjMnWtRR8pMeSBgk7FWSrtd0PBhGsqvByrAts4wCG9QLxm4PJydeDI7fM58b1pgvHeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:12.062381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71139d782094788eb6ebdd09c4feda401d0cf06c26764cb422c47d2380b76fdf","sha256:ec7854f8f84abf52051fe7434f6135785a3f92addb1118b0fa53bdc7e6254f96"],"state_sha256":"67d3cfebbbfc3703c9a5584717a7895c4e9f6faebd469480a12177561062edd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usxte5U7+fik2LMA41X7dCi8fDOwejaanI4skobMKnH9gHpvkCylaWWgBUWHHlQpvMTRqisMTx3sfYSraMO1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:34:50.501124Z","bundle_sha256":"d27988e44bfdc2e0c430e5b79fff93c26b907a6237bb032c4a0e0d651136bf26"}}