{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6OILWZ6I3Q4BBYRCPV2XS2WIGO","short_pith_number":"pith:6OILWZ6I","canonical_record":{"source":{"id":"1105.6277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-05-31T13:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"79bacb239746ca6e1a112fe38ceba2bcd0540917bb77c036c882ad501aeb3e4b","abstract_canon_sha256":"e24d4fc8b6ad3824129d66216409fb3ca55c381c2760f7ec1a39ca80ec9e13c2"},"schema_version":"1.0"},"canonical_sha256":"f390bb67c8dc3810e2227d75796ac833b5e195e28167bcbd731e95fee774a461","source":{"kind":"arxiv","id":"1105.6277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6277","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6277v1","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6277","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"pith_short_12","alias_value":"6OILWZ6I3Q4B","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6OILWZ6I3Q4BBYRC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6OILWZ6I","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6OILWZ6I3Q4BBYRCPV2XS2WIGO","target":"record","payload":{"canonical_record":{"source":{"id":"1105.6277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-05-31T13:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"79bacb239746ca6e1a112fe38ceba2bcd0540917bb77c036c882ad501aeb3e4b","abstract_canon_sha256":"e24d4fc8b6ad3824129d66216409fb3ca55c381c2760f7ec1a39ca80ec9e13c2"},"schema_version":"1.0"},"canonical_sha256":"f390bb67c8dc3810e2227d75796ac833b5e195e28167bcbd731e95fee774a461","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:52.298748Z","signature_b64":"MzP1u8Sop58K57k7j4GAu+MS5OF2r/qVxnaAKw9K4gfl+rGelbDpPS1vyVEIgs4tijiNDRBRU1RyWdAIX+zZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f390bb67c8dc3810e2227d75796ac833b5e195e28167bcbd731e95fee774a461","last_reissued_at":"2026-05-18T04:20:52.298304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:52.298304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.6277","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-18T04:20:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r15zHQmlNFF1wCT6FVD4CWI6lnTSykM6TvqV8QQkXI7Xtgt7uBOYPAajdvXxjUAnPuYyrtW/AZ58DMpTfJgmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:22:45.417738Z"},"content_sha256":"defc469d8d20bfefcde92bd442674315bd8eccf9b86278a90d938f650988f75f","schema_version":"1.0","event_id":"sha256:defc469d8d20bfefcde92bd442674315bd8eccf9b86278a90d938f650988f75f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6OILWZ6I3Q4BBYRCPV2XS2WIGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Top-k List Comparison Approach to Robust Multi-Structure Model Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"David Suter, Hoi Sim Wong, Jin Yu, Tat-Jun Chin","submitted_at":"2011-05-31T13:45:46Z","abstract_excerpt":"Random hypothesis sampling lies at the core of many popular robust fitting techniques such as RANSAC. In this paper, we propose a novel hypothesis sampling scheme based on incremental computation of distances between partial rankings (top-$k$ lists) derived from residual sorting information. Our method simultaneously (1) guides the sampling such that hypotheses corresponding to all true structures can be quickly retrieved and (2) filters the hypotheses such that only a small but very promising subset remain. This permits the usage of simple agglomerative clustering on the surviving hypotheses "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6277","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-18T04:20:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGP2lPHbILCTI7AZ30h8VT+eS36fpfQjoMsUlqe7/QazKT4eSjYmQ/cumG3HF8y+ZrINiiOnaOzQmthxSWApCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:22:45.418413Z"},"content_sha256":"f2271dcaad6aaaed1f850a9aa6419b09dfb29863ab9b2ad00b117ce67a2ac88a","schema_version":"1.0","event_id":"sha256:f2271dcaad6aaaed1f850a9aa6419b09dfb29863ab9b2ad00b117ce67a2ac88a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OILWZ6I3Q4BBYRCPV2XS2WIGO/bundle.json","state_url":"https://pith.science/pith/6OILWZ6I3Q4BBYRCPV2XS2WIGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OILWZ6I3Q4BBYRCPV2XS2WIGO/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-27T12:22:45Z","links":{"resolver":"https://pith.science/pith/6OILWZ6I3Q4BBYRCPV2XS2WIGO","bundle":"https://pith.science/pith/6OILWZ6I3Q4BBYRCPV2XS2WIGO/bundle.json","state":"https://pith.science/pith/6OILWZ6I3Q4BBYRCPV2XS2WIGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OILWZ6I3Q4BBYRCPV2XS2WIGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6OILWZ6I3Q4BBYRCPV2XS2WIGO","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":"e24d4fc8b6ad3824129d66216409fb3ca55c381c2760f7ec1a39ca80ec9e13c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-05-31T13:45:46Z","title_canon_sha256":"79bacb239746ca6e1a112fe38ceba2bcd0540917bb77c036c882ad501aeb3e4b"},"schema_version":"1.0","source":{"id":"1105.6277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6277","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6277v1","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6277","created_at":"2026-05-18T04:20:52Z"},{"alias_kind":"pith_short_12","alias_value":"6OILWZ6I3Q4B","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6OILWZ6I3Q4BBYRC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6OILWZ6I","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:f2271dcaad6aaaed1f850a9aa6419b09dfb29863ab9b2ad00b117ce67a2ac88a","target":"graph","created_at":"2026-05-18T04:20:52Z","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":"Random hypothesis sampling lies at the core of many popular robust fitting techniques such as RANSAC. In this paper, we propose a novel hypothesis sampling scheme based on incremental computation of distances between partial rankings (top-$k$ lists) derived from residual sorting information. Our method simultaneously (1) guides the sampling such that hypotheses corresponding to all true structures can be quickly retrieved and (2) filters the hypotheses such that only a small but very promising subset remain. This permits the usage of simple agglomerative clustering on the surviving hypotheses ","authors_text":"David Suter, Hoi Sim Wong, Jin Yu, Tat-Jun Chin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-05-31T13:45:46Z","title":"Incremental Top-k List Comparison Approach to Robust Multi-Structure Model Fitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6277","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:defc469d8d20bfefcde92bd442674315bd8eccf9b86278a90d938f650988f75f","target":"record","created_at":"2026-05-18T04:20:52Z","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":"e24d4fc8b6ad3824129d66216409fb3ca55c381c2760f7ec1a39ca80ec9e13c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-05-31T13:45:46Z","title_canon_sha256":"79bacb239746ca6e1a112fe38ceba2bcd0540917bb77c036c882ad501aeb3e4b"},"schema_version":"1.0","source":{"id":"1105.6277","kind":"arxiv","version":1}},"canonical_sha256":"f390bb67c8dc3810e2227d75796ac833b5e195e28167bcbd731e95fee774a461","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f390bb67c8dc3810e2227d75796ac833b5e195e28167bcbd731e95fee774a461","first_computed_at":"2026-05-18T04:20:52.298304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:52.298304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MzP1u8Sop58K57k7j4GAu+MS5OF2r/qVxnaAKw9K4gfl+rGelbDpPS1vyVEIgs4tijiNDRBRU1RyWdAIX+zZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:52.298748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.6277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:defc469d8d20bfefcde92bd442674315bd8eccf9b86278a90d938f650988f75f","sha256:f2271dcaad6aaaed1f850a9aa6419b09dfb29863ab9b2ad00b117ce67a2ac88a"],"state_sha256":"706dfab1430afb55ca1e353d5f0d366e0cf247e745f66b38e1694c29d5ad3db4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4zApquC9fxnj+uNERi0kjHZTZ5XuzdbVNc+rB2VUaaQ2/NCnHis5Xigb6tqtqScSwzC4TyGXdLPjwSxI3BoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:22:45.421966Z","bundle_sha256":"67fdd8b6fe02fd1a48b5de6785b0ec285adf78089a3d0eaaa9ce634b1e3add15"}}