{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AGVKSQR2C2W7ZB5ADWNUMLG46A","short_pith_number":"pith:AGVKSQR2","schema_version":"1.0","canonical_sha256":"01aaa9423a16adfc87a01d9b462cdcf02b594b93e2c5a397a372184f14940576","source":{"kind":"arxiv","id":"1901.05529","version":3},"attestation_state":"computed","paper":{"title":"Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Cheng Gao, Hoi-To Wai, Kejun Huang, Shahana Ibrahim, Xiao Fu","submitted_at":"2019-01-16T21:15:42Z","abstract_excerpt":"This work considers the problem of computing the canonical polyadic decomposition (CPD) of large tensors. Prior works mostly leverage data sparsity to handle this problem, which is not suitable for handling dense tensors that often arise in applications such as medical imaging, computer vision, and remote sensing. Stochastic optimization is known for its low memory cost and per-iteration complexity when handling dense data. However, exisiting stochastic CPD algorithms are not flexible enough to incorporate a variety of constraints/regularizations that are of interest in signal and data analyti"},"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":"1901.05529","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-01-16T21:15:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6c6f4740fe45b128f897e625c57ad15d82f9f58c778709fa5c0af02943d70271","abstract_canon_sha256":"fe7bc08f0fcd1c15de7432b30249311c105543559f7001e102bf66855f7d9331"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:24.397798Z","signature_b64":"Buma7RkhcKWb88NREyhvfWicExxeAkXb1XXVcLFSTzUzUcKI8mL0irkicUq4QBpMVwYdhXxGJpamz3OTXK5OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01aaa9423a16adfc87a01d9b462cdcf02b594b93e2c5a397a372184f14940576","last_reissued_at":"2026-07-05T00:50:24.397245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:24.397245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Cheng Gao, Hoi-To Wai, Kejun Huang, Shahana Ibrahim, Xiao Fu","submitted_at":"2019-01-16T21:15:42Z","abstract_excerpt":"This work considers the problem of computing the canonical polyadic decomposition (CPD) of large tensors. Prior works mostly leverage data sparsity to handle this problem, which is not suitable for handling dense tensors that often arise in applications such as medical imaging, computer vision, and remote sensing. Stochastic optimization is known for its low memory cost and per-iteration complexity when handling dense data. However, exisiting stochastic CPD algorithms are not flexible enough to incorporate a variety of constraints/regularizations that are of interest in signal and data analyti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05529","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/1901.05529/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":"1901.05529","created_at":"2026-07-05T00:50:24.397301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05529v3","created_at":"2026-07-05T00:50:24.397301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05529","created_at":"2026-07-05T00:50:24.397301+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGVKSQR2C2W7","created_at":"2026-07-05T00:50:24.397301+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGVKSQR2C2W7ZB5A","created_at":"2026-07-05T00:50:24.397301+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGVKSQR2","created_at":"2026-07-05T00:50:24.397301+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/AGVKSQR2C2W7ZB5ADWNUMLG46A","json":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A.json","graph_json":"https://pith.science/api/pith-number/AGVKSQR2C2W7ZB5ADWNUMLG46A/graph.json","events_json":"https://pith.science/api/pith-number/AGVKSQR2C2W7ZB5ADWNUMLG46A/events.json","paper":"https://pith.science/paper/AGVKSQR2"},"agent_actions":{"view_html":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A","download_json":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A.json","view_paper":"https://pith.science/paper/AGVKSQR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05529&json=true","fetch_graph":"https://pith.science/api/pith-number/AGVKSQR2C2W7ZB5ADWNUMLG46A/graph.json","fetch_events":"https://pith.science/api/pith-number/AGVKSQR2C2W7ZB5ADWNUMLG46A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A/action/storage_attestation","attest_author":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A/action/author_attestation","sign_citation":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A/action/citation_signature","submit_replication":"https://pith.science/pith/AGVKSQR2C2W7ZB5ADWNUMLG46A/action/replication_record"}},"created_at":"2026-07-05T00:50:24.397301+00:00","updated_at":"2026-07-05T00:50:24.397301+00:00"}