{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DUQOSNP3S7BYA6QOSJUPF3ZIOC","short_pith_number":"pith:DUQOSNP3","canonical_record":{"source":{"id":"1807.09436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-25T04:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"a4254370808f55129bdf72ac5c80331350a07b94e5336dc36afc72d1446ec78d","abstract_canon_sha256":"10114c4c4c1917645f9f97c31a052b8580bca64c58ccf71c467b87e1bd033bcc"},"schema_version":"1.0"},"canonical_sha256":"1d20e935fb97c3807a0e9268f2ef2870960a2e1a8550bc583aed1567ff4a3c14","source":{"kind":"arxiv","id":"1807.09436","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09436","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09436v3","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09436","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"DUQOSNP3S7BY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DUQOSNP3S7BYA6QO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DUQOSNP3","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DUQOSNP3S7BYA6QOSJUPF3ZIOC","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-25T04:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"a4254370808f55129bdf72ac5c80331350a07b94e5336dc36afc72d1446ec78d","abstract_canon_sha256":"10114c4c4c1917645f9f97c31a052b8580bca64c58ccf71c467b87e1bd033bcc"},"schema_version":"1.0"},"canonical_sha256":"1d20e935fb97c3807a0e9268f2ef2870960a2e1a8550bc583aed1567ff4a3c14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:22.479310Z","signature_b64":"yNB0iV0ulzAZiWzD+3K7V2cetrZFDOUwKwZaI28MRFEX0tM5V0Kg4pDAWD6/jsuSUBdc9tFL9si7RFP1jQTfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d20e935fb97c3807a0e9268f2ef2870960a2e1a8550bc583aed1567ff4a3c14","last_reissued_at":"2026-05-17T23:59:22.478953Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:22.478953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09436","source_version":3,"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-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfIYBzUGXRVQ05hPoNZPI0YZMtfCFSYT2MjwOqhm5jes7o3tXZSMGoqISLM1c1CWFJ6e9ppsnbCvY4rulk6NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:49:33.829405Z"},"content_sha256":"74ac5c4079757a98c8047b330af4d535896f0da95031ec474761594cdf6aecc3","schema_version":"1.0","event_id":"sha256:74ac5c4079757a98c8047b330af4d535896f0da95031ec474761594cdf6aecc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DUQOSNP3S7BYA6QOSJUPF3ZIOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic consensus maximization with biconvex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"David Suter, Huu Le, Tat-Jun Chin, Zhipeng Cai","submitted_at":"2018-07-25T04:54:57Z","abstract_excerpt":"Consensus maximization is one of the most widely used robust fitting paradigms in computer vision, and the development of algorithms for consensus maximization is an active research topic. In this paper, we propose an efficient deterministic optimization algorithm for consensus maximization. Given an initial solution, our method conducts a deterministic search that forcibly increases the consensus of the initial solution. We show how each iteration of the update can be formulated as an instance of biconvex programming, which we solve efficiently using a novel biconvex optimization algorithm. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09436","kind":"arxiv","version":3},"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-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzRKrGBCWn5FJ3uiiVnisNP/IORL9k+sXtmZLqV3x9tj7l0KUcIWE0l4MODsno0sELvOqTQCNEeJ0qiTeSidCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:49:33.830058Z"},"content_sha256":"a04b5f1a376ab3789d218415c0cbb5a2e967ffb8764490c94dfe8715bb3d1bae","schema_version":"1.0","event_id":"sha256:a04b5f1a376ab3789d218415c0cbb5a2e967ffb8764490c94dfe8715bb3d1bae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUQOSNP3S7BYA6QOSJUPF3ZIOC/bundle.json","state_url":"https://pith.science/pith/DUQOSNP3S7BYA6QOSJUPF3ZIOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUQOSNP3S7BYA6QOSJUPF3ZIOC/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-05-27T08:49:33Z","links":{"resolver":"https://pith.science/pith/DUQOSNP3S7BYA6QOSJUPF3ZIOC","bundle":"https://pith.science/pith/DUQOSNP3S7BYA6QOSJUPF3ZIOC/bundle.json","state":"https://pith.science/pith/DUQOSNP3S7BYA6QOSJUPF3ZIOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUQOSNP3S7BYA6QOSJUPF3ZIOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DUQOSNP3S7BYA6QOSJUPF3ZIOC","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":"10114c4c4c1917645f9f97c31a052b8580bca64c58ccf71c467b87e1bd033bcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-25T04:54:57Z","title_canon_sha256":"a4254370808f55129bdf72ac5c80331350a07b94e5336dc36afc72d1446ec78d"},"schema_version":"1.0","source":{"id":"1807.09436","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09436","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09436v3","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09436","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"DUQOSNP3S7BY","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DUQOSNP3S7BYA6QO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DUQOSNP3","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:a04b5f1a376ab3789d218415c0cbb5a2e967ffb8764490c94dfe8715bb3d1bae","target":"graph","created_at":"2026-05-17T23:59:22Z","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":"Consensus maximization is one of the most widely used robust fitting paradigms in computer vision, and the development of algorithms for consensus maximization is an active research topic. In this paper, we propose an efficient deterministic optimization algorithm for consensus maximization. Given an initial solution, our method conducts a deterministic search that forcibly increases the consensus of the initial solution. We show how each iteration of the update can be formulated as an instance of biconvex programming, which we solve efficiently using a novel biconvex optimization algorithm. I","authors_text":"David Suter, Huu Le, Tat-Jun Chin, Zhipeng Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-25T04:54:57Z","title":"Deterministic consensus maximization with biconvex programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09436","kind":"arxiv","version":3},"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:74ac5c4079757a98c8047b330af4d535896f0da95031ec474761594cdf6aecc3","target":"record","created_at":"2026-05-17T23:59:22Z","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":"10114c4c4c1917645f9f97c31a052b8580bca64c58ccf71c467b87e1bd033bcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-25T04:54:57Z","title_canon_sha256":"a4254370808f55129bdf72ac5c80331350a07b94e5336dc36afc72d1446ec78d"},"schema_version":"1.0","source":{"id":"1807.09436","kind":"arxiv","version":3}},"canonical_sha256":"1d20e935fb97c3807a0e9268f2ef2870960a2e1a8550bc583aed1567ff4a3c14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d20e935fb97c3807a0e9268f2ef2870960a2e1a8550bc583aed1567ff4a3c14","first_computed_at":"2026-05-17T23:59:22.478953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:22.478953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yNB0iV0ulzAZiWzD+3K7V2cetrZFDOUwKwZaI28MRFEX0tM5V0Kg4pDAWD6/jsuSUBdc9tFL9si7RFP1jQTfAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:22.479310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09436","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74ac5c4079757a98c8047b330af4d535896f0da95031ec474761594cdf6aecc3","sha256:a04b5f1a376ab3789d218415c0cbb5a2e967ffb8764490c94dfe8715bb3d1bae"],"state_sha256":"e550366742839bd466b5c14e3f1868b805d84b3a9d159f64431c0ccb69e05a79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lHBRI0YP+Ddp29LmF+0B5lLpCdn4DOqSHNGyfG++2cPA9viSttCk21ErvkVBHmo2N+MkWwcBjjbsGNAo7ubBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:49:33.833171Z","bundle_sha256":"490bec03720ca1d15e603287014e90d60756731d93c1fd0f83a29eb0c03e1e9f"}}