{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CKVRC62E26MUOO4GBVHQDJZ66Z","short_pith_number":"pith:CKVRC62E","canonical_record":{"source":{"id":"1310.3954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:30:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0429a8a22d5c1b83efc607203e1688fd826d054db1c788e1816c62249d9e1373","abstract_canon_sha256":"83331221a59481bcafadc08a0fc0e09292ddbaa36741fec7a8462ef33f1e453f"},"schema_version":"1.0"},"canonical_sha256":"12ab117b44d799473b860d4f01a73ef669ee736a4e76565886fc246730b0767d","source":{"kind":"arxiv","id":"1310.3954","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3954","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3954v1","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3954","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"CKVRC62E26MU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CKVRC62E26MUOO4G","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CKVRC62E","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CKVRC62E26MUOO4GBVHQDJZ66Z","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:30:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0429a8a22d5c1b83efc607203e1688fd826d054db1c788e1816c62249d9e1373","abstract_canon_sha256":"83331221a59481bcafadc08a0fc0e09292ddbaa36741fec7a8462ef33f1e453f"},"schema_version":"1.0"},"canonical_sha256":"12ab117b44d799473b860d4f01a73ef669ee736a4e76565886fc246730b0767d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:25.606333Z","signature_b64":"9w7OpBlTUctlsxzYUGg1ZWittHDJ8heVZnGrRNJ1Dmwj1uKgNahcXnNeAqf7yhCSth1DL86uyo95ja4wZOU3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12ab117b44d799473b860d4f01a73ef669ee736a4e76565886fc246730b0767d","last_reissued_at":"2026-05-18T03:10:25.605604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:25.605604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3954","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-18T03:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wi/srWQGDUgVicPK1P/MIBnibQCznYK9GrB4aZpid4UWpfAXbSG8w7WUtTg0JVHM0Z/sprHHZPAnhaqlaao7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:11:33.788481Z"},"content_sha256":"72c08002e3f4351799eeb0ca2ca14c72e9e97f0dee8f72c92cd4e932e0be22cc","schema_version":"1.0","event_id":"sha256:72c08002e3f4351799eeb0ca2ca14c72e9e97f0dee8f72c92cd4e932e0be22cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CKVRC62E26MUOO4GBVHQDJZ66Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Solution of Underdetermined Linear Equations via Adaptively Iterative Thresholding","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinshan Zeng, Shaobo Lin, Zongben Xu","submitted_at":"2013-10-15T08:30:59Z","abstract_excerpt":"Finding the sparset solution of an underdetermined system of linear equations $y=Ax$ has attracted considerable attention in recent years. Among a large number of algorithms, iterative thresholding algorithms are recognized as one of the most efficient and important classes of algorithms. This is mainly due to their low computational complexities, especially for large scale applications. The aim of this paper is to provide guarantees on the global convergence of a wide class of iterative thresholding algorithms. Since the thresholds of the considered algorithms are set adaptively at each itera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3954","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-18T03:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCbYqG7wKVl026Kla8/y3RE74rc2bvqRJTcsMcp3ABrCFdiQ2YGWJzRPXV0s1Uq3DAasAz7LIntsY6ydFISRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:11:33.788825Z"},"content_sha256":"014c9afdd45c5cdb195f58db856e6cc2ce77e095e876d3c4ba188c2729a3d5c8","schema_version":"1.0","event_id":"sha256:014c9afdd45c5cdb195f58db856e6cc2ce77e095e876d3c4ba188c2729a3d5c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKVRC62E26MUOO4GBVHQDJZ66Z/bundle.json","state_url":"https://pith.science/pith/CKVRC62E26MUOO4GBVHQDJZ66Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKVRC62E26MUOO4GBVHQDJZ66Z/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-25T17:11:33Z","links":{"resolver":"https://pith.science/pith/CKVRC62E26MUOO4GBVHQDJZ66Z","bundle":"https://pith.science/pith/CKVRC62E26MUOO4GBVHQDJZ66Z/bundle.json","state":"https://pith.science/pith/CKVRC62E26MUOO4GBVHQDJZ66Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKVRC62E26MUOO4GBVHQDJZ66Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CKVRC62E26MUOO4GBVHQDJZ66Z","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":"83331221a59481bcafadc08a0fc0e09292ddbaa36741fec7a8462ef33f1e453f","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:30:59Z","title_canon_sha256":"0429a8a22d5c1b83efc607203e1688fd826d054db1c788e1816c62249d9e1373"},"schema_version":"1.0","source":{"id":"1310.3954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3954","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3954v1","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3954","created_at":"2026-05-18T03:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"CKVRC62E26MU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CKVRC62E26MUOO4G","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CKVRC62E","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:014c9afdd45c5cdb195f58db856e6cc2ce77e095e876d3c4ba188c2729a3d5c8","target":"graph","created_at":"2026-05-18T03:10:25Z","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":"Finding the sparset solution of an underdetermined system of linear equations $y=Ax$ has attracted considerable attention in recent years. Among a large number of algorithms, iterative thresholding algorithms are recognized as one of the most efficient and important classes of algorithms. This is mainly due to their low computational complexities, especially for large scale applications. The aim of this paper is to provide guarantees on the global convergence of a wide class of iterative thresholding algorithms. Since the thresholds of the considered algorithms are set adaptively at each itera","authors_text":"Jinshan Zeng, Shaobo Lin, Zongben Xu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:30:59Z","title":"Sparse Solution of Underdetermined Linear Equations via Adaptively Iterative Thresholding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3954","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:72c08002e3f4351799eeb0ca2ca14c72e9e97f0dee8f72c92cd4e932e0be22cc","target":"record","created_at":"2026-05-18T03:10:25Z","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":"83331221a59481bcafadc08a0fc0e09292ddbaa36741fec7a8462ef33f1e453f","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T08:30:59Z","title_canon_sha256":"0429a8a22d5c1b83efc607203e1688fd826d054db1c788e1816c62249d9e1373"},"schema_version":"1.0","source":{"id":"1310.3954","kind":"arxiv","version":1}},"canonical_sha256":"12ab117b44d799473b860d4f01a73ef669ee736a4e76565886fc246730b0767d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12ab117b44d799473b860d4f01a73ef669ee736a4e76565886fc246730b0767d","first_computed_at":"2026-05-18T03:10:25.605604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:25.605604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9w7OpBlTUctlsxzYUGg1ZWittHDJ8heVZnGrRNJ1Dmwj1uKgNahcXnNeAqf7yhCSth1DL86uyo95ja4wZOU3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:25.606333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72c08002e3f4351799eeb0ca2ca14c72e9e97f0dee8f72c92cd4e932e0be22cc","sha256:014c9afdd45c5cdb195f58db856e6cc2ce77e095e876d3c4ba188c2729a3d5c8"],"state_sha256":"c9c4e1a0c523499c0d3722e5fbb324481baa57d0e44b3261c857b0990274e94b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InBKcUpOgrXHOdiSBCqUkVFZBA4TcMMDVrQcckykIXwCxdPGE4e6O8QDVp4tsbxRWRXbOn4jGnpQ1rkK0nN9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:11:33.791097Z","bundle_sha256":"2c4599bb3535e1b06f8b6055c59e2bcc8ef37af97b135548dd20c1efda21587f"}}