{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PNVZ3MEKL3AOAMNB3ATDIL775Z","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":"85cffb765868f22274ea6843a8f0fe78352550399a982f2a5ce560dc025c18d5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-05T13:03:41Z","title_canon_sha256":"37f2d6897dd95d5790447f0a5836902b11840d72918282a9ff6616453824e29c"},"schema_version":"1.0","source":{"id":"2511.03443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.03443","created_at":"2026-07-29T01:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"2511.03443v2","created_at":"2026-07-29T01:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.03443","created_at":"2026-07-29T01:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"PNVZ3MEKL3AO","created_at":"2026-07-29T01:24:26Z"},{"alias_kind":"pith_short_16","alias_value":"PNVZ3MEKL3AOAMNB","created_at":"2026-07-29T01:24:26Z"},{"alias_kind":"pith_short_8","alias_value":"PNVZ3MEK","created_at":"2026-07-29T01:24:26Z"}],"graph_snapshots":[{"event_id":"sha256:82c4be3c39a5eedfc37ff277d71cd316720acdb4de6ce9e653ed764166117ec9","target":"graph","created_at":"2026-07-29T01:24:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.03443/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \\times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our analysis demonstrates that, by fixing the support set, the global solution of the minimization subproblem for the proximal linearization of the objective function can be computed in closed form with at most $n$ nonzero entries. Exploiting this structural property offers a powerful avenue for dramatically enhancing computational efficiency. Guided by this insight,","authors_text":"Lei Wang, Xiaojun Chen, Xin Liu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-05T13:03:41Z","title":"A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.03443","kind":"arxiv","version":2},"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:2186397ab8f15224cc7246e93d07bded850eb527f95eaf3d89de86cdc179b376","target":"record","created_at":"2026-07-29T01:24:26Z","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":"85cffb765868f22274ea6843a8f0fe78352550399a982f2a5ce560dc025c18d5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-05T13:03:41Z","title_canon_sha256":"37f2d6897dd95d5790447f0a5836902b11840d72918282a9ff6616453824e29c"},"schema_version":"1.0","source":{"id":"2511.03443","kind":"arxiv","version":2}},"canonical_sha256":"7b6b9db08a5ec0e031a1d826342fffee7cbcf7136153f506c61303f09996be00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b6b9db08a5ec0e031a1d826342fffee7cbcf7136153f506c61303f09996be00","first_computed_at":"2026-07-29T01:24:26.124542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T01:24:26.124542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O+cPVCU2ZQjhncEYpDuFMbyzmhGAgDHR6lR3BHdqrpkMJcsBKnOxqObw+Z25KExqIm5Pi3f+MG/43twYocbGBA==","signature_status":"signed_v1","signed_at":"2026-07-29T01:24:26.125484Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.03443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2186397ab8f15224cc7246e93d07bded850eb527f95eaf3d89de86cdc179b376","sha256:82c4be3c39a5eedfc37ff277d71cd316720acdb4de6ce9e653ed764166117ec9"],"state_sha256":"bf4a8668869ac56a956ef173f45ada3d95ff3c3a8cfdb4b9e959499ea2df9e3b"}