{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J3ML5AATBTVI43NCL6K4YRHFH2","short_pith_number":"pith:J3ML5AAT","schema_version":"1.0","canonical_sha256":"4ed8be80130cea8e6da25f95cc44e53e88a139f7c39a2bdc623ca871d3eb8c9f","source":{"kind":"arxiv","id":"2606.21427","version":1},"attestation_state":"computed","paper":{"title":"Dual-Attention Convolution Experts for Sparse Tensor Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Yanlei Liu, Zhenyu Liao","submitted_at":"2026-06-19T13:45:18Z","abstract_excerpt":"Tensor factorization (TF) has been widely adopted for high-dimensional sparse data completion tasks. Despite significant progress, neural TF methods often struggle to capture complex cross-mode interactions and remain vulnerable to (extreme) data sparsity. To address these challenges, we propose a novel neural tensor factorization approach, termed Dual-Attention Convolution Expert Networks with Group-Level Contrastive Learning (DCGC). For the first problem, DCGC generates diverse non-linear alignment patterns of latent factors via a multi-channel convolution network, and leverages the gated du"},"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":"2606.21427","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-19T13:45:18Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"abc50f417f00ed05aa6533448f93aa0e74e810486b8ffe279bc48c5bf6b769d2","abstract_canon_sha256":"9370bbc5dd3d843297096c00fd55e64ea535928cc82245f2a94b09de751f9efd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:13:09.888930Z","signature_b64":"O+0wfFzNQiQOQlWBELiJwARbKqGDx8PqOt37u1HskJnv+tCEsrxPHiZiLEfGzqtr3EjfO5akHJKX4h7gwJPvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ed8be80130cea8e6da25f95cc44e53e88a139f7c39a2bdc623ca871d3eb8c9f","last_reissued_at":"2026-06-23T01:13:09.888501Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:13:09.888501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual-Attention Convolution Experts for Sparse Tensor Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Yanlei Liu, Zhenyu Liao","submitted_at":"2026-06-19T13:45:18Z","abstract_excerpt":"Tensor factorization (TF) has been widely adopted for high-dimensional sparse data completion tasks. Despite significant progress, neural TF methods often struggle to capture complex cross-mode interactions and remain vulnerable to (extreme) data sparsity. To address these challenges, we propose a novel neural tensor factorization approach, termed Dual-Attention Convolution Expert Networks with Group-Level Contrastive Learning (DCGC). For the first problem, DCGC generates diverse non-linear alignment patterns of latent factors via a multi-channel convolution network, and leverages the gated du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21427","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21427/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":"2606.21427","created_at":"2026-06-23T01:13:09.888570+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21427v1","created_at":"2026-06-23T01:13:09.888570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21427","created_at":"2026-06-23T01:13:09.888570+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3ML5AATBTVI","created_at":"2026-06-23T01:13:09.888570+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3ML5AATBTVI43NC","created_at":"2026-06-23T01:13:09.888570+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3ML5AAT","created_at":"2026-06-23T01:13:09.888570+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/J3ML5AATBTVI43NCL6K4YRHFH2","json":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2.json","graph_json":"https://pith.science/api/pith-number/J3ML5AATBTVI43NCL6K4YRHFH2/graph.json","events_json":"https://pith.science/api/pith-number/J3ML5AATBTVI43NCL6K4YRHFH2/events.json","paper":"https://pith.science/paper/J3ML5AAT"},"agent_actions":{"view_html":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2","download_json":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2.json","view_paper":"https://pith.science/paper/J3ML5AAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21427&json=true","fetch_graph":"https://pith.science/api/pith-number/J3ML5AATBTVI43NCL6K4YRHFH2/graph.json","fetch_events":"https://pith.science/api/pith-number/J3ML5AATBTVI43NCL6K4YRHFH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2/action/storage_attestation","attest_author":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2/action/author_attestation","sign_citation":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2/action/citation_signature","submit_replication":"https://pith.science/pith/J3ML5AATBTVI43NCL6K4YRHFH2/action/replication_record"}},"created_at":"2026-06-23T01:13:09.888570+00:00","updated_at":"2026-06-23T01:13:09.888570+00:00"}