{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J6LCPMCXBSR3DQUV43KGNAGAPP","short_pith_number":"pith:J6LCPMCX","canonical_record":{"source":{"id":"1602.04208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-12T20:57:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8430db25b7a44f321526bc2e41ebae942b12e6d70fdc1a4bc57320b3734b7846","abstract_canon_sha256":"e6670f11d9ae7bb80d9638f168816793347d69fe8a2f5ecbe2322b3e57f0eb1f"},"schema_version":"1.0"},"canonical_sha256":"4f9627b0570ca3b1c295e6d46680c07bed099cae0c80c930cec14dd70384ae7a","source":{"kind":"arxiv","id":"1602.04208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04208","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04208v1","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04208","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"J6LCPMCXBSR3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6LCPMCXBSR3DQUV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6LCPMCX","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J6LCPMCXBSR3DQUV43KGNAGAPP","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-12T20:57:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8430db25b7a44f321526bc2e41ebae942b12e6d70fdc1a4bc57320b3734b7846","abstract_canon_sha256":"e6670f11d9ae7bb80d9638f168816793347d69fe8a2f5ecbe2322b3e57f0eb1f"},"schema_version":"1.0"},"canonical_sha256":"4f9627b0570ca3b1c295e6d46680c07bed099cae0c80c930cec14dd70384ae7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:54.305266Z","signature_b64":"diB15cJb+IPcBHX7mY3qH/qzzk/psjq+KxQaNGsF+wYya27e8kQWerzuPGMwn1vIzvG+0yRXThci6jNQBtCvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f9627b0570ca3b1c295e6d46680c07bed099cae0c80c930cec14dd70384ae7a","last_reissued_at":"2026-05-18T01:20:54.304450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:54.304450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04208","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-18T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDhlz1FQ+GWc56D7mZDEO1S1WUgKNHe2VbdPFa6nwqEk/59C0d2qtO3uyXoc5o0tAaYvCfYwCSJ/vkkPwSJKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:43:45.355410Z"},"content_sha256":"b4cb91c0a8b3eef9ac8ed4edf95c562e3944731e6715bba8d1561326511c0c0a","schema_version":"1.0","event_id":"sha256:b4cb91c0a8b3eef9ac8ed4edf95c562e3944731e6715bba8d1561326511c0c0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J6LCPMCXBSR3DQUV43KGNAGAPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pursuits in Structured Non-Convex Matrix Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Jaggi, Michael Tschannen, Rajiv Khanna","submitted_at":"2016-02-12T20:57:35Z","abstract_excerpt":"Efficiently representing real world data in a succinct and parsimonious manner is of central importance in many fields. We present a generalized greedy pursuit framework, allowing us to efficiently solve structured matrix factorization problems, where the factors are allowed to be from arbitrary sets of structured vectors. Such structure may include sparsity, non-negativeness, order, or a combination thereof. The algorithm approximates a given matrix by a linear combination of few rank-1 matrices, each factorized into an outer product of two vector atoms of the desired structure. For the non-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04208","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-18T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CyP9vqy8oaUdZymKFan08eypEHiYRj4kDVaUy7dVqwgTvAPbVnh8b99YTLH9swG9DzV++Enz2wg2BZhUV9tHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:43:45.355756Z"},"content_sha256":"a2400e131f90ef17d49e0538f856ce54bd42b7927be845984be614f918aaea41","schema_version":"1.0","event_id":"sha256:a2400e131f90ef17d49e0538f856ce54bd42b7927be845984be614f918aaea41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6LCPMCXBSR3DQUV43KGNAGAPP/bundle.json","state_url":"https://pith.science/pith/J6LCPMCXBSR3DQUV43KGNAGAPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6LCPMCXBSR3DQUV43KGNAGAPP/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-04T21:43:45Z","links":{"resolver":"https://pith.science/pith/J6LCPMCXBSR3DQUV43KGNAGAPP","bundle":"https://pith.science/pith/J6LCPMCXBSR3DQUV43KGNAGAPP/bundle.json","state":"https://pith.science/pith/J6LCPMCXBSR3DQUV43KGNAGAPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6LCPMCXBSR3DQUV43KGNAGAPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J6LCPMCXBSR3DQUV43KGNAGAPP","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":"e6670f11d9ae7bb80d9638f168816793347d69fe8a2f5ecbe2322b3e57f0eb1f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-12T20:57:35Z","title_canon_sha256":"8430db25b7a44f321526bc2e41ebae942b12e6d70fdc1a4bc57320b3734b7846"},"schema_version":"1.0","source":{"id":"1602.04208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04208","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04208v1","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04208","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"J6LCPMCXBSR3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6LCPMCXBSR3DQUV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6LCPMCX","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:a2400e131f90ef17d49e0538f856ce54bd42b7927be845984be614f918aaea41","target":"graph","created_at":"2026-05-18T01:20:54Z","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":"Efficiently representing real world data in a succinct and parsimonious manner is of central importance in many fields. We present a generalized greedy pursuit framework, allowing us to efficiently solve structured matrix factorization problems, where the factors are allowed to be from arbitrary sets of structured vectors. Such structure may include sparsity, non-negativeness, order, or a combination thereof. The algorithm approximates a given matrix by a linear combination of few rank-1 matrices, each factorized into an outer product of two vector atoms of the desired structure. For the non-c","authors_text":"Martin Jaggi, Michael Tschannen, Rajiv Khanna","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-12T20:57:35Z","title":"Pursuits in Structured Non-Convex Matrix Factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04208","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:b4cb91c0a8b3eef9ac8ed4edf95c562e3944731e6715bba8d1561326511c0c0a","target":"record","created_at":"2026-05-18T01:20:54Z","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":"e6670f11d9ae7bb80d9638f168816793347d69fe8a2f5ecbe2322b3e57f0eb1f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-12T20:57:35Z","title_canon_sha256":"8430db25b7a44f321526bc2e41ebae942b12e6d70fdc1a4bc57320b3734b7846"},"schema_version":"1.0","source":{"id":"1602.04208","kind":"arxiv","version":1}},"canonical_sha256":"4f9627b0570ca3b1c295e6d46680c07bed099cae0c80c930cec14dd70384ae7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f9627b0570ca3b1c295e6d46680c07bed099cae0c80c930cec14dd70384ae7a","first_computed_at":"2026-05-18T01:20:54.304450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:54.304450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"diB15cJb+IPcBHX7mY3qH/qzzk/psjq+KxQaNGsF+wYya27e8kQWerzuPGMwn1vIzvG+0yRXThci6jNQBtCvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:54.305266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4cb91c0a8b3eef9ac8ed4edf95c562e3944731e6715bba8d1561326511c0c0a","sha256:a2400e131f90ef17d49e0538f856ce54bd42b7927be845984be614f918aaea41"],"state_sha256":"a76666c128d6deeb67903414f513d588601838e310d57882b6577430906ceb4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RfpgR7hrq7HPKRnzPp9zO+5yaCny66nSxhzWpFexB3Fc4q2MELaS3IY0zNPakeOw/0zgL8ojHa7mdFPmEVSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:43:45.357794Z","bundle_sha256":"521c620af76209e6609cdc7c654add97a9f81b09d7b6ca2f109fe82907bfbc06"}}