{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W2G3QJLREJHZU4EK5V6BI46XQT","short_pith_number":"pith:W2G3QJLR","canonical_record":{"source":{"id":"1506.03137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-09T23:53:42Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8f2a9ee1428a8a4040c7fc002ef5aa1c4801cb5be533e4b939ff9fc88c5d14b5","abstract_canon_sha256":"0e858966406a15befcffe3fd233989273af4fe89dc35290b2cf28385592a74f2"},"schema_version":"1.0"},"canonical_sha256":"b68db82571224f9a708aed7c1473d784e93dea83fce53062ffa9699ed5287fb8","source":{"kind":"arxiv","id":"1506.03137","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03137","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03137v3","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03137","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"W2G3QJLREJHZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W2G3QJLREJHZU4EK","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W2G3QJLR","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W2G3QJLREJHZU4EK5V6BI46XQT","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-09T23:53:42Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8f2a9ee1428a8a4040c7fc002ef5aa1c4801cb5be533e4b939ff9fc88c5d14b5","abstract_canon_sha256":"0e858966406a15befcffe3fd233989273af4fe89dc35290b2cf28385592a74f2"},"schema_version":"1.0"},"canonical_sha256":"b68db82571224f9a708aed7c1473d784e93dea83fce53062ffa9699ed5287fb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:10.117378Z","signature_b64":"3VIcBujEHGu2hQx5Axwxoqazg7G6v8Uhm1KDsSGeewOKdCwkk/f1yP7irJPH82+sshNgPEEy6w1ct3ObVJD2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b68db82571224f9a708aed7c1473d784e93dea83fce53062ffa9699ed5287fb8","last_reissued_at":"2026-05-18T01:26:10.116738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:10.116738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03137","source_version":3,"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-05-18T01:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RS5GOHjpfMiVSpzPuM8s7GKZU9f9JoS+gyKLK2AQT0F/78VLF/+LweVhEYdhM9ywD32C0MKW+Ttu0DAD1sWYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:48:00.233483Z"},"content_sha256":"94ce6e33b9c40bf8b623d70230df7c3441495c9bd7c0a926f2c51312ccff6d62","schema_version":"1.0","event_id":"sha256:94ce6e33b9c40bf8b623d70230df7c3441495c9bd7c0a926f2c51312ccff6d62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W2G3QJLREJHZU4EK5V6BI46XQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Benjamin Weitz, Tselil Schramm","submitted_at":"2015-06-09T23:53:42Z","abstract_excerpt":"We give an algorithm for completing an order-$m$ symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the problem of learning mixtures of product distributions over the hypercube, obtaining new algorithmic results. If the centers of the product distribution are linearly independent, then we recover distributions with as many as $\\Omega(n)$ centers in polynomial time and sample complexity. In the general case, we recover distributions with as many as $\\tilde\\Omega(n)$ centers in quasi-pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03137","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":""},"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-05-18T01:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9Hwh8qYfklOau+liFUidqTvcK2Dr3O1iEifkXkbzGEubSfJjUXU9Q25BbY+FQt/3g4mmRrZSqaCvmVKaPeyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:48:00.234289Z"},"content_sha256":"7bc0507cbf7be87eac73e6efcc888e1acf7e57e43754693b577f0ea5d71def3d","schema_version":"1.0","event_id":"sha256:7bc0507cbf7be87eac73e6efcc888e1acf7e57e43754693b577f0ea5d71def3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2G3QJLREJHZU4EK5V6BI46XQT/bundle.json","state_url":"https://pith.science/pith/W2G3QJLREJHZU4EK5V6BI46XQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2G3QJLREJHZU4EK5V6BI46XQT/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-06-07T05:48:00Z","links":{"resolver":"https://pith.science/pith/W2G3QJLREJHZU4EK5V6BI46XQT","bundle":"https://pith.science/pith/W2G3QJLREJHZU4EK5V6BI46XQT/bundle.json","state":"https://pith.science/pith/W2G3QJLREJHZU4EK5V6BI46XQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2G3QJLREJHZU4EK5V6BI46XQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W2G3QJLREJHZU4EK5V6BI46XQT","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":"0e858966406a15befcffe3fd233989273af4fe89dc35290b2cf28385592a74f2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-09T23:53:42Z","title_canon_sha256":"8f2a9ee1428a8a4040c7fc002ef5aa1c4801cb5be533e4b939ff9fc88c5d14b5"},"schema_version":"1.0","source":{"id":"1506.03137","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03137","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03137v3","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03137","created_at":"2026-05-18T01:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"W2G3QJLREJHZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W2G3QJLREJHZU4EK","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W2G3QJLR","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:7bc0507cbf7be87eac73e6efcc888e1acf7e57e43754693b577f0ea5d71def3d","target":"graph","created_at":"2026-05-18T01:26:10Z","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"},"paper":{"abstract_excerpt":"We give an algorithm for completing an order-$m$ symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the problem of learning mixtures of product distributions over the hypercube, obtaining new algorithmic results. If the centers of the product distribution are linearly independent, then we recover distributions with as many as $\\Omega(n)$ centers in polynomial time and sample complexity. In the general case, we recover distributions with as many as $\\tilde\\Omega(n)$ centers in quasi-pol","authors_text":"Benjamin Weitz, Tselil Schramm","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-09T23:53:42Z","title":"Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03137","kind":"arxiv","version":3},"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:94ce6e33b9c40bf8b623d70230df7c3441495c9bd7c0a926f2c51312ccff6d62","target":"record","created_at":"2026-05-18T01:26:10Z","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":"0e858966406a15befcffe3fd233989273af4fe89dc35290b2cf28385592a74f2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-09T23:53:42Z","title_canon_sha256":"8f2a9ee1428a8a4040c7fc002ef5aa1c4801cb5be533e4b939ff9fc88c5d14b5"},"schema_version":"1.0","source":{"id":"1506.03137","kind":"arxiv","version":3}},"canonical_sha256":"b68db82571224f9a708aed7c1473d784e93dea83fce53062ffa9699ed5287fb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b68db82571224f9a708aed7c1473d784e93dea83fce53062ffa9699ed5287fb8","first_computed_at":"2026-05-18T01:26:10.116738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:10.116738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3VIcBujEHGu2hQx5Axwxoqazg7G6v8Uhm1KDsSGeewOKdCwkk/f1yP7irJPH82+sshNgPEEy6w1ct3ObVJD2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:10.117378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03137","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94ce6e33b9c40bf8b623d70230df7c3441495c9bd7c0a926f2c51312ccff6d62","sha256:7bc0507cbf7be87eac73e6efcc888e1acf7e57e43754693b577f0ea5d71def3d"],"state_sha256":"9897a3f0521b273de85e74f89cc7eabc26aed640dea61d9d19cccd6bdd0024fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P30JknhVW4w1MRXzeE+tXUpeZdqFLV12gs0pz3fEeQ5F3JeED6JmxFM2S/CB05gKHCZ6DYuzlHQ0aP5I62jVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:48:00.237514Z","bundle_sha256":"e4722a7905180aff50c76602d0732ba4fbdd87835f3523ec732b9dd687999eb5"}}