{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3ZRZ3GTBJFMWJHLNPEHOI2XQMJ","short_pith_number":"pith:3ZRZ3GTB","schema_version":"1.0","canonical_sha256":"de639d9a614959649d6d790ee46af0625706fbce09171461d6b801fee6d0b952","source":{"kind":"arxiv","id":"1706.08146","version":3},"attestation_state":"computed","paper":{"title":"Compressed Factorization: Fast and Accurate Low-Rank Factorization of Compressively-Sensed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gregory Valiant, Kai Sheng Tai, Peter Bailis, Vatsal Sharan","submitted_at":"2017-06-25T17:47:16Z","abstract_excerpt":"What learning algorithms can be run directly on compressively-sensed data? In this work, we consider the question of accurately and efficiently computing low-rank matrix or tensor factorizations given data compressed via random projections. We examine the approach of first performing factorization in the compressed domain, and then reconstructing the original high-dimensional factors from the recovered (compressed) factors. In both the matrix and tensor settings, we establish conditions under which this natural approach will provably recover the original factors. While it is well-known that ra"},"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":"1706.08146","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-25T17:47:16Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"2c2efc9ce4f9985247a4058b74badd18effbca8b34c6068a731fcd0093b6087a","abstract_canon_sha256":"aa23bf8fbf7359068c7bd55da9b71fa4c2e57647850254ddbf65079f9d9e9879"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:04.932862Z","signature_b64":"M8+nYzmVEWpViM66k7rU7j8K0dRqeHR8SM41BBPobGkg8wGLTsLJw3aEN/GOdfnbd+2nyJCF3cdNZrikykWHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de639d9a614959649d6d790ee46af0625706fbce09171461d6b801fee6d0b952","last_reissued_at":"2026-05-17T23:45:04.932401Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:04.932401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Factorization: Fast and Accurate Low-Rank Factorization of Compressively-Sensed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gregory Valiant, Kai Sheng Tai, Peter Bailis, Vatsal Sharan","submitted_at":"2017-06-25T17:47:16Z","abstract_excerpt":"What learning algorithms can be run directly on compressively-sensed data? In this work, we consider the question of accurately and efficiently computing low-rank matrix or tensor factorizations given data compressed via random projections. We examine the approach of first performing factorization in the compressed domain, and then reconstructing the original high-dimensional factors from the recovered (compressed) factors. In both the matrix and tensor settings, we establish conditions under which this natural approach will provably recover the original factors. While it is well-known that ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08146","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08146","created_at":"2026-05-17T23:45:04.932468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08146v3","created_at":"2026-05-17T23:45:04.932468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08146","created_at":"2026-05-17T23:45:04.932468+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZRZ3GTBJFMW","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZRZ3GTBJFMWJHLN","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZRZ3GTB","created_at":"2026-05-18T12:30:58.224056+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/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ","json":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ.json","graph_json":"https://pith.science/api/pith-number/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/graph.json","events_json":"https://pith.science/api/pith-number/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/events.json","paper":"https://pith.science/paper/3ZRZ3GTB"},"agent_actions":{"view_html":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ","download_json":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ.json","view_paper":"https://pith.science/paper/3ZRZ3GTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08146&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/action/storage_attestation","attest_author":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/action/author_attestation","sign_citation":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/action/citation_signature","submit_replication":"https://pith.science/pith/3ZRZ3GTBJFMWJHLNPEHOI2XQMJ/action/replication_record"}},"created_at":"2026-05-17T23:45:04.932468+00:00","updated_at":"2026-05-17T23:45:04.932468+00:00"}