Pith. sign in

Paper Citation Record · LEDGER

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2507.14631 v1

Coverage vector

measured 66 of 66 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:10:41.673483Z

measured 66 of 66 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

66 of 66 outbound references displayed

  • verified exact1
  • verified fuzzy60
  • unresolved5
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6b4f0337-280b-423c-a6a4-563de37f5d08 · outbound

This paper cites A robust autoregressive gaussian process motion model usingl1-norm based low-rank kernel matrix approximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation A robust autoregressive gaussian process motion model usingl1-norm based low-rank kernel matrix approximation,

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:33.109997Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.093096Z digest=sha256:0a40a48cc7fd66a8c3bded0ee58f5a93fb05d72633c27a26a42546c3a50226bb

Observation 246b148b-d547-4dea-a081-619eaa6e45be · outbound

This paper cites Linear-time estimation with tree assumed density filtering and low-rank ap- proximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Linear-time estimation with tree assumed density filtering and low-rank ap- proximation,

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:32.933812Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.167783Z digest=sha256:f268c23b69a401c5040da1f0613f8213868c078d9c6ca204ca8be8f35bb75869

Observation 36d81e90-4cc1-4023-9e6e-f1d575af27eb · outbound

This paper cites A comparative study on PCA and LDA based EMG pattern recognition for anthropomorphic robotic hand,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation A comparative study on PCA and LDA based EMG pattern recognition for anthropomorphic robotic hand,

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:32.759355Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.275962Z digest=sha256:9cf78dd77d4d74e9f441913eba8933858a3526a14bd19be0cd13bed3a117ba1d

Observation 92edb98b-1412-4755-8e5d-96f1e947f48d · outbound

This paper cites Real-time scalable 6dof pose estimation for textureless objects,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Real-time scalable 6dof pose estimation for textureless objects,

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:32.602772Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.353009Z digest=sha256:5fea212c1fbc378b384ff4b5e8e9faae305376989aa85faf565321732ab57201

Observation f91721b9-4d92-490b-8f32-ecf3de78923f · outbound

This paper cites Self-localization from images with small overlap,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Self-localization from images with small overlap,

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:32.417276Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.429395Z digest=sha256:c895b0c9065b5dc4c62d2eb93d040a030f9a56d24ef252236f8d0f646a7b8416

Observation 31375524-447e-4784-9943-de734e8cbe5b · outbound

This paper cites Smart-inspect: micro scale localization and classification of smartphone glass defects for industrial automation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Smart-inspect: micro scale localization and classification of smartphone glass defects for industrial automation,

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:32.235121Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.527033Z digest=sha256:de7ab6d6458fb0f86446da7e0e9f7bf14a280e7f9e7bae820dbc96da24af3e3a

Observation a91cb25d-e342-4a8a-8a44-4c74e27c031d · outbound

This paper cites Self-supervised weed detection in vegetable crops using ground based hyperspectral imaging,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Self-supervised weed detection in vegetable crops using ground based hyperspectral imaging,

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:32.068517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.629477Z digest=sha256:57479a32de2b5095a7f42e4d0bfb90a4e6e7424d623ab9d0aa6fd3fba25df66e

Observation bba9dc94-ad89-4553-9f6c-3cd433941427 · outbound

This paper cites Low rank approximation with entrywise l1-norm error,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Low rank approximation with entrywise l1-norm error,

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:31.909331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.748311Z digest=sha256:267ae65f726134382ab17f9c27547861dd0ab078323a44b533cf910f0dc2eda8

Observation 5729de40-ca9c-4c2c-b1e9-b27a1187a8a7 · outbound

This paper cites Tight bounds for sketching the operator norm, schatten norms, and sub- space embeddings,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Tight bounds for sketching the operator norm, schatten norms, and sub- space embeddings,

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:31.767675Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.829209Z digest=sha256:35bb3c8b24af59c53c4732987d3c8e4df87237234502bedc31ca921bd849d778

Observation 0842f57f-1be4-4951-ae6e-92e8f65c54a6 · outbound

