{"as_of":"2026-08-24T02:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3407e9e694c8e68a13138c44daa34b6630ddc648c6a81db8b21d820747fe3991","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:10:41.673483Z","state":"measured"},{"denominator":66,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":66,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.14631/citation-record","integrity":"/paper/2507.14631/integrity","json":"/paper/2507.14631/citation-record.json","paper":"/paper/2507.14631"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:33.024490Z","title":"A robust autoregressive gaussian process motion model usingl1-norm based low-rank kernel matrix approximation,","venue":null,"work_id":"2e82ccaf-ed51-4f44-aac0-1a0f91d10781","year":2014},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.093096Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:0a40a48cc7fd66a8c3bded0ee58f5a93fb05d72633c27a26a42546c3a50226bb","observation_id":"6b4f0337-280b-423c-a6a4-563de37f5d08","resolution":{"observed_at":"2026-08-06T16:11:33.109997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:32.845722Z","title":"Linear-time estimation with tree assumed density filtering and low-rank ap- proximation,","venue":null,"work_id":"dc356090-f568-4a7d-9d99-503e151d8fce","year":2014},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.167783Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:f268c23b69a401c5040da1f0613f8213868c078d9c6ca204ca8be8f35bb75869","observation_id":"246b148b-d547-4dea-a081-619eaa6e45be","resolution":{"observed_at":"2026-08-06T16:11:32.933812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:32.678514Z","title":"A comparative study on PCA and LDA based EMG pattern recognition for anthropomorphic robotic hand,","venue":null,"work_id":"149f216e-b41a-4588-b80b-941c73c74428","year":2014},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.275962Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:9cf78dd77d4d74e9f441913eba8933858a3526a14bd19be0cd13bed3a117ba1d","observation_id":"36d81e90-4cc1-4023-9e6e-f1d575af27eb","resolution":{"observed_at":"2026-08-06T16:11:32.759355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:32.513750Z","title":"Real-time scalable 6dof pose estimation for textureless objects,","venue":null,"work_id":"7ab536d7-2fb3-41c5-a96e-0c2ce390727e","year":2016},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.353009Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:5fea212c1fbc378b384ff4b5e8e9faae305376989aa85faf565321732ab57201","observation_id":"92edb98b-1412-4755-8e5d-96f1e947f48d","resolution":{"observed_at":"2026-08-06T16:11:32.602772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:32.320093Z","title":"Self-localization from images with small overlap,","venue":null,"work_id":"8603de27-9b5d-4220-90dc-c58ef1612f0e","year":2016},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.429395Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:c895b0c9065b5dc4c62d2eb93d040a030f9a56d24ef252236f8d0f646a7b8416","observation_id":"f91721b9-4d92-490b-8f32-ecf3de78923f","resolution":{"observed_at":"2026-08-06T16:11:32.417276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:32.167041Z","title":"Smart-inspect: micro scale localization and classification of smartphone glass defects for industrial automation,","venue":null,"work_id":"4bad1ab3-4814-490f-884f-5c76b100dd14","year":2020},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.527033Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:de7ab6d6458fb0f86446da7e0e9f7bf14a280e7f9e7bae820dbc96da24af3e3a","observation_id":"31375524-447e-4784-9943-de734e8cbe5b","resolution":{"observed_at":"2026-08-06T16:11:32.235121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:31.979251Z","title":"Self-supervised weed detection in vegetable crops using ground based hyperspectral imaging,","venue":null,"work_id":"0d62a735-7b12-4f7c-ad39-1a77d4ce3ef0","year":2016},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.629477Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:57479a32de2b5095a7f42e4d0bfb90a4e6e7424d623ab9d0aa6fd3fba25df66e","observation_id":"a91cb25d-e342-4a8a-8a44-4c74e27c031d","resolution":{"observed_at":"2026-08-06T16:11:32.068517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:31.843161Z","title":"Low rank approximation with entrywise l1-norm error,","venue":null,"work_id":"c00ab4eb-4cef-41b0-9c75-6cd350b9fafc","year":2017},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.748311Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:267ae65f726134382ab17f9c27547861dd0ab078323a44b533cf910f0dc2eda8","observation_id":"bba9dc94-ad89-4553-9f6c-3cd433941427","resolution":{"observed_at":"2026-08-06T16:11:31.909331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:31.697758Z","title":"Tight bounds for sketching the operator norm, schatten norms, and sub- space embeddings,","venue":null,"work_id":"057bdb25-fa41-4b13-8108-e86c4b23000d","year":2016},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.829209Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:35bb3c8b24af59c53c4732987d3c8e4df87237234502bedc31ca921bd849d778","observation_id":"5729de40-ca9c-4c2c-b1e9-b27a1187a8a7","resolution":{"observed_at":"2026-08-06T16:11:31.767675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:31.501220Z","title":"Sampling algorithms and coresets for lp regression,","venue":null,"work_id":"fa610e45-d524-4796-957c-cc39840d5ca4","year":2009},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:35.936500Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:9a4d5295c35da03f4ab25abfd3a1af92022b28b96729203f15006ec322daf644","observation_id":"0842f57f-1be4-4951-ae6e-92e8f65c54a6","resolution":{"observed_at":"2026-08-06T16:11:31.589737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:31.313832Z","title":"Coresets forweighted facilities and their applications,","venue":null,"work_id":"0606026f-5a12-4b81-86a4-c6d523eda99e","year":2006},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.042911Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:d42f542e7b327c8d89b37c6242a782045654648bff42c37c000d0a959d13d9f8","observation_id":"6b30f5db-9014-42d2-8c25-3ff9193342c9","resolution":{"observed_at":"2026-08-06T16:11:31.402565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:31.123146Z","title":"Coresets for near-convex functions,","venue":null,"work_id":"e7d1b17e-b65e-456b-a464-f008e14abe43","year":2020},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.156772Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:5142ce64c86b68184f160d3332497b878ae04f280673be40e4d965938ad2702c","observation_id":"4f3b2437-d5d0-45d7-be05-b7605e15ba36","resolution":{"observed_at":"2026-08-06T16:11:31.215308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:30.929461Z","title":"Tight sensitivity bounds for smaller coresets,","venue":null,"work_id":"b6a4bedf-2456-4da3-b699-63730acf3e0d","year":2020},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.277410Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:0185859d582665e9a9a2582de16d0379d3a8f865396613e1f0bd758354015fa7","observation_id":"f7f8e5ad-6ba8-4198-8038-cc4023251e76","resolution":{"observed_at":"2026-08-06T16:11:31.017838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:30.673719Z","title":"Recent advances in continuous location theory,","venue":null,"work_id":"b748b684-342d-47cf-bec8-c69400079da5","year":1983},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.400553Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:8c5922e1899aa0fadfce862ec0d3dcffdada1f00c7e93847984735178e2d10e9","observation_id":"e0e18f69-034b-4a2e-aa75-b322382fc244","resolution":{"observed_at":"2026-08-06T16:11:30.800996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:30.409437Z","title":"Euclidean constructibility in graph-minimization problems,","venue":null,"work_id":"6314fb8d-6c1d-43cf-bac5-8cf33ef604f7","year":1969},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.472671Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:61772851c079d9f1215650f709b51c45b843f154a5b1df44d59ba089ea4db2a7","observation_id":"6dc36d18-2579-4175-a7ec-f65dd4a3c120","resolution":{"observed_at":"2026-08-06T16:11:30.526141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:30.096624Z","title":"Geometric median in nearly linear time,","venue":null,"work_id":"ff546b01-0130-4727-a536-6ebe5d4b059d","year":2016},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.556190Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:e1e262c0dd6086bb00506c1d000177d341c61763655b36ef7c15a2207a289d53","observation_id":"cb744a41-b4bc-4c6b-b470-7e063d8c6260","resolution":{"observed_at":"2026-08-06T16:11:30.286478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:29.868032Z","title":"Efficient subspace approximation algorithms,","venue":null,"work_id":"6d6099c3-b4b7-4127-9bd6-43ad03cd246b","year":2007},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.656996Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:678c6c62a2411f267ac2ede77a0e10d98ad26824047e433499d8a9f35e1b2c99","observation_id":"87f275c5-8e4d-4744-a5d3-8743ec521a81","resolution":{"observed_at":"2026-08-06T16:11:29.961690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:29.619965Z","title":"Success amplification and random sampling,","venue":null,"work_id":"05e87a29-a5e3-4a4e-9f9f-8789276806e0","year":2005},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.734730Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:6741a2fcd4b8ee9861d30342b7b652afae5b3896736d22077995ca9856d83a21","observation_id":"a53bcea4-99fc-44a3-93f1-ba772741a534","resolution":{"observed_at":"2026-08-06T16:11:29.740743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:29.354339Z","title":"Sampling-based dimension reduction for subspace approximation,","venue":null,"work_id":"96d8891c-a52c-450e-bc0c-a072f1436f91","year":2007},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.817535Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:1750070ccfb95b2e70ce0f7509b7e7a0fdedd4b3bbda9af040bd9151d9d43634","observation_id":"52a84508-868c-4f63-8291-47a32c934187","resolution":{"observed_at":"2026-08-06T16:11:29.481803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:29.117050Z","title":"Coresets and sketches for high di- mensional subspace approximation problems,","venue":null,"work_id":"9dd3bde4-a77f-4261-9f5d-c49a46d626a6","year":2010},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.896212Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:7a0d671b958a9073fc28ee0fa0c30b98cd215b05657b0affc405e095fd6ab345","observation_id":"7be1e2a1-3101-4163-81da-ca4d647e3880","resolution":{"observed_at":"2026-08-06T16:11:29.217754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:28.908068Z","title":"Input sparsity and hardness for robust subspace approximation,","venue":null,"work_id":"fdd1d484-831c-40df-bd17-0e167eb9df4c","year":2015},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:36.933031Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:5728e4e9488e1a3382ef69cb25b9be1d631db449457241e3ea24a29f4110c908","observation_id":"62d7e7ae-933b-4ad5-bc83-e7ff167bf8ca","resolution":{"observed_at":"2026-08-06T16:11:29.006043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:28.642909Z","title":"Optimal algorithms for l1-subspace signal processing,","venue":null,"work_id":"8ffb0fba-9774-4470-89ce-5965f2060cfa","year":2014},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.065998Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:0511d1efebf195ffaf9cdc1b019a06e313fc300f0e7d6d82f7145ae3cf661106","observation_id":"a541c316-8889-4341-91a8-938c0634f855","resolution":{"observed_at":"2026-08-06T16:11:28.771603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:28.377729Z","title":"Algorithms for ℓ p low-rank approximation,","venue":null,"work_id":"1391bca5-a1cb-419b-96db-642413b23b97","year":2017},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.245927Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:777056d621bf58121900ed44510de9944ca6848da0422f8dea401516845e2665","observation_id":"a1049827-42cb-4b75-ade8-d31bd927cd34","resolution":{"observed_at":"2026-08-06T16:11:28.505814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:28.114212Z","title":"Low-rank approximation with 1/ϵ 1/3 matrix-vector products,","venue":null,"work_id":"cc0b4402-5687-4efa-90e5-abf83195b70d","year":2022},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.364012Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:31f4f71868d19209742daf278f23b259398d21be2bf680ac285749f512939ad1","observation_id":"98273218-51e8-477d-94b8-9e91bda23a88","resolution":{"observed_at":"2026-08-06T16:11:28.242160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:27.883659Z","title":"Generalized s-numbers of τ -measurable operators,","venue":null,"work_id":"4fe0f66c-42e4-41d0-9413-34462bf8247d","year":1986},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.469499Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:2ec05ede9ef103acf7c93e36d888b1fdf55f0baf1d9d95e8b3a51e82f669d1f7","observation_id":"10e5d236-2449-40d4-acc6-1a2f994e3c4c","resolution":{"observed_at":"2026-08-06T16:11:27.994758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:27.714934Z","title":"Efficient l1-norm principal-component analysis via bit flipping,","venue":null,"work_id":"976064f4-730f-44c7-9c2d-51c3c0457f93","year":2017},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.557443Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:dd3183b7702f522fc7c71b267afc50a1b78adf87c5074407ee654e2bf510bd6f","observation_id":"29237b42-1fbd-4fef-8c61-60814d8500fb","resolution":{"observed_at":"2026-08-06T16:11:27.801514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:27.486182Z","title":"L1-PCA Toolbox","venue":null,"work_id":"bff7823d-9df9-458a-bad8-4cc894060cb6","year":2025},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.617660Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:c2af66fea1641f49856d0da7f42febfef8a59278a6db6dc020e4431b1fe92932","observation_id":"6c313686-d2c5-45e1-8f89-5ebf8c183cb7","resolution":{"observed_at":"2026-08-06T16:11:27.613557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:27.320001Z","title":"Greenhut and T","venue":null,"work_id":"b850fd23-7da3-4433-9e6c-3faa8224f60a","year":2022},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.683613Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:4327a88364509d49b3415ac9703f83f03f5ffbe05790dc1107ec0f51e87b1816","observation_id":"c77a9d04-f9cd-4741-af8b-01d198fae1e2","resolution":{"observed_at":"2026-08-06T16:11:27.396538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:27.164548Z","title":"On least squares solutions subject to a rank restriction,","venue":null,"work_id":"eaac2882-48ef-4584-a354-34ae9cd86df5","year":2015},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.756315Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:a59b5478b077a1e7faad518e536ae203056105e8767beaadf225aa9d3e50df6f","observation_id":"5c8cb49b-ed01-4047-b13d-113f452d8db4","resolution":{"observed_at":"2026-08-06T16:11:27.236872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:26.975510Z","title":"The monotonicity theorem, cauchy’s interlace theorem, and the courant-fischer theorem,","venue":null,"work_id":"434043eb-fb44-4d3b-b5f2-eda4e8b612fe","year":1987},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.864214Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:06e13583e9eabfcf0aad1a08d230d48cc73a335fa8e5098db15f3e7d638070da","observation_id":"7a7500e4-ed43-4f98-9b8e-9919b9043a71","resolution":{"observed_at":"2026-08-06T16:11:27.048738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:37.966136Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:37.966136Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:d41bf60cc5158a15cd72057db658bed03b931e84a841be3a899111c0854307b9","observation_id":"a2805177-d490-4d7f-9462-b2cecbafd735","resolution":{"observed_at":"2026-08-06T16:10:37.966136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:26.758003Z","title":"Matrix computations, johns hopkins u,","venue":null,"work_id":"50d1dac0-cd19-4052-93a2-ba6c535780cb","year":1996},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.056400Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:3142d1a2e18f86b5cd0c4f0eaf0e3a67585134384f9eed9564c1c75ec8863281","observation_id":"31d8d1da-fb02-4f49-96ac-69ab3c412486","resolution":{"observed_at":"2026-08-06T16:11:26.850173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:26.518213Z","title":"The fundamental theorem of linear programming: extensions and applications,","venue":null,"work_id":"8e8daeac-ade2-4086-87fa-2a4a0b126ad9","year":2011},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.125505Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:6b439c984db18d9a7d86b13d65c027324111b84dea36fddee33ebdc490b46870","observation_id":"8f874d46-42ba-4390-a425-4710e64efa46","resolution":{"observed_at":"2026-08-06T16:11:26.618163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:26.322479Z","title":"Interior point polynomial methods in convex programming,","venue":null,"work_id":"53ed02fd-e586-40df-9138-b865a79b5c73","year":1994},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.234259Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:6ca102c5941248cb22d8736e561a1063aa3d69caf91a5e3cd342ec07cfbcb2e2","observation_id":"a73dd98c-c3a8-45ec-b6a3-5a097f0a258b","resolution":{"observed_at":"2026-08-06T16:11:26.407401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:26.142251Z","title":"Ben-Tal and A","venue":null,"work_id":"8c6aeb1a-c740-476b-a8b8-e4a9af0237b1","year":2001},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.331081Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:28f08e8fc43b7f6c41104fad1ec1b919c011940acdd9a4111f1d4fb5f8ee6a83","observation_id":"d2ae73cb-fdc7-44e0-8bd8-dac063393df3","resolution":{"observed_at":"2026-08-06T16:11:26.213722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:38.443951Z","title":"Beck, First-order methods in optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.443951Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:a77d038f985595a59f612c46fa207a4629213d68d0741b416c16aa4a800ca045","observation_id":"b7c470d1-20aa-4782-a36d-6414c9b5493f","resolution":{"observed_at":"2026-08-06T16:10:38.443951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:38.626233Z","title":"Statlog (Vehicle Silhouettes)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.626233Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:54b8da132620721d88df17efc7198445aa5bb5b0fb2f83af8171af2523f9790f","observation_id":"ddc639bc-38e9-4f5e-a128-34305eeb7faf","resolution":{"observed_at":"2026-08-06T16:10:38.626233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:38.752779Z","title":"Optical Recognition of Handwritten Digits","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.752779Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:7f1c1ce17a2aadbd5cbee75f97c2b57213c5b1e7754a674f91cda9ac03e85c64","observation_id":"0facb7f4-c90f-412b-ab3b-f066709ad79b","resolution":{"observed_at":"2026-08-06T16:10:38.752779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:25.946451Z","title":"Vehicle recognition using rule based methods,","venue":null,"work_id":"c1f5978d-034c-4695-b36c-6e843356db01","year":1987},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:38.903203Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:62819b97d48bcaf7a1189d049225b242add1a106e6eb107c05c0106df8bd246f","observation_id":"b6d50e90-3c40-4314-81a5-7026d1710d84","resolution":{"observed_at":"2026-08-06T16:11:26.018889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:25.792002Z","title":"Methods of combining multiple classifiers and their application to handwritten digit recog- nition,","venue":null,"work_id":"d6bfeecd-8209-4154-8e22-27448b463f90","year":1995},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:39.073086Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:02d8fc4abb0dae022d57962a029d9179318db45f66380135f3a80fd9d15ea0c5","observation_id":"333220b0-9218-4410-82bc-ecbd320531fc","resolution":{"observed_at":"2026-08-06T16:11:25.860178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:25.613884Z","title":"L1-Norm-Algorithms","venue":null,"work_id":"825ca560-7266-4fc1-b47d-683d24a94c2f","year":2021},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:39.172922Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:43bab3b37d223e1b823661dc10368ec34e97031c4164bce39c4bd126aa3b1c1b","observation_id":"08dd0fea-40e1-4deb-959e-edc76c26c163","resolution":{"observed_at":"2026-08-06T16:11:25.704701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:25.466873Z","title":"Breakdown points of affine equivariant estimators of multivariate location and covariance matrices,","venue":null,"work_id":"7e0e0486-a2f1-4e07-8906-4a091f2da502","year":1991},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:39.378231Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:bb168b290a699a0685f28109695583894678a3a147de999668d7639dfd146519","observation_id":"afc2f152-d451-4b34-800c-31885bb273bc","resolution":{"observed_at":"2026-08-06T16:11:25.532613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:25.285431Z","title":"Liii. on lines and planes of closest fit to systems of points in space,","venue":null,"work_id":"d875c56e-5753-4fc4-addf-b01307a9eb1e","year":1901},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:39.548549Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:72fae64defedc6820b88bc570d21b883815e50aa4eac04a2325d949220b0aa5a","observation_id":"34f5bb2f-8d45-4010-820a-96b241c2c0c5","resolution":{"observed_at":"2026-08-06T16:11:25.391406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:25.033695Z","title":"Some options for l1-subspace signal processing,","venue":null,"work_id":"4d630c04-82e7-4775-915e-33d3c5db9c77","year":2013},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:39.627882Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:693994f7a2e33030cda95eced6e14abce6902380f8b0af5a3c1d199d22ba447e","observation_id":"36784fd0-adc3-46b5-84da-e06fd5ccc486","resolution":{"observed_at":"2026-08-06T16:11:25.164697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:24.824736Z","title":"An independent benchmarking of sdp and socp solvers,","venue":null,"work_id":"1e45f9a1-db3d-4cd9-9681-4f36bcd5650f","year":2003},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:39.775979Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:fbf436b944804575c8735ca0f03c0532435662ab85e5c403f8c3b9555f6657b9","observation_id":"7fddc05c-82f4-4424-b045-43fe85702ff0","resolution":{"observed_at":"2026-08-06T16:11:24.919114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:24.710909Z","title":"Mixed sdp/socp moment relaxations of the optimal power flow problem,","venue":null,"work_id":"344dd772-6c3b-45e1-b675-242fdd37e4a8","year":2015},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:39.903796Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:39f0e3674e9d7b4fec8cf9e8f931040fb4043fb26d3d1a1684b3930d3dee7479","observation_id":"6f827e79-c591-4a87-a39d-8c7dd2c2aaac","resolution":{"observed_at":"2026-08-06T16:11:24.782749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:24.509730Z","title":"R1-PAC: rotational invariantL1-norm principal component anal- ysis for robust subspace factorization,","venue":null,"work_id":"e7438bda-8dab-4133-bf65-3b246680c50e","year":2006},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.026757Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:80a58fc9dbd522d75a270179a48389c3c7010df1df481de944a6bb6c74c7f865","observation_id":"dec46efd-8513-45d3-904b-f1d7362c52c7","resolution":{"observed_at":"2026-08-06T16:11:24.620236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:24.289399Z","title":"Bi-criteria linear-time approximations for general- ized k-mean/median/center,","venue":null,"work_id":"710ec749-c0f7-4b1e-b0cb-e7c41abf1667","year":2007},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.196530Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:76d7c991eee9c4a914f1def31d0d108402febd75617bb2323a6bf025e2a20c6e","observation_id":"4e10c144-3635-4bed-b809-1f3a81603a9c","resolution":{"observed_at":"2026-08-06T16:11:24.411171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:24.121814Z","title":"The abel–ruffini theorem: Complex but not complicated,","venue":null,"work_id":"cce916c1-298a-48ba-8780-d81cceff15db","year":2022},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.254325Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:1a4a1fb2b4cf20038401d9336fe155261379c5f1fd26872ae5b6750f63d383a1","observation_id":"0759f5b3-98f8-4d10-88e8-4fd80ccd4b78","resolution":{"observed_at":"2026-08-06T16:11:24.209350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:23.968132Z","title":"Improved approximation algorithms for large matrices via random projections,","venue":null,"work_id":"d52ea336-9c51-40e2-93fd-61cd0365666a","year":2006},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.315055Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:c66e082263bd04682b3b9db7df27d174a5639429233339a03ee912b67816fc93","observation_id":"f1d3badb-25f9-4c45-958e-89660da42f2e","resolution":{"observed_at":"2026-08-06T16:11:24.045459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.8802","last_updated":"2014-10-31T16:46:36Z","snapshot_observed_at":"2026-08-14T23:13:27.241617Z","submitted_at":"2014-10-31T16:46:36Z","title":"Low Rank Matrix Approximation in Linear Time","version":1},"cited_work":{"arxiv_id":"1410.8802","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.8802","snapshot_observed_at":"2026-08-06T16:10:41.815681Z","title":"Low Rank Matrix Approximation in Linear Time","venue":"cs.CG","work_id":"a8995638-5750-4c4c-af45-943c285ca3f1","year":2014},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.388253Z"},"links":{"cited_paper":"/paper/1410.8802","citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:a006a635de3b3c8331596068c7d06f218dae2c281cd77a1e47b56ee07328e88b","observation_id":"29ea1201-368c-40dd-98e3-5bcb83976ea6","resolution":{"observed_at":"2026-08-06T16:10:41.866363Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:23.791381Z","title":"Adaptive sampling and fast low-rank matrix approximation,","venue":null,"work_id":"0e9566a4-396a-416a-82ac-31b635a01b6d","year":2006},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.493871Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:c3f9760450282ad2032ad0989bdeabf77fb965127aab7ef5b2307788bb0f1fdc","observation_id":"52daebb5-95a5-48ae-a286-f5ca6bb59095","resolution":{"observed_at":"2026-08-06T16:11:23.862915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:23.622705Z","title":"Matrix approximation and projective clustering via volume sampling,","venue":null,"work_id":"843ab2cc-39bb-4e06-af2f-dfdbde6bc6ed","year":2006},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.613984Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:8f1a40452ceb37fc08312fee6f6a66c5af370471d2ce94f0688b34cf6359f488","observation_id":"e942d67e-3380-480b-8b73-cc196d67ebe6","resolution":{"observed_at":"2026-08-06T16:11:23.719878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:23.489549Z","title":"Polynomial time algorithm for column-row based relative-error low-rank matrix approximation,","venue":null,"work_id":"a6b04e3b-e06c-404b-9a85-1c1d989f5eae","year":2006},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.707009Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:75f6885aa48cf1909765383aa7f9a77c1dd8819bc2c9f6dddebb8af4032c15b6","observation_id":"9d6cf813-d6ba-45fe-b158-e9afba23838c","resolution":{"observed_at":"2026-08-06T16:11:23.512594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:23.305346Z","title":"Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix,","venue":null,"work_id":"0ad067be-d5f1-4d9f-bacf-11d9b357503a","year":2006},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.786611Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:81d53af2de52bbce68841cc10c6f395a2f99e53462a293cc600e60b329a1bad0","observation_id":"2bcf18ff-77ba-45fd-87f6-cf00dcfb489c","resolution":{"observed_at":"2026-08-06T16:11:23.356707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:23.172446Z","title":"The complexity of the matrix eigenproblem,","venue":null,"work_id":"73f3fbd7-f2a6-472f-be87-81a8ec4eb98a","year":1999},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.863135Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:83a5089e2281aa901088ca0683cfa8e6b556bc8890fbc3fd6aebdfb43ee61c1c","observation_id":"0a2d7445-cd27-4e54-b0d4-96a054865405","resolution":{"observed_at":"2026-08-06T16:11:23.244812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:23.092440Z","title":"Complexity of finding the eigendecomposition of a matrix","venue":null,"work_id":"ce2e1489-8fe2-45c1-8e95-f6f57ee12bb8","year":2024},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:40.958837Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:24a369d18963a685f7002c972e9f84e653d5126a6aca66bf1b309db7b5088c50","observation_id":"22db2b7a-4c06-4817-a684-3a3c4e958872","resolution":{"observed_at":"2026-08-06T16:11:23.103795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:22.920506Z","title":"Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering,","venue":null,"work_id":"280157a9-668b-40a3-a9ba-fca5a367c261","year":2020},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.033763Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:60d60105d7f2a07507ec513db791c58b4e80bcdd49c42bde5a7b42df1b178866","observation_id":"636c903a-28f5-45f5-81a0-b0078dd31813","resolution":{"observed_at":"2026-08-06T16:11:22.991528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:22.598222Z","title":"Gr¨ otschel, L","venue":null,"work_id":"143f4750-dda3-4b80-b2e2-184f21b7519d","year":2012},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.091081Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:a201027ceacc169e7d9445ff3a85f5b9133b39cc3c36c5e00b41b4bb1765fc4a","observation_id":"e09c6b81-5ae8-42e2-ab59-e865a50e87c9","resolution":{"observed_at":"2026-08-06T16:11:22.755746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:11:22.233426Z","title":"Mathematical problems for the next century,","venue":null,"work_id":"65abc483-bcaf-49c1-beb7-551c40e6ba8b","year":1998},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.156585Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:0314220084b62bc7bc14659fca717f74df482881deea519b46176af4f9c55044","observation_id":"c0badd7c-e649-4f5f-b149-39b67b8e7663","resolution":{"observed_at":"2026-08-06T16:11:22.455473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:43.546030Z","title":"Approximating the radii of point sets,","venue":null,"work_id":"f7c5764a-ee9a-47ab-98ca-df516a3c3cad","year":2007},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.263206Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:da0266edc75aeea3b28710e7b214b2b1e8157809e08802a3e4cff4033523c084","observation_id":"05adde02-2856-4a8b-8942-b44a0a5f128e","resolution":{"observed_at":"2026-08-06T16:11:22.157422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:42.856205Z","title":"Algorithms and hardness for subspace approximation,","venue":null,"work_id":"a746d296-290c-41b6-b5e5-530b87f91761","year":2011},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.327509Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:a450b45d1c02beb37d0e3e3ad499cd3520d1842af84b7e64f3157ff4be55c2aa","observation_id":"eb361c51-e224-4a19-a035-c1165099a7d9","resolution":{"observed_at":"2026-08-06T16:10:43.248726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.00889","last_updated":"2022-09-18T13:42:11Z","snapshot_observed_at":"2026-08-14T21:27:20.200969Z","submitted_at":"2016-12-02T23:04:16Z","title":"New Frameworks for Offline and Streaming Coreset Constructions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.00889","snapshot_observed_at":"2026-08-06T16:10:41.413123Z","title":"New frameworks for offline and streaming coreset constructions,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.413123Z"},"links":{"cited_paper":"/paper/1612.00889","citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:2341346a40a57fb51ce2e641f748e0461af97a889cf8b9c3ae9a89a41fb5db22","observation_id":"aacf1269-c2a8-403e-ba0f-6aca84e6d24f","resolution":{"observed_at":"2026-08-06T16:10:41.413123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:42.310275Z","title":"Dimensionality reduction for the sum-of-distances metric,","venue":null,"work_id":"cd1b9174-cad0-4517-85c9-2b4bf6ee5ac3","year":2021},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.493603Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:7014886511511336cf656917eb41cafede41e154069e2f358a1df24210a81c2d","observation_id":"c3259a47-dc6c-480c-9133-1a9580996471","resolution":{"observed_at":"2026-08-06T16:10:42.477189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:42.082422Z","title":"Strong coresets for k-median and subspace approximation: Goodbye dimension,","venue":null,"work_id":"ef6da421-814b-4167-9d5c-7048fb2009da","year":2018},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.585343Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:5e1a4e5ec689cbb4e6fa6e367feab971578dbae52dec58fae7c8fbef9f676652","observation_id":"654f0e91-65e1-40eb-8399-c764eccaa937","resolution":{"observed_at":"2026-08-06T16:10:42.173397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:10:41.946034Z","title":"Improved coresets and sublinear algorithms for power means in Euclidean spaces,","venue":null,"work_id":"9645912d-2984-4858-8b62-d9f74ce4324a","year":2021},"citing_paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:41.673483Z"},"links":{"citing_paper":"/paper/2507.14631"},"observation_digest":"sha256:0f0adb2667d6e7e07310b2c1d0c9889a25e6eb674f18c3cd64bc68390f7b40d3","observation_id":"9ddc618a-c0ca-4c9c-b6e2-c7631d8a1d53","resolution":{"observed_at":"2026-08-06T16:10:42.009096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.14631","last_updated":"2025-07-19T14:00:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:33:07.600231Z","submitted_at":"2025-07-19T14:00:50Z","title":"$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":60},"total_outbound_references":66},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:2507.14631."}