{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MBJOYAUAWDPMR4MF5NRRFPVPQA","short_pith_number":"pith:MBJOYAUA","canonical_record":{"source":{"id":"1707.00281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-02T11:55:09Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"2fe10aa79948fa946e51558730c274b78927f5855695296376a0ed444b386682","abstract_canon_sha256":"c33e87b7782663828bc5a75ef443f3a3773e319705410f0a67cc3f7903d722b5"},"schema_version":"1.0"},"canonical_sha256":"6052ec0280b0dec8f185eb6312beaf80039797b1b07ee10f8dc9db3c45b00aca","source":{"kind":"arxiv","id":"1707.00281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00281","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00281v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00281","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"MBJOYAUAWDPM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBJOYAUAWDPMR4MF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBJOYAUA","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MBJOYAUAWDPMR4MF5NRRFPVPQA","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-02T11:55:09Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"2fe10aa79948fa946e51558730c274b78927f5855695296376a0ed444b386682","abstract_canon_sha256":"c33e87b7782663828bc5a75ef443f3a3773e319705410f0a67cc3f7903d722b5"},"schema_version":"1.0"},"canonical_sha256":"6052ec0280b0dec8f185eb6312beaf80039797b1b07ee10f8dc9db3c45b00aca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:03.864411Z","signature_b64":"+Jx7ViLVJ5HXvQ1VxwBaEifSE1CxCy8wYXGgYCqab9wYg88HG7YTRvrC+9tO/pLkstDDGROvle9Tn5m8/VyvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6052ec0280b0dec8f185eb6312beaf80039797b1b07ee10f8dc9db3c45b00aca","last_reissued_at":"2026-05-18T00:41:03.863909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:03.863909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00281","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:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozoQQEcn1VR78HsFdKAltI0ts0RjbqoAKa1+i5xwIgyFO0f9jwz8Jb5ditrUgUl7ERKKpuJQ5GAL9dtO9NkuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:26:15.216372Z"},"content_sha256":"465b4ef176fab87ec418d69ef19ee2fe5c1b1f8596d036e4576018bbb78a10dd","schema_version":"1.0","event_id":"sha256:465b4ef176fab87ec418d69ef19ee2fe5c1b1f8596d036e4576018bbb78a10dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MBJOYAUAWDPMR4MF5NRRFPVPQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Batch-Incremental Video Background Estimation Model using Weighted Low-Rank Approximation of Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC"],"primary_cat":"cs.CV","authors_text":"Aritra Dutta, Peter Richt\\'arik, Xin Li","submitted_at":"2017-07-02T11:55:09Z","abstract_excerpt":"Principal component pursuit (PCP) is a state-of-the-art approach for background estimation problems. Due to their higher computational cost, PCP algorithms, such as robust principal component analysis (RPCA) and its variants, are not feasible in processing high definition videos. To avoid the curse of dimensionality in those algorithms, several methods have been proposed to solve the background estimation problem in an incremental manner. We propose a batch-incremental background estimation model using a special weighted low-rank approximation of matrices. Through experiments with real and syn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00281","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:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dQuC34uJHkpmXv2Xq9DI79BVJYDKauqddLpEPvi7ydJXkysoI6tduOXVUJbc2A1SF7GdP8foEGHfAmBEFU8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:26:15.216788Z"},"content_sha256":"7ed867bacc38b1c915924e5bb07fb8818728a9677b2f3676b4b8f5aa0fe92485","schema_version":"1.0","event_id":"sha256:7ed867bacc38b1c915924e5bb07fb8818728a9677b2f3676b4b8f5aa0fe92485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBJOYAUAWDPMR4MF5NRRFPVPQA/bundle.json","state_url":"https://pith.science/pith/MBJOYAUAWDPMR4MF5NRRFPVPQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBJOYAUAWDPMR4MF5NRRFPVPQA/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-23T22:26:15Z","links":{"resolver":"https://pith.science/pith/MBJOYAUAWDPMR4MF5NRRFPVPQA","bundle":"https://pith.science/pith/MBJOYAUAWDPMR4MF5NRRFPVPQA/bundle.json","state":"https://pith.science/pith/MBJOYAUAWDPMR4MF5NRRFPVPQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBJOYAUAWDPMR4MF5NRRFPVPQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MBJOYAUAWDPMR4MF5NRRFPVPQA","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":"c33e87b7782663828bc5a75ef443f3a3773e319705410f0a67cc3f7903d722b5","cross_cats_sorted":["math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-02T11:55:09Z","title_canon_sha256":"2fe10aa79948fa946e51558730c274b78927f5855695296376a0ed444b386682"},"schema_version":"1.0","source":{"id":"1707.00281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00281","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00281v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00281","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"MBJOYAUAWDPM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBJOYAUAWDPMR4MF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBJOYAUA","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:7ed867bacc38b1c915924e5bb07fb8818728a9677b2f3676b4b8f5aa0fe92485","target":"graph","created_at":"2026-05-18T00:41:03Z","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":"Principal component pursuit (PCP) is a state-of-the-art approach for background estimation problems. Due to their higher computational cost, PCP algorithms, such as robust principal component analysis (RPCA) and its variants, are not feasible in processing high definition videos. To avoid the curse of dimensionality in those algorithms, several methods have been proposed to solve the background estimation problem in an incremental manner. We propose a batch-incremental background estimation model using a special weighted low-rank approximation of matrices. Through experiments with real and syn","authors_text":"Aritra Dutta, Peter Richt\\'arik, Xin Li","cross_cats":["math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-02T11:55:09Z","title":"A Batch-Incremental Video Background Estimation Model using Weighted Low-Rank Approximation of Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00281","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:465b4ef176fab87ec418d69ef19ee2fe5c1b1f8596d036e4576018bbb78a10dd","target":"record","created_at":"2026-05-18T00:41:03Z","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":"c33e87b7782663828bc5a75ef443f3a3773e319705410f0a67cc3f7903d722b5","cross_cats_sorted":["math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-02T11:55:09Z","title_canon_sha256":"2fe10aa79948fa946e51558730c274b78927f5855695296376a0ed444b386682"},"schema_version":"1.0","source":{"id":"1707.00281","kind":"arxiv","version":1}},"canonical_sha256":"6052ec0280b0dec8f185eb6312beaf80039797b1b07ee10f8dc9db3c45b00aca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6052ec0280b0dec8f185eb6312beaf80039797b1b07ee10f8dc9db3c45b00aca","first_computed_at":"2026-05-18T00:41:03.863909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:03.863909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Jx7ViLVJ5HXvQ1VxwBaEifSE1CxCy8wYXGgYCqab9wYg88HG7YTRvrC+9tO/pLkstDDGROvle9Tn5m8/VyvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:03.864411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:465b4ef176fab87ec418d69ef19ee2fe5c1b1f8596d036e4576018bbb78a10dd","sha256:7ed867bacc38b1c915924e5bb07fb8818728a9677b2f3676b4b8f5aa0fe92485"],"state_sha256":"82a175bfe65f91e46671d9ba0914eb1af62eb5a52d019fd1f8a45be39e3ed541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buHEH3VBg0K23N8lks6jHPLzqqRDg1P77CjNyzODhPbjIaf7Nvq8zQ53II3IsJlVZO1Gv0VP5KuWiRm4hlvwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:26:15.220785Z","bundle_sha256":"df7efc0acc35bc55f3b2d08cb894cd91cecfdd08e8f76226273e3e70e39543e6"}}