{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TLK2QWODEAYHQKXJDNH4DRYX5H","short_pith_number":"pith:TLK2QWOD","schema_version":"1.0","canonical_sha256":"9ad5a859c32030782ae91b4fc1c717e9d0b04327ca9f0468eb5abec80bea0db1","source":{"kind":"arxiv","id":"1502.05023","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.05023","created_at":"2026-05-18T02:26:45.004984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05023v2","created_at":"2026-05-18T02:26:45.004984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05023","created_at":"2026-05-18T02:26:45.004984+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLK2QWODEAYH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLK2QWODEAYHQKXJ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLK2QWOD","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01241","citing_title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H","json":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H.json","graph_json":"https://pith.science/api/pith-number/TLK2QWODEAYHQKXJDNH4DRYX5H/graph.json","events_json":"https://pith.science/api/pith-number/TLK2QWODEAYHQKXJDNH4DRYX5H/events.json","paper":"https://pith.science/paper/TLK2QWOD"},"agent_actions":{"view_html":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H","download_json":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H.json","view_paper":"https://pith.science/paper/TLK2QWOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05023&json=true","fetch_graph":"https://pith.science/api/pith-number/TLK2QWODEAYHQKXJDNH4DRYX5H/graph.json","fetch_events":"https://pith.science/api/pith-number/TLK2QWODEAYHQKXJDNH4DRYX5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/action/storage_attestation","attest_author":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/action/author_attestation","sign_citation":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/action/citation_signature","submit_replication":"https://pith.science/pith/TLK2QWODEAYHQKXJDNH4DRYX5H/action/replication_record"}},"created_at":"2026-05-18T02:26:45.004984+00:00","updated_at":"2026-05-18T02:26:45.004984+00:00"}