{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2OSFH53DJ4Z53CHF4XM6YWWCIL","short_pith_number":"pith:2OSFH53D","canonical_record":{"source":{"id":"2211.02802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-05T03:14:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6b8cba8a5c8b2689e9b95e3f72e8be960e157096c17428595610d6dc1317f0f2","abstract_canon_sha256":"59b9fd179a942fe84fec28209ca85e132b6618f3f7d81c94168b64175a1cc7a1"},"schema_version":"1.0"},"canonical_sha256":"d3a453f7634f33dd88e5e5d9ec5ac242eae08da5a8594120d9c23b72e5b86b17","source":{"kind":"arxiv","id":"2211.02802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02802","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02802v1","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02802","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"2OSFH53DJ4Z5","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"pith_short_16","alias_value":"2OSFH53DJ4Z53CHF","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"pith_short_8","alias_value":"2OSFH53D","created_at":"2026-07-05T05:13:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2OSFH53DJ4Z53CHF4XM6YWWCIL","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-05T03:14:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6b8cba8a5c8b2689e9b95e3f72e8be960e157096c17428595610d6dc1317f0f2","abstract_canon_sha256":"59b9fd179a942fe84fec28209ca85e132b6618f3f7d81c94168b64175a1cc7a1"},"schema_version":"1.0"},"canonical_sha256":"d3a453f7634f33dd88e5e5d9ec5ac242eae08da5a8594120d9c23b72e5b86b17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:21.795612Z","signature_b64":"7h5yV5lV22drZvdijhDg5WuGhV7LXQhAAI7lH5lnxramn4KLd2G++e37DXxZGbMLKL23MMlPPXgfl4c4qfS5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3a453f7634f33dd88e5e5d9ec5ac242eae08da5a8594120d9c23b72e5b86b17","last_reissued_at":"2026-07-05T05:13:21.795154Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:21.795154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02802","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-07-05T05:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8K7MzDge6gzRsYXQFBX5MhPKSSyd89rrY7+7x5FcY4lWNTfugQn1F0DgD+7NlzifJKpKPrCvQzvLX7FnORdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:05:04.653852Z"},"content_sha256":"006c3d164065296bf75cd76ad9c4ac8f090e6a3fce85125befd8616964c2d5ad","schema_version":"1.0","event_id":"sha256:006c3d164065296bf75cd76ad9c4ac8f090e6a3fce85125befd8616964c2d5ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2OSFH53DJ4Z53CHF4XM6YWWCIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Variance Reduced Gradient for affine rank minimization problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Jian Lu, Juan Nie, Michael K. Ng, Ningning Han","submitted_at":"2022-11-05T03:14:05Z","abstract_excerpt":"We develop an efficient stochastic variance reduced gradient descent algorithm to solve the affine rank minimization problem consists of finding a matrix of minimum rank from linear measurements. The proposed algorithm as a stochastic gradient descent strategy enjoys a more favorable complexity than full gradients. It also reduces the variance of the stochastic gradient at each iteration and accelerate the rate of convergence. We prove that the proposed algorithm converges linearly in expectation to the solution under a restricted isometry condition. The numerical experiments show that the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02802","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.02802/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnhH80xkrJJSJGNuVXGVs/9+P4NRIeBKSXBFtHD1yecssXzzIg3QUx4jfKcGXpW6TpiRpnUTdInvrDEaXimABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:05:04.654372Z"},"content_sha256":"6539985be7951b013784592ce649cc43b1d59e4ea2ccf768ec0e0415922fcba1","schema_version":"1.0","event_id":"sha256:6539985be7951b013784592ce649cc43b1d59e4ea2ccf768ec0e0415922fcba1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OSFH53DJ4Z53CHF4XM6YWWCIL/bundle.json","state_url":"https://pith.science/pith/2OSFH53DJ4Z53CHF4XM6YWWCIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OSFH53DJ4Z53CHF4XM6YWWCIL/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-08-08T23:05:04Z","links":{"resolver":"https://pith.science/pith/2OSFH53DJ4Z53CHF4XM6YWWCIL","bundle":"https://pith.science/pith/2OSFH53DJ4Z53CHF4XM6YWWCIL/bundle.json","state":"https://pith.science/pith/2OSFH53DJ4Z53CHF4XM6YWWCIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OSFH53DJ4Z53CHF4XM6YWWCIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2OSFH53DJ4Z53CHF4XM6YWWCIL","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":"59b9fd179a942fe84fec28209ca85e132b6618f3f7d81c94168b64175a1cc7a1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-05T03:14:05Z","title_canon_sha256":"6b8cba8a5c8b2689e9b95e3f72e8be960e157096c17428595610d6dc1317f0f2"},"schema_version":"1.0","source":{"id":"2211.02802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02802","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02802v1","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02802","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"2OSFH53DJ4Z5","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"pith_short_16","alias_value":"2OSFH53DJ4Z53CHF","created_at":"2026-07-05T05:13:21Z"},{"alias_kind":"pith_short_8","alias_value":"2OSFH53D","created_at":"2026-07-05T05:13:21Z"}],"graph_snapshots":[{"event_id":"sha256:6539985be7951b013784592ce649cc43b1d59e4ea2ccf768ec0e0415922fcba1","target":"graph","created_at":"2026-07-05T05:13:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.02802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an efficient stochastic variance reduced gradient descent algorithm to solve the affine rank minimization problem consists of finding a matrix of minimum rank from linear measurements. The proposed algorithm as a stochastic gradient descent strategy enjoys a more favorable complexity than full gradients. It also reduces the variance of the stochastic gradient at each iteration and accelerate the rate of convergence. We prove that the proposed algorithm converges linearly in expectation to the solution under a restricted isometry condition. The numerical experiments show that the pro","authors_text":"Jian Lu, Juan Nie, Michael K. Ng, Ningning Han","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-05T03:14:05Z","title":"Stochastic Variance Reduced Gradient for affine rank minimization problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02802","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:006c3d164065296bf75cd76ad9c4ac8f090e6a3fce85125befd8616964c2d5ad","target":"record","created_at":"2026-07-05T05:13:21Z","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":"59b9fd179a942fe84fec28209ca85e132b6618f3f7d81c94168b64175a1cc7a1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-05T03:14:05Z","title_canon_sha256":"6b8cba8a5c8b2689e9b95e3f72e8be960e157096c17428595610d6dc1317f0f2"},"schema_version":"1.0","source":{"id":"2211.02802","kind":"arxiv","version":1}},"canonical_sha256":"d3a453f7634f33dd88e5e5d9ec5ac242eae08da5a8594120d9c23b72e5b86b17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3a453f7634f33dd88e5e5d9ec5ac242eae08da5a8594120d9c23b72e5b86b17","first_computed_at":"2026-07-05T05:13:21.795154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:13:21.795154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7h5yV5lV22drZvdijhDg5WuGhV7LXQhAAI7lH5lnxramn4KLd2G++e37DXxZGbMLKL23MMlPPXgfl4c4qfS5Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:13:21.795612Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:006c3d164065296bf75cd76ad9c4ac8f090e6a3fce85125befd8616964c2d5ad","sha256:6539985be7951b013784592ce649cc43b1d59e4ea2ccf768ec0e0415922fcba1"],"state_sha256":"92122ae7274aff7835ec29b25cfcf385ababb5bfa85f20439b334a05b64b4d19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwkWgx0MfuPb0zzqLCeRf7WJpBcSdzx/FUXx1xCi7qewGhu/N1J6pbtm811p4e9LZa/VG0uwJQtStt3rLJvTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:05:04.659680Z","bundle_sha256":"f9426ac9e19156b5d1355fb31f1fa005872446824d6891f9fde6f46301dc3a2a"}}