{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:25RD2CF5DOTOKKCWOPU4NAO6Q4","short_pith_number":"pith:25RD2CF5","schema_version":"1.0","canonical_sha256":"d7623d08bd1ba6e5285673e9c681de872fbbd95a560c1f0904f94195f39dd72b","source":{"kind":"arxiv","id":"2412.07041","version":3},"attestation_state":"computed","paper":{"title":"Generalized Least Squares Kernelized Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Lijun Sun, Mengying Lei","submitted_at":"2024-12-09T23:01:04Z","abstract_excerpt":"Completing multidimensional tensor-structured data with missing entries is a fundamental task for many real-world applications involving incomplete or corrupted datasets. For data with spatial or temporal side information, low-rank factorization models with smoothness constraints have demonstrated strong performance. Although effective at capturing global and long-range correlations, these models often struggle to capture short-scale, high-frequency variations in the data. To address this limitation, we propose the Generalized Least Squares Kernelized Tensor Factorization (GLSKF) framework for"},"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":"2412.07041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-12-09T23:01:04Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"aacbfd735abe340ecddda1db30747b5e344bb1dbe611782f542506cc5aa03256","abstract_canon_sha256":"774ca1e052ddde22e7dae4d4303c7408824e6a38b18c5a0cedb8e93a658310cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:24.139247Z","signature_b64":"QfF6uRgtV7BtgEG9sBbrqa1I4vUXQCE3gvKbiorJUlwVjI2QbnsftD62ihjstVZInkDL/1q0akVZ6LyX/2ATBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7623d08bd1ba6e5285673e9c681de872fbbd95a560c1f0904f94195f39dd72b","last_reissued_at":"2026-07-05T10:12:24.138764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:24.138764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Least Squares Kernelized Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Lijun Sun, Mengying Lei","submitted_at":"2024-12-09T23:01:04Z","abstract_excerpt":"Completing multidimensional tensor-structured data with missing entries is a fundamental task for many real-world applications involving incomplete or corrupted datasets. For data with spatial or temporal side information, low-rank factorization models with smoothness constraints have demonstrated strong performance. Although effective at capturing global and long-range correlations, these models often struggle to capture short-scale, high-frequency variations in the data. To address this limitation, we propose the Generalized Least Squares Kernelized Tensor Factorization (GLSKF) framework for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07041","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.07041/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.07041","created_at":"2026-07-05T10:12:24.138822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07041v3","created_at":"2026-07-05T10:12:24.138822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07041","created_at":"2026-07-05T10:12:24.138822+00:00"},{"alias_kind":"pith_short_12","alias_value":"25RD2CF5DOTO","created_at":"2026-07-05T10:12:24.138822+00:00"},{"alias_kind":"pith_short_16","alias_value":"25RD2CF5DOTOKKCW","created_at":"2026-07-05T10:12:24.138822+00:00"},{"alias_kind":"pith_short_8","alias_value":"25RD2CF5","created_at":"2026-07-05T10:12:24.138822+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22732","citing_title":"Robust Tensor Completion via Gradient Tensor Nulclear L1-L2 Norm for Traffic Data Recovery","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4","json":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4.json","graph_json":"https://pith.science/api/pith-number/25RD2CF5DOTOKKCWOPU4NAO6Q4/graph.json","events_json":"https://pith.science/api/pith-number/25RD2CF5DOTOKKCWOPU4NAO6Q4/events.json","paper":"https://pith.science/paper/25RD2CF5"},"agent_actions":{"view_html":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4","download_json":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4.json","view_paper":"https://pith.science/paper/25RD2CF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07041&json=true","fetch_graph":"https://pith.science/api/pith-number/25RD2CF5DOTOKKCWOPU4NAO6Q4/graph.json","fetch_events":"https://pith.science/api/pith-number/25RD2CF5DOTOKKCWOPU4NAO6Q4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4/action/storage_attestation","attest_author":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4/action/author_attestation","sign_citation":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4/action/citation_signature","submit_replication":"https://pith.science/pith/25RD2CF5DOTOKKCWOPU4NAO6Q4/action/replication_record"}},"created_at":"2026-07-05T10:12:24.138822+00:00","updated_at":"2026-07-05T10:12:24.138822+00:00"}