{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PZLLQZZ26L4MBP3XEPOYXJRTIX","short_pith_number":"pith:PZLLQZZ2","canonical_record":{"source":{"id":"1710.03309","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T20:50:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70be8397f4e7bc26813e9018f71a243c99852b96157ad4d41d68ba050dd1113d","abstract_canon_sha256":"5e37b1cdfce757633152cdb503e4f75b420333f9b9e8d9c56a9a3e1b97bea769"},"schema_version":"1.0"},"canonical_sha256":"7e56b8673af2f8c0bf7723dd8ba63345f775422f1685faf0a1fa1df982f09227","source":{"kind":"arxiv","id":"1710.03309","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03309","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03309v2","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03309","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"PZLLQZZ26L4M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZLLQZZ26L4MBP3X","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZLLQZZ2","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PZLLQZZ26L4MBP3XEPOYXJRTIX","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03309","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T20:50:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70be8397f4e7bc26813e9018f71a243c99852b96157ad4d41d68ba050dd1113d","abstract_canon_sha256":"5e37b1cdfce757633152cdb503e4f75b420333f9b9e8d9c56a9a3e1b97bea769"},"schema_version":"1.0"},"canonical_sha256":"7e56b8673af2f8c0bf7723dd8ba63345f775422f1685faf0a1fa1df982f09227","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:31.474836Z","signature_b64":"eWTyQom1O3OmDglfpauEaywJvqXOKs/0ixBcrWJbnaDkNQ13YRFF4qBILNETL9NskNkPgseB+ZUqAxu61UH+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e56b8673af2f8c0bf7723dd8ba63345f775422f1685faf0a1fa1df982f09227","last_reissued_at":"2026-05-18T00:18:31.474472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:31.474472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03309","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-18T00:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOPOMIeLEg+YOZTTm64JjBLyfUkTvsAfki2o6T8oNxtus+MUcES2nzIgiUGFoAgmddqCzpk/skyzlJXMgV+RDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:56:09.894010Z"},"content_sha256":"d86e460ec183bd53fe075a35ccfd790dba47b1c8de82dcd8ea5d60d8a59824bc","schema_version":"1.0","event_id":"sha256:d86e460ec183bd53fe075a35ccfd790dba47b1c8de82dcd8ea5d60d8a59824bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PZLLQZZ26L4MBP3XEPOYXJRTIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Paul Hand, Wen Huang","submitted_at":"2017-10-09T20:50:06Z","abstract_excerpt":"In this paper, we propose a Riemannian steepest descent method for solving a blind deconvolution problem. We prove that the proposed algorithm with an appropriate initialization will recover the exact solution with high probability when the number of measurements is, up to log-factors, the information-theoretical minimum scaling. The quotient structure in our formulation yields a simpler penalty term in the cost function compared to [LLSW16], which eases the convergence analysis and yields a natural implementation. Empirically, the proposed algorithm has better performance than the Wirtinger g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03309","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-18T00:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZxvPpAZE0RmyfTXW7JwrVAy/CMZQoBwqrQ85BgBF3cFRh7fQMlpzE6oxg7ShwSPwfDCThFa1D4rDCnUqTF4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:56:09.894653Z"},"content_sha256":"ecbbbf6d31f269d5e4a3a1666e83a330d3843c4c8b34a502a9e4122deaa75b87","schema_version":"1.0","event_id":"sha256:ecbbbf6d31f269d5e4a3a1666e83a330d3843c4c8b34a502a9e4122deaa75b87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZLLQZZ26L4MBP3XEPOYXJRTIX/bundle.json","state_url":"https://pith.science/pith/PZLLQZZ26L4MBP3XEPOYXJRTIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZLLQZZ26L4MBP3XEPOYXJRTIX/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-31T09:56:09Z","links":{"resolver":"https://pith.science/pith/PZLLQZZ26L4MBP3XEPOYXJRTIX","bundle":"https://pith.science/pith/PZLLQZZ26L4MBP3XEPOYXJRTIX/bundle.json","state":"https://pith.science/pith/PZLLQZZ26L4MBP3XEPOYXJRTIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZLLQZZ26L4MBP3XEPOYXJRTIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PZLLQZZ26L4MBP3XEPOYXJRTIX","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":"5e37b1cdfce757633152cdb503e4f75b420333f9b9e8d9c56a9a3e1b97bea769","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T20:50:06Z","title_canon_sha256":"70be8397f4e7bc26813e9018f71a243c99852b96157ad4d41d68ba050dd1113d"},"schema_version":"1.0","source":{"id":"1710.03309","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03309","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03309v2","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03309","created_at":"2026-05-18T00:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"PZLLQZZ26L4M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZLLQZZ26L4MBP3X","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZLLQZZ2","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:ecbbbf6d31f269d5e4a3a1666e83a330d3843c4c8b34a502a9e4122deaa75b87","target":"graph","created_at":"2026-05-18T00:18:31Z","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":"In this paper, we propose a Riemannian steepest descent method for solving a blind deconvolution problem. We prove that the proposed algorithm with an appropriate initialization will recover the exact solution with high probability when the number of measurements is, up to log-factors, the information-theoretical minimum scaling. The quotient structure in our formulation yields a simpler penalty term in the cost function compared to [LLSW16], which eases the convergence analysis and yields a natural implementation. Empirically, the proposed algorithm has better performance than the Wirtinger g","authors_text":"Paul Hand, Wen Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T20:50:06Z","title":"Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03309","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:d86e460ec183bd53fe075a35ccfd790dba47b1c8de82dcd8ea5d60d8a59824bc","target":"record","created_at":"2026-05-18T00:18:31Z","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":"5e37b1cdfce757633152cdb503e4f75b420333f9b9e8d9c56a9a3e1b97bea769","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T20:50:06Z","title_canon_sha256":"70be8397f4e7bc26813e9018f71a243c99852b96157ad4d41d68ba050dd1113d"},"schema_version":"1.0","source":{"id":"1710.03309","kind":"arxiv","version":2}},"canonical_sha256":"7e56b8673af2f8c0bf7723dd8ba63345f775422f1685faf0a1fa1df982f09227","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e56b8673af2f8c0bf7723dd8ba63345f775422f1685faf0a1fa1df982f09227","first_computed_at":"2026-05-18T00:18:31.474472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:31.474472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eWTyQom1O3OmDglfpauEaywJvqXOKs/0ixBcrWJbnaDkNQ13YRFF4qBILNETL9NskNkPgseB+ZUqAxu61UH+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:31.474836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03309","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d86e460ec183bd53fe075a35ccfd790dba47b1c8de82dcd8ea5d60d8a59824bc","sha256:ecbbbf6d31f269d5e4a3a1666e83a330d3843c4c8b34a502a9e4122deaa75b87"],"state_sha256":"cf859bfd736d20b63ddd647806b086740a05705fbb1bcade1958f9b96a2dac2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21YSRrBzH6FJQ57KI6fFHU8ovgN7EJLYV7j1VSHmTt4S8293JQoh27zpIADV12AYjaP16nrTW2O3XJooQew5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:56:09.897866Z","bundle_sha256":"40794612c9c682bbb9f8c57cef50b7ce0841d363fb43b0b1d06d6465d9599cc4"}}