{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CLDEGLOM7LPMKTDA7LEM3D7ANY","short_pith_number":"pith:CLDEGLOM","canonical_record":{"source":{"id":"1610.05712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-18T17:20:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"07971a4f5053cc65518dc5608c58472dc3322aebe2fddac7f739c504b75eef1e","abstract_canon_sha256":"6a239b4b8142e9564d90d9a58d8c3898c714adc18df37eb1b01a955f80849e42"},"schema_version":"1.0"},"canonical_sha256":"12c6432dccfadec54c60fac8cd8fe06e130b4e0593066f3ca7acd0cd9d6318df","source":{"kind":"arxiv","id":"1610.05712","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05712","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05712v2","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05712","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"CLDEGLOM7LPM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CLDEGLOM7LPMKTDA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CLDEGLOM","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CLDEGLOM7LPMKTDA7LEM3D7ANY","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-18T17:20:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"07971a4f5053cc65518dc5608c58472dc3322aebe2fddac7f739c504b75eef1e","abstract_canon_sha256":"6a239b4b8142e9564d90d9a58d8c3898c714adc18df37eb1b01a955f80849e42"},"schema_version":"1.0"},"canonical_sha256":"12c6432dccfadec54c60fac8cd8fe06e130b4e0593066f3ca7acd0cd9d6318df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.180982Z","signature_b64":"8h6fahLdl0nHeGNCMt/S6vLjRTVxm/mVJr/JFaM/2dIpIjn6yl6EedPhqAqtgwAm1A3uCy19TSMg8GwcegnzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12c6432dccfadec54c60fac8cd8fe06e130b4e0593066f3ca7acd0cd9d6318df","last_reissued_at":"2026-05-18T00:59:34.180280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.180280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05712","source_version":2,"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:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TN9rTL8Yxo1lCQ3X2ZQciLHA/eS21dR2xG3zunMbTqKcc4RTg12kwK/DLu1pmD4UKI47Fha34ij74fjozRgvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T23:21:24.713182Z"},"content_sha256":"65e56c7aef2068a93a1f2291d6311e387557919255282451f1402d4caf0209a0","schema_version":"1.0","event_id":"sha256:65e56c7aef2068a93a1f2291d6311e387557919255282451f1402d4caf0209a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CLDEGLOM7LPMKTDA7LEM3D7ANY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast L1-NMF for Multiple Parametric Model Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Guillermo Sapiro, Mariano Tepper","submitted_at":"2016-10-18T17:20:38Z","abstract_excerpt":"In this work we introduce a comprehensive algorithmic pipeline for multiple parametric model estimation. The proposed approach analyzes the information produced by a random sampling algorithm (e.g., RANSAC) from a machine learning/optimization perspective, using a \\textit{parameterless} biclustering algorithm based on L1 nonnegative matrix factorization (L1-NMF). The proposed framework exploits consistent patterns that naturally arise during the RANSAC execution, while explicitly avoiding spurious inconsistencies. Contrarily to the main trends in the literature, the proposed technique does not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05712","kind":"arxiv","version":2},"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:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQoGf5jOZAwoHIwCG7a7+f/GqPhIgAd2L6xcZD+YUZmWjuCGx/jEGe/VJvhCgzaT63EAImuVMKaGwawgW7JpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T23:21:24.713842Z"},"content_sha256":"2e27270a7dfbdc9fae1c7daed39f162278f3a3a87077da2dd32c2a9efd34b660","schema_version":"1.0","event_id":"sha256:2e27270a7dfbdc9fae1c7daed39f162278f3a3a87077da2dd32c2a9efd34b660"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLDEGLOM7LPMKTDA7LEM3D7ANY/bundle.json","state_url":"https://pith.science/pith/CLDEGLOM7LPMKTDA7LEM3D7ANY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLDEGLOM7LPMKTDA7LEM3D7ANY/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-07-03T23:21:24Z","links":{"resolver":"https://pith.science/pith/CLDEGLOM7LPMKTDA7LEM3D7ANY","bundle":"https://pith.science/pith/CLDEGLOM7LPMKTDA7LEM3D7ANY/bundle.json","state":"https://pith.science/pith/CLDEGLOM7LPMKTDA7LEM3D7ANY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLDEGLOM7LPMKTDA7LEM3D7ANY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CLDEGLOM7LPMKTDA7LEM3D7ANY","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":"6a239b4b8142e9564d90d9a58d8c3898c714adc18df37eb1b01a955f80849e42","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-18T17:20:38Z","title_canon_sha256":"07971a4f5053cc65518dc5608c58472dc3322aebe2fddac7f739c504b75eef1e"},"schema_version":"1.0","source":{"id":"1610.05712","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05712","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05712v2","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05712","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"CLDEGLOM7LPM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CLDEGLOM7LPMKTDA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CLDEGLOM","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:2e27270a7dfbdc9fae1c7daed39f162278f3a3a87077da2dd32c2a9efd34b660","target":"graph","created_at":"2026-05-18T00:59:34Z","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":"In this work we introduce a comprehensive algorithmic pipeline for multiple parametric model estimation. The proposed approach analyzes the information produced by a random sampling algorithm (e.g., RANSAC) from a machine learning/optimization perspective, using a \\textit{parameterless} biclustering algorithm based on L1 nonnegative matrix factorization (L1-NMF). The proposed framework exploits consistent patterns that naturally arise during the RANSAC execution, while explicitly avoiding spurious inconsistencies. Contrarily to the main trends in the literature, the proposed technique does not","authors_text":"Guillermo Sapiro, Mariano Tepper","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-18T17:20:38Z","title":"Fast L1-NMF for Multiple Parametric Model Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05712","kind":"arxiv","version":2},"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:65e56c7aef2068a93a1f2291d6311e387557919255282451f1402d4caf0209a0","target":"record","created_at":"2026-05-18T00:59:34Z","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":"6a239b4b8142e9564d90d9a58d8c3898c714adc18df37eb1b01a955f80849e42","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-18T17:20:38Z","title_canon_sha256":"07971a4f5053cc65518dc5608c58472dc3322aebe2fddac7f739c504b75eef1e"},"schema_version":"1.0","source":{"id":"1610.05712","kind":"arxiv","version":2}},"canonical_sha256":"12c6432dccfadec54c60fac8cd8fe06e130b4e0593066f3ca7acd0cd9d6318df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12c6432dccfadec54c60fac8cd8fe06e130b4e0593066f3ca7acd0cd9d6318df","first_computed_at":"2026-05-18T00:59:34.180280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:34.180280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8h6fahLdl0nHeGNCMt/S6vLjRTVxm/mVJr/JFaM/2dIpIjn6yl6EedPhqAqtgwAm1A3uCy19TSMg8GwcegnzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:34.180982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05712","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65e56c7aef2068a93a1f2291d6311e387557919255282451f1402d4caf0209a0","sha256:2e27270a7dfbdc9fae1c7daed39f162278f3a3a87077da2dd32c2a9efd34b660"],"state_sha256":"58535c4b084c67d9aba9e1cfa8399c52c4634b50e95b6fa7936cc48e7a07635f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YdfEi4JORSgdPi3fL7wkW4Pxf8Ea0Znp+EIc66W5qTsax7gDdCtLi7NONedpd6AmtuoW4f57E/p1txyF9+IJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T23:21:24.718062Z","bundle_sha256":"66380b69b190786f6436c6738ab36f6052d9a75a90454565836cdd4211422c9f"}}