This paper cites Sampling algorithms and coresets for lp regression,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Sampling algorithms and coresets for lp regression,

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:31.589737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:35.936500Z digest=sha256:9a4d5295c35da03f4ab25abfd3a1af92022b28b96729203f15006ec322daf644

Observation 6b30f5db-9014-42d2-8c25-3ff9193342c9 · outbound

This paper cites Coresets forweighted facilities and their applications,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Coresets forweighted facilities and their applications,

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:31.402565Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.042911Z digest=sha256:d42f542e7b327c8d89b37c6242a782045654648bff42c37c000d0a959d13d9f8

Observation 4f3b2437-d5d0-45d7-be05-b7605e15ba36 · outbound

This paper cites Coresets for near-convex functions,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Coresets for near-convex functions,

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:31.215308Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.156772Z digest=sha256:5142ce64c86b68184f160d3332497b878ae04f280673be40e4d965938ad2702c

Observation f7f8e5ad-6ba8-4198-8038-cc4023251e76 · outbound

This paper cites Tight sensitivity bounds for smaller coresets,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Tight sensitivity bounds for smaller coresets,

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:31.017838Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.277410Z digest=sha256:0185859d582665e9a9a2582de16d0379d3a8f865396613e1f0bd758354015fa7

Observation e0e18f69-034b-4a2e-aa75-b322382fc244 · outbound

This paper cites Recent advances in continuous location theory,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Recent advances in continuous location theory,

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:30.800996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.400553Z digest=sha256:8c5922e1899aa0fadfce862ec0d3dcffdada1f00c7e93847984735178e2d10e9

Observation 6dc36d18-2579-4175-a7ec-f65dd4a3c120 · outbound

This paper cites Euclidean constructibility in graph-minimization problems,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Euclidean constructibility in graph-minimization problems,

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:30.526141Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.472671Z digest=sha256:61772851c079d9f1215650f709b51c45b843f154a5b1df44d59ba089ea4db2a7

Observation cb744a41-b4bc-4c6b-b470-7e063d8c6260 · outbound

This paper cites Geometric median in nearly linear time,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Geometric median in nearly linear time,

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:30.286478Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.556190Z digest=sha256:e1e262c0dd6086bb00506c1d000177d341c61763655b36ef7c15a2207a289d53

Observation 87f275c5-8e4d-4744-a5d3-8743ec521a81 · outbound

This paper cites Efficient subspace approximation algorithms,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Efficient subspace approximation algorithms,

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:29.961690Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.656996Z digest=sha256:678c6c62a2411f267ac2ede77a0e10d98ad26824047e433499d8a9f35e1b2c99

Observation a53bcea4-99fc-44a3-93f1-ba772741a534 · outbound

This paper cites Success amplification and random sampling,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Success amplification and random sampling,

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:29.740743Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.734730Z digest=sha256:6741a2fcd4b8ee9861d30342b7b652afae5b3896736d22077995ca9856d83a21

Observation 52a84508-868c-4f63-8291-47a32c934187 · outbound

This paper cites Sampling-based dimension reduction for subspace approximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Sampling-based dimension reduction for subspace approximation,

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:29.481803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.817535Z digest=sha256:1750070ccfb95b2e70ce0f7509b7e7a0fdedd4b3bbda9af040bd9151d9d43634

Observation 7be1e2a1-3101-4163-81da-ca4d647e3880 · outbound

This paper cites Coresets and sketches for high di- mensional subspace approximation problems,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Coresets and sketches for high di- mensional subspace approximation problems,

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:29.217754Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.896212Z digest=sha256:7a0d671b958a9073fc28ee0fa0c30b98cd215b05657b0affc405e095fd6ab345

Observation 62d7e7ae-933b-4ad5-bc83-e7ff167bf8ca · outbound

This paper cites Input sparsity and hardness for robust subspace approximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Input sparsity and hardness for robust subspace approximation,

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:29.006043Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:36.933031Z digest=sha256:5728e4e9488e1a3382ef69cb25b9be1d631db449457241e3ea24a29f4110c908

Observation a541c316-8889-4341-91a8-938c0634f855 · outbound

