{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZDKBEXTT4JMVRCWMBEGAJUC3OZ","short_pith_number":"pith:ZDKBEXTT","schema_version":"1.0","canonical_sha256":"c8d4125e73e259588acc090c04d05b765a574bb72502b33758bc175aa5dfe3aa","source":{"kind":"arxiv","id":"1702.00027","version":1},"attestation_state":"computed","paper":{"title":"Representation of big data by dimension reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"A.G.Ramm, C. Van","submitted_at":"2017-01-31T19:25:44Z","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"},"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":"1702.00027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T19:25:44Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"a88f6b8335aab64114b3017e731836af693139525d78fc5b67c66e3e6f0ff98e","abstract_canon_sha256":"c45b7de08abb10db7a767a7f3b7252227c1aa1cd2dfda612ac53f0fa8c011195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:35.354111Z","signature_b64":"L5faViwSBXqLMCdBWO5pIBYHdm8nZp+EiqZqdUrP0938r6d8tlC65YXqXKTXTL39DCtW65jSk4KUp8I8mMhZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8d4125e73e259588acc090c04d05b765a574bb72502b33758bc175aa5dfe3aa","last_reissued_at":"2026-05-18T00:51:35.353756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:35.353756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representation of big data by dimension reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"A.G.Ramm, C. Van","submitted_at":"2017-01-31T19:25:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00027","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":"1702.00027","created_at":"2026-05-18T00:51:35.353819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00027v1","created_at":"2026-05-18T00:51:35.353819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00027","created_at":"2026-05-18T00:51:35.353819+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDKBEXTT4JMV","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDKBEXTT4JMVRCWM","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDKBEXTT","created_at":"2026-05-18T12:31:59.375834+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/ZDKBEXTT4JMVRCWMBEGAJUC3OZ","json":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ.json","graph_json":"https://pith.science/api/pith-number/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/graph.json","events_json":"https://pith.science/api/pith-number/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/events.json","paper":"https://pith.science/paper/ZDKBEXTT"},"agent_actions":{"view_html":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ","download_json":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ.json","view_paper":"https://pith.science/paper/ZDKBEXTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00027&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZDKBEXTT4JMVRCWMBEGAJUC3OZ/action/replication_record"}},"created_at":"2026-05-18T00:51:35.353819+00:00","updated_at":"2026-05-18T00:51:35.353819+00:00"}