{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M4TD3AZAFO5XTH3CM66N3ORI3K","short_pith_number":"pith:M4TD3AZA","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"},"canonical_sha256":"67263d83202bbb799f6267bcddba28da87daa7dd181ef2735cd128d7590b7faf","source":{"kind":"arxiv","id":"1403.4806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4806","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4806v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4806","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"M4TD3AZAFO5X","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4TD3AZAFO5XTH3C","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4TD3AZA","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M4TD3AZAFO5XTH3CM66N3ORI3K","target":"record","payload":{"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"},"canonical_sha256":"67263d83202bbb799f6267bcddba28da87daa7dd181ef2735cd128d7590b7faf","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"},"source_kind":"arxiv","source_id":"1403.4806","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9B4QDMHoncQwjlV2n5OdV44q+XgI7hpdWkZobYOxzaPkq/RcJDF2gk8/lblPFg8pHu5ox8a3I9Eb69rQvGuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:16:01.908304Z"},"content_sha256":"9766b8ae17a78ac97f286993fdc573522b10b9cd175127184f565ce8bf87f002","schema_version":"1.0","event_id":"sha256:9766b8ae17a78ac97f286993fdc573522b10b9cd175127184f565ce8bf87f002"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M4TD3AZAFO5XTH3CM66N3ORI3K","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9g4tQCOFmVbjwttRSzwoxRwYNtqbMz7lDJr/nm4h/SBsqk3CQVPMJM8T4VnJXXbpmzCLuqA3lX6hFcmz+kVOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:16:01.908667Z"},"content_sha256":"a65885292b8d6feedb96aabc85afe3f224d7ed663e0f342932ec614865b60243","schema_version":"1.0","event_id":"sha256:a65885292b8d6feedb96aabc85afe3f224d7ed663e0f342932ec614865b60243"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/bundle.json","state_url":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T13:16:01Z","links":{"resolver":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K","bundle":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/bundle.json","state":"https://pith.science/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4TD3AZAFO5XTH3CM66N3ORI3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M4TD3AZAFO5XTH3CM66N3ORI3K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"760f0c538aed3a274628d13461cb43e9d9e50823bfb0a75d30eb1a4fb3a35554","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T14:13:04Z","title_canon_sha256":"7d26ed3b381e6f495a0a34ae272563e23de9f51e701a17de8fd2f51acdb98fa3"},"schema_version":"1.0","source":{"id":"1403.4806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4806","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4806v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4806","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"M4TD3AZAFO5X","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4TD3AZAFO5XTH3C","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4TD3AZA","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:a65885292b8d6feedb96aabc85afe3f224d7ed663e0f342932ec614865b60243","target":"graph","created_at":"2026-05-18T02:56:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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,","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T14:13:04Z","title":"Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4806","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9766b8ae17a78ac97f286993fdc573522b10b9cd175127184f565ce8bf87f002","target":"record","created_at":"2026-05-18T02:56:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"760f0c538aed3a274628d13461cb43e9d9e50823bfb0a75d30eb1a4fb3a35554","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T14:13:04Z","title_canon_sha256":"7d26ed3b381e6f495a0a34ae272563e23de9f51e701a17de8fd2f51acdb98fa3"},"schema_version":"1.0","source":{"id":"1403.4806","kind":"arxiv","version":1}},"canonical_sha256":"67263d83202bbb799f6267bcddba28da87daa7dd181ef2735cd128d7590b7faf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67263d83202bbb799f6267bcddba28da87daa7dd181ef2735cd128d7590b7faf","first_computed_at":"2026-05-18T02:56:04.419717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:04.419717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKFbI3cLDRSU293Z6E8xaxDVbaNQTvzYF6LPWNS/1rKZVc90fpVqkns6TRGZnNuRKDFEV88YrQEYK+ik6jnuCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:04.420148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9766b8ae17a78ac97f286993fdc573522b10b9cd175127184f565ce8bf87f002","sha256:a65885292b8d6feedb96aabc85afe3f224d7ed663e0f342932ec614865b60243"],"state_sha256":"60b7332ae479d47a9453a2e1639c0bbbb5996b195534ba8f4bbd3200fd79280f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwkM3/BXTWfIfKgekRXQm2ea8C//sgynOnwq1eDoaLWzM+5zmKijcCdaW9QpVl1kQ8xlcJYQutLWJelAkxWZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T13:16:01.910630Z","bundle_sha256":"49c012a3a61447dc29c304a7a49258ed505c7939ff14bfe806645ccbf46b76a2"}}