This paper cites Optimal algorithms for l1-subspace signal processing,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Optimal algorithms for l1-subspace signal processing,

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:28.771603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.065998Z digest=sha256:0511d1efebf195ffaf9cdc1b019a06e313fc300f0e7d6d82f7145ae3cf661106

Observation a1049827-42cb-4b75-ade8-d31bd927cd34 · outbound

This paper cites Algorithms for ℓ p low-rank approximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Algorithms for ℓ p low-rank approximation,

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:28.505814Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.245927Z digest=sha256:777056d621bf58121900ed44510de9944ca6848da0422f8dea401516845e2665

Observation 98273218-51e8-477d-94b8-9e91bda23a88 · outbound

This paper cites Low-rank approximation with 1/ϵ 1/3 matrix-vector products,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Low-rank approximation with 1/ϵ 1/3 matrix-vector products,

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:28.242160Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.364012Z digest=sha256:31f4f71868d19209742daf278f23b259398d21be2bf680ac285749f512939ad1

Observation 10e5d236-2449-40d4-acc6-1a2f994e3c4c · outbound

This paper cites Generalized s-numbers of τ -measurable operators,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Generalized s-numbers of τ -measurable operators,

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:27.994758Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.469499Z digest=sha256:2ec05ede9ef103acf7c93e36d888b1fdf55f0baf1d9d95e8b3a51e82f669d1f7

Observation 29237b42-1fbd-4fef-8c61-60814d8500fb · outbound

This paper cites Efficient l1-norm principal-component analysis via bit flipping,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Efficient l1-norm principal-component analysis via bit flipping,

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:27.801514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.557443Z digest=sha256:dd3183b7702f522fc7c71b267afc50a1b78adf87c5074407ee654e2bf510bd6f

Observation 6c313686-d2c5-45e1-8f89-5ebf8c183cb7 · outbound

This paper cites L1-PCA Toolbox.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation L1-PCA Toolbox

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:27.613557Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.617660Z digest=sha256:c2af66fea1641f49856d0da7f42febfef8a59278a6db6dc020e4431b1fe92932

Observation c77a9d04-f9cd-4741-af8b-01d198fae1e2 · outbound

This paper cites Greenhut and T.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Greenhut and T

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:27.396538Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.683613Z digest=sha256:4327a88364509d49b3415ac9703f83f03f5ffbe05790dc1107ec0f51e87b1816

Observation 5c8cb49b-ed01-4047-b13d-113f452d8db4 · outbound

This paper cites On least squares solutions subject to a rank restriction,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation On least squares solutions subject to a rank restriction,

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:27.236872Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.756315Z digest=sha256:a59b5478b077a1e7faad518e536ae203056105e8767beaadf225aa9d3e50df6f

Observation 7a7500e4-ed43-4f98-9b8e-9919b9043a71 · outbound

This paper cites The monotonicity theorem, cauchy’s interlace theorem, and the courant-fischer theorem,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation The monotonicity theorem, cauchy’s interlace theorem, and the courant-fischer theorem,

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:27.048738Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:37.864214Z digest=sha256:06e13583e9eabfcf0aad1a08d230d48cc73a335fa8e5098db15f3e7d638070da

Observation a2805177-d490-4d7f-9462-b2cecbafd735 · outbound

This paper cites an unresolved cited work.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Unresolved cited work

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-06T16:10:37.966136Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T16:10:37.966136Z digest=sha256:d41bf60cc5158a15cd72057db658bed03b931e84a841be3a899111c0854307b9

Observation 31d8d1da-fb02-4f49-96ac-69ab3c412486 · outbound

This paper cites Matrix computations, johns hopkins u,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Matrix computations, johns hopkins u,

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:26.850173Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:38.056400Z digest=sha256:3142d1a2e18f86b5cd0c4f0eaf0e3a67585134384f9eed9564c1c75ec8863281

Observation 8f874d46-42ba-4390-a425-4710e64efa46 · outbound

This paper cites The fundamental theorem of linear programming: extensions and applications,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation The fundamental theorem of linear programming: extensions and applications,

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:26.618163Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:38.125505Z digest=sha256:6b439c984db18d9a7d86b13d65c027324111b84dea36fddee33ebdc490b46870

