{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DBJDW3ZRMMSACPKBJBPZNRHR4N","short_pith_number":"pith:DBJDW3ZR","schema_version":"1.0","canonical_sha256":"18523b6f316324013d41485f96c4f1e37412b159421792c792cd63cbe4d78707","source":{"kind":"arxiv","id":"1505.04845","version":2},"attestation_state":"computed","paper":{"title":"Multi-Image Matching via Fast Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kostas Daniilidis, Menglong Zhu, Xiaowei Zhou","submitted_at":"2015-05-19T01:14:26Z","abstract_excerpt":"In this paper we propose a global optimization-based approach to jointly matching a set of images. The estimated correspondences simultaneously maximize pairwise feature affinities and cycle consistency across multiple images. Unlike previous convex methods relying on semidefinite programming, we formulate the problem as a low-rank matrix recovery problem and show that the desired semidefiniteness of a solution can be spontaneously fulfilled. The low-rank formulation enables us to derive a fast alternating minimization algorithm in order to handle practical problems with thousands of features."},"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":"1505.04845","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-19T01:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"a33954ddc84992cc46b9c7c68381ca01e8d63a066ca9d9cf681bdf77630d38b0","abstract_canon_sha256":"b83df10885f0b31bbfb62671c4b3e6fd61e98e91e2dac3d480455dea9c58815a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:26.348756Z","signature_b64":"Oj42WN+kNQ2VQmxL6umSloytPQ6DMUB6LY9R7i4LrXj1hDkq8gH5qmZF3P0WDlJeKGHNQjsGs3Bbo2PSR5BBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18523b6f316324013d41485f96c4f1e37412b159421792c792cd63cbe4d78707","last_reissued_at":"2026-05-18T01:25:26.348148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:26.348148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Image Matching via Fast Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kostas Daniilidis, Menglong Zhu, Xiaowei Zhou","submitted_at":"2015-05-19T01:14:26Z","abstract_excerpt":"In this paper we propose a global optimization-based approach to jointly matching a set of images. The estimated correspondences simultaneously maximize pairwise feature affinities and cycle consistency across multiple images. Unlike previous convex methods relying on semidefinite programming, we formulate the problem as a low-rank matrix recovery problem and show that the desired semidefiniteness of a solution can be spontaneously fulfilled. The low-rank formulation enables us to derive a fast alternating minimization algorithm in order to handle practical problems with thousands of features."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04845","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.04845","created_at":"2026-05-18T01:25:26.348243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04845v2","created_at":"2026-05-18T01:25:26.348243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04845","created_at":"2026-05-18T01:25:26.348243+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBJDW3ZRMMSA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBJDW3ZRMMSACPKB","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBJDW3ZR","created_at":"2026-05-18T12:29:17.054201+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/DBJDW3ZRMMSACPKBJBPZNRHR4N","json":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N.json","graph_json":"https://pith.science/api/pith-number/DBJDW3ZRMMSACPKBJBPZNRHR4N/graph.json","events_json":"https://pith.science/api/pith-number/DBJDW3ZRMMSACPKBJBPZNRHR4N/events.json","paper":"https://pith.science/paper/DBJDW3ZR"},"agent_actions":{"view_html":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N","download_json":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N.json","view_paper":"https://pith.science/paper/DBJDW3ZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04845&json=true","fetch_graph":"https://pith.science/api/pith-number/DBJDW3ZRMMSACPKBJBPZNRHR4N/graph.json","fetch_events":"https://pith.science/api/pith-number/DBJDW3ZRMMSACPKBJBPZNRHR4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N/action/storage_attestation","attest_author":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N/action/author_attestation","sign_citation":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N/action/citation_signature","submit_replication":"https://pith.science/pith/DBJDW3ZRMMSACPKBJBPZNRHR4N/action/replication_record"}},"created_at":"2026-05-18T01:25:26.348243+00:00","updated_at":"2026-05-18T01:25:26.348243+00:00"}