{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TLK2QWODEAYHQKXJDNH4DRYX5H","short_pith_number":"pith:TLK2QWOD","canonical_record":{"source":{"id":"1502.05023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-17T20:23:13Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"4486b87370e43025f6fb197bd2262e4777ddf1839dc7c3ef4246e829aa55a6ee","abstract_canon_sha256":"749b82bcf71c034d908f2a68fc54f5cf7e026ea9133404d9d95d3a5f4b7fa8ee"},"schema_version":"1.0"},"canonical_sha256":"9ad5a859c32030782ae91b4fc1c717e9d0b04327ca9f0468eb5abec80bea0db1","source":{"kind":"arxiv","id":"1502.05023","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05023","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05023v2","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05023","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"TLK2QWODEAYH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TLK2QWODEAYHQKXJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TLK2QWOD","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TLK2QWODEAYHQKXJDNH4DRYX5H","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-17T20:23:13Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"4486b87370e43025f6fb197bd2262e4777ddf1839dc7c3ef4246e829aa55a6ee","abstract_canon_sha256":"749b82bcf71c034d908f2a68fc54f5cf7e026ea9133404d9d95d3a5f4b7fa8ee"},"schema_version":"1.0"},"canonical_sha256":"9ad5a859c32030782ae91b4fc1c717e9d0b04327ca9f0468eb5abec80bea0db1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:45.005359Z","signature_b64":"1PmGrmDud5HYqFKnxMnwemrZQwLoqdHzyNY2LZmjiCI8PoYn7U76y11fvjYwG6Zi/KxS2p/sVgI/v//eYf+IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad5a859c32030782ae91b4fc1c717e9d0b04327ca9f0468eb5abec80bea0db1","last_reissued_at":"2026-05-18T02:26:45.004918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:45.004918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05023","source_version":2,"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-18T02:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/XmVT+lowCDivdcgyhFQ3vEaa/Dz/wWpzVtQKeL7RZ0NqiqK7ZNfOyn4TvkwIwO8R56JF+UDcI6LD+qhIPVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:55:43.376711Z"},"content_sha256":"90d87d62658fd1a3f1c798c5219feed9fbe4f78da9db04cbc10a5e5ffb8c12f4","schema_version":"1.0","event_id":"sha256:90d87d62658fd1a3f1c798c5219feed9fbe4f78da9db04cbc10a5e5ffb8c12f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TLK2QWODEAYHQKXJDNH4DRYX5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Sampling Technique for Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Srinadh Bhojanapalli, Sujay Sanghavi","submitted_at":"2015-02-17T20:23:13Z","abstract_excerpt":"In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a biased random way, only $O(n^{1.5}/\\epsilon^2)$ of the possible $n^3$ elements while still achieving each of the three goals: \\\\ {\\em (a) tensor sparsification}: for a tensor that has to be formed from arbitrary samples, compute very few elements to get a good spectral approximation, and for arbitrary orthogonal tensors {\\em (b) tensor completion:} recover "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05023","kind":"arxiv","version":2},"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-18T02:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sGkEmlYyiFn2/7u4WRMY+5jugdQ/1OJf4ZFIN9ouGbvjt8y+5qk2rZv8urqtnVdrM90DRqfn+VYhWuynbB8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:55:43.377995Z"},"content_sha256":"fe14a87851c40b147bb883be0d09e9cc32072df4cfecdef20922d440162762ed","schema_version":"1.0","event_id":"sha256:fe14a87851c40b147bb883be0d09e9cc32072df4cfecdef20922d440162762ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/bundle.json","state_url":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/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-16T09:55:43Z","links":{"resolver":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H","bundle":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/bundle.json","state":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TLK2QWODEAYHQKXJDNH4DRYX5H","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":"749b82bcf71c034d908f2a68fc54f5cf7e026ea9133404d9d95d3a5f4b7fa8ee","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-17T20:23:13Z","title_canon_sha256":"4486b87370e43025f6fb197bd2262e4777ddf1839dc7c3ef4246e829aa55a6ee"},"schema_version":"1.0","source":{"id":"1502.05023","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05023","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05023v2","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05023","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"TLK2QWODEAYH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TLK2QWODEAYHQKXJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TLK2QWOD","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:fe14a87851c40b147bb883be0d09e9cc32072df4cfecdef20922d440162762ed","target":"graph","created_at":"2026-05-18T02:26:45Z","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":"In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a biased random way, only $O(n^{1.5}/\\epsilon^2)$ of the possible $n^3$ elements while still achieving each of the three goals: \\\\ {\\em (a) tensor sparsification}: for a tensor that has to be formed from arbitrary samples, compute very few elements to get a good spectral approximation, and for arbitrary orthogonal tensors {\\em (b) tensor completion:} recover ","authors_text":"Srinadh Bhojanapalli, Sujay Sanghavi","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-17T20:23:13Z","title":"A New Sampling Technique for Tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05023","kind":"arxiv","version":2},"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:90d87d62658fd1a3f1c798c5219feed9fbe4f78da9db04cbc10a5e5ffb8c12f4","target":"record","created_at":"2026-05-18T02:26:45Z","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":"749b82bcf71c034d908f2a68fc54f5cf7e026ea9133404d9d95d3a5f4b7fa8ee","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-17T20:23:13Z","title_canon_sha256":"4486b87370e43025f6fb197bd2262e4777ddf1839dc7c3ef4246e829aa55a6ee"},"schema_version":"1.0","source":{"id":"1502.05023","kind":"arxiv","version":2}},"canonical_sha256":"9ad5a859c32030782ae91b4fc1c717e9d0b04327ca9f0468eb5abec80bea0db1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ad5a859c32030782ae91b4fc1c717e9d0b04327ca9f0468eb5abec80bea0db1","first_computed_at":"2026-05-18T02:26:45.004918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:45.004918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1PmGrmDud5HYqFKnxMnwemrZQwLoqdHzyNY2LZmjiCI8PoYn7U76y11fvjYwG6Zi/KxS2p/sVgI/v//eYf+IAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:45.005359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05023","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90d87d62658fd1a3f1c798c5219feed9fbe4f78da9db04cbc10a5e5ffb8c12f4","sha256:fe14a87851c40b147bb883be0d09e9cc32072df4cfecdef20922d440162762ed"],"state_sha256":"1a9f31704e9bfef2321b689b6be60df76537392f1cba973d7d6e1ea3bf7ae21d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9mqykdGHqDRAQ6y0Ahiv9V7lN3stE91Y3pPEqGENWmWbIIhyx9/pCKXlDjl9JgbNj7BOLvoevl5C3owktWABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:55:43.385766Z","bundle_sha256":"ebc84fe358477e7d252e430d6259189fcb13a620f92e406e2f90a31e7dfac0fb"}}