{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TCCN5OV6DSAFA3CRMTCKYZIKW2","short_pith_number":"pith:TCCN5OV6","canonical_record":{"source":{"id":"2503.24075","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-31T13:31:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec0c4445d5150e6ac98d155b3893d191f0c7361d73d816c90059c683e7ca1c45","abstract_canon_sha256":"a9904e28546d4b26cf71a7bf3aeab8dc73ef87d7fb6fd86c93b0d243ac3bb5ca"},"schema_version":"1.0"},"canonical_sha256":"9884debabe1c80506c5164c4ac650ab6b0cf556c3316857c4d74b0ab0c14efcc","source":{"kind":"arxiv","id":"2503.24075","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.24075","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2503.24075v4","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.24075","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"TCCN5OV6DSAF","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"TCCN5OV6DSAFA3CR","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"TCCN5OV6","created_at":"2026-07-02T00:18:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TCCN5OV6DSAFA3CRMTCKYZIKW2","target":"record","payload":{"canonical_record":{"source":{"id":"2503.24075","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-31T13:31:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec0c4445d5150e6ac98d155b3893d191f0c7361d73d816c90059c683e7ca1c45","abstract_canon_sha256":"a9904e28546d4b26cf71a7bf3aeab8dc73ef87d7fb6fd86c93b0d243ac3bb5ca"},"schema_version":"1.0"},"canonical_sha256":"9884debabe1c80506c5164c4ac650ab6b0cf556c3316857c4d74b0ab0c14efcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:10.063682Z","signature_b64":"qoDA3cndmLIx4ZSLE20vqqNCa0e5HrW3WYR8lcTdLMLvCdgZi8BST8gYo6LwQNpm1Z71Btdx9ECo+dEs7LeiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9884debabe1c80506c5164c4ac650ab6b0cf556c3316857c4d74b0ab0c14efcc","last_reissued_at":"2026-07-02T00:18:10.062950Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:10.062950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.24075","source_version":4,"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-07-02T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ptiRdaMUrDwWF45q3O1b4o17pkO/VO+ey9eSiLwkCR+RyPTou3FJSESZgVfsITMOn7g2mPbJKKAhvw1QGyoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:40:31.423719Z"},"content_sha256":"6835469e054c8ca62c5980f62d13f67c45821b00e0d086449026f2439744a2f6","schema_version":"1.0","event_id":"sha256:6835469e054c8ca62c5980f62d13f67c45821b00e0d086449026f2439744a2f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TCCN5OV6DSAFA3CRMTCKYZIKW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andersen Ang, Flavia Esposito","submitted_at":"2025-03-31T13:31:05Z","abstract_excerpt":"Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank structures and constraints. These problems arise in various applications, including machine learning, signal processing, environmental fields, and computational biology. In this work, we propose a novel manifold optimization approach to efficiently tackle these problems. Our method leverages the geometry of oblique manifolds to reformulate the problem and intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.24075","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.24075/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-02T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dmVop6Lp1Pv0FnILddAFrTv0bcCV7TlYw3sZISkzUjWEj12aIWaCsWj4KiKlQ5g6KwmhSlqAeFJnDpkDqwDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:40:31.425186Z"},"content_sha256":"42c92dc71026efed2f1eaa2d1c902e259d6d348f7df08b53fcf030b9bee82394","schema_version":"1.0","event_id":"sha256:42c92dc71026efed2f1eaa2d1c902e259d6d348f7df08b53fcf030b9bee82394"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCCN5OV6DSAFA3CRMTCKYZIKW2/bundle.json","state_url":"https://pith.science/pith/TCCN5OV6DSAFA3CRMTCKYZIKW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCCN5OV6DSAFA3CRMTCKYZIKW2/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-08-11T12:40:31Z","links":{"resolver":"https://pith.science/pith/TCCN5OV6DSAFA3CRMTCKYZIKW2","bundle":"https://pith.science/pith/TCCN5OV6DSAFA3CRMTCKYZIKW2/bundle.json","state":"https://pith.science/pith/TCCN5OV6DSAFA3CRMTCKYZIKW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCCN5OV6DSAFA3CRMTCKYZIKW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TCCN5OV6DSAFA3CRMTCKYZIKW2","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":"a9904e28546d4b26cf71a7bf3aeab8dc73ef87d7fb6fd86c93b0d243ac3bb5ca","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-31T13:31:05Z","title_canon_sha256":"ec0c4445d5150e6ac98d155b3893d191f0c7361d73d816c90059c683e7ca1c45"},"schema_version":"1.0","source":{"id":"2503.24075","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.24075","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2503.24075v4","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.24075","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"TCCN5OV6DSAF","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"TCCN5OV6DSAFA3CR","created_at":"2026-07-02T00:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"TCCN5OV6","created_at":"2026-07-02T00:18:10Z"}],"graph_snapshots":[{"event_id":"sha256:42c92dc71026efed2f1eaa2d1c902e259d6d348f7df08b53fcf030b9bee82394","target":"graph","created_at":"2026-07-02T00:18:10Z","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/2503.24075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank structures and constraints. These problems arise in various applications, including machine learning, signal processing, environmental fields, and computational biology. In this work, we propose a novel manifold optimization approach to efficiently tackle these problems. Our method leverages the geometry of oblique manifolds to reformulate the problem and intr","authors_text":"Andersen Ang, Flavia Esposito","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-31T13:31:05Z","title":"Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.24075","kind":"arxiv","version":4},"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:6835469e054c8ca62c5980f62d13f67c45821b00e0d086449026f2439744a2f6","target":"record","created_at":"2026-07-02T00:18:10Z","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":"a9904e28546d4b26cf71a7bf3aeab8dc73ef87d7fb6fd86c93b0d243ac3bb5ca","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-31T13:31:05Z","title_canon_sha256":"ec0c4445d5150e6ac98d155b3893d191f0c7361d73d816c90059c683e7ca1c45"},"schema_version":"1.0","source":{"id":"2503.24075","kind":"arxiv","version":4}},"canonical_sha256":"9884debabe1c80506c5164c4ac650ab6b0cf556c3316857c4d74b0ab0c14efcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9884debabe1c80506c5164c4ac650ab6b0cf556c3316857c4d74b0ab0c14efcc","first_computed_at":"2026-07-02T00:18:10.062950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:10.062950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qoDA3cndmLIx4ZSLE20vqqNCa0e5HrW3WYR8lcTdLMLvCdgZi8BST8gYo6LwQNpm1Z71Btdx9ECo+dEs7LeiCw==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:10.063682Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.24075","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6835469e054c8ca62c5980f62d13f67c45821b00e0d086449026f2439744a2f6","sha256:42c92dc71026efed2f1eaa2d1c902e259d6d348f7df08b53fcf030b9bee82394"],"state_sha256":"6d0c501877820d5bba9f725ffe382a9f527331c24ac58f4bbda91d0212c83a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bt9n2BqCquGmzTsx+ONZxYw/bZyqdkGZLZ0Dm/UW8H34L7GV71+j1WSUbu5BR+beiB9b9kjWU1J9S1AREgTDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T12:40:31.436111Z","bundle_sha256":"948fa7efa11237f45442a5f0008cc2041603560a73f59d7f09e39fab7430c46c"}}