{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GHGQ5E4ZKKW3OT4CPGBTUALNWV","short_pith_number":"pith:GHGQ5E4Z","canonical_record":{"source":{"id":"1907.11868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-27T07:41:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d421d0aa790b9a8d9fda5b2b0ab7550b82b7b82a13f3e9ffd1b319f46a3f904b","abstract_canon_sha256":"4ed30606f7c6a8b9f1394cb9678e4d2f3503cf6065575381a7c907e165000c76"},"schema_version":"1.0"},"canonical_sha256":"31cd0e939952adb74f8279833a016db5616379a0f197807f3169eb9282a5bd7e","source":{"kind":"arxiv","id":"1907.11868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11868","created_at":"2026-05-17T23:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11868v1","created_at":"2026-05-17T23:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11868","created_at":"2026-05-17T23:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"GHGQ5E4ZKKW3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GHGQ5E4ZKKW3OT4C","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GHGQ5E4Z","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GHGQ5E4ZKKW3OT4CPGBTUALNWV","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-27T07:41:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d421d0aa790b9a8d9fda5b2b0ab7550b82b7b82a13f3e9ffd1b319f46a3f904b","abstract_canon_sha256":"4ed30606f7c6a8b9f1394cb9678e4d2f3503cf6065575381a7c907e165000c76"},"schema_version":"1.0"},"canonical_sha256":"31cd0e939952adb74f8279833a016db5616379a0f197807f3169eb9282a5bd7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:22.748737Z","signature_b64":"1/hhOpeDpm8+PRB3+BEN8lAX8CCCoaqYD5Pe/QomntyH0m06pfyK/lvtzLX3heLFKuLsvMHm1Udrq5j9hoCTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31cd0e939952adb74f8279833a016db5616379a0f197807f3169eb9282a5bd7e","last_reissued_at":"2026-05-17T23:39:22.747941Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:22.747941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11868","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-17T23:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfjkTKV30F3RHa5CB9PylBWBUKNcp4a0KhwqZ4tnEmF9apluEBd/8jnY3RTe72knq4GMAaULmmAfEnMJaNYQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:32:35.683158Z"},"content_sha256":"8510a3e852cab156b3a075cb3a345e7f46b22d47597f14eb91ac91cb0d16b605","schema_version":"1.0","event_id":"sha256:8510a3e852cab156b3a075cb3a345e7f46b22d47597f14eb91ac91cb0d16b605"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GHGQ5E4ZKKW3OT4CPGBTUALNWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Greedy Algorithm for Matrix Recovery with Subspace Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzan Haddadi, Hamideh.S Fazael Ardakani, Sajad Daei","submitted_at":"2019-07-27T07:41:51Z","abstract_excerpt":"Matrix recovery is the problem of recovering a low-rank matrix from a few linear measurements. Recently, this problem has gained a lot of attention as it is employed in many applications such as Netflix prize problem, seismic data interpolation and collaborative filtering. In these applications, one might access to additional prior information about the column and row spaces of the matrix. These extra information can potentially enhance the matrix recovery performance. In this paper, we propose an efficient greedy algorithm that exploits prior information in the recovery procedure. The perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11868","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-17T23:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W5u0CyU8gFAqn8eVmmNsxAZ3iwWKjKw5Zg2Xf5HEKRH/G50W3z1XMU155Aa6LRfpemcTbmUv1ZWxleL57a6mAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:32:35.683871Z"},"content_sha256":"61fd706946cfadfc97d4bf80d6d385ec017f383936f4514e75d92eadeda67886","schema_version":"1.0","event_id":"sha256:61fd706946cfadfc97d4bf80d6d385ec017f383936f4514e75d92eadeda67886"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHGQ5E4ZKKW3OT4CPGBTUALNWV/bundle.json","state_url":"https://pith.science/pith/GHGQ5E4ZKKW3OT4CPGBTUALNWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHGQ5E4ZKKW3OT4CPGBTUALNWV/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-26T07:32:35Z","links":{"resolver":"https://pith.science/pith/GHGQ5E4ZKKW3OT4CPGBTUALNWV","bundle":"https://pith.science/pith/GHGQ5E4ZKKW3OT4CPGBTUALNWV/bundle.json","state":"https://pith.science/pith/GHGQ5E4ZKKW3OT4CPGBTUALNWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHGQ5E4ZKKW3OT4CPGBTUALNWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GHGQ5E4ZKKW3OT4CPGBTUALNWV","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":"4ed30606f7c6a8b9f1394cb9678e4d2f3503cf6065575381a7c907e165000c76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-27T07:41:51Z","title_canon_sha256":"d421d0aa790b9a8d9fda5b2b0ab7550b82b7b82a13f3e9ffd1b319f46a3f904b"},"schema_version":"1.0","source":{"id":"1907.11868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11868","created_at":"2026-05-17T23:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11868v1","created_at":"2026-05-17T23:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11868","created_at":"2026-05-17T23:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"GHGQ5E4ZKKW3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GHGQ5E4ZKKW3OT4C","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GHGQ5E4Z","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:61fd706946cfadfc97d4bf80d6d385ec017f383936f4514e75d92eadeda67886","target":"graph","created_at":"2026-05-17T23:39:22Z","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":"Matrix recovery is the problem of recovering a low-rank matrix from a few linear measurements. Recently, this problem has gained a lot of attention as it is employed in many applications such as Netflix prize problem, seismic data interpolation and collaborative filtering. In these applications, one might access to additional prior information about the column and row spaces of the matrix. These extra information can potentially enhance the matrix recovery performance. In this paper, we propose an efficient greedy algorithm that exploits prior information in the recovery procedure. The perform","authors_text":"Farzan Haddadi, Hamideh.S Fazael Ardakani, Sajad Daei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-27T07:41:51Z","title":"A Greedy Algorithm for Matrix Recovery with Subspace Prior Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11868","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:8510a3e852cab156b3a075cb3a345e7f46b22d47597f14eb91ac91cb0d16b605","target":"record","created_at":"2026-05-17T23:39:22Z","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":"4ed30606f7c6a8b9f1394cb9678e4d2f3503cf6065575381a7c907e165000c76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-27T07:41:51Z","title_canon_sha256":"d421d0aa790b9a8d9fda5b2b0ab7550b82b7b82a13f3e9ffd1b319f46a3f904b"},"schema_version":"1.0","source":{"id":"1907.11868","kind":"arxiv","version":1}},"canonical_sha256":"31cd0e939952adb74f8279833a016db5616379a0f197807f3169eb9282a5bd7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31cd0e939952adb74f8279833a016db5616379a0f197807f3169eb9282a5bd7e","first_computed_at":"2026-05-17T23:39:22.747941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:22.747941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1/hhOpeDpm8+PRB3+BEN8lAX8CCCoaqYD5Pe/QomntyH0m06pfyK/lvtzLX3heLFKuLsvMHm1Udrq5j9hoCTAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:22.748737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8510a3e852cab156b3a075cb3a345e7f46b22d47597f14eb91ac91cb0d16b605","sha256:61fd706946cfadfc97d4bf80d6d385ec017f383936f4514e75d92eadeda67886"],"state_sha256":"0915dc86383bec64526ac8c047dd6444234257a18cdbf81e5d5c92399b47c8a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuM5FYHc1VvGksIToOls4DylebVVDyVCGpUWp0HVDCbgHcw4Xz3Fl2377Gv31SkL6+XKJB9hz6El2kGiRNu5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:32:35.687731Z","bundle_sha256":"2eef91de57634c35eda22675c10ff9bc3467204b8452bd416cf17e12b4a56e98"}}