{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FYP4BVE7K4GTDXQFMZHUQNRHX3","short_pith_number":"pith:FYP4BVE7","canonical_record":{"source":{"id":"1309.5406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-09-20T22:17:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b373d412fd0ba579f601b8dc831d4c73320529f895fd0af7533391d2ff4ad725","abstract_canon_sha256":"823a685e324c461cb8c437e25d4b45afde09497277f044d67bd48e7125dd64b0"},"schema_version":"1.0"},"canonical_sha256":"2e1fc0d49f570d31de05664f483627beff98d304662577c447343960f3a23b9b","source":{"kind":"arxiv","id":"1309.5406","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5406","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5406v2","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5406","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"FYP4BVE7K4GT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FYP4BVE7K4GTDXQF","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FYP4BVE7","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FYP4BVE7K4GTDXQFMZHUQNRHX3","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-09-20T22:17:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b373d412fd0ba579f601b8dc831d4c73320529f895fd0af7533391d2ff4ad725","abstract_canon_sha256":"823a685e324c461cb8c437e25d4b45afde09497277f044d67bd48e7125dd64b0"},"schema_version":"1.0"},"canonical_sha256":"2e1fc0d49f570d31de05664f483627beff98d304662577c447343960f3a23b9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:26.622378Z","signature_b64":"jdBlqvMlvRTykJ4CJHG1A8VI8hMSI1imVSg4FgRoeVY7HtofbPb9MxjGP+yhvgJeNhwmpewqa3mdISjR5JppBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e1fc0d49f570d31de05664f483627beff98d304662577c447343960f3a23b9b","last_reissued_at":"2026-05-18T02:38:26.621803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:26.621803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5406","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-18T02:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPwoeuRes+NzMGqvCzaRHOG0+P2WN6BOhFwQJU3f1zaK64kidroaZere4H+qhPNHzTegjiKgUbs3Yw7AMqg1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:06:28.788254Z"},"content_sha256":"3f37d4be22c834a5bd231779143d026a74240d20db1d1362f17ede19b50ce71a","schema_version":"1.0","event_id":"sha256:3f37d4be22c834a5bd231779143d026a74240d20db1d1362f17ede19b50ce71a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FYP4BVE7K4GTDXQFMZHUQNRHX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Andrew Thompson, Coralia Cartis","submitted_at":"2013-09-20T22:17:15Z","abstract_excerpt":"We present a new recovery analysis for a standard compressed sensing algorithm, Iterative Hard Thresholding (IHT) (Blumensath and Davies, 2008), which considers the fixed points of the algorithm. In the context of arbitrary measurement matrices, we derive a sufficient condition for convergence of IHT to a fixed point and a necessary condition for the existence of fixed points. These conditions allow us to perform a sparse signal recovery analysis in the deterministic noiseless case by implying that the original sparse signal is the unique fixed point and limit point of IHT, and in the case of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5406","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-18T02:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4LuAD3kbOWTdtyDTaU847DIuJCs7GVlhKHSE6X5J/ak19f5+h4pbRyk5Y/wLf18N1g6qZ0lM/qL13jF1lQ9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:06:28.788618Z"},"content_sha256":"58bc6b4f534b500ebbfad6e1f40dc9db0b28aea8562a567be8aede5fdbadfc10","schema_version":"1.0","event_id":"sha256:58bc6b4f534b500ebbfad6e1f40dc9db0b28aea8562a567be8aede5fdbadfc10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYP4BVE7K4GTDXQFMZHUQNRHX3/bundle.json","state_url":"https://pith.science/pith/FYP4BVE7K4GTDXQFMZHUQNRHX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYP4BVE7K4GTDXQFMZHUQNRHX3/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-06-04T17:06:28Z","links":{"resolver":"https://pith.science/pith/FYP4BVE7K4GTDXQFMZHUQNRHX3","bundle":"https://pith.science/pith/FYP4BVE7K4GTDXQFMZHUQNRHX3/bundle.json","state":"https://pith.science/pith/FYP4BVE7K4GTDXQFMZHUQNRHX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYP4BVE7K4GTDXQFMZHUQNRHX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FYP4BVE7K4GTDXQFMZHUQNRHX3","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":"823a685e324c461cb8c437e25d4b45afde09497277f044d67bd48e7125dd64b0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-09-20T22:17:15Z","title_canon_sha256":"b373d412fd0ba579f601b8dc831d4c73320529f895fd0af7533391d2ff4ad725"},"schema_version":"1.0","source":{"id":"1309.5406","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5406","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5406v2","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5406","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"FYP4BVE7K4GT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FYP4BVE7K4GTDXQF","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FYP4BVE7","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:58bc6b4f534b500ebbfad6e1f40dc9db0b28aea8562a567be8aede5fdbadfc10","target":"graph","created_at":"2026-05-18T02:38:26Z","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 present a new recovery analysis for a standard compressed sensing algorithm, Iterative Hard Thresholding (IHT) (Blumensath and Davies, 2008), which considers the fixed points of the algorithm. In the context of arbitrary measurement matrices, we derive a sufficient condition for convergence of IHT to a fixed point and a necessary condition for the existence of fixed points. These conditions allow us to perform a sparse signal recovery analysis in the deterministic noiseless case by implying that the original sparse signal is the unique fixed point and limit point of IHT, and in the case of ","authors_text":"Andrew Thompson, Coralia Cartis","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-09-20T22:17:15Z","title":"A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5406","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:3f37d4be22c834a5bd231779143d026a74240d20db1d1362f17ede19b50ce71a","target":"record","created_at":"2026-05-18T02:38:26Z","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":"823a685e324c461cb8c437e25d4b45afde09497277f044d67bd48e7125dd64b0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-09-20T22:17:15Z","title_canon_sha256":"b373d412fd0ba579f601b8dc831d4c73320529f895fd0af7533391d2ff4ad725"},"schema_version":"1.0","source":{"id":"1309.5406","kind":"arxiv","version":2}},"canonical_sha256":"2e1fc0d49f570d31de05664f483627beff98d304662577c447343960f3a23b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e1fc0d49f570d31de05664f483627beff98d304662577c447343960f3a23b9b","first_computed_at":"2026-05-18T02:38:26.621803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:26.621803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jdBlqvMlvRTykJ4CJHG1A8VI8hMSI1imVSg4FgRoeVY7HtofbPb9MxjGP+yhvgJeNhwmpewqa3mdISjR5JppBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:26.622378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5406","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f37d4be22c834a5bd231779143d026a74240d20db1d1362f17ede19b50ce71a","sha256:58bc6b4f534b500ebbfad6e1f40dc9db0b28aea8562a567be8aede5fdbadfc10"],"state_sha256":"7c2182898551c15ca64afe3336716946e0bf45616d61c09a26e50c9c4889fabc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWvAvVsFGb9/S7SMY5IrCYRPDlVDv300xIMSGMzYWQWO9mCCEbEMyFogKHfvOryx+8kzeqwG1yW6ESl6w47eAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:06:28.790556Z","bundle_sha256":"8c9c6a56524fdfa4b94ed95b38876efd96d8afa8c014bc13348f07c4886b5052"}}