{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TEDR7ZRZN4WR2CUZOTKKOU452N","short_pith_number":"pith:TEDR7ZRZ","schema_version":"1.0","canonical_sha256":"99071fe6396f2d1d0a9974d4a7539dd35ed053d74023a1a328f17511d37d5b2c","source":{"kind":"arxiv","id":"1708.06897","version":2},"attestation_state":"computed","paper":{"title":"Projected support points: a new method for high-dimensional data reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Simon Mak, V. Roshan Joseph","submitted_at":"2017-08-23T06:34:06Z","abstract_excerpt":"In an era where big and high-dimensional data is readily available, data scientists are inevitably faced with the challenge of reducing this data for expensive downstream computation or analysis. To this end, we present here a new method for reducing high-dimensional big data into a representative point set, called projected support points (PSPs). A key ingredient in our method is the so-called sparsity-inducing (SpIn) kernel, which encourages the preservation of low-dimensional features when reducing high-dimensional data. We begin by introducing a unifying theoretical framework for data redu"},"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":"1708.06897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-08-23T06:34:06Z","cross_cats_sorted":[],"title_canon_sha256":"68ac69b4b8a5d9f6143095d5bfa237c189e8bd5bc29664abc968f0d8a3d588eb","abstract_canon_sha256":"117585a44d15af4eda1db1f3a8988dd26317565c3c6a746710d787e383baee62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:22.384020Z","signature_b64":"oewhwUhi/eiK6eyY6U0tMBrx3FxN8hswmxcd4KsLGMf4im9kc8t4RFMgiNHaeAII1ESZeclpDlO/fwEJwyuuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99071fe6396f2d1d0a9974d4a7539dd35ed053d74023a1a328f17511d37d5b2c","last_reissued_at":"2026-05-18T00:14:22.383266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:22.383266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projected support points: a new method for high-dimensional data reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Simon Mak, V. Roshan Joseph","submitted_at":"2017-08-23T06:34:06Z","abstract_excerpt":"In an era where big and high-dimensional data is readily available, data scientists are inevitably faced with the challenge of reducing this data for expensive downstream computation or analysis. To this end, we present here a new method for reducing high-dimensional big data into a representative point set, called projected support points (PSPs). A key ingredient in our method is the so-called sparsity-inducing (SpIn) kernel, which encourages the preservation of low-dimensional features when reducing high-dimensional data. We begin by introducing a unifying theoretical framework for data redu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06897","kind":"arxiv","version":2},"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":"1708.06897","created_at":"2026-05-18T00:14:22.383406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06897v2","created_at":"2026-05-18T00:14:22.383406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06897","created_at":"2026-05-18T00:14:22.383406+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEDR7ZRZN4WR","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEDR7ZRZN4WR2CUZ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEDR7ZRZ","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08018","citing_title":"BAMIFun: Bayesian Multiple Imputation for Functional Data","ref_index":166,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N","json":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N.json","graph_json":"https://pith.science/api/pith-number/TEDR7ZRZN4WR2CUZOTKKOU452N/graph.json","events_json":"https://pith.science/api/pith-number/TEDR7ZRZN4WR2CUZOTKKOU452N/events.json","paper":"https://pith.science/paper/TEDR7ZRZ"},"agent_actions":{"view_html":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N","download_json":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N.json","view_paper":"https://pith.science/paper/TEDR7ZRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06897&json=true","fetch_graph":"https://pith.science/api/pith-number/TEDR7ZRZN4WR2CUZOTKKOU452N/graph.json","fetch_events":"https://pith.science/api/pith-number/TEDR7ZRZN4WR2CUZOTKKOU452N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N/action/storage_attestation","attest_author":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N/action/author_attestation","sign_citation":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N/action/citation_signature","submit_replication":"https://pith.science/pith/TEDR7ZRZN4WR2CUZOTKKOU452N/action/replication_record"}},"created_at":"2026-05-18T00:14:22.383406+00:00","updated_at":"2026-05-18T00:14:22.383406+00:00"}