{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:45W6HQIC5GRJ726RUK3YJYKVUT","short_pith_number":"pith:45W6HQIC","canonical_record":{"source":{"id":"1902.04794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-13T09:00:19Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ac9eb17b7a5199d85a293d80b72ac6429d626c4f40d22ac3b5d7885ab79bf537","abstract_canon_sha256":"9b43fd61744b043820fc2f851c31faf2b0029190d0744cbfc00438c11731d3b4"},"schema_version":"1.0"},"canonical_sha256":"e76de3c102e9a29febd1a2b784e155a4e5d91a5959d7ca21053b94a8bf698648","source":{"kind":"arxiv","id":"1902.04794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04794","created_at":"2026-05-17T23:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04794v2","created_at":"2026-05-17T23:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04794","created_at":"2026-05-17T23:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"45W6HQIC5GRJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"45W6HQIC5GRJ726R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"45W6HQIC","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:45W6HQIC5GRJ726RUK3YJYKVUT","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-13T09:00:19Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ac9eb17b7a5199d85a293d80b72ac6429d626c4f40d22ac3b5d7885ab79bf537","abstract_canon_sha256":"9b43fd61744b043820fc2f851c31faf2b0029190d0744cbfc00438c11731d3b4"},"schema_version":"1.0"},"canonical_sha256":"e76de3c102e9a29febd1a2b784e155a4e5d91a5959d7ca21053b94a8bf698648","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:30.458432Z","signature_b64":"q6qsSpntN1W5lCehokvXcZE69Nx3uODmOH1lDt4eoJUecw7QmxtiwFSmuXKOnON8lZlMmdrrfbCUGKsOReHQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e76de3c102e9a29febd1a2b784e155a4e5d91a5959d7ca21053b94a8bf698648","last_reissued_at":"2026-05-17T23:39:30.457892Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:30.457892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04794","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-17T23:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6t83JrTxJXVfg0o8okydnpCsRu484tbAH1MZFsPdfZyaLvrYOEoSaB1FAst1uwJhFZa1VrzI+wZ2nQ1NIBThCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:57:26.567032Z"},"content_sha256":"8a852fa63f3d4d212582bd9d4bdc94e60ca102e27b6bb1d483b86b7064900511","schema_version":"1.0","event_id":"sha256:8a852fa63f3d4d212582bd9d4bdc94e60ca102e27b6bb1d483b86b7064900511"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:45W6HQIC5GRJ726RUK3YJYKVUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Lukas Neumann, Markus Haltmeier, Simon Rabanser","submitted_at":"2019-02-13T09:00:19Z","abstract_excerpt":"Block coordinate descent (BCD) methods approach optimization problems by performing gradient steps along alternating subgroups of coordinates. This is in contrast to full gradient descent, where a gradient step updates all coordinates simultaneously. BCD has been demonstrated to accelerate the gradient method in many practical large-scale applications. Despite its success no convergence analysis for inverse problems is known so far. In this paper, we investigate the BCD method for solving linear inverse problems. As main theoretical result, we show that for operators having a particular tensor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04794","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-17T23:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZSnqDqf3j3Q+z5dL7BnP03N78KMoCBzpk7NQSjGJb1iOnBUNf/vul6Dmk02ozMi9X1rKfNknhz5z0sMCaxsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:57:26.567386Z"},"content_sha256":"9326303ddb508c211b04f4b6e387c831f5d67c94d8bab391323c5f6f9fe7ca30","schema_version":"1.0","event_id":"sha256:9326303ddb508c211b04f4b6e387c831f5d67c94d8bab391323c5f6f9fe7ca30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45W6HQIC5GRJ726RUK3YJYKVUT/bundle.json","state_url":"https://pith.science/pith/45W6HQIC5GRJ726RUK3YJYKVUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45W6HQIC5GRJ726RUK3YJYKVUT/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-25T11:57:26Z","links":{"resolver":"https://pith.science/pith/45W6HQIC5GRJ726RUK3YJYKVUT","bundle":"https://pith.science/pith/45W6HQIC5GRJ726RUK3YJYKVUT/bundle.json","state":"https://pith.science/pith/45W6HQIC5GRJ726RUK3YJYKVUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45W6HQIC5GRJ726RUK3YJYKVUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:45W6HQIC5GRJ726RUK3YJYKVUT","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":"9b43fd61744b043820fc2f851c31faf2b0029190d0744cbfc00438c11731d3b4","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-13T09:00:19Z","title_canon_sha256":"ac9eb17b7a5199d85a293d80b72ac6429d626c4f40d22ac3b5d7885ab79bf537"},"schema_version":"1.0","source":{"id":"1902.04794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04794","created_at":"2026-05-17T23:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04794v2","created_at":"2026-05-17T23:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04794","created_at":"2026-05-17T23:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"45W6HQIC5GRJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"45W6HQIC5GRJ726R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"45W6HQIC","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:9326303ddb508c211b04f4b6e387c831f5d67c94d8bab391323c5f6f9fe7ca30","target":"graph","created_at":"2026-05-17T23:39:30Z","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":"Block coordinate descent (BCD) methods approach optimization problems by performing gradient steps along alternating subgroups of coordinates. This is in contrast to full gradient descent, where a gradient step updates all coordinates simultaneously. BCD has been demonstrated to accelerate the gradient method in many practical large-scale applications. Despite its success no convergence analysis for inverse problems is known so far. In this paper, we investigate the BCD method for solving linear inverse problems. As main theoretical result, we show that for operators having a particular tensor","authors_text":"Lukas Neumann, Markus Haltmeier, Simon Rabanser","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-13T09:00:19Z","title":"Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04794","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:8a852fa63f3d4d212582bd9d4bdc94e60ca102e27b6bb1d483b86b7064900511","target":"record","created_at":"2026-05-17T23:39:30Z","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":"9b43fd61744b043820fc2f851c31faf2b0029190d0744cbfc00438c11731d3b4","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-13T09:00:19Z","title_canon_sha256":"ac9eb17b7a5199d85a293d80b72ac6429d626c4f40d22ac3b5d7885ab79bf537"},"schema_version":"1.0","source":{"id":"1902.04794","kind":"arxiv","version":2}},"canonical_sha256":"e76de3c102e9a29febd1a2b784e155a4e5d91a5959d7ca21053b94a8bf698648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e76de3c102e9a29febd1a2b784e155a4e5d91a5959d7ca21053b94a8bf698648","first_computed_at":"2026-05-17T23:39:30.457892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:30.457892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q6qsSpntN1W5lCehokvXcZE69Nx3uODmOH1lDt4eoJUecw7QmxtiwFSmuXKOnON8lZlMmdrrfbCUGKsOReHQBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:30.458432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a852fa63f3d4d212582bd9d4bdc94e60ca102e27b6bb1d483b86b7064900511","sha256:9326303ddb508c211b04f4b6e387c831f5d67c94d8bab391323c5f6f9fe7ca30"],"state_sha256":"c0286c40c96dbaaeaac15851f712c90e6853674d1658aae627ec308cf04861b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jWDruf8Ff+fHaz98Lc5LhETFaS3KLGc/QhL010EYiMs9J4OTD+YQlF2Q0lg3UnkB/ywX1dNIBi5EOjAlKR8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:57:26.569238Z","bundle_sha256":"43d408ced516f29002b048a4c6fc6a77ca6cd2a5a8d6b22270e3697ed3558a09"}}