{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:56ERPXIQ33A5M4CBXQMDWIDZHW","short_pith_number":"pith:56ERPXIQ","schema_version":"1.0","canonical_sha256":"ef8917dd10dec1d67041bc183b20793d95a069df8da42063707de0e74ea665c0","source":{"kind":"arxiv","id":"1005.2197","version":1},"attestation_state":"computed","paper":{"title":"Scalable Tensor Factorizations for Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.data-an"],"primary_cat":"math.NA","authors_text":"Daniel M. Dunlavy, Evrim Acar, Morten Morup, Tamara G. Kolda","submitted_at":"2010-05-12T20:11:43Z","abstract_excerpt":"The problem of incomplete data - i.e., data with missing or unknown values - in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, communication networks, etc.  We consider the problem of how to factorize data sets with missing  values with the goal of capturing the underlying latent structure of the data and possibly reconstructing missing values (i.e., tensor completion). We focus on one of the most well-known tensor factorizations that captures multi-linear structure, CANDECOMP/PARA"},"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":"1005.2197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-05-12T20:11:43Z","cross_cats_sorted":["cs.NA","physics.data-an"],"title_canon_sha256":"ca9b7a2db7acf8eff13a7d58720de9cdb9dd4917ef55527998890a208d479e42","abstract_canon_sha256":"7b4326af93c2266452df01e783276cd54b07b115882246f96f11fa5a139c9060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:07.735326Z","signature_b64":"qF4xsd2m/wt39g7VcrHQsrVNsmergHArq5R/r2EKTy/OLsB+Tuoml70Fo5MwgC8tVUE8pm0Go3jzfzMbt9IHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef8917dd10dec1d67041bc183b20793d95a069df8da42063707de0e74ea665c0","last_reissued_at":"2026-05-18T02:24:07.734635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:07.734635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Tensor Factorizations for Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","physics.data-an"],"primary_cat":"math.NA","authors_text":"Daniel M. Dunlavy, Evrim Acar, Morten Morup, Tamara G. Kolda","submitted_at":"2010-05-12T20:11:43Z","abstract_excerpt":"The problem of incomplete data - i.e., data with missing or unknown values - in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, communication networks, etc.  We consider the problem of how to factorize data sets with missing  values with the goal of capturing the underlying latent structure of the data and possibly reconstructing missing values (i.e., tensor completion). We focus on one of the most well-known tensor factorizations that captures multi-linear structure, CANDECOMP/PARA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2197","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":"1005.2197","created_at":"2026-05-18T02:24:07.734728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2197v1","created_at":"2026-05-18T02:24:07.734728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2197","created_at":"2026-05-18T02:24:07.734728+00:00"},{"alias_kind":"pith_short_12","alias_value":"56ERPXIQ33A5","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"56ERPXIQ33A5M4CB","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"56ERPXIQ","created_at":"2026-05-18T12:26:04.259169+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/56ERPXIQ33A5M4CBXQMDWIDZHW","json":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW.json","graph_json":"https://pith.science/api/pith-number/56ERPXIQ33A5M4CBXQMDWIDZHW/graph.json","events_json":"https://pith.science/api/pith-number/56ERPXIQ33A5M4CBXQMDWIDZHW/events.json","paper":"https://pith.science/paper/56ERPXIQ"},"agent_actions":{"view_html":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW","download_json":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW.json","view_paper":"https://pith.science/paper/56ERPXIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2197&json=true","fetch_graph":"https://pith.science/api/pith-number/56ERPXIQ33A5M4CBXQMDWIDZHW/graph.json","fetch_events":"https://pith.science/api/pith-number/56ERPXIQ33A5M4CBXQMDWIDZHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW/action/storage_attestation","attest_author":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW/action/author_attestation","sign_citation":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW/action/citation_signature","submit_replication":"https://pith.science/pith/56ERPXIQ33A5M4CBXQMDWIDZHW/action/replication_record"}},"created_at":"2026-05-18T02:24:07.734728+00:00","updated_at":"2026-05-18T02:24:07.734728+00:00"}