{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7UG7J4DVG2YIJCNZVZQUH6MWCB","short_pith_number":"pith:7UG7J4DV","canonical_record":{"source":{"id":"1810.11749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-28T02:25:19Z","cross_cats_sorted":[],"title_canon_sha256":"82125ee83e945a4fb9bf5ec5517d2eb3f2ea87d4fbd51e6cbd0b0d345a9d66be","abstract_canon_sha256":"afe17a5fdacae88305da07ad1b737e80366e224f826fccdfb202dc49a0e2c24f"},"schema_version":"1.0"},"canonical_sha256":"fd0df4f07536b08489b9ae6143f9961043141160110d4b79d18a7591377a0a60","source":{"kind":"arxiv","id":"1810.11749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11749","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11749v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11749","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"7UG7J4DVG2YI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7UG7J4DVG2YIJCNZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7UG7J4DV","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7UG7J4DVG2YIJCNZVZQUH6MWCB","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-28T02:25:19Z","cross_cats_sorted":[],"title_canon_sha256":"82125ee83e945a4fb9bf5ec5517d2eb3f2ea87d4fbd51e6cbd0b0d345a9d66be","abstract_canon_sha256":"afe17a5fdacae88305da07ad1b737e80366e224f826fccdfb202dc49a0e2c24f"},"schema_version":"1.0"},"canonical_sha256":"fd0df4f07536b08489b9ae6143f9961043141160110d4b79d18a7591377a0a60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:07.530058Z","signature_b64":"mDGq2OPLqEawbMQF7WA4IYbYTvmApxuuKlOZt6hWatCdWzyx+orQMqnSr2l57XBDYPr08j6JXnubJeYdzHY9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd0df4f07536b08489b9ae6143f9961043141160110d4b79d18a7591377a0a60","last_reissued_at":"2026-05-18T00:02:07.529471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:07.529471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11749","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:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rs4zUyQ0Wi+7Xmwl5lq40kjC1uelQzmE6WDaa3kmobX8qJso7PJkjUfKI8FjiwBzXpHf4I7lUrHBQvfSSxJjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:23:26.298140Z"},"content_sha256":"60bc74816cf6e31b88c3412d04b8511788111dc6f48acc5ff595c8ef7bbf351c","schema_version":"1.0","event_id":"sha256:60bc74816cf6e31b88c3412d04b8511788111dc6f48acc5ff595c8ef7bbf351c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7UG7J4DVG2YIJCNZVZQUH6MWCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Hard Thresholding for Low-Rank Recovery from Rank-One Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Simon Foucart, Srinivas Subramanian","submitted_at":"2018-10-28T02:25:19Z","abstract_excerpt":"A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to succeed in situations where the standard rank-restricted isometry property fails, e.g. in case of subexponential unstructured measurements or of subgaussian rank-one measurements. The stability and robustness of the algorithm are established based on distinctive matrix-analytic ingredients and its performance is substantiated numerically."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11749","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:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odyeh9w4k9TEfyjZ9SxM8nwAtNYnLN7dceq7UAAi2i0AF7rJyNbyeTE6RlAG1xyzk9zDGgtj9Y2mGXbjQnt4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:23:26.298764Z"},"content_sha256":"e4aaf60e2e0c6bb4c0155b957f04663d7ed09c27a8e8148bf8e2e89d6049c3d3","schema_version":"1.0","event_id":"sha256:e4aaf60e2e0c6bb4c0155b957f04663d7ed09c27a8e8148bf8e2e89d6049c3d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UG7J4DVG2YIJCNZVZQUH6MWCB/bundle.json","state_url":"https://pith.science/pith/7UG7J4DVG2YIJCNZVZQUH6MWCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UG7J4DVG2YIJCNZVZQUH6MWCB/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-26T12:23:26Z","links":{"resolver":"https://pith.science/pith/7UG7J4DVG2YIJCNZVZQUH6MWCB","bundle":"https://pith.science/pith/7UG7J4DVG2YIJCNZVZQUH6MWCB/bundle.json","state":"https://pith.science/pith/7UG7J4DVG2YIJCNZVZQUH6MWCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UG7J4DVG2YIJCNZVZQUH6MWCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7UG7J4DVG2YIJCNZVZQUH6MWCB","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":"afe17a5fdacae88305da07ad1b737e80366e224f826fccdfb202dc49a0e2c24f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-28T02:25:19Z","title_canon_sha256":"82125ee83e945a4fb9bf5ec5517d2eb3f2ea87d4fbd51e6cbd0b0d345a9d66be"},"schema_version":"1.0","source":{"id":"1810.11749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11749","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11749v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11749","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"7UG7J4DVG2YI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7UG7J4DVG2YIJCNZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7UG7J4DV","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:e4aaf60e2e0c6bb4c0155b957f04663d7ed09c27a8e8148bf8e2e89d6049c3d3","target":"graph","created_at":"2026-05-18T00:02:07Z","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":"A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to succeed in situations where the standard rank-restricted isometry property fails, e.g. in case of subexponential unstructured measurements or of subgaussian rank-one measurements. The stability and robustness of the algorithm are established based on distinctive matrix-analytic ingredients and its performance is substantiated numerically.","authors_text":"Simon Foucart, Srinivas Subramanian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-28T02:25:19Z","title":"Iterative Hard Thresholding for Low-Rank Recovery from Rank-One Projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11749","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:60bc74816cf6e31b88c3412d04b8511788111dc6f48acc5ff595c8ef7bbf351c","target":"record","created_at":"2026-05-18T00:02:07Z","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":"afe17a5fdacae88305da07ad1b737e80366e224f826fccdfb202dc49a0e2c24f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-28T02:25:19Z","title_canon_sha256":"82125ee83e945a4fb9bf5ec5517d2eb3f2ea87d4fbd51e6cbd0b0d345a9d66be"},"schema_version":"1.0","source":{"id":"1810.11749","kind":"arxiv","version":1}},"canonical_sha256":"fd0df4f07536b08489b9ae6143f9961043141160110d4b79d18a7591377a0a60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd0df4f07536b08489b9ae6143f9961043141160110d4b79d18a7591377a0a60","first_computed_at":"2026-05-18T00:02:07.529471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:07.529471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDGq2OPLqEawbMQF7WA4IYbYTvmApxuuKlOZt6hWatCdWzyx+orQMqnSr2l57XBDYPr08j6JXnubJeYdzHY9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:07.530058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60bc74816cf6e31b88c3412d04b8511788111dc6f48acc5ff595c8ef7bbf351c","sha256:e4aaf60e2e0c6bb4c0155b957f04663d7ed09c27a8e8148bf8e2e89d6049c3d3"],"state_sha256":"ebeb3fe9253c2325013c3c71c973b5ba19dc0b8f41d8e03258b060252dd1d35c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XFMKEdDzN6LwyHhZVHHVCQfyTfocTHrlZ7ksCJjMImi3AKsayGX4AXpozOqX4N83jpFfLJXWQf5D/Qz19aNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:23:26.301885Z","bundle_sha256":"ab7939d51dac85cd48967c11478a394dd442856190653126973b30fd1c680e27"}}