{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QB2QMN7B7EAA4PGH23XT6BMLZF","short_pith_number":"pith:QB2QMN7B","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"},"canonical_sha256":"80750637e1f9000e3cc7d6ef3f058bc9508ca557a378784c6a5488773f348eb4","source":{"kind":"arxiv","id":"1705.09437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09437","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09437v1","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09437","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"QB2QMN7B7EAA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QB2QMN7B7EAA4PGH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QB2QMN7B","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QB2QMN7B7EAA4PGH23XT6BMLZF","target":"record","payload":{"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"},"canonical_sha256":"80750637e1f9000e3cc7d6ef3f058bc9508ca557a378784c6a5488773f348eb4","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"},"source_kind":"arxiv","source_id":"1705.09437","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-18T00:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Smr4n5tKZy6gGo4iLUjAOD+DzLR+FfUhHY1puWz+63UCRA7ZgkYZaJmgtvJ5t6SCoXXOkBcagNiJW8oY+mz4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:02:01.836162Z"},"content_sha256":"6031f073d22af046050489cf1cf327f699055aaa523966687781865a494d0f81","schema_version":"1.0","event_id":"sha256:6031f073d22af046050489cf1cf327f699055aaa523966687781865a494d0f81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QB2QMN7B7EAA4PGH23XT6BMLZF","target":"graph","payload":{"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"},"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:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"McT9CjF/YmA2eftzAQ5mMZ2pGSUpzK5n5+y7/qycsRgLqUX5h0m1WyZZnG5940Xs21fer9UGPSV8/RrgQCQ8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:02:01.836816Z"},"content_sha256":"d738e176cf06cff21f9fbd4d3b33b94f8bbb800dee0c1f3031124d125bc82365","schema_version":"1.0","event_id":"sha256:d738e176cf06cff21f9fbd4d3b33b94f8bbb800dee0c1f3031124d125bc82365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/bundle.json","state_url":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/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-28T03:02:01Z","links":{"resolver":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF","bundle":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/bundle.json","state":"https://pith.science/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QB2QMN7B7EAA4PGH23XT6BMLZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QB2QMN7B7EAA4PGH23XT6BMLZF","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":"e2542ab03635e4322fa87af39661b9b6fef6ceaab56f62728f0cad966c769451","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T05:39:07Z","title_canon_sha256":"1697cfec240324817ba6e0cb90353b5275331be6cc41d14fa3b49ce026a365b0"},"schema_version":"1.0","source":{"id":"1705.09437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09437","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09437v1","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09437","created_at":"2026-05-18T00:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"QB2QMN7B7EAA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QB2QMN7B7EAA4PGH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QB2QMN7B","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d738e176cf06cff21f9fbd4d3b33b94f8bbb800dee0c1f3031124d125bc82365","target":"graph","created_at":"2026-05-18T00:09:31Z","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":"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","authors_text":"Alireza Bab-Hadiashar, Alireza Sadri, Reza Hoseinnezhad, Ruwan Tennakoon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T05:39:07Z","title":"Effective Sampling: Fast Segmentation Using Robust Geometric Model Fitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09437","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:6031f073d22af046050489cf1cf327f699055aaa523966687781865a494d0f81","target":"record","created_at":"2026-05-18T00:09:31Z","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":"e2542ab03635e4322fa87af39661b9b6fef6ceaab56f62728f0cad966c769451","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T05:39:07Z","title_canon_sha256":"1697cfec240324817ba6e0cb90353b5275331be6cc41d14fa3b49ce026a365b0"},"schema_version":"1.0","source":{"id":"1705.09437","kind":"arxiv","version":1}},"canonical_sha256":"80750637e1f9000e3cc7d6ef3f058bc9508ca557a378784c6a5488773f348eb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80750637e1f9000e3cc7d6ef3f058bc9508ca557a378784c6a5488773f348eb4","first_computed_at":"2026-05-18T00:09:31.202136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:31.202136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AUX3AVtfowBYLVRiSYlwxrPUUIwhoRGJi7XvWeLNhDIPnxFjiGZD8Kh0f6LMleW6WmqG5AWDcEPAdJ/f5WT2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:31.202828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6031f073d22af046050489cf1cf327f699055aaa523966687781865a494d0f81","sha256:d738e176cf06cff21f9fbd4d3b33b94f8bbb800dee0c1f3031124d125bc82365"],"state_sha256":"2b2c8a7a4ac433f3404ee38e080c453378a59dac0edd131cfb6c0a9985e0b8ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QkRL0XlULNHjtm/jr/tXHP9sW3BnydH9av1rXrcGIxEBhVLalrjgbuCWFdeZb/iaxEtOaKkS9BjjNSGsQJoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:02:01.840089Z","bundle_sha256":"2a75b10ae59edb49303c26dd154fa10178fc9aab6bada6f135aef747fc6bf025"}}