{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NQ36F4CQIE7TN4JI5WV2BJCAXB","short_pith_number":"pith:NQ36F4CQ","canonical_record":{"source":{"id":"1702.08134","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T03:51:46Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"d12996e6daedc9154ff6434366c1c2131a9a91596fc125ce50c705ee601808bc","abstract_canon_sha256":"eea0035d020b90ae1b2e4acf0064d581bcccdcbe76bac0dfeca1f54636871a97"},"schema_version":"1.0"},"canonical_sha256":"6c37e2f050413f36f128edaba0a440b879faf840f733d119adf323fd7864e9dd","source":{"kind":"arxiv","id":"1702.08134","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08134","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08134v10","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08134","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"NQ36F4CQIE7T","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"NQ36F4CQIE7TN4JI","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"NQ36F4CQ","created_at":"2026-07-05T00:04:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NQ36F4CQIE7TN4JI5WV2BJCAXB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08134","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T03:51:46Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"d12996e6daedc9154ff6434366c1c2131a9a91596fc125ce50c705ee601808bc","abstract_canon_sha256":"eea0035d020b90ae1b2e4acf0064d581bcccdcbe76bac0dfeca1f54636871a97"},"schema_version":"1.0"},"canonical_sha256":"6c37e2f050413f36f128edaba0a440b879faf840f733d119adf323fd7864e9dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:35.756201Z","signature_b64":"QTtrRfr6/QnES9JVj5lqnSXanu8Dq9i0G9ftsCaxBFaqrX9OhDULZ7ymS+yXy6oC1T4LYlM3KNjhAPK5Ju/oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c37e2f050413f36f128edaba0a440b879faf840f733d119adf323fd7864e9dd","last_reissued_at":"2026-07-05T00:04:35.755687Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:35.755687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08134","source_version":10,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdCrov7sO9I5NBtop2XEbQnqdSFMeZ2y4ZXI1y/Uvm3tD5/g7EMJVj5tF0SxLalZ+rZKXhp8ljmqk5UisjAKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:59:56.209896Z"},"content_sha256":"573dc62cf4fc4703c3400b8ffa1348be8fe47f9cd00b5cc5955e839835a55d58","schema_version":"1.0","event_id":"sha256:573dc62cf4fc4703c3400b8ffa1348be8fe47f9cd00b5cc5955e839835a55d58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NQ36F4CQIE7TN4JI5WV2BJCAXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dropping Convexity for More Efficient and Scalable Online Multiview Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris J. Li, Lin F. Yang, Tuo Zhao, Zhehui Chen","submitted_at":"2017-02-27T03:51:46Z","abstract_excerpt":"Multiview representation learning is very popular for latent factor analysis. It naturally arises in many data analysis, machine learning, and information retrieval applications to model dependent structures among multiple data sources. For computational convenience, existing approaches usually formulate the multiview representation learning as convex optimization problems, where global optima can be obtained by certain algorithms in polynomial time. However, many pieces of evidence have corroborated that heuristic nonconvex approaches also have good empirical computational performance and con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08134","kind":"arxiv","version":10},"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/1702.08134/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eaPCLZhHCAW7MfuwttD67N64BomY6Hy58jGVD51upt/Qd5buyydaKIUS0BeM2M/RZOydCFGnSvinC9BiD1nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:59:56.210414Z"},"content_sha256":"1a1b76f896b6525faa8916f420ef8ac29dcefed92702478568e0c6b75512fcab","schema_version":"1.0","event_id":"sha256:1a1b76f896b6525faa8916f420ef8ac29dcefed92702478568e0c6b75512fcab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQ36F4CQIE7TN4JI5WV2BJCAXB/bundle.json","state_url":"https://pith.science/pith/NQ36F4CQIE7TN4JI5WV2BJCAXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQ36F4CQIE7TN4JI5WV2BJCAXB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-23T11:59:56Z","links":{"resolver":"https://pith.science/pith/NQ36F4CQIE7TN4JI5WV2BJCAXB","bundle":"https://pith.science/pith/NQ36F4CQIE7TN4JI5WV2BJCAXB/bundle.json","state":"https://pith.science/pith/NQ36F4CQIE7TN4JI5WV2BJCAXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQ36F4CQIE7TN4JI5WV2BJCAXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NQ36F4CQIE7TN4JI5WV2BJCAXB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eea0035d020b90ae1b2e4acf0064d581bcccdcbe76bac0dfeca1f54636871a97","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T03:51:46Z","title_canon_sha256":"d12996e6daedc9154ff6434366c1c2131a9a91596fc125ce50c705ee601808bc"},"schema_version":"1.0","source":{"id":"1702.08134","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08134","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08134v10","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08134","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"NQ36F4CQIE7T","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"NQ36F4CQIE7TN4JI","created_at":"2026-07-05T00:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"NQ36F4CQ","created_at":"2026-07-05T00:04:35Z"}],"graph_snapshots":[{"event_id":"sha256:1a1b76f896b6525faa8916f420ef8ac29dcefed92702478568e0c6b75512fcab","target":"graph","created_at":"2026-07-05T00:04:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1702.08134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multiview representation learning is very popular for latent factor analysis. It naturally arises in many data analysis, machine learning, and information retrieval applications to model dependent structures among multiple data sources. For computational convenience, existing approaches usually formulate the multiview representation learning as convex optimization problems, where global optima can be obtained by certain algorithms in polynomial time. However, many pieces of evidence have corroborated that heuristic nonconvex approaches also have good empirical computational performance and con","authors_text":"Chris J. Li, Lin F. Yang, Tuo Zhao, Zhehui Chen","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T03:51:46Z","title":"Dropping Convexity for More Efficient and Scalable Online Multiview Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08134","kind":"arxiv","version":10},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:573dc62cf4fc4703c3400b8ffa1348be8fe47f9cd00b5cc5955e839835a55d58","target":"record","created_at":"2026-07-05T00:04:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eea0035d020b90ae1b2e4acf0064d581bcccdcbe76bac0dfeca1f54636871a97","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T03:51:46Z","title_canon_sha256":"d12996e6daedc9154ff6434366c1c2131a9a91596fc125ce50c705ee601808bc"},"schema_version":"1.0","source":{"id":"1702.08134","kind":"arxiv","version":10}},"canonical_sha256":"6c37e2f050413f36f128edaba0a440b879faf840f733d119adf323fd7864e9dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c37e2f050413f36f128edaba0a440b879faf840f733d119adf323fd7864e9dd","first_computed_at":"2026-07-05T00:04:35.755687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:35.755687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QTtrRfr6/QnES9JVj5lqnSXanu8Dq9i0G9ftsCaxBFaqrX9OhDULZ7ymS+yXy6oC1T4LYlM3KNjhAPK5Ju/oBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:35.756201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08134","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:573dc62cf4fc4703c3400b8ffa1348be8fe47f9cd00b5cc5955e839835a55d58","sha256:1a1b76f896b6525faa8916f420ef8ac29dcefed92702478568e0c6b75512fcab"],"state_sha256":"c805b2752a3a1b90e556e99b78b44a25e3d0c702d706ab5dd4d87fb93f720c96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84fCIJpo0eboZ+8+KMpI1FTPJx9Z1uIsY960w7JOrS10vXiLAgwb71NR0OlOpdxrZoij462lR2dUXhdHxDGaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T11:59:56.214175Z","bundle_sha256":"dd37ab3fa71a0224a3c0303c3b9232fdd1ac1ea93123b4a6f14635fe564bca60"}}