{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IO55UXR4LQQZYUQKX6WUGQPJGU","short_pith_number":"pith:IO55UXR4","canonical_record":{"source":{"id":"1703.09848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-29T00:45:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6cc4bee08b66fb58ed25d3afa65df42867b876aaf1f89503ebd69eae42d9fb14","abstract_canon_sha256":"9c306c4c99ee723e1c4ab7c4912446359dee369492ceaa2a97015923ab05e37c"},"schema_version":"1.0"},"canonical_sha256":"43bbda5e3c5c219c520abfad4341e93515151f4a2e8bc235835433938d12fbb6","source":{"kind":"arxiv","id":"1703.09848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09848","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09848v1","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09848","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"IO55UXR4LQQZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IO55UXR4LQQZYUQK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IO55UXR4","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IO55UXR4LQQZYUQKX6WUGQPJGU","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-29T00:45:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6cc4bee08b66fb58ed25d3afa65df42867b876aaf1f89503ebd69eae42d9fb14","abstract_canon_sha256":"9c306c4c99ee723e1c4ab7c4912446359dee369492ceaa2a97015923ab05e37c"},"schema_version":"1.0"},"canonical_sha256":"43bbda5e3c5c219c520abfad4341e93515151f4a2e8bc235835433938d12fbb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:39.250425Z","signature_b64":"gJReTQUgV703dcJRza4+AGf3UbE+itUs0alQ81vvPpgh5uwNLqHqqAdaTcSpjyLdIMQD+OPF6u6cs/+C1orhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43bbda5e3c5c219c520abfad4341e93515151f4a2e8bc235835433938d12fbb6","last_reissued_at":"2026-05-18T00:47:39.249868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:39.249868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09848","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:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBwUyVc8MW7Qlg013qbs8jbHrk/fHe37MdS3kkb+PHLaroOB5UHAIR9KR/HHnkTu4ZiDB6fBWLPy471lF3IRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:56:25.282002Z"},"content_sha256":"a2200d7c18052ff9eb250be2472dbbfe0bc950bf75fe7f92f1fc6c6423dfa3a1","schema_version":"1.0","event_id":"sha256:a2200d7c18052ff9eb250be2472dbbfe0bc950bf75fe7f92f1fc6c6423dfa3a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IO55UXR4LQQZYUQKX6WUGQPJGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Painless Breakups -- Efficient Demixing of Low Rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ke Wei, Thomas Strohmer","submitted_at":"2017-03-29T00:45:15Z","abstract_excerpt":"Assume we are given a sum of linear measurements of $s$ different rank-$r$ matrices of the form $y = \\sum_{k=1}^{s} \\mathcal{A}_k ({X}_k)$. When and under which conditions is it possible to extract (demix) the individual matrices ${X}_k$ from the single measurement vector ${y}$? And can we do the demixing numerically efficiently? We present two computationally efficient algorithms based on hard thresholding to solve this low rank demixing problem. We prove that under suitable conditions these algorithms are guaranteed to converge to the correct solution at a linear rate. We discuss application"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09848","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:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XX7iedwIFHVVR3l2tHTvClIs0neFTtDvPu2u5GyfBLbBftcA5v6PRRO33C/K9tpdfrED+BWk0colSoMzvvK/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:56:25.282513Z"},"content_sha256":"8b126785efd7f3ea1f630361b15f68367a1ee4e5188e2b1bf52e9be9f7ffec81","schema_version":"1.0","event_id":"sha256:8b126785efd7f3ea1f630361b15f68367a1ee4e5188e2b1bf52e9be9f7ffec81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IO55UXR4LQQZYUQKX6WUGQPJGU/bundle.json","state_url":"https://pith.science/pith/IO55UXR4LQQZYUQKX6WUGQPJGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IO55UXR4LQQZYUQKX6WUGQPJGU/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-27T14:56:25Z","links":{"resolver":"https://pith.science/pith/IO55UXR4LQQZYUQKX6WUGQPJGU","bundle":"https://pith.science/pith/IO55UXR4LQQZYUQKX6WUGQPJGU/bundle.json","state":"https://pith.science/pith/IO55UXR4LQQZYUQKX6WUGQPJGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IO55UXR4LQQZYUQKX6WUGQPJGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IO55UXR4LQQZYUQKX6WUGQPJGU","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":"9c306c4c99ee723e1c4ab7c4912446359dee369492ceaa2a97015923ab05e37c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-29T00:45:15Z","title_canon_sha256":"6cc4bee08b66fb58ed25d3afa65df42867b876aaf1f89503ebd69eae42d9fb14"},"schema_version":"1.0","source":{"id":"1703.09848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09848","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09848v1","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09848","created_at":"2026-05-18T00:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"IO55UXR4LQQZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IO55UXR4LQQZYUQK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IO55UXR4","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:8b126785efd7f3ea1f630361b15f68367a1ee4e5188e2b1bf52e9be9f7ffec81","target":"graph","created_at":"2026-05-18T00:47:39Z","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":"Assume we are given a sum of linear measurements of $s$ different rank-$r$ matrices of the form $y = \\sum_{k=1}^{s} \\mathcal{A}_k ({X}_k)$. When and under which conditions is it possible to extract (demix) the individual matrices ${X}_k$ from the single measurement vector ${y}$? And can we do the demixing numerically efficiently? We present two computationally efficient algorithms based on hard thresholding to solve this low rank demixing problem. We prove that under suitable conditions these algorithms are guaranteed to converge to the correct solution at a linear rate. We discuss application","authors_text":"Ke Wei, Thomas Strohmer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-29T00:45:15Z","title":"Painless Breakups -- Efficient Demixing of Low Rank Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09848","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:a2200d7c18052ff9eb250be2472dbbfe0bc950bf75fe7f92f1fc6c6423dfa3a1","target":"record","created_at":"2026-05-18T00:47:39Z","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":"9c306c4c99ee723e1c4ab7c4912446359dee369492ceaa2a97015923ab05e37c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-29T00:45:15Z","title_canon_sha256":"6cc4bee08b66fb58ed25d3afa65df42867b876aaf1f89503ebd69eae42d9fb14"},"schema_version":"1.0","source":{"id":"1703.09848","kind":"arxiv","version":1}},"canonical_sha256":"43bbda5e3c5c219c520abfad4341e93515151f4a2e8bc235835433938d12fbb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43bbda5e3c5c219c520abfad4341e93515151f4a2e8bc235835433938d12fbb6","first_computed_at":"2026-05-18T00:47:39.249868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:39.249868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gJReTQUgV703dcJRza4+AGf3UbE+itUs0alQ81vvPpgh5uwNLqHqqAdaTcSpjyLdIMQD+OPF6u6cs/+C1orhAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:39.250425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2200d7c18052ff9eb250be2472dbbfe0bc950bf75fe7f92f1fc6c6423dfa3a1","sha256:8b126785efd7f3ea1f630361b15f68367a1ee4e5188e2b1bf52e9be9f7ffec81"],"state_sha256":"3cd03b0e83c31b2ae22b7a560ce1d6ebff9f91c272844c7fe1d50480e263f08e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yy6k4fRWfFO5V/RpCkdcaXEpMM4KvZz7dD4Tq2nttpSCO22h58f+sjlxl8++HW70ppYEQ6ZLcmRItrqE8M1lAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:56:25.284812Z","bundle_sha256":"8400ccebd2f0de2adc74eecaf15877a387b965b59089a688cf58c53cb153f772"}}