{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:V2IX3MSSTVPJLED6Q2NOQUUV5L","short_pith_number":"pith:V2IX3MSS","schema_version":"1.0","canonical_sha256":"ae917db2529d5e95907e869ae85295ead2d8a2bee0ec1a0ff5c86b92ba0fc8bb","source":{"kind":"arxiv","id":"1903.11874","version":1},"attestation_state":"computed","paper":{"title":"Block stochastic gradient descent for large-scale tomographic reconstruction in a parallel network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ander Biguri, Thomas Blumensath, Yushan Gao","submitted_at":"2019-03-28T10:10:27Z","abstract_excerpt":"Iterative algorithms have many advantages for linear tomographic image reconstruction when compared to back-projection based methods. However, iterative methods tend to have significantly higher computational complexity. To overcome this, parallel processing schemes that can utilise several computing nodes are desirable. Popular methods here are row action methods, which update the entire image simultaneously and column action methods, which require access to all measurements at each node. In large scale tomographic reconstruction with limited storage capacity of each node, data communication "},"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":"1903.11874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-28T10:10:27Z","cross_cats_sorted":[],"title_canon_sha256":"cbe25f384a33febedb9b2fb6e012a0ef184785c0ab0e0b7bc56ba92c5e7688d0","abstract_canon_sha256":"512f36aea0696dbb9948c0eb84a218e5603eeebb1bb64164eedf9a78d4a22429"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:58.847241Z","signature_b64":"Yfwd9HwaFc2BLUTRcrRzTJj6UA6qJ8CoeN+ej9CbtsizpNF/GTnHr4lMMZ7ZRGGmP2dyT9BhlpY6w3JnogSTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae917db2529d5e95907e869ae85295ead2d8a2bee0ec1a0ff5c86b92ba0fc8bb","last_reissued_at":"2026-05-17T23:49:58.846571Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:58.846571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block stochastic gradient descent for large-scale tomographic reconstruction in a parallel network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ander Biguri, Thomas Blumensath, Yushan Gao","submitted_at":"2019-03-28T10:10:27Z","abstract_excerpt":"Iterative algorithms have many advantages for linear tomographic image reconstruction when compared to back-projection based methods. However, iterative methods tend to have significantly higher computational complexity. To overcome this, parallel processing schemes that can utilise several computing nodes are desirable. Popular methods here are row action methods, which update the entire image simultaneously and column action methods, which require access to all measurements at each node. In large scale tomographic reconstruction with limited storage capacity of each node, data communication "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11874","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":"1903.11874","created_at":"2026-05-17T23:49:58.846654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11874v1","created_at":"2026-05-17T23:49:58.846654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11874","created_at":"2026-05-17T23:49:58.846654+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2IX3MSSTVPJ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2IX3MSSTVPJLED6","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2IX3MSS","created_at":"2026-05-18T12:33:30.264802+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/V2IX3MSSTVPJLED6Q2NOQUUV5L","json":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L.json","graph_json":"https://pith.science/api/pith-number/V2IX3MSSTVPJLED6Q2NOQUUV5L/graph.json","events_json":"https://pith.science/api/pith-number/V2IX3MSSTVPJLED6Q2NOQUUV5L/events.json","paper":"https://pith.science/paper/V2IX3MSS"},"agent_actions":{"view_html":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L","download_json":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L.json","view_paper":"https://pith.science/paper/V2IX3MSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11874&json=true","fetch_graph":"https://pith.science/api/pith-number/V2IX3MSSTVPJLED6Q2NOQUUV5L/graph.json","fetch_events":"https://pith.science/api/pith-number/V2IX3MSSTVPJLED6Q2NOQUUV5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L/action/storage_attestation","attest_author":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L/action/author_attestation","sign_citation":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L/action/citation_signature","submit_replication":"https://pith.science/pith/V2IX3MSSTVPJLED6Q2NOQUUV5L/action/replication_record"}},"created_at":"2026-05-17T23:49:58.846654+00:00","updated_at":"2026-05-17T23:49:58.846654+00:00"}