{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6WZVOXS66BL5P2W4YEB46I7RDL","short_pith_number":"pith:6WZVOXS6","schema_version":"1.0","canonical_sha256":"f5b3575e5ef057d7eadcc103cf23f11ae25fcd03147b8555ab42812857696f45","source":{"kind":"arxiv","id":"1804.10019","version":1},"attestation_state":"computed","paper":{"title":"Joint Deformable Registration of Large EM Image Volumes: A Matrix Solver Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gennady Denisov, Khaled Khairy, Stephan Saalfeld","submitted_at":"2018-04-26T12:35:58Z","abstract_excerpt":"Large electron microscopy image datasets for connectomics are typically composed of thousands to millions of partially overlapping two-dimensional images (tiles), which must be registered into a coherent volume prior to further analysis. A common registration strategy is to find matching features between neighboring and overlapping image pairs, followed by a numerical estimation of optimal image deformation using a so-called solver program.\n  Existing solvers are inadequate for large data volumes, and inefficient for small-scale image registration.\n  In this work, an efficient and accurate mat"},"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":"1804.10019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T12:35:58Z","cross_cats_sorted":[],"title_canon_sha256":"e3840ee52ebaae0e1d8e7cbbe5a0b164d671bcc921334fcc063f29d69351859b","abstract_canon_sha256":"e624536a7e118c7e0b4d63edaa581c05484e7878ca2bb4bf9c4aee9b111c3d76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:25.372661Z","signature_b64":"NbiOeIPjuHsDLXpkIb5cFF+ZDCvUYwVzSdmsGP67Zda/pRBhTJ0GMlg+zwUYhgjaWeyVPJfTkLOHCRhh7WZlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b3575e5ef057d7eadcc103cf23f11ae25fcd03147b8555ab42812857696f45","last_reissued_at":"2026-05-18T00:17:25.372010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:25.372010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Deformable Registration of Large EM Image Volumes: A Matrix Solver Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gennady Denisov, Khaled Khairy, Stephan Saalfeld","submitted_at":"2018-04-26T12:35:58Z","abstract_excerpt":"Large electron microscopy image datasets for connectomics are typically composed of thousands to millions of partially overlapping two-dimensional images (tiles), which must be registered into a coherent volume prior to further analysis. A common registration strategy is to find matching features between neighboring and overlapping image pairs, followed by a numerical estimation of optimal image deformation using a so-called solver program.\n  Existing solvers are inadequate for large data volumes, and inefficient for small-scale image registration.\n  In this work, an efficient and accurate mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10019","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":"1804.10019","created_at":"2026-05-18T00:17:25.372126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10019v1","created_at":"2026-05-18T00:17:25.372126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10019","created_at":"2026-05-18T00:17:25.372126+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WZVOXS66BL5","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WZVOXS66BL5P2W4","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WZVOXS6","created_at":"2026-05-18T12:32:11.075285+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/6WZVOXS66BL5P2W4YEB46I7RDL","json":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL.json","graph_json":"https://pith.science/api/pith-number/6WZVOXS66BL5P2W4YEB46I7RDL/graph.json","events_json":"https://pith.science/api/pith-number/6WZVOXS66BL5P2W4YEB46I7RDL/events.json","paper":"https://pith.science/paper/6WZVOXS6"},"agent_actions":{"view_html":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL","download_json":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL.json","view_paper":"https://pith.science/paper/6WZVOXS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10019&json=true","fetch_graph":"https://pith.science/api/pith-number/6WZVOXS66BL5P2W4YEB46I7RDL/graph.json","fetch_events":"https://pith.science/api/pith-number/6WZVOXS66BL5P2W4YEB46I7RDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL/action/storage_attestation","attest_author":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL/action/author_attestation","sign_citation":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL/action/citation_signature","submit_replication":"https://pith.science/pith/6WZVOXS66BL5P2W4YEB46I7RDL/action/replication_record"}},"created_at":"2026-05-18T00:17:25.372126+00:00","updated_at":"2026-05-18T00:17:25.372126+00:00"}