{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2HCNAYG6KJGAR5EGLFOPY7JV5D","short_pith_number":"pith:2HCNAYG6","schema_version":"1.0","canonical_sha256":"d1c4d060de524c08f486595cfc7d35e8eb13b9ba82fd9ef67644e527832c032a","source":{"kind":"arxiv","id":"1611.10336","version":1},"attestation_state":"computed","paper":{"title":"An Artificial Agent for Robust Image Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ali Kamen, Dorin Comaniciu, Pierre de Tournemire, Rui Liao, Sasa Grbic, Shun Miao, Tommaso Mansi","submitted_at":"2016-11-30T20:05:55Z","abstract_excerpt":"3-D image registration, which involves aligning two or more images, is a critical step in a variety of medical applications from diagnosis to therapy. Image registration is commonly performed by optimizing an image matching metric as a cost function. However, this task is challenging due to the non-convex nature of the matching metric over the plausible registration parameter space and insufficient approaches for a robust optimization. As a result, current approaches are often customized to a specific problem and sensitive to image quality and artifacts. In this paper, we propose a completely "},"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":"1611.10336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-30T20:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"d4de7382f79646e27b079bfd53a0b4df0aa60cbb41a85f572e447966ba81e156","abstract_canon_sha256":"a22f97bb58fa10894f53f6533c0046bff8ecb66dc921a44f55fc4804607bb987"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:10.731876Z","signature_b64":"6UTHhkDLS5eNgo8y9tdE4YOofV2Un5ywM9xV9U3yb7T/u5j4ZMQQQdzFhdXL/k4wCbJIAKEXvuBSkv7lu2P+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c4d060de524c08f486595cfc7d35e8eb13b9ba82fd9ef67644e527832c032a","last_reissued_at":"2026-05-18T00:56:10.731453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:10.731453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Artificial Agent for Robust Image Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ali Kamen, Dorin Comaniciu, Pierre de Tournemire, Rui Liao, Sasa Grbic, Shun Miao, Tommaso Mansi","submitted_at":"2016-11-30T20:05:55Z","abstract_excerpt":"3-D image registration, which involves aligning two or more images, is a critical step in a variety of medical applications from diagnosis to therapy. Image registration is commonly performed by optimizing an image matching metric as a cost function. However, this task is challenging due to the non-convex nature of the matching metric over the plausible registration parameter space and insufficient approaches for a robust optimization. As a result, current approaches are often customized to a specific problem and sensitive to image quality and artifacts. In this paper, we propose a completely "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10336","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":"1611.10336","created_at":"2026-05-18T00:56:10.731533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.10336v1","created_at":"2026-05-18T00:56:10.731533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10336","created_at":"2026-05-18T00:56:10.731533+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HCNAYG6KJGA","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HCNAYG6KJGAR5EG","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HCNAYG6","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.17392","citing_title":"MorphSeek: Fine-grained Latent Representation-Level Policy Optimization for Deformable Image Registration","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D","json":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D.json","graph_json":"https://pith.science/api/pith-number/2HCNAYG6KJGAR5EGLFOPY7JV5D/graph.json","events_json":"https://pith.science/api/pith-number/2HCNAYG6KJGAR5EGLFOPY7JV5D/events.json","paper":"https://pith.science/paper/2HCNAYG6"},"agent_actions":{"view_html":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D","download_json":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D.json","view_paper":"https://pith.science/paper/2HCNAYG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.10336&json=true","fetch_graph":"https://pith.science/api/pith-number/2HCNAYG6KJGAR5EGLFOPY7JV5D/graph.json","fetch_events":"https://pith.science/api/pith-number/2HCNAYG6KJGAR5EGLFOPY7JV5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D/action/storage_attestation","attest_author":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D/action/author_attestation","sign_citation":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D/action/citation_signature","submit_replication":"https://pith.science/pith/2HCNAYG6KJGAR5EGLFOPY7JV5D/action/replication_record"}},"created_at":"2026-05-18T00:56:10.731533+00:00","updated_at":"2026-05-18T00:56:10.731533+00:00"}