Observation a73dd98c-c3a8-45ec-b6a3-5a097f0a258b · outbound

This paper cites Interior point polynomial methods in convex programming,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Interior point polynomial methods in convex programming,

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:26.407401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:38.234259Z digest=sha256:6ca102c5941248cb22d8736e561a1063aa3d69caf91a5e3cd342ec07cfbcb2e2

Observation d2ae73cb-fdc7-44e0-8bd8-dac063393df3 · outbound

This paper cites Ben-Tal and A.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Ben-Tal and A

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:26.213722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:38.331081Z digest=sha256:28f08e8fc43b7f6c41104fad1ec1b919c011940acdd9a4111f1d4fb5f8ee6a83

Observation b7c470d1-20aa-4782-a36d-6414c9b5493f · outbound

This paper cites Beck, First-order methods in optimization.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Beck, First-order methods in optimization

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-06T16:10:38.443951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T16:10:38.443951Z digest=sha256:a77d038f985595a59f612c46fa207a4629213d68d0741b416c16aa4a800ca045

Observation ddc639bc-38e9-4f5e-a128-34305eeb7faf · outbound

This paper cites Statlog (Vehicle Silhouettes).

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Statlog (Vehicle Silhouettes)

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-06T16:10:38.626233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T16:10:38.626233Z digest=sha256:54b8da132620721d88df17efc7198445aa5bb5b0fb2f83af8171af2523f9790f

Observation 0facb7f4-c90f-412b-ab3b-f066709ad79b · outbound

This paper cites Optical Recognition of Handwritten Digits.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Optical Recognition of Handwritten Digits

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-06T16:10:38.752779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T16:10:38.752779Z digest=sha256:7f1c1ce17a2aadbd5cbee75f97c2b57213c5b1e7754a674f91cda9ac03e85c64

Observation b6d50e90-3c40-4314-81a5-7026d1710d84 · outbound

This paper cites Vehicle recognition using rule based methods,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Vehicle recognition using rule based methods,

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:26.018889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:38.903203Z digest=sha256:62819b97d48bcaf7a1189d049225b242add1a106e6eb107c05c0106df8bd246f

Observation 333220b0-9218-4410-82bc-ecbd320531fc · outbound

This paper cites Methods of combining multiple classifiers and their application to handwritten digit recog- nition,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Methods of combining multiple classifiers and their application to handwritten digit recog- nition,

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:25.860178Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:39.073086Z digest=sha256:02d8fc4abb0dae022d57962a029d9179318db45f66380135f3a80fd9d15ea0c5

Observation 08dd0fea-40e1-4deb-959e-edc76c26c163 · outbound

This paper cites L1-Norm-Algorithms.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation L1-Norm-Algorithms

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:25.704701Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:39.172922Z digest=sha256:43bab3b37d223e1b823661dc10368ec34e97031c4164bce39c4bd126aa3b1c1b

Observation afc2f152-d451-4b34-800c-31885bb273bc · outbound

This paper cites Breakdown points of affine equivariant estimators of multivariate location and covariance matrices,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Breakdown points of affine equivariant estimators of multivariate location and covariance matrices,

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:25.532613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:39.378231Z digest=sha256:bb168b290a699a0685f28109695583894678a3a147de999668d7639dfd146519

Observation 34f5bb2f-8d45-4010-820a-96b241c2c0c5 · outbound

This paper cites Liii. on lines and planes of closest fit to systems of points in space,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Liii. on lines and planes of closest fit to systems of points in space,

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:25.391406Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:39.548549Z digest=sha256:72fae64defedc6820b88bc570d21b883815e50aa4eac04a2325d949220b0aa5a

Observation 36784fd0-adc3-46b5-84da-e06fd5ccc486 · outbound

This paper cites Some options for l1-subspace signal processing,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Some options for l1-subspace signal processing,

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:25.164697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:39.627882Z digest=sha256:693994f7a2e33030cda95eced6e14abce6902380f8b0af5a3c1d199d22ba447e

Observation 7fddc05c-82f4-4424-b045-43fe85702ff0 · outbound

