{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ACWY4RF3FRBORL4N4KQGXOKB7J","short_pith_number":"pith:ACWY4RF3","canonical_record":{"source":{"id":"1710.10003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-27T06:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"9876d43b112582927f146971a71f1e67087c761ce65bc4533e0b15faecb4c52c","abstract_canon_sha256":"6c48affa6c5653d71cab64e38b3015fcca9213f32581bba496188a9411e4e4d2"},"schema_version":"1.0"},"canonical_sha256":"00ad8e44bb2c42e8af8de2a06bb941fa62ea58fbb0c8cbf225785b9da6a25994","source":{"kind":"arxiv","id":"1710.10003","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10003","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10003v2","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10003","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"ACWY4RF3FRBO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACWY4RF3FRBORL4N","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACWY4RF3","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ACWY4RF3FRBORL4N4KQGXOKB7J","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-27T06:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"9876d43b112582927f146971a71f1e67087c761ce65bc4533e0b15faecb4c52c","abstract_canon_sha256":"6c48affa6c5653d71cab64e38b3015fcca9213f32581bba496188a9411e4e4d2"},"schema_version":"1.0"},"canonical_sha256":"00ad8e44bb2c42e8af8de2a06bb941fa62ea58fbb0c8cbf225785b9da6a25994","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:36.062614Z","signature_b64":"bAqHmKcI5aMWn8EMJQFfYL0v60UOrhI0QmdG/WJmqCJnfOSFWhiEbBE3IbOYe6KzKEzpyOyomFPu5iW+2YM3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00ad8e44bb2c42e8af8de2a06bb941fa62ea58fbb0c8cbf225785b9da6a25994","last_reissued_at":"2026-05-18T00:02:36.061990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:36.061990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10003","source_version":2,"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-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgEOmnnqjY+R8HPOjaHkQBqOZj+reqZkL4fQFVOa9x1Ty/XTJjDKAhVJDmyUl5JCN1l+oBQ/pkxuAwCgV9k3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:52:55.221174Z"},"content_sha256":"4e9486cd3e7052ab726ee9c6172f4f0e836a83b5a905b328273c8c825389ad93","schema_version":"1.0","event_id":"sha256:4e9486cd3e7052ab726ee9c6172f4f0e836a83b5a905b328273c8c825389ad93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ACWY4RF3FRBORL4N4KQGXOKB7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Approximate Methods for Maximum Consensus Robust Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anders Eriksson, David Suter, Huu Le, Tat-Jun Chin, Thanh-Toan Do","submitted_at":"2017-10-27T06:40:26Z","abstract_excerpt":"Maximum consensus estimation plays a critically important role in robust fitting problems in computer vision. Currently, the most prevalent algorithms for consensus maximization draw from the class of randomized hypothesize-and-verify algorithms, which are cheap but can usually deliver only rough approximate solutions. On the other extreme, there are exact algorithms which are exhaustive search in nature and can be costly for practical-sized inputs. This paper fills the gap between the two extremes by proposing deterministic algorithms to approximately optimize the maximum consensus criterion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10003","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"},"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-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucTskS40TewR5SRCGAmaXuQBIR1Zlkuiw2w9wDVpU5b6O/beFACtzUnzXQf1Yx/JyDtosA7EkQMXafRyx063BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:52:55.221536Z"},"content_sha256":"45afa19c40e449a473b6de9c188fc2abc1a9e241a8bcd2ce6db8f897eb44dc73","schema_version":"1.0","event_id":"sha256:45afa19c40e449a473b6de9c188fc2abc1a9e241a8bcd2ce6db8f897eb44dc73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACWY4RF3FRBORL4N4KQGXOKB7J/bundle.json","state_url":"https://pith.science/pith/ACWY4RF3FRBORL4N4KQGXOKB7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACWY4RF3FRBORL4N4KQGXOKB7J/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-28T06:52:55Z","links":{"resolver":"https://pith.science/pith/ACWY4RF3FRBORL4N4KQGXOKB7J","bundle":"https://pith.science/pith/ACWY4RF3FRBORL4N4KQGXOKB7J/bundle.json","state":"https://pith.science/pith/ACWY4RF3FRBORL4N4KQGXOKB7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACWY4RF3FRBORL4N4KQGXOKB7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ACWY4RF3FRBORL4N4KQGXOKB7J","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":"6c48affa6c5653d71cab64e38b3015fcca9213f32581bba496188a9411e4e4d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-27T06:40:26Z","title_canon_sha256":"9876d43b112582927f146971a71f1e67087c761ce65bc4533e0b15faecb4c52c"},"schema_version":"1.0","source":{"id":"1710.10003","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10003","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10003v2","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10003","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"ACWY4RF3FRBO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACWY4RF3FRBORL4N","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACWY4RF3","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:45afa19c40e449a473b6de9c188fc2abc1a9e241a8bcd2ce6db8f897eb44dc73","target":"graph","created_at":"2026-05-18T00:02:36Z","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":"Maximum consensus estimation plays a critically important role in robust fitting problems in computer vision. Currently, the most prevalent algorithms for consensus maximization draw from the class of randomized hypothesize-and-verify algorithms, which are cheap but can usually deliver only rough approximate solutions. On the other extreme, there are exact algorithms which are exhaustive search in nature and can be costly for practical-sized inputs. This paper fills the gap between the two extremes by proposing deterministic algorithms to approximately optimize the maximum consensus criterion.","authors_text":"Anders Eriksson, David Suter, Huu Le, Tat-Jun Chin, Thanh-Toan Do","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-27T06:40:26Z","title":"Deterministic Approximate Methods for Maximum Consensus Robust Fitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10003","kind":"arxiv","version":2},"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:4e9486cd3e7052ab726ee9c6172f4f0e836a83b5a905b328273c8c825389ad93","target":"record","created_at":"2026-05-18T00:02:36Z","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":"6c48affa6c5653d71cab64e38b3015fcca9213f32581bba496188a9411e4e4d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-27T06:40:26Z","title_canon_sha256":"9876d43b112582927f146971a71f1e67087c761ce65bc4533e0b15faecb4c52c"},"schema_version":"1.0","source":{"id":"1710.10003","kind":"arxiv","version":2}},"canonical_sha256":"00ad8e44bb2c42e8af8de2a06bb941fa62ea58fbb0c8cbf225785b9da6a25994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00ad8e44bb2c42e8af8de2a06bb941fa62ea58fbb0c8cbf225785b9da6a25994","first_computed_at":"2026-05-18T00:02:36.061990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:36.061990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bAqHmKcI5aMWn8EMJQFfYL0v60UOrhI0QmdG/WJmqCJnfOSFWhiEbBE3IbOYe6KzKEzpyOyomFPu5iW+2YM3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:36.062614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10003","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e9486cd3e7052ab726ee9c6172f4f0e836a83b5a905b328273c8c825389ad93","sha256:45afa19c40e449a473b6de9c188fc2abc1a9e241a8bcd2ce6db8f897eb44dc73"],"state_sha256":"d439d732da99b1d4e1dcebb3f0d0f92d050dbfa5c2b2ce01f6a4bab04655362a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUq3NgPRw3K5g1zF/YQsBAu9xwuhdF9NOyxa98MMsvqa/BjjF/YC5Wk+Rl72aJFKli/SM2hm90DGGrhAJ751CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:52:55.223588Z","bundle_sha256":"a30b6864308768fde26836e50deedd39c297fa3487550893a23f05b4dd43cc26"}}