{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J3TC2QAFYDLTBSL4O5CTFEZDKG","short_pith_number":"pith:J3TC2QAF","canonical_record":{"source":{"id":"1802.06464","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T22:54:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7277eb267a4935c828430378f06de6f1a8ff6b3a1dcd6ea8dae13d88ab9518de","abstract_canon_sha256":"7f2f3ba0984d52d8ad4d2cc7ec8634595da5a413b5aefd4da8af83b289b72b03"},"schema_version":"1.0"},"canonical_sha256":"4ee62d4005c0d730c97c774532932351afc2cee03470ee2b987115b08ae1e911","source":{"kind":"arxiv","id":"1802.06464","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06464","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06464v3","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06464","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"J3TC2QAFYDLT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J3TC2QAFYDLTBSL4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J3TC2QAF","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J3TC2QAFYDLTBSL4O5CTFEZDKG","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06464","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T22:54:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7277eb267a4935c828430378f06de6f1a8ff6b3a1dcd6ea8dae13d88ab9518de","abstract_canon_sha256":"7f2f3ba0984d52d8ad4d2cc7ec8634595da5a413b5aefd4da8af83b289b72b03"},"schema_version":"1.0"},"canonical_sha256":"4ee62d4005c0d730c97c774532932351afc2cee03470ee2b987115b08ae1e911","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.356539Z","signature_b64":"kdupil0I9CT9K1N7ZCkZSyuzRI2pppV8SwlKnteu46V4WjNgW8s2URhhRe6pXVXmJXJB5owJ9/3kMZN4WAX9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee62d4005c0d730c97c774532932351afc2cee03470ee2b987115b08ae1e911","last_reissued_at":"2026-05-17T23:41:01.355578Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.355578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06464","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:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+PCy8bfTDZKp7xI0cUSklBw0NfKRJtPePB5jqJdgsUgQiznZ1fcLr89tttP4G+dghEq2I1O5KqgfeWo7bzhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:52:01.359038Z"},"content_sha256":"680f95d87e9175c1f736b355e644d488bbed098d16ff0346e26bfcab18ecbc72","schema_version":"1.0","event_id":"sha256:680f95d87e9175c1f736b355e644d488bbed098d16ff0346e26bfcab18ecbc72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J3TC2QAFYDLTBSL4O5CTFEZDKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Fitting in Computer Vision: Easy or Hard?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CV","authors_text":"Frank Neumann, Tat-Jun Chin, Zhipeng Cai","submitted_at":"2018-02-18T22:54:50Z","abstract_excerpt":"Robust model fitting plays a vital role in computer vision, and research into algorithms for robust fitting continues to be active. Arguably the most popular paradigm for robust fitting in computer vision is consensus maximisation, which strives to find the model parameters that maximise the number of inliers. Despite the significant developments in algorithms for consensus maximisation, there has been a lack of fundamental analysis of the problem in the computer vision literature. In particular, whether consensus maximisation is \"tractable\" remains a question that has not been rigorously deal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06464","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:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8XSFD62AsUVJ65THjOu5WZrqJaU9ZSrHmd1ZsXqmhClxOMsAoFZnGDge0c3O7HynUYMEO75vPjs0EqgOLIiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:52:01.359751Z"},"content_sha256":"b963055450329a3c789154f6196f2434b7609be995f9640f60e6d1d38153d321","schema_version":"1.0","event_id":"sha256:b963055450329a3c789154f6196f2434b7609be995f9640f60e6d1d38153d321"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3TC2QAFYDLTBSL4O5CTFEZDKG/bundle.json","state_url":"https://pith.science/pith/J3TC2QAFYDLTBSL4O5CTFEZDKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3TC2QAFYDLTBSL4O5CTFEZDKG/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-08T02:52:01Z","links":{"resolver":"https://pith.science/pith/J3TC2QAFYDLTBSL4O5CTFEZDKG","bundle":"https://pith.science/pith/J3TC2QAFYDLTBSL4O5CTFEZDKG/bundle.json","state":"https://pith.science/pith/J3TC2QAFYDLTBSL4O5CTFEZDKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3TC2QAFYDLTBSL4O5CTFEZDKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J3TC2QAFYDLTBSL4O5CTFEZDKG","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":"7f2f3ba0984d52d8ad4d2cc7ec8634595da5a413b5aefd4da8af83b289b72b03","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T22:54:50Z","title_canon_sha256":"7277eb267a4935c828430378f06de6f1a8ff6b3a1dcd6ea8dae13d88ab9518de"},"schema_version":"1.0","source":{"id":"1802.06464","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06464","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06464v3","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06464","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"J3TC2QAFYDLT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J3TC2QAFYDLTBSL4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J3TC2QAF","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:b963055450329a3c789154f6196f2434b7609be995f9640f60e6d1d38153d321","target":"graph","created_at":"2026-05-17T23:41:01Z","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":"Robust model fitting plays a vital role in computer vision, and research into algorithms for robust fitting continues to be active. Arguably the most popular paradigm for robust fitting in computer vision is consensus maximisation, which strives to find the model parameters that maximise the number of inliers. Despite the significant developments in algorithms for consensus maximisation, there has been a lack of fundamental analysis of the problem in the computer vision literature. In particular, whether consensus maximisation is \"tractable\" remains a question that has not been rigorously deal","authors_text":"Frank Neumann, Tat-Jun Chin, Zhipeng Cai","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T22:54:50Z","title":"Robust Fitting in Computer Vision: Easy or Hard?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06464","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:680f95d87e9175c1f736b355e644d488bbed098d16ff0346e26bfcab18ecbc72","target":"record","created_at":"2026-05-17T23:41:01Z","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":"7f2f3ba0984d52d8ad4d2cc7ec8634595da5a413b5aefd4da8af83b289b72b03","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T22:54:50Z","title_canon_sha256":"7277eb267a4935c828430378f06de6f1a8ff6b3a1dcd6ea8dae13d88ab9518de"},"schema_version":"1.0","source":{"id":"1802.06464","kind":"arxiv","version":3}},"canonical_sha256":"4ee62d4005c0d730c97c774532932351afc2cee03470ee2b987115b08ae1e911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ee62d4005c0d730c97c774532932351afc2cee03470ee2b987115b08ae1e911","first_computed_at":"2026-05-17T23:41:01.355578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:01.355578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kdupil0I9CT9K1N7ZCkZSyuzRI2pppV8SwlKnteu46V4WjNgW8s2URhhRe6pXVXmJXJB5owJ9/3kMZN4WAX9Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:01.356539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06464","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:680f95d87e9175c1f736b355e644d488bbed098d16ff0346e26bfcab18ecbc72","sha256:b963055450329a3c789154f6196f2434b7609be995f9640f60e6d1d38153d321"],"state_sha256":"974c3300b5feb2d1c3c900637a128d8136f97593321cfba0a246ce89ff63f2d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbOCqUSoOu3a36ZGesWzF+DtKJ0n9zykBuHTyuWse3K1wgFj2razO9aasfA+hKoeRdpBe0l5qqen/QlsFM3VBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:52:01.363187Z","bundle_sha256":"7ac66229067a9e2b331234ce58dbd0447253514bd88aa71837220811be508621"}}