{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QB2QMN7B7EAA4PGH23XT6BMLZF","short_pith_number":"pith:QB2QMN7B","schema_version":"1.0","canonical_sha256":"80750637e1f9000e3cc7d6ef3f058bc9508ca557a378784c6a5488773f348eb4","source":{"kind":"arxiv","id":"1705.09437","version":1},"attestation_state":"computed","paper":{"title":"Effective Sampling: Fast Segmentation Using Robust Geometric Model Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alireza Bab-Hadiashar, Alireza Sadri, Reza Hoseinnezhad, Ruwan Tennakoon","submitted_at":"2017-05-26T05:39:07Z","abstract_excerpt":"Identifying the underlying models in a set of data points contaminated by noise and outliers, leads to a highly complex multi-model fitting problem. This problem can be posed as a clustering problem by the projection of higher order affinities between data points into a graph, which can then be clustered using spectral clustering. Calculating all possible higher order affinities is computationally expensive. Hence in most cases only a subset is used. In this paper, we propose an effective sampling method to obtain a highly accurate approximation of the full graph required to solve multi-struct"},"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":"1705.09437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T05:39:07Z","cross_cats_sorted":[],"title_canon_sha256":"1697cfec240324817ba6e0cb90353b5275331be6cc41d14fa3b49ce026a365b0","abstract_canon_sha256":"e2542ab03635e4322fa87af39661b9b6fef6ceaab56f62728f0cad966c769451"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:31.202828Z","signature_b64":"AUX3AVtfowBYLVRiSYlwxrPUUIwhoRGJi7XvWeLNhDIPnxFjiGZD8Kh0f6LMleW6WmqG5AWDcEPAdJ/f5WT2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80750637e1f9000e3cc7d6ef3f058bc9508ca557a378784c6a5488773f348eb4","last_reissued_at":"2026-05-18T00:09:31.202136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:31.202136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Sampling: Fast Segmentation Using Robust Geometric Model Fitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alireza Bab-Hadiashar, Alireza Sadri, Reza Hoseinnezhad, Ruwan Tennakoon","submitted_at":"2017-05-26T05:39:07Z","abstract_excerpt":"Identifying the underlying models in a set of data points contaminated by noise and outliers, leads to a highly complex multi-model fitting problem. This problem can be posed as a clustering problem by the projection of higher order affinities between data points into a graph, which can then be clustered using spectral clustering. Calculating all possible higher order affinities is computationally expensive. Hence in most cases only a subset is used. In this paper, we propose an effective sampling method to obtain a highly accurate approximation of the full graph required to solve multi-struct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09437","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":"1705.09437","created_at":"2026-05-18T00:09:31.202240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09437v1","created_at":"2026-05-18T00:09:31.202240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09437","created_at":"2026-05-18T00:09:31.202240+00:00"},{"alias_kind":"pith_short_12","alias_value":"QB2QMN7B7EAA","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QB2QMN7B7EAA4PGH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QB2QMN7B","created_at":"2026-05-18T12:31:37.085036+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/QB2QMN7B7EAA4PGH23XT6BMLZF","json":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF.json","graph_json":"https://pith.science/api/pith-number/QB2QMN7B7EAA4PGH23XT6BMLZF/graph.json","events_json":"https://pith.science/api/pith-number/QB2QMN7B7EAA4PGH23XT6BMLZF/events.json","paper":"https://pith.science/paper/QB2QMN7B"},"agent_actions":{"view_html":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF","download_json":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF.json","view_paper":"https://pith.science/paper/QB2QMN7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09437&json=true","fetch_graph":"https://pith.science/api/pith-number/QB2QMN7B7EAA4PGH23XT6BMLZF/graph.json","fetch_events":"https://pith.science/api/pith-number/QB2QMN7B7EAA4PGH23XT6BMLZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/action/storage_attestation","attest_author":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/action/author_attestation","sign_citation":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/action/citation_signature","submit_replication":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/action/replication_record"}},"created_at":"2026-05-18T00:09:31.202240+00:00","updated_at":"2026-05-18T00:09:31.202240+00:00"}