{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IGORRET5EVGLSMRGA7OZZV6ISD","short_pith_number":"pith:IGORRET5","schema_version":"1.0","canonical_sha256":"419d18927d254cb9322607dd9cd7c890dd854132b38bc7655703507f46aae947","source":{"kind":"arxiv","id":"1603.07807","version":1},"attestation_state":"computed","paper":{"title":"Mode-Seeking on Hypergraphs for Robust Geometric Model Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"David Suter, Guobao Xiao, Hanzi Wang, Yan Yan","submitted_at":"2016-03-25T02:29:40Z","abstract_excerpt":"In this paper, we propose a novel geometric model fitting method, called Mode-Seeking on Hypergraphs (MSH),to deal with multi-structure data even in the presence of severe outliers. The proposed method formulates geometric model fitting as a mode seeking problem on a hypergraph in which vertices represent model hypotheses and hyperedges denote data points. MSH intuitively detects model instances by a simple and effective mode seeking algorithm. In addition to the mode seeking algorithm, MSH includes a similarity measure between vertices on the hypergraph and a weight-aware sampling technique. "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.07807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-25T02:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"e03ec4cec17b2dec585fa7f0862d08224852560121a157e85c466cb211d91213","abstract_canon_sha256":"8a45b16d772d9ab4dff99c1dd74afb30f3d4f881b048de118f6472458f6364ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.521019Z","signature_b64":"2bCluu+SDM4f8bGPMBof3dB7KshyDhfB6VtdrexgpjJ0dS1zz12i+K1M0sHnPK6Rj+O227LvJHfz3ISPPvePDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"419d18927d254cb9322607dd9cd7c890dd854132b38bc7655703507f46aae947","last_reissued_at":"2026-05-18T00:58:09.520430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.520430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mode-Seeking on Hypergraphs for Robust Geometric Model Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"David Suter, Guobao Xiao, Hanzi Wang, Yan Yan","submitted_at":"2016-03-25T02:29:40Z","abstract_excerpt":"In this paper, we propose a novel geometric model fitting method, called Mode-Seeking on Hypergraphs (MSH),to deal with multi-structure data even in the presence of severe outliers. The proposed method formulates geometric model fitting as a mode seeking problem on a hypergraph in which vertices represent model hypotheses and hyperedges denote data points. MSH intuitively detects model instances by a simple and effective mode seeking algorithm. In addition to the mode seeking algorithm, MSH includes a similarity measure between vertices on the hypergraph and a weight-aware sampling technique. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07807","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.07807","created_at":"2026-05-18T00:58:09.520528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07807v1","created_at":"2026-05-18T00:58:09.520528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07807","created_at":"2026-05-18T00:58:09.520528+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGORRET5EVGL","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGORRET5EVGLSMRG","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGORRET5","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD","json":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD.json","graph_json":"https://pith.science/api/pith-number/IGORRET5EVGLSMRGA7OZZV6ISD/graph.json","events_json":"https://pith.science/api/pith-number/IGORRET5EVGLSMRGA7OZZV6ISD/events.json","paper":"https://pith.science/paper/IGORRET5"},"agent_actions":{"view_html":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD","download_json":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD.json","view_paper":"https://pith.science/paper/IGORRET5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07807&json=true","fetch_graph":"https://pith.science/api/pith-number/IGORRET5EVGLSMRGA7OZZV6ISD/graph.json","fetch_events":"https://pith.science/api/pith-number/IGORRET5EVGLSMRGA7OZZV6ISD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD/action/storage_attestation","attest_author":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD/action/author_attestation","sign_citation":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD/action/citation_signature","submit_replication":"https://pith.science/pith/IGORRET5EVGLSMRGA7OZZV6ISD/action/replication_record"}},"created_at":"2026-05-18T00:58:09.520528+00:00","updated_at":"2026-05-18T00:58:09.520528+00:00"}