{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M4TD3AZAFO5XTH3CM66N3ORI3K","short_pith_number":"pith:M4TD3AZA","schema_version":"1.0","canonical_sha256":"67263d83202bbb799f6267bcddba28da87daa7dd181ef2735cd128d7590b7faf","source":{"kind":"arxiv","id":"1403.4806","version":1},"attestation_state":"computed","paper":{"title":"Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Bartoli (ISIT), CTU/FEE), Didier Henrion (LAAS, Florian Bugarin (ICA), Jean-Bernard Lasserre (LAAS), Jean-Jos\\'e Orteu (ICA), LAAS), Thierry Sentenac (ICA","submitted_at":"2014-03-19T14:13:04Z","abstract_excerpt":"The fundamental matrix can be estimated from point matches. The current gold standard is to bootstrap the eight-point algorithm and two-view projective bundle adjustment. The eight-point algorithm first computes a simple linear least squares solution by minimizing an algebraic cost and then projects the result to the closest rank-deficient matrix. We propose a single-step method that solves both steps of the eight-point algorithm. Using recent results from polynomial global optimization, our method finds the rank-deficient matrix that exactly minimizes the algebraic cost. In this special case,"},"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":"1403.4806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T14:13:04Z","cross_cats_sorted":[],"title_canon_sha256":"7d26ed3b381e6f495a0a34ae272563e23de9f51e701a17de8fd2f51acdb98fa3","abstract_canon_sha256":"760f0c538aed3a274628d13461cb43e9d9e50823bfb0a75d30eb1a4fb3a35554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.420148Z","signature_b64":"ZKFbI3cLDRSU293Z6E8xaxDVbaNQTvzYF6LPWNS/1rKZVc90fpVqkns6TRGZnNuRKDFEV88YrQEYK+ik6jnuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67263d83202bbb799f6267bcddba28da87daa7dd181ef2735cd128d7590b7faf","last_reissued_at":"2026-05-18T02:56:04.419717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.419717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien Bartoli (ISIT), CTU/FEE), Didier Henrion (LAAS, Florian Bugarin (ICA), Jean-Bernard Lasserre (LAAS), Jean-Jos\\'e Orteu (ICA), LAAS), Thierry Sentenac (ICA","submitted_at":"2014-03-19T14:13:04Z","abstract_excerpt":"The fundamental matrix can be estimated from point matches. The current gold standard is to bootstrap the eight-point algorithm and two-view projective bundle adjustment. The eight-point algorithm first computes a simple linear least squares solution by minimizing an algebraic cost and then projects the result to the closest rank-deficient matrix. We propose a single-step method that solves both steps of the eight-point algorithm. Using recent results from polynomial global optimization, our method finds the rank-deficient matrix that exactly minimizes the algebraic cost. In this special case,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4806","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":"1403.4806","created_at":"2026-05-18T02:56:04.419781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4806v1","created_at":"2026-05-18T02:56:04.419781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4806","created_at":"2026-05-18T02:56:04.419781+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4TD3AZAFO5X","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4TD3AZAFO5XTH3C","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4TD3AZA","created_at":"2026-05-18T12:28:38.356838+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/M4TD3AZAFO5XTH3CM66N3ORI3K","json":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K.json","graph_json":"https://pith.science/api/pith-number/M4TD3AZAFO5XTH3CM66N3ORI3K/graph.json","events_json":"https://pith.science/api/pith-number/M4TD3AZAFO5XTH3CM66N3ORI3K/events.json","paper":"https://pith.science/paper/M4TD3AZA"},"agent_actions":{"view_html":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K","download_json":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K.json","view_paper":"https://pith.science/paper/M4TD3AZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4806&json=true","fetch_graph":"https://pith.science/api/pith-number/M4TD3AZAFO5XTH3CM66N3ORI3K/graph.json","fetch_events":"https://pith.science/api/pith-number/M4TD3AZAFO5XTH3CM66N3ORI3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/action/storage_attestation","attest_author":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/action/author_attestation","sign_citation":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/action/citation_signature","submit_replication":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/action/replication_record"}},"created_at":"2026-05-18T02:56:04.419781+00:00","updated_at":"2026-05-18T02:56:04.419781+00:00"}