{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2ZDTRNIIJ2GTWKDBPTJCENSNFJ","short_pith_number":"pith:2ZDTRNII","schema_version":"1.0","canonical_sha256":"d64738b5084e8d3b28617cd222364d2a7a47fc5ed6b254317d6b6bbdb07eacd5","source":{"kind":"arxiv","id":"1503.03492","version":1},"attestation_state":"computed","paper":{"title":"Parallel Statistical Multi-resolution Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"physics.comp-ph","authors_text":"Jan Lebert, Johannes Hagemann, Lutz K\\\"unneke, Stephan C. Kramer","submitted_at":"2015-03-10T09:54:40Z","abstract_excerpt":"We discuss several strategies to implement Dykstra's projection algorithm on NVIDIA's compute unified device architecture (CUDA). Dykstra's algorithm is the central step in and the computationally most expensive part of statistical multi-resolution methods. It projects a given vector onto the intersection of convex sets. Compared with a CPU implementation our CUDA implementation is one order of magnitude faster. For a further speed up and to reduce memory consumption we have developed a new variant, which we call incomplete Dykstra's algorithm. Implemented in CUDA it is one order of magnitude "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.03492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2015-03-10T09:54:40Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7a77bd9aba468db308b72a4067418d8996b6a3fe39063ee3a6faef4a3885842f","abstract_canon_sha256":"cdb3f8d581c699198f06a5a8bfdfb23cb11a242858949057f976f6f83e2506fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:58.425123Z","signature_b64":"zusBCykM+sjAtJ5Rk1hSX3e3Obedc8lrGXXOZVwRLh6rVS7eyBsWRkFNzxrj9jtQRaNrk66i3TnumNTocikxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d64738b5084e8d3b28617cd222364d2a7a47fc5ed6b254317d6b6bbdb07eacd5","last_reissued_at":"2026-05-18T02:24:58.424486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:58.424486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Statistical Multi-resolution Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"physics.comp-ph","authors_text":"Jan Lebert, Johannes Hagemann, Lutz K\\\"unneke, Stephan C. Kramer","submitted_at":"2015-03-10T09:54:40Z","abstract_excerpt":"We discuss several strategies to implement Dykstra's projection algorithm on NVIDIA's compute unified device architecture (CUDA). Dykstra's algorithm is the central step in and the computationally most expensive part of statistical multi-resolution methods. It projects a given vector onto the intersection of convex sets. Compared with a CPU implementation our CUDA implementation is one order of magnitude faster. For a further speed up and to reduce memory consumption we have developed a new variant, which we call incomplete Dykstra's algorithm. Implemented in CUDA it is one order of magnitude "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03492","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.03492","created_at":"2026-05-18T02:24:58.424593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03492v1","created_at":"2026-05-18T02:24:58.424593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03492","created_at":"2026-05-18T02:24:58.424593+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZDTRNIIJ2GT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZDTRNIIJ2GTWKDB","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZDTRNII","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ","json":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ.json","graph_json":"https://pith.science/api/pith-number/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/graph.json","events_json":"https://pith.science/api/pith-number/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/events.json","paper":"https://pith.science/paper/2ZDTRNII"},"agent_actions":{"view_html":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ","download_json":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ.json","view_paper":"https://pith.science/paper/2ZDTRNII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03492&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/action/storage_attestation","attest_author":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/action/author_attestation","sign_citation":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/action/citation_signature","submit_replication":"https://pith.science/pith/2ZDTRNIIJ2GTWKDBPTJCENSNFJ/action/replication_record"}},"created_at":"2026-05-18T02:24:58.424593+00:00","updated_at":"2026-05-18T02:24:58.424593+00:00"}