{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7BL42FH6JQAHAEZ6LHRTZRCNCG","short_pith_number":"pith:7BL42FH6","canonical_record":{"source":{"id":"1410.6126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-22T18:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"d0f639390529e2f804bcf8278477a1cba5ea91e92e3bca2bfd144e167f2070f2","abstract_canon_sha256":"a7611d9ce25966962234a74e6857e301bfaa0a5f422a234add99ac60ff75a309"},"schema_version":"1.0"},"canonical_sha256":"f857cd14fe4c0070133e59e33cc44d118255c50237fe0481fe818adccdaebce8","source":{"kind":"arxiv","id":"1410.6126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6126","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6126v1","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6126","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"7BL42FH6JQAH","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7BL42FH6JQAHAEZ6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7BL42FH6","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7BL42FH6JQAHAEZ6LHRTZRCNCG","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-22T18:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"d0f639390529e2f804bcf8278477a1cba5ea91e92e3bca2bfd144e167f2070f2","abstract_canon_sha256":"a7611d9ce25966962234a74e6857e301bfaa0a5f422a234add99ac60ff75a309"},"schema_version":"1.0"},"canonical_sha256":"f857cd14fe4c0070133e59e33cc44d118255c50237fe0481fe818adccdaebce8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.553938Z","signature_b64":"aCPnklqpq5EB/cQ2+QfaAzrOv8oVVuJVQPWQnZK3WoP57+aNBSRJRU8kjXwcnQ2sJEq38uOOdON0U9/Lql8fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f857cd14fe4c0070133e59e33cc44d118255c50237fe0481fe818adccdaebce8","last_reissued_at":"2026-05-18T02:39:32.553361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.553361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6126","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-18T02:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwtk9w1GRwEhk78fHdAIGuS/JIwgS7+uQZnsT370OGCe39g6K+PmuVKFttdBqve8M6Sgg5swn5euIMLnEuThAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:31:08.148534Z"},"content_sha256":"f8f5bde8bf8a612863e8eea71d432b31bb4582afed5bf1dfc6ca714d9daeef7b","schema_version":"1.0","event_id":"sha256:f8f5bde8bf8a612863e8eea71d432b31bb4582afed5bf1dfc6ca714d9daeef7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7BL42FH6JQAHAEZ6LHRTZRCNCG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motion Estimation via Robust Decomposition with Constrained Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"German Ros, Jose Alvarez, Julio Guerrero","submitted_at":"2014-10-22T18:15:27Z","abstract_excerpt":"In this work, we address the problem of outlier detection for robust motion estimation by using modern sparse-low-rank decompositions, i.e., Robust PCA-like methods, to impose global rank constraints. Robust decompositions have shown to be good at splitting a corrupted matrix into an uncorrupted low-rank matrix and a sparse matrix, containing outliers. However, this process only works when matrices have relatively low rank with respect to their ambient space, a property not met in motion estimation problems. As a solution, we propose to exploit the partial information present in the decomposit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6126","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-18T02:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WR6fPpGmMXsiWnp2eBxs2FGTrhA7OtHOuH8wvJgGRMG/HBGuvVM7/i9Ilz5Kgzr8p7Tj09AWtoum2sKOnCj6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:31:08.148882Z"},"content_sha256":"039e554aa46ecb690925a256aef90fffcf8c07735bc22925105decc4daf27bbd","schema_version":"1.0","event_id":"sha256:039e554aa46ecb690925a256aef90fffcf8c07735bc22925105decc4daf27bbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/bundle.json","state_url":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/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-30T14:31:08Z","links":{"resolver":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG","bundle":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/bundle.json","state":"https://pith.science/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BL42FH6JQAHAEZ6LHRTZRCNCG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7BL42FH6JQAHAEZ6LHRTZRCNCG","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":"a7611d9ce25966962234a74e6857e301bfaa0a5f422a234add99ac60ff75a309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-22T18:15:27Z","title_canon_sha256":"d0f639390529e2f804bcf8278477a1cba5ea91e92e3bca2bfd144e167f2070f2"},"schema_version":"1.0","source":{"id":"1410.6126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6126","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6126v1","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6126","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"7BL42FH6JQAH","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7BL42FH6JQAHAEZ6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7BL42FH6","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:039e554aa46ecb690925a256aef90fffcf8c07735bc22925105decc4daf27bbd","target":"graph","created_at":"2026-05-18T02:39:32Z","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 address the problem of outlier detection for robust motion estimation by using modern sparse-low-rank decompositions, i.e., Robust PCA-like methods, to impose global rank constraints. Robust decompositions have shown to be good at splitting a corrupted matrix into an uncorrupted low-rank matrix and a sparse matrix, containing outliers. However, this process only works when matrices have relatively low rank with respect to their ambient space, a property not met in motion estimation problems. As a solution, we propose to exploit the partial information present in the decomposit","authors_text":"German Ros, Jose Alvarez, Julio Guerrero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-22T18:15:27Z","title":"Motion Estimation via Robust Decomposition with Constrained Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6126","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:f8f5bde8bf8a612863e8eea71d432b31bb4582afed5bf1dfc6ca714d9daeef7b","target":"record","created_at":"2026-05-18T02:39:32Z","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":"a7611d9ce25966962234a74e6857e301bfaa0a5f422a234add99ac60ff75a309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-22T18:15:27Z","title_canon_sha256":"d0f639390529e2f804bcf8278477a1cba5ea91e92e3bca2bfd144e167f2070f2"},"schema_version":"1.0","source":{"id":"1410.6126","kind":"arxiv","version":1}},"canonical_sha256":"f857cd14fe4c0070133e59e33cc44d118255c50237fe0481fe818adccdaebce8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f857cd14fe4c0070133e59e33cc44d118255c50237fe0481fe818adccdaebce8","first_computed_at":"2026-05-18T02:39:32.553361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:32.553361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCPnklqpq5EB/cQ2+QfaAzrOv8oVVuJVQPWQnZK3WoP57+aNBSRJRU8kjXwcnQ2sJEq38uOOdON0U9/Lql8fAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:32.553938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8f5bde8bf8a612863e8eea71d432b31bb4582afed5bf1dfc6ca714d9daeef7b","sha256:039e554aa46ecb690925a256aef90fffcf8c07735bc22925105decc4daf27bbd"],"state_sha256":"90128e58053bb78405dae05fc898ae7712daefa98b690e3341ce5af19d8298f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LRgDa+57w+zkMmGjNbnRJcVOqNQQVljsKxN2dJBAN1DWJD9tSwJeB0VzXx0RjKVgBJe3HZMiwXVG2EknZ8ECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:31:08.150973Z","bundle_sha256":"ced74fe4d816ddbcc1a2bfb5e2bfeca32dbecd1fe094dbcffe4105f506c8d825"}}