{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NCYFGCYTLNQ6N744TFTGFVTQG5","short_pith_number":"pith:NCYFGCYT","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"},"canonical_sha256":"68b0530b135b61e6ff9c996662d670375a7a46bd37b14a25b02736cc7489826a","source":{"kind":"arxiv","id":"1502.07017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07017","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07017v1","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07017","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"NCYFGCYTLNQ6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCYFGCYTLNQ6N744","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCYFGCYT","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NCYFGCYTLNQ6N744TFTGFVTQG5","target":"record","payload":{"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"},"canonical_sha256":"68b0530b135b61e6ff9c996662d670375a7a46bd37b14a25b02736cc7489826a","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"},"source_kind":"arxiv","source_id":"1502.07017","source_version":1,"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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikMBlVRC2A8KgqMlID5a95xlUWEVH8SXOfOdwi/3Viphrkza6JaLHQMEd0UsrT7CL2Xw9J0UQiHN9Ig9PMFwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:26:33.217142Z"},"content_sha256":"a364b5586ea19ad63bb754e5256274563a90261c80eb477ea46dc3661bb0f3fe","schema_version":"1.0","event_id":"sha256:a364b5586ea19ad63bb754e5256274563a90261c80eb477ea46dc3661bb0f3fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NCYFGCYTLNQ6N744TFTGFVTQG5","target":"graph","payload":{"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"},"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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxLvGioVkADKPgPfAGycm71q71/u4PAHO3NyhH6jLUZpWGgQeptLpkoCRk4Wi/D+yOVIFC0savrKa9kAx14GCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:26:33.217751Z"},"content_sha256":"a425574db810d82ebf4c16412d304cf284a985b8856156752b0e4899f78a5da7","schema_version":"1.0","event_id":"sha256:a425574db810d82ebf4c16412d304cf284a985b8856156752b0e4899f78a5da7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/bundle.json","state_url":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/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-05-25T20:26:33Z","links":{"resolver":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5","bundle":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/bundle.json","state":"https://pith.science/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCYFGCYTLNQ6N744TFTGFVTQG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NCYFGCYTLNQ6N744TFTGFVTQG5","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":"6ba2bd83e94c0e10aefa93844b6224209e2d0b11a612fe155850023bf39b866f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-25T00:45:41Z","title_canon_sha256":"aa9cb33f326e78d5008dbc950a81458a02cdab0c83192b87e196b30f3194f018"},"schema_version":"1.0","source":{"id":"1502.07017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07017","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07017v1","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07017","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"NCYFGCYTLNQ6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCYFGCYTLNQ6N744","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCYFGCYT","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:a425574db810d82ebf4c16412d304cf284a985b8856156752b0e4899f78a5da7","target":"graph","created_at":"2026-05-18T02:26:12Z","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 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 ","authors_text":"Jarvis Haupt, Swayambhoo Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-25T00:45:41Z","title":"On Convolutional Approximations to Linear Dimensionality Reduction Operators for Large Scale Data Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07017","kind":"arxiv","version":1},"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:a364b5586ea19ad63bb754e5256274563a90261c80eb477ea46dc3661bb0f3fe","target":"record","created_at":"2026-05-18T02:26:12Z","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":"6ba2bd83e94c0e10aefa93844b6224209e2d0b11a612fe155850023bf39b866f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-25T00:45:41Z","title_canon_sha256":"aa9cb33f326e78d5008dbc950a81458a02cdab0c83192b87e196b30f3194f018"},"schema_version":"1.0","source":{"id":"1502.07017","kind":"arxiv","version":1}},"canonical_sha256":"68b0530b135b61e6ff9c996662d670375a7a46bd37b14a25b02736cc7489826a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68b0530b135b61e6ff9c996662d670375a7a46bd37b14a25b02736cc7489826a","first_computed_at":"2026-05-18T02:26:12.104248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:12.104248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"up0PK7W/llibTVOi1f6j8aq0SA0+TFkyfR5ru/a08scS5WsWE+3ukRDEmhQDNrJPOAEB2F2GE3rGl/nCshjXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:12.104811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a364b5586ea19ad63bb754e5256274563a90261c80eb477ea46dc3661bb0f3fe","sha256:a425574db810d82ebf4c16412d304cf284a985b8856156752b0e4899f78a5da7"],"state_sha256":"ee278b01c2aa732df30fa37486436afd32357ddd740deafa1ddeaabc21bfcef0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4AeHuNe4vj3jPr8IxekwgEEbG7iT381dsbq2M3cjczwihvEMjXvnHfnIDUpavzoefwVkEnqzB91YSeh/QX4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:26:33.221421Z","bundle_sha256":"b3098a5c61f08a462a01ddedf3a2b5c3ada245863a8ad60700ae22026af49012"}}