{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3OINFFK6ZCPFD3OVDSIZJ2YANM","short_pith_number":"pith:3OINFFK6","schema_version":"1.0","canonical_sha256":"db90d2955ec89e51edd51c9194eb006b16757a92a4f574a6a40cb98bad8fa63f","source":{"kind":"arxiv","id":"2004.11720","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Tensor Ring Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Abdul Ahad, Ce Zhu, Yipeng Liu, Zhen Long","submitted_at":"2020-04-22T11:10:17Z","abstract_excerpt":"Tensor completion can estimate missing values of a high-order data from its partially observed entries. Recent works show that low rank tensor ring approximation is one of the most powerful tools to solve tensor completion problem. However, existing algorithms need predefined tensor ring rank which may be hard to determine in practice. To address the issue, we propose a hierarchical tensor ring decomposition for more compact representation. We use the standard tensor ring to decompose a tensor into several 3-order sub-tensors in the first layer, and each sub-tensor is further factorized by ten"},"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":"2004.11720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-04-22T11:10:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"76df9bb15ee33e5cba5116a5b775a5b5de360b8d3ae1d580753798d4ee7ec852","abstract_canon_sha256":"bdafd4d2744cc4c1a4d50a7dcc04d698d4f6871bc3f3b8b953c004ad9d9a21f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:21.985377Z","signature_b64":"dL3j7Mw/CtdDB8EAEZspTUQ2LZRrbgKIz0gPBoXM0WYL2/X+AsSUB7TtpCGcPNjEpWrDZKSRMCX8ReWZOxx3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db90d2955ec89e51edd51c9194eb006b16757a92a4f574a6a40cb98bad8fa63f","last_reissued_at":"2026-07-05T02:03:21.984960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:21.984960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Tensor Ring Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Abdul Ahad, Ce Zhu, Yipeng Liu, Zhen Long","submitted_at":"2020-04-22T11:10:17Z","abstract_excerpt":"Tensor completion can estimate missing values of a high-order data from its partially observed entries. Recent works show that low rank tensor ring approximation is one of the most powerful tools to solve tensor completion problem. However, existing algorithms need predefined tensor ring rank which may be hard to determine in practice. To address the issue, we propose a hierarchical tensor ring decomposition for more compact representation. We use the standard tensor ring to decompose a tensor into several 3-order sub-tensors in the first layer, and each sub-tensor is further factorized by ten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.11720","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/2004.11720/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":"2004.11720","created_at":"2026-07-05T02:03:21.985020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.11720v1","created_at":"2026-07-05T02:03:21.985020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.11720","created_at":"2026-07-05T02:03:21.985020+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OINFFK6ZCPF","created_at":"2026-07-05T02:03:21.985020+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OINFFK6ZCPFD3OV","created_at":"2026-07-05T02:03:21.985020+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OINFFK6","created_at":"2026-07-05T02:03:21.985020+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/3OINFFK6ZCPFD3OVDSIZJ2YANM","json":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM.json","graph_json":"https://pith.science/api/pith-number/3OINFFK6ZCPFD3OVDSIZJ2YANM/graph.json","events_json":"https://pith.science/api/pith-number/3OINFFK6ZCPFD3OVDSIZJ2YANM/events.json","paper":"https://pith.science/paper/3OINFFK6"},"agent_actions":{"view_html":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM","download_json":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM.json","view_paper":"https://pith.science/paper/3OINFFK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.11720&json=true","fetch_graph":"https://pith.science/api/pith-number/3OINFFK6ZCPFD3OVDSIZJ2YANM/graph.json","fetch_events":"https://pith.science/api/pith-number/3OINFFK6ZCPFD3OVDSIZJ2YANM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM/action/storage_attestation","attest_author":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM/action/author_attestation","sign_citation":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM/action/citation_signature","submit_replication":"https://pith.science/pith/3OINFFK6ZCPFD3OVDSIZJ2YANM/action/replication_record"}},"created_at":"2026-07-05T02:03:21.985020+00:00","updated_at":"2026-07-05T02:03:21.985020+00:00"}