{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NCYFGCYTLNQ6N744TFTGFVTQG5","short_pith_number":"pith:NCYFGCYT","schema_version":"1.0","canonical_sha256":"68b0530b135b61e6ff9c996662d670375a7a46bd37b14a25b02736cc7489826a","source":{"kind":"arxiv","id":"1502.07017","version":1},"attestation_state":"computed","paper":{"title":"On Convolutional Approximations to Linear Dimensionality Reduction Operators for Large Scale Data Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jarvis Haupt, Swayambhoo Jain","submitted_at":"2015-02-25T00:45:41Z","abstract_excerpt":"In this paper, we examine the problem of approximating a general linear dimensionality reduction (LDR) operator, represented as a matrix $A \\in \\mathbb{R}^{m \\times n}$ with $m < n$, by a partial circulant matrix with rows related by circular shifts. Partial circulant matrices admit fast implementations via Fourier transform methods and subsampling operations; our investigation here is motivated by a desire to leverage these potential computational improvements in large-scale data processing tasks. We establish a fundamental result, that most large LDR matrices (whose row spaces are uniformly "},"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.07017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-25T00:45:41Z","cross_cats_sorted":[],"title_canon_sha256":"aa9cb33f326e78d5008dbc950a81458a02cdab0c83192b87e196b30f3194f018","abstract_canon_sha256":"6ba2bd83e94c0e10aefa93844b6224209e2d0b11a612fe155850023bf39b866f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:12.104811Z","signature_b64":"up0PK7W/llibTVOi1f6j8aq0SA0+TFkyfR5ru/a08scS5WsWE+3ukRDEmhQDNrJPOAEB2F2GE3rGl/nCshjXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68b0530b135b61e6ff9c996662d670375a7a46bd37b14a25b02736cc7489826a","last_reissued_at":"2026-05-18T02:26:12.104248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:12.104248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Convolutional Approximations to Linear Dimensionality Reduction Operators for Large Scale Data Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jarvis Haupt, Swayambhoo Jain","submitted_at":"2015-02-25T00:45:41Z","abstract_excerpt":"In this paper, we examine the problem of approximating a general linear dimensionality reduction (LDR) operator, represented as a matrix $A \\in \\mathbb{R}^{m \\times n}$ with $m < n$, by a partial circulant matrix with rows related by circular shifts. Partial circulant matrices admit fast implementations via Fourier transform methods and subsampling operations; our investigation here is motivated by a desire to leverage these potential computational improvements in large-scale data processing tasks. We establish a fundamental result, that most large LDR matrices (whose row spaces are uniformly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07017","kind":"arxiv","version":1},"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.07017","created_at":"2026-05-18T02:26:12.104337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07017v1","created_at":"2026-05-18T02:26:12.104337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07017","created_at":"2026-05-18T02:26:12.104337+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCYFGCYTLNQ6","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCYFGCYTLNQ6N744","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCYFGCYT","created_at":"2026-05-18T12:29:32.376354+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/NCYFGCYTLNQ6N744TFTGFVTQG5","json":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5.json","graph_json":"https://pith.science/api/pith-number/NCYFGCYTLNQ6N744TFTGFVTQG5/graph.json","events_json":"https://pith.science/api/pith-number/NCYFGCYTLNQ6N744TFTGFVTQG5/events.json","paper":"https://pith.science/paper/NCYFGCYT"},"agent_actions":{"view_html":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5","download_json":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5.json","view_paper":"https://pith.science/paper/NCYFGCYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07017&json=true","fetch_graph":"https://pith.science/api/pith-number/NCYFGCYTLNQ6N744TFTGFVTQG5/graph.json","fetch_events":"https://pith.science/api/pith-number/NCYFGCYTLNQ6N744TFTGFVTQG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/action/storage_attestation","attest_author":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/action/author_attestation","sign_citation":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/action/citation_signature","submit_replication":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/action/replication_record"}},"created_at":"2026-05-18T02:26:12.104337+00:00","updated_at":"2026-05-18T02:26:12.104337+00:00"}