{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VDPNT6T3HHAQOMCF47K753HNDR","short_pith_number":"pith:VDPNT6T3","schema_version":"1.0","canonical_sha256":"a8ded9fa7b39c1073045e7d5feeced1c77b05217fc19821b1a6e13860cb2c113","source":{"kind":"arxiv","id":"1804.06252","version":1},"attestation_state":"computed","paper":{"title":"Weighted Low-Rank Approximation of Matrices and Background Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.CV","authors_text":"Aritra Dutta, Peter Richtarik, Xin Li","submitted_at":"2018-04-15T21:43:08Z","abstract_excerpt":"We primarily study a special a weighted low-rank approximation of matrices and then apply it to solve the background modeling problem. We propose two algorithms for this purpose: one operates in the batch mode on the entire data and the other one operates in the batch-incremental mode on the data and naturally captures more background variations and computationally more effective. Moreover, we propose a robust technique that learns the background frame indices from the data and does not require any training frames. We demonstrate through extensive experiments that by inserting a simple weight "},"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":"1804.06252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-15T21:43:08Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"8e936d53681105c60ec5118ebf024afc9ea46b795e350c17da9be4db36464722","abstract_canon_sha256":"6f85e0c47173c7633549cd106b4ac4377b4f3274b36b204beeb473369a4df78c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.239248Z","signature_b64":"seS9NKf+oNLuUxJmrlI3/MamUO6UNSZ/Fu3gK3h7h/MVEL85UksP5NH7b9eDmcmXYQKDT5C8RBG00HJ3GzbjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8ded9fa7b39c1073045e7d5feeced1c77b05217fc19821b1a6e13860cb2c113","last_reissued_at":"2026-05-18T00:18:21.238560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.238560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Low-Rank Approximation of Matrices and Background Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.CV","authors_text":"Aritra Dutta, Peter Richtarik, Xin Li","submitted_at":"2018-04-15T21:43:08Z","abstract_excerpt":"We primarily study a special a weighted low-rank approximation of matrices and then apply it to solve the background modeling problem. We propose two algorithms for this purpose: one operates in the batch mode on the entire data and the other one operates in the batch-incremental mode on the data and naturally captures more background variations and computationally more effective. Moreover, we propose a robust technique that learns the background frame indices from the data and does not require any training frames. We demonstrate through extensive experiments that by inserting a simple weight "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06252","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":"1804.06252","created_at":"2026-05-18T00:18:21.238662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06252v1","created_at":"2026-05-18T00:18:21.238662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06252","created_at":"2026-05-18T00:18:21.238662+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDPNT6T3HHAQ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDPNT6T3HHAQOMCF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDPNT6T3","created_at":"2026-05-18T12:32:59.047623+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/VDPNT6T3HHAQOMCF47K753HNDR","json":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR.json","graph_json":"https://pith.science/api/pith-number/VDPNT6T3HHAQOMCF47K753HNDR/graph.json","events_json":"https://pith.science/api/pith-number/VDPNT6T3HHAQOMCF47K753HNDR/events.json","paper":"https://pith.science/paper/VDPNT6T3"},"agent_actions":{"view_html":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR","download_json":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR.json","view_paper":"https://pith.science/paper/VDPNT6T3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06252&json=true","fetch_graph":"https://pith.science/api/pith-number/VDPNT6T3HHAQOMCF47K753HNDR/graph.json","fetch_events":"https://pith.science/api/pith-number/VDPNT6T3HHAQOMCF47K753HNDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR/action/storage_attestation","attest_author":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR/action/author_attestation","sign_citation":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR/action/citation_signature","submit_replication":"https://pith.science/pith/VDPNT6T3HHAQOMCF47K753HNDR/action/replication_record"}},"created_at":"2026-05-18T00:18:21.238662+00:00","updated_at":"2026-05-18T00:18:21.238662+00:00"}