{"as_of":"2026-08-06T20:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f377d3d540b3f305366c9401590dac9cdc360f70e9668e4e8bf98a024c7073ef","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-06T06:34:29.942622+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-06T15:49:02.410570Z","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:52074597724799cf6bec0adb841c5325d794c266eecbb3d866cdfb45ca7fbb98","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:fa3d3da882433c5c5db359e8a9c30b3e03f463a6301e6bd1467b622dbf6850bb","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:4b7d8566f4198ab986756028b06731802fd1d591090e60141980f794abc30550","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:27fff81093ccd22e9f6d8aca4880fb887e8ad7facf5e753d9c31a479926ca7fc","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:73c078d514722858f69c9c0ef69b80d096189671d07b30ee7f1821f269f13085","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:f06a19a1bd6b1278388fde52047e4ca204c7f11c199c9c33e188076701f94838","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:dbd6eae26c070fc650e83a5f2e9af770c33713b232ed6111201cb180d298f33f","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:83deffae936ea54e5095c1534d65a5a0ea570960a748225e21ca3eeed4c47b34","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:4530b7451b99528789d021c255ce18e3688b3c970c21162016a8a9a5f6d078af","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:a811e363fc46e17666102e45b774aa05082e5aff8926ac2e6e8788d0cd4773f9","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:4426df8494b16bffd1e6620899d7c3afcd78ef4ad1c9d80268b18e02872bd819","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:951e75e3756a5770cb4b0854735edefb8fb6bb0d1b685b92608890781e263f00","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:71ee27c73ec6ba742a69200beabb28908add69515ab8d7104887500e234a54bd","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:459a2f67feb7f9d66444bdfd7b1edfe6d49b7819349c6605d138f9c8de7ff814","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:f0fec713685e59c7373e36b03973d57b3836e1e5438f2d8b6e2a2ba22177ee1e","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:59827c10a1e706298416dc9d7596505ca74bd19a39a60dcbe23cf2cdf7f03d51","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:e64926d291e5e2e90525a5b249b4525c8e68f68b6960c1109fa1c75a6b14f761","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:7e8fad585a22d5c4f77a3c4fcc0999d6556f42995937895a463f32ddfb95dccf","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:c4c09ecc374916ad28560049c471af290454b1815d936600d5669360637b478b","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:3935349d3dd16fe952437eeb2b90b60c276790e3a7466e4fae3cea5b87e803b2","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:5feeaf0f4092afda6791d18b6e15078a81f3f33270aa87d6926d6e8e36db7dbe","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:626281a5beadbf1a39fedfe6e037ac7903bd79e296863ef9cd3f0443c5ca0915","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:c62c039a6382e6a97102075ccf50ad272036da10ecf47606062557e4ad44da29","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:e48023f1e0b33ef280da06492469dd93376e9214c5814c9a4aa53490631f5dfa","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:025a06622bf4dd942176f6b074588917fdaa753094b03e76b01eb7ea80653d98","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:bb2762a137bd00f14005da9331e9c5059e9ea9ba0c87c8123d2232c63f7114c8","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:7fd10983bf04ba70c3807aecbbd7c70b9fd697f4e0bc1cd1fb417683eaff43be","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:6c9431bcd7a4e96bcd9aafa3fa9cbf037f67aa448e269ed43f268268e06bae08","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:7b19b5d77373348d60a032d84524eb0eb6eaf10b9d1e2cce5179057259985759","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:78a81c91b6b7c19c8f21d323dc1f38997197940a436a2ace83019564c662c1e8","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:5ee837e727bd55be522c31e4c00e31bc5d34db28c0bd90215f41251a29aecbfb","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-06T15:49:02.410570Z","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:497b2eaf766d8f96afecb5e0f850be499284e2da28cd1a515a94d9a60d9f6fbe","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:af873a93081f6e89b406f6e498fcb674ac73751221d4c781f3869fa3c37fdcba","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:3370e33227ede18c6627031d1a77e516f58587f66810c0d76394b0246be610ac","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:9c99a1b8bf9f28269819b8d692c35ca2f28cf97f0c4bff030264bab182fb2801","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:8ecd596185f6ca89c192c0e624243834b28b0bdf555866bf66defda7b9e7e3a5","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-06T15:49:02.410570Z","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:10e8e3cfce03594d42ffe1a62e8eac13b9c2be5ae542a8308b377c49e71d0018","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-06T15:49:02.410570Z","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:ed5ba15527f6104c5d2581c06c39d60abb5309b0476176d41463e32a90990144","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-06T15:49:02.410570Z","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:55046687c5729b407ba7f92b9942120ab76c60a2087dce12b0e155deba528294","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:1833b25d1de6ccc0dc6d449d8eb5295bf41fbd71cdb03bb2936323db98f5a128","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:ea2d8126f8aebcdda96a31d9c1856729766c2f5d2525ddc02d094b932d3f13aa","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:31cdbcfa1ff3991ce44e55aede5c4d629982d405d8e6ad8abb2dcd28b214dc01","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:bb859a91178afa8777a4d5584dd36dbaddd6bb86d0a0afb18e08a962c1e3592a","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:94356cdd4398622f926b686f604e48ce91b2e4caf4afda43988259349a600cf8","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:82761b946c9e647c324d31789f67a020fa2930846513450345c6c8676e3c78bf","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:750aa8bdaac50405ee714b3c620b344addb2c4018bc6c2052b0962edd3325dd6","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:9d1f2dbeda66c8761997d251be8e37f58b8d290c290438d9b80998e89f0f27bb","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:d95d61b685fe5e940b0c583c7ec75dafc3cbdb21a4fe8ab070c91dc5ed5597ab","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:ae0217a47f38bdfd37409d60d88078266ac7a607a28098c18684bcf18b17a123","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:fcc4f948ec32fe2309e95a03a182241e4075fb18c6c8bc117fd25298636a0163","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-06T03:59:10.667719Z","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-06T15:49:02.410570Z","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:741efb274592f2c5221008471c5945c3556b19009d47d702596cabb53d428f84","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:32f1993549a4c4ea074495dc1a179b0366e3f21c8a3f5e669e29031f7f0eef5f","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:76783329b621803defa8993282ffa5453caafec76777243cbb92212bb6867157","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:3de7410e5bd1c86bcbd49620230e0d54ac11068b86760e080475101f080a8212","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:18ca05e6fe5435b84a922db545c0b78fb85db30af3286cc605fa397650868299","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:50fdf94257cef0d9a45072c934ab8b7652e9e53f4df9fe755f33c06f9b62f22a","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:c92302e187d483797fe3b9afa1750a38ecab86f878259915966bfc70d92a35df","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:7924a5b2331caf74ba426b97be4108f17d135f26069792f441253639e9124938","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:733bf5eb4ed67093c7c019c064c29402e29047d85f13b0abddf96a1e139c9a21","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:ae0bd3958f7e29170e0b82fe8b35894b8359df1069cb67af66027f48a01c53b3","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:874c9cb903603570486abe8f0910506561cfeec1f4a75d1a255364f462fe4b97","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:5d85093204183109f216188dd9a664f517d1d2a26423ce9971a9ca4355e61903","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-04T15:16:32.774531Z","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-06T15:49:02.410570Z","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:cf4bbd2e94ef01acf069befae74d7b2d8324133707783ee9561cc67b340d8588","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-06T15:49:02.410570Z","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:e71979f4d49fa2ad4018f476251326d58a37f5ae40ece8d43899d19117f2cd08","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:e6086af95efa4c1a920e739cbf69dffd94833ae5ac80a3c9da3b248e822732a6","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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:f83539471cb78d2ea266795fe13098c727811515972b22583ddbcc8f3a6b50fc","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06T15:49:02.410570Z","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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 0 inbound Pith citation observations for arXiv:2507.14631."}