This paper cites An independent benchmarking of sdp and socp solvers,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation An independent benchmarking of sdp and socp solvers,

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:24.919114Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:39.775979Z digest=sha256:fbf436b944804575c8735ca0f03c0532435662ab85e5c403f8c3b9555f6657b9

Observation 6f827e79-c591-4a87-a39d-8c7dd2c2aaac · outbound

This paper cites Mixed sdp/socp moment relaxations of the optimal power flow problem,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Mixed sdp/socp moment relaxations of the optimal power flow problem,

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:24.782749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:39.903796Z digest=sha256:39f0e3674e9d7b4fec8cf9e8f931040fb4043fb26d3d1a1684b3930d3dee7479

Observation dec46efd-8513-45d3-904b-f1d7362c52c7 · outbound

This paper cites R1-PAC: rotational invariantL1-norm principal component anal- ysis for robust subspace factorization,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation R1-PAC: rotational invariantL1-norm principal component anal- ysis for robust subspace factorization,

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:24.620236Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.026757Z digest=sha256:80a58fc9dbd522d75a270179a48389c3c7010df1df481de944a6bb6c74c7f865

Observation 4e10c144-3635-4bed-b809-1f3a81603a9c · outbound

This paper cites Bi-criteria linear-time approximations for general- ized k-mean/median/center,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Bi-criteria linear-time approximations for general- ized k-mean/median/center,

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:24.411171Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.196530Z digest=sha256:76d7c991eee9c4a914f1def31d0d108402febd75617bb2323a6bf025e2a20c6e

Observation 0759f5b3-98f8-4d10-88e8-4fd80ccd4b78 · outbound

This paper cites The abel–ruffini theorem: Complex but not complicated,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation The abel–ruffini theorem: Complex but not complicated,

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:24.209350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.254325Z digest=sha256:1a4a1fb2b4cf20038401d9336fe155261379c5f1fd26872ae5b6750f63d383a1

Observation f1d3badb-25f9-4c45-958e-89660da42f2e · outbound

This paper cites Improved approximation algorithms for large matrices via random projections,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Improved approximation algorithms for large matrices via random projections,

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:24.045459Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.315055Z digest=sha256:c66e082263bd04682b3b9db7df27d174a5639429233339a03ee912b67816fc93

Observation 29ea1201-368c-40dd-98e3-5bcb83976ea6 · outbound

This paper cites Low Rank Matrix Approximation in Linear Time.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Low Rank Matrix Approximation in Linear Time

Reference 51

Resolution
verified exact
local_arxiv, observed 2026-08-06T16:10:41.866363Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.388253Z digest=sha256:a006a635de3b3c8331596068c7d06f218dae2c281cd77a1e47b56ee07328e88b

Observation 52daebb5-95a5-48ae-a286-f5ca6bb59095 · outbound

This paper cites Adaptive sampling and fast low-rank matrix approximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Adaptive sampling and fast low-rank matrix approximation,

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:23.862915Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.493871Z digest=sha256:c3f9760450282ad2032ad0989bdeabf77fb965127aab7ef5b2307788bb0f1fdc

Observation e942d67e-3380-480b-8b73-cc196d67ebe6 · outbound

This paper cites Matrix approximation and projective clustering via volume sampling,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Matrix approximation and projective clustering via volume sampling,

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:23.719878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.613984Z digest=sha256:8f1a40452ceb37fc08312fee6f6a66c5af370471d2ce94f0688b34cf6359f488

Observation 9d6cf813-d6ba-45fe-b158-e9afba23838c · outbound

This paper cites Polynomial time algorithm for column-row based relative-error low-rank matrix approximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Polynomial time algorithm for column-row based relative-error low-rank matrix approximation,

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:23.512594Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.707009Z digest=sha256:75f6885aa48cf1909765383aa7f9a77c1dd8819bc2c9f6dddebb8af4032c15b6

Observation 2bcf18ff-77ba-45fd-87f6-cf00dcfb489c · outbound

This paper cites Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix,

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:23.356707Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.786611Z digest=sha256:81d53af2de52bbce68841cc10c6f395a2f99e53462a293cc600e60b329a1bad0

