{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UMGPWT5ZVP5L2QOB4FM5XYEO2M","short_pith_number":"pith:UMGPWT5Z","canonical_record":{"source":{"id":"1309.0302","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2013-09-02T05:07:31Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"b2830ed3efa56c15d49d3f1a69cd2baa4dfbf86aa4f0dd6b30085b7fcf170a37","abstract_canon_sha256":"712fdd2ec72bc4016b6b1626a901261b72478ec4b341a07528b430ba632e4f64"},"schema_version":"1.0"},"canonical_sha256":"a30cfb4fb9abfabd41c1e159dbe08ed33c4939fa6cd1fc5d40123669eb240c1c","source":{"kind":"arxiv","id":"1309.0302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0302","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0302v1","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0302","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"UMGPWT5ZVP5L","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UMGPWT5ZVP5L2QOB","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UMGPWT5Z","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UMGPWT5ZVP5L2QOB4FM5XYEO2M","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0302","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2013-09-02T05:07:31Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"b2830ed3efa56c15d49d3f1a69cd2baa4dfbf86aa4f0dd6b30085b7fcf170a37","abstract_canon_sha256":"712fdd2ec72bc4016b6b1626a901261b72478ec4b341a07528b430ba632e4f64"},"schema_version":"1.0"},"canonical_sha256":"a30cfb4fb9abfabd41c1e159dbe08ed33c4939fa6cd1fc5d40123669eb240c1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:27.614902Z","signature_b64":"7aUmyfXrj2KH/w9UbcB0cn78X0yWycJIeMfzdzE1Uwfq0SUIrsCQEa9BOA7SqQgN9e2u0VSRhQasoe+fR4LlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a30cfb4fb9abfabd41c1e159dbe08ed33c4939fa6cd1fc5d40123669eb240c1c","last_reissued_at":"2026-05-18T03:14:27.614297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:27.614297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0302","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-18T03:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqtGicmuUQBPGUqVHViQIsT1ik3F7edDVgmvVSekdtpZKi1fN6jZQPAdmZ/vrg7O8HlPl3eO8+EfsPonbpgCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:00.358925Z"},"content_sha256":"4092b96ff07cf72b3dbb680e2774945279d0917fd89174279ac212ef6af4aa1e","schema_version":"1.0","event_id":"sha256:4092b96ff07cf72b3dbb680e2774945279d0917fd89174279ac212ef6af4aa1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UMGPWT5ZVP5L2QOB4FM5XYEO2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unmixing Incoherent Structures of Big Data by Randomized or Greedy Decomposition","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Dacheng Tao, Tianyi Zhou","submitted_at":"2013-09-02T05:07:31Z","abstract_excerpt":"Learning big data by matrix decomposition always suffers from expensive computation, mixing of complicated structures and noise. In this paper, we study more adaptive models and efficient algorithms that decompose a data matrix as the sum of semantic components with incoherent structures. We firstly introduce \"GO decomposition (GoDec)\", an alternating projection method estimating the low-rank part $L$ and the sparse part $S$ from data matrix $X=L+S+G$ corrupted by noise $G$. Two acceleration strategies are proposed to obtain scalable unmixing algorithm on big data: 1) Bilateral random projecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0302","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-18T03:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIoogCCH5WIjuZAaMF505Djxr7kjEYaj8hl0TQjOxZfNauzVqLk/u6QTTa+e2353Q55tn4DtXtqNvgVSuXlrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:00.359571Z"},"content_sha256":"2ff5457b6b786b80a5116ea0acbcc1f04c2d462f1a6d8d783daea12c50c4805c","schema_version":"1.0","event_id":"sha256:2ff5457b6b786b80a5116ea0acbcc1f04c2d462f1a6d8d783daea12c50c4805c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMGPWT5ZVP5L2QOB4FM5XYEO2M/bundle.json","state_url":"https://pith.science/pith/UMGPWT5ZVP5L2QOB4FM5XYEO2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMGPWT5ZVP5L2QOB4FM5XYEO2M/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-31T17:18:00Z","links":{"resolver":"https://pith.science/pith/UMGPWT5ZVP5L2QOB4FM5XYEO2M","bundle":"https://pith.science/pith/UMGPWT5ZVP5L2QOB4FM5XYEO2M/bundle.json","state":"https://pith.science/pith/UMGPWT5ZVP5L2QOB4FM5XYEO2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMGPWT5ZVP5L2QOB4FM5XYEO2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UMGPWT5ZVP5L2QOB4FM5XYEO2M","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":"712fdd2ec72bc4016b6b1626a901261b72478ec4b341a07528b430ba632e4f64","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2013-09-02T05:07:31Z","title_canon_sha256":"b2830ed3efa56c15d49d3f1a69cd2baa4dfbf86aa4f0dd6b30085b7fcf170a37"},"schema_version":"1.0","source":{"id":"1309.0302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0302","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0302v1","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0302","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"UMGPWT5ZVP5L","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UMGPWT5ZVP5L2QOB","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UMGPWT5Z","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:2ff5457b6b786b80a5116ea0acbcc1f04c2d462f1a6d8d783daea12c50c4805c","target":"graph","created_at":"2026-05-18T03:14:27Z","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":"Learning big data by matrix decomposition always suffers from expensive computation, mixing of complicated structures and noise. In this paper, we study more adaptive models and efficient algorithms that decompose a data matrix as the sum of semantic components with incoherent structures. We firstly introduce \"GO decomposition (GoDec)\", an alternating projection method estimating the low-rank part $L$ and the sparse part $S$ from data matrix $X=L+S+G$ corrupted by noise $G$. Two acceleration strategies are proposed to obtain scalable unmixing algorithm on big data: 1) Bilateral random projecti","authors_text":"Dacheng Tao, Tianyi Zhou","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2013-09-02T05:07:31Z","title":"Unmixing Incoherent Structures of Big Data by Randomized or Greedy Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0302","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:4092b96ff07cf72b3dbb680e2774945279d0917fd89174279ac212ef6af4aa1e","target":"record","created_at":"2026-05-18T03:14:27Z","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":"712fdd2ec72bc4016b6b1626a901261b72478ec4b341a07528b430ba632e4f64","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"stat.ML","submitted_at":"2013-09-02T05:07:31Z","title_canon_sha256":"b2830ed3efa56c15d49d3f1a69cd2baa4dfbf86aa4f0dd6b30085b7fcf170a37"},"schema_version":"1.0","source":{"id":"1309.0302","kind":"arxiv","version":1}},"canonical_sha256":"a30cfb4fb9abfabd41c1e159dbe08ed33c4939fa6cd1fc5d40123669eb240c1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a30cfb4fb9abfabd41c1e159dbe08ed33c4939fa6cd1fc5d40123669eb240c1c","first_computed_at":"2026-05-18T03:14:27.614297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:27.614297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7aUmyfXrj2KH/w9UbcB0cn78X0yWycJIeMfzdzE1Uwfq0SUIrsCQEa9BOA7SqQgN9e2u0VSRhQasoe+fR4LlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:27.614902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4092b96ff07cf72b3dbb680e2774945279d0917fd89174279ac212ef6af4aa1e","sha256:2ff5457b6b786b80a5116ea0acbcc1f04c2d462f1a6d8d783daea12c50c4805c"],"state_sha256":"8972accf3012995b2518e22a0c655c236b722c23c5b28cca0fb813eb7898ba30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VI2+qkCYxKc2EuFfX7zESMX240dUOf1CzZlqMBSd1jkBETRD3KOa7qtaA1okvt9Jypio0x8cht0QJJl4NI0mDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:18:00.362744Z","bundle_sha256":"a2e635407796b15bb00fd88b726841fbe03fe7df399ce6aedf450a6d9f3f9dee"}}