{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IWWJLFQ4XVOO2PL3RZMXLVP5EQ","short_pith_number":"pith:IWWJLFQ4","canonical_record":{"source":{"id":"1412.2669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-05T18:19:31Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ab6a8b6013804a396053d6e91cbc85ccfe36342894518fd16362bb7f392c350c","abstract_canon_sha256":"a5238a6655032a96822963f9667b0d92d874f7323753335515172c80e4db8206"},"schema_version":"1.0"},"canonical_sha256":"45ac95961cbd5ced3d7b8e5975d5fd24252071cc90a18c38d33e90e5a5f70e6b","source":{"kind":"arxiv","id":"1412.2669","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2669","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2669v2","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2669","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"IWWJLFQ4XVOO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWWJLFQ4XVOO2PL3","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWWJLFQ4","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IWWJLFQ4XVOO2PL3RZMXLVP5EQ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-05T18:19:31Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ab6a8b6013804a396053d6e91cbc85ccfe36342894518fd16362bb7f392c350c","abstract_canon_sha256":"a5238a6655032a96822963f9667b0d92d874f7323753335515172c80e4db8206"},"schema_version":"1.0"},"canonical_sha256":"45ac95961cbd5ced3d7b8e5975d5fd24252071cc90a18c38d33e90e5a5f70e6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:38.131753Z","signature_b64":"CdNQrM4kDH51m8sGgseE2/OA25JDPtUHIGB/x5+ouTSk72++89ISjn5voDUX6BQCg82y4Cz9HNCHINMCIILrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45ac95961cbd5ced3d7b8e5975d5fd24252071cc90a18c38d33e90e5a5f70e6b","last_reissued_at":"2026-05-18T01:59:38.131046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:38.131046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2669","source_version":2,"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:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0AB4eKS7XSOAU6MBclr9vuF8/Zx+O0EgYcCPgIhYTno/Gc10y++WaqVcm4e+9nxW/U+fMs56Uc/VDln49I/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:14:43.477039Z"},"content_sha256":"5a60a690b1886741b4cdc3e4706fded7d441c434f5563b6f309091b6add06fd3","schema_version":"1.0","event_id":"sha256:5a60a690b1886741b4cdc3e4706fded7d441c434f5563b6f309091b6add06fd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IWWJLFQ4XVOO2PL3RZMXLVP5EQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two step recovery of jointly sparse and low-rank matrices: theoretical guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Mathews Jacob, Raghuraman Mudumbai, Sampurna Biswas, Soura Dasgupta, Sunrita Poddar","submitted_at":"2014-12-05T18:19:31Z","abstract_excerpt":"We introduce a two step algorithm with theoretical guarantees to recover a jointly sparse and low-rank matrix from undersampled measurements of its columns. The algorithm first estimates the row subspace of the matrix using a set of common measurements of the columns. In the second step, the subspace aware recovery of the matrix is solved using a simple least square algorithm. The results are verified in the context of recovering CINE data from undersampled measurements; we obtain good recovery when the sampling conditions are satisfied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2669","kind":"arxiv","version":2},"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:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pqQDyv0SGQkR0GqP79wecHP8JaVIZkAtQWI/sPn58/vKBAs8+/YG579ol9RLMsw4I2HkCAlAUe5f02M+qRzFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:14:43.477757Z"},"content_sha256":"8e540250066dff7665ef938cc9ac23a5099077cf544b2b1be114a2d2bcc9f093","schema_version":"1.0","event_id":"sha256:8e540250066dff7665ef938cc9ac23a5099077cf544b2b1be114a2d2bcc9f093"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWWJLFQ4XVOO2PL3RZMXLVP5EQ/bundle.json","state_url":"https://pith.science/pith/IWWJLFQ4XVOO2PL3RZMXLVP5EQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWWJLFQ4XVOO2PL3RZMXLVP5EQ/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-27T01:14:43Z","links":{"resolver":"https://pith.science/pith/IWWJLFQ4XVOO2PL3RZMXLVP5EQ","bundle":"https://pith.science/pith/IWWJLFQ4XVOO2PL3RZMXLVP5EQ/bundle.json","state":"https://pith.science/pith/IWWJLFQ4XVOO2PL3RZMXLVP5EQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWWJLFQ4XVOO2PL3RZMXLVP5EQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IWWJLFQ4XVOO2PL3RZMXLVP5EQ","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":"a5238a6655032a96822963f9667b0d92d874f7323753335515172c80e4db8206","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-05T18:19:31Z","title_canon_sha256":"ab6a8b6013804a396053d6e91cbc85ccfe36342894518fd16362bb7f392c350c"},"schema_version":"1.0","source":{"id":"1412.2669","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2669","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2669v2","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2669","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"IWWJLFQ4XVOO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWWJLFQ4XVOO2PL3","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWWJLFQ4","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:8e540250066dff7665ef938cc9ac23a5099077cf544b2b1be114a2d2bcc9f093","target":"graph","created_at":"2026-05-18T01:59:38Z","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":"We introduce a two step algorithm with theoretical guarantees to recover a jointly sparse and low-rank matrix from undersampled measurements of its columns. The algorithm first estimates the row subspace of the matrix using a set of common measurements of the columns. In the second step, the subspace aware recovery of the matrix is solved using a simple least square algorithm. The results are verified in the context of recovering CINE data from undersampled measurements; we obtain good recovery when the sampling conditions are satisfied.","authors_text":"Mathews Jacob, Raghuraman Mudumbai, Sampurna Biswas, Soura Dasgupta, Sunrita Poddar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-05T18:19:31Z","title":"Two step recovery of jointly sparse and low-rank matrices: theoretical guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2669","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:5a60a690b1886741b4cdc3e4706fded7d441c434f5563b6f309091b6add06fd3","target":"record","created_at":"2026-05-18T01:59:38Z","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":"a5238a6655032a96822963f9667b0d92d874f7323753335515172c80e4db8206","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-05T18:19:31Z","title_canon_sha256":"ab6a8b6013804a396053d6e91cbc85ccfe36342894518fd16362bb7f392c350c"},"schema_version":"1.0","source":{"id":"1412.2669","kind":"arxiv","version":2}},"canonical_sha256":"45ac95961cbd5ced3d7b8e5975d5fd24252071cc90a18c38d33e90e5a5f70e6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45ac95961cbd5ced3d7b8e5975d5fd24252071cc90a18c38d33e90e5a5f70e6b","first_computed_at":"2026-05-18T01:59:38.131046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:38.131046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CdNQrM4kDH51m8sGgseE2/OA25JDPtUHIGB/x5+ouTSk72++89ISjn5voDUX6BQCg82y4Cz9HNCHINMCIILrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:38.131753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2669","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a60a690b1886741b4cdc3e4706fded7d441c434f5563b6f309091b6add06fd3","sha256:8e540250066dff7665ef938cc9ac23a5099077cf544b2b1be114a2d2bcc9f093"],"state_sha256":"4e39a92a8edc434c7e68d3f927361e41a00ab8d17e0706e15b121cdfaf7d5dcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxwMNc4ZhYUwhMKhWsbcKqyn4fQMUjC0sh9vFwFziqvt0rF65RsxVwYivtA0akgMXklqn/AJC6uHlc8Auxc0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:14:43.481368Z","bundle_sha256":"19ab4479cac1b66ce8defd01527014fd5660a71b0af7b600d7013d5d0bd988c7"}}