Observation 0a2d7445-cd27-4e54-b0d4-96a054865405 · outbound

This paper cites The complexity of the matrix eigenproblem,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation The complexity of the matrix eigenproblem,

Reference 56

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:23.244812Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.863135Z digest=sha256:83a5089e2281aa901088ca0683cfa8e6b556bc8890fbc3fd6aebdfb43ee61c1c

Observation 22db2b7a-4c06-4817-a684-3a3c4e958872 · outbound

This paper cites Complexity of finding the eigendecomposition of a matrix.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Complexity of finding the eigendecomposition of a matrix

Reference 57

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:23.103795Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:40.958837Z digest=sha256:24a369d18963a685f7002c972e9f84e653d5126a6aca66bf1b309db7b5088c50

Observation 636c903a-28f5-45f5-81a0-b0078dd31813 · outbound

This paper cites Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering,

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:22.991528Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.033763Z digest=sha256:60d60105d7f2a07507ec513db791c58b4e80bcdd49c42bde5a7b42df1b178866

Observation e09c6b81-5ae8-42e2-ab59-e865a50e87c9 · outbound

This paper cites Gr¨ otschel, L.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Gr¨ otschel, L

Reference 59

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:22.755746Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.091081Z digest=sha256:a201027ceacc169e7d9445ff3a85f5b9133b39cc3c36c5e00b41b4bb1765fc4a

Observation c0badd7c-e649-4f5f-b149-39b67b8e7663 · outbound

This paper cites Mathematical problems for the next century,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Mathematical problems for the next century,

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:22.455473Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.156585Z digest=sha256:0314220084b62bc7bc14659fca717f74df482881deea519b46176af4f9c55044

Observation 05adde02-2856-4a8b-8942-b44a0a5f128e · outbound

This paper cites Approximating the radii of point sets,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Approximating the radii of point sets,

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:11:22.157422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.263206Z digest=sha256:da0266edc75aeea3b28710e7b214b2b1e8157809e08802a3e4cff4033523c084

Observation eb361c51-e224-4a19-a035-c1165099a7d9 · outbound

This paper cites Algorithms and hardness for subspace approximation,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Algorithms and hardness for subspace approximation,

Reference 62

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:10:43.248726Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.327509Z digest=sha256:a450b45d1c02beb37d0e3e3ad499cd3520d1842af84b7e64f3157ff4be55c2aa

Observation aacf1269-c2a8-403e-ba0f-6aca84e6d24f · outbound

This paper cites New Frameworks for Offline and Streaming Coreset Constructions.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation New Frameworks for Offline and Streaming Coreset Constructions

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-06T16:10:41.413123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T16:10:41.413123Z digest=sha256:2341346a40a57fb51ce2e641f748e0461af97a889cf8b9c3ae9a89a41fb5db22

Observation c3259a47-dc6c-480c-9133-1a9580996471 · outbound

This paper cites Dimensionality reduction for the sum-of-distances metric,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Dimensionality reduction for the sum-of-distances metric,

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:10:42.477189Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.493603Z digest=sha256:7014886511511336cf656917eb41cafede41e154069e2f358a1df24210a81c2d

Observation 654f0e91-65e1-40eb-8399-c764eccaa937 · outbound

This paper cites Strong coresets for k-median and subspace approximation: Goodbye dimension,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Strong coresets for k-median and subspace approximation: Goodbye dimension,

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:10:42.173397Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.585343Z digest=sha256:5e1a4e5ec689cbb4e6fa6e367feab971578dbae52dec58fae7c8fbef9f676652

Observation 9ddc618a-c0ca-4c9c-b6e2-c7631d8a1d53 · outbound

This paper cites Improved coresets and sublinear algorithms for power means in Euclidean spaces,.

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation Improved coresets and sublinear algorithms for power means in Euclidean spaces,

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T16:10:42.009096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T16:10:41.673483Z digest=sha256:0f0adb2667d6e7e07310b2c1d0c9889a25e6eb674f18c3cd64bc68390f7b40d3

Pith citing papers

No inbound Pith citation observations are available.