{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZDKBEXTT4JMVRCWMBEGAJUC3OZ","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":"c45b7de08abb10db7a767a7f3b7252227c1aa1cd2dfda612ac53f0fa8c011195","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T19:25:44Z","title_canon_sha256":"a88f6b8335aab64114b3017e731836af693139525d78fc5b67c66e3e6f0ff98e"},"schema_version":"1.0","source":{"id":"1702.00027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00027","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00027v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00027","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZDKBEXTT4JMV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZDKBEXTT4JMVRCWM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZDKBEXTT","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:47dd9097fbe295b80c17b1427779048363be1d8026cef508dc1f02e023befbde","target":"graph","created_at":"2026-05-18T00:51:35Z","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":"Suppose the data consist of a set $S$ of points $x_j, 1 \\leq j \\leq J$, distributed in a bounded domain $D \\subset R^N$, where $N$ and $J$ are large numbers. In this paper an algorithm is proposed for checking whether there exists a manifold $\\mathbb{M}$ of low dimension near which many of the points of $S$ lie and finding such $\\mathbb{M}$ if it exists. There are many dimension reduction algorithms, both linear and non-linear. Our algorithm is simple to implement and has some advantages compared with the known algorithms. If there is a manifold of low dimension near which most of the data poi","authors_text":"A.G.Ramm, C. Van","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T19:25:44Z","title":"Representation of big data by dimension reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00027","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:e4a8b6d3213bcde651f27cfd80d7b76111b324049e81da34334ab7ce80404a76","target":"record","created_at":"2026-05-18T00:51:35Z","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":"c45b7de08abb10db7a767a7f3b7252227c1aa1cd2dfda612ac53f0fa8c011195","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T19:25:44Z","title_canon_sha256":"a88f6b8335aab64114b3017e731836af693139525d78fc5b67c66e3e6f0ff98e"},"schema_version":"1.0","source":{"id":"1702.00027","kind":"arxiv","version":1}},"canonical_sha256":"c8d4125e73e259588acc090c04d05b765a574bb72502b33758bc175aa5dfe3aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8d4125e73e259588acc090c04d05b765a574bb72502b33758bc175aa5dfe3aa","first_computed_at":"2026-05-18T00:51:35.353756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:35.353756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L5faViwSBXqLMCdBWO5pIBYHdm8nZp+EiqZqdUrP0938r6d8tlC65YXqXKTXTL39DCtW65jSk4KUp8I8mMhZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:35.354111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4a8b6d3213bcde651f27cfd80d7b76111b324049e81da34334ab7ce80404a76","sha256:47dd9097fbe295b80c17b1427779048363be1d8026cef508dc1f02e023befbde"],"state_sha256":"ada5c906c7c83120854b7828a4259305cb65effa8c7b860aa6698fefc7438eb3"}