{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TZB4HOQVINIZTPDRESQ4UMFQ2U","short_pith_number":"pith:TZB4HOQV","schema_version":"1.0","canonical_sha256":"9e43c3ba15435199bc7124a1ca30b0d519b8699939af23519b75d31ff63812dc","source":{"kind":"arxiv","id":"1611.03578","version":1},"attestation_state":"computed","paper":{"title":"Simple and Efficient Parallelization for Probabilistic Temporal Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Guangxi Li, Irwin King, Jinmian Ye, Linnan Wang, Michael Lyu, Zenglin Xu","submitted_at":"2016-11-11T03:54:00Z","abstract_excerpt":"Probabilistic Temporal Tensor Factorization (PTTF) is an effective algorithm to model the temporal tensor data. It leverages a time constraint to capture the evolving properties of tensor data. Nowadays the exploding dataset demands a large scale PTTF analysis, and a parallel solution is critical to accommodate the trend. Whereas, the parallelization of PTTF still remains unexplored. In this paper, we propose a simple yet efficient Parallel Probabilistic Temporal Tensor Factorization, referred to as P$^2$T$^2$F, to provide a scalable PTTF solution. P$^2$T$^2$F is fundamentally disparate from e"},"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":"1611.03578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-11T03:54:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0fa4da033a8dbb1293cdcd21e4536d682b53ce7243a71713c797e8f921b35b15","abstract_canon_sha256":"e2a222e2be6e736e5b15379d1ab914b83cecc2b46eb59254145e5ee5f8874c91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:33.829504Z","signature_b64":"6UmBiCO8KtZ3ZvN11YNYWnf0fZZTiQc5rP9joxITikpSsk9ycewEMxWeNyqw++jkF/TAUG3VYjs2nCloK52MBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e43c3ba15435199bc7124a1ca30b0d519b8699939af23519b75d31ff63812dc","last_reissued_at":"2026-05-18T00:59:33.828902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:33.828902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Efficient Parallelization for Probabilistic Temporal Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Guangxi Li, Irwin King, Jinmian Ye, Linnan Wang, Michael Lyu, Zenglin Xu","submitted_at":"2016-11-11T03:54:00Z","abstract_excerpt":"Probabilistic Temporal Tensor Factorization (PTTF) is an effective algorithm to model the temporal tensor data. It leverages a time constraint to capture the evolving properties of tensor data. Nowadays the exploding dataset demands a large scale PTTF analysis, and a parallel solution is critical to accommodate the trend. Whereas, the parallelization of PTTF still remains unexplored. In this paper, we propose a simple yet efficient Parallel Probabilistic Temporal Tensor Factorization, referred to as P$^2$T$^2$F, to provide a scalable PTTF solution. P$^2$T$^2$F is fundamentally disparate from e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03578","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":"1611.03578","created_at":"2026-05-18T00:59:33.829006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03578v1","created_at":"2026-05-18T00:59:33.829006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03578","created_at":"2026-05-18T00:59:33.829006+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZB4HOQVINIZ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZB4HOQVINIZTPDR","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZB4HOQV","created_at":"2026-05-18T12:30:46.583412+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/TZB4HOQVINIZTPDRESQ4UMFQ2U","json":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U.json","graph_json":"https://pith.science/api/pith-number/TZB4HOQVINIZTPDRESQ4UMFQ2U/graph.json","events_json":"https://pith.science/api/pith-number/TZB4HOQVINIZTPDRESQ4UMFQ2U/events.json","paper":"https://pith.science/paper/TZB4HOQV"},"agent_actions":{"view_html":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U","download_json":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U.json","view_paper":"https://pith.science/paper/TZB4HOQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03578&json=true","fetch_graph":"https://pith.science/api/pith-number/TZB4HOQVINIZTPDRESQ4UMFQ2U/graph.json","fetch_events":"https://pith.science/api/pith-number/TZB4HOQVINIZTPDRESQ4UMFQ2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U/action/storage_attestation","attest_author":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U/action/author_attestation","sign_citation":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U/action/citation_signature","submit_replication":"https://pith.science/pith/TZB4HOQVINIZTPDRESQ4UMFQ2U/action/replication_record"}},"created_at":"2026-05-18T00:59:33.829006+00:00","updated_at":"2026-05-18T00:59:33.829006+00:00"}