{"as_of":"2026-08-17T15:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7572630010e25f03ac34c84bae9eb96610219f2a8f64e736bca7650f0c6ffa20","coverage":[{"denominator":84,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":84,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:15:34.917614Z","state":"measured"},{"denominator":85,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":85,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:34:16.013429Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T18:16:14.067578Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"cited_work":{"arxiv_id":"2505.08146","doi":"10.48550/arxiv.2505.08146","metadata_source":"pith","pith_arxiv_id":"2505.08146","snapshot_observed_at":"2026-08-15T18:16:14.067578Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","venue":"cs.DS","work_id":"f766acb9-658f-4229-b8e0-201c6f008134","year":2025},"citing_paper":{"arxiv_id":"2608.10523","last_updated":"2026-08-11T05:59:25Z","snapshot_observed_at":"2026-08-15T14:16:21.449654Z","submitted_at":"2026-08-11T05:59:25Z","title":"Improving TensorSketch Using Complex Random Variables","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T14:34:16.013429Z"},"links":{"cited_paper":"/paper/2505.08146","citing_paper":"/paper/2608.10523"},"observation_digest":"sha256:1440ee5cf814d7bbe9c171b97d5c496b9a2170438072f9b157184549949908cd","observation_id":"188057da-dac5-4817-8849-465252fa8c2b","resolution":{"observed_at":"2026-08-15T14:34:16.266882Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.08146/citation-record","integrity":"/paper/2505.08146/integrity","json":"/paper/2505.08146/citation-record.json","paper":"/paper/2505.08146"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:15:34.585568Z","title":"Oblivious sketching of high-degree polynomial kernels","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.585568Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:dc516b7c588337d7c7d868734945f4e45025d84dd7ee261e7ac4acee4dbc3ff7","observation_id":"6166f0fb-9fed-4ecd-b784-e872f8ca36bc","resolution":{"observed_at":"2026-08-15T22:15:34.585568Z","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-15T22:15:34.590720Z","title":"The fast johnson--lindenstrauss transform and approximate nearest neighbors","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.590720Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:ca2cf5e6a00adfecd7663e336b569021d6b2a9efb3790d4019726cf03f8c5565","observation_id":"e8ccd0b5-b79b-469a-8605-16c6cf239d1f","resolution":{"observed_at":"2026-08-15T22:15:34.590720Z","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-15T22:15:34.595414Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.595414Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:ce4a31b58f9aeb20a0d4c44cfa702fecebeb88ceb7dd888f2e9e305d8ad90539","observation_id":"d7469e07-41ed-4332-a592-f0e4d58d8bc2","resolution":{"observed_at":"2026-08-15T22:15:34.595414Z","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-15T22:15:34.600819Z","title":"The space complexity of approximating the frequency moments","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.600819Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:3ddb99341c622814c46fd00bd43fa0915f9c19b2c6d0417a3eed4e4a5c1d4ba8","observation_id":"764e710c-0b16-40f3-b140-0788154937a0","resolution":{"observed_at":"2026-08-15T22:15:34.600819Z","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-15T22:15:35.900475Z","title":"Nguyen, and David P","venue":null,"work_id":"d844160a-3ad0-48c7-b4db-3554df7e0116","year":2014},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.605806Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:a5a5a51bc1cf84b2d098f7308b4c0ad3b58322bcbb33beacb5576248e28b3af0","observation_id":"a1b37002-a3cf-4e06-9ffc-23285786c7ff","resolution":{"observed_at":"2026-08-15T22:15:35.904079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.889333Z","title":"Clarkson, and David P","venue":null,"work_id":"80c74b6a-89ef-4faa-bcd9-5ad42bec43c1","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.610512Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:0591f9bf92d5b853f29ba76b6b56d7139a180bb423fd1dfe3c5cfea3e23aa47d","observation_id":"1d2028a7-0c6f-4575-a736-40d504bff7e5","resolution":{"observed_at":"2026-08-15T22:15:35.893180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.877998Z","title":"Random fourier features for kernel ridge regression: Approximation bounds and statistical guarantees","venue":null,"work_id":"9b88688c-c3cf-4005-ae09-ac681b225af5","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.615434Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:a0829fdd0a91dfbb53a3102aea1d2a70ad29b17aeac52b8c33050fdf6a90d96e","observation_id":"68f55cd8-53f1-435f-a37e-9873274943e9","resolution":{"observed_at":"2026-08-15T22:15:35.882153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.865409Z","title":null,"venue":null,"work_id":"ab18237a-742f-4bf4-bee3-e50ec881da7d","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.619257Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:e8cce9f35d2b3001c3794eb930368e07b75a0bf4cc4c430bc6cc21f7ae167fa7","observation_id":"d3020bf2-398c-4e29-adb9-da8d2b2c0148","resolution":{"observed_at":"2026-08-15T22:15:35.870105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.852956Z","title":"Harmonic Analysis and the Theory of Probability","venue":null,"work_id":"2886c7b7-18d8-46fe-8eda-b8335cc8d488","year":2005},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.622840Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:387766e2e50970f4c2d46ec6176dfbe0d0d0de81e7cc7c47f26eee39267a9537","observation_id":"bcf09cf8-ef5a-4785-9197-c760591886b9","resolution":{"observed_at":"2026-08-15T22:15:35.857681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.841669Z","title":"AMS without 4-wise independence on product domains","venue":null,"work_id":"5a3e936e-5459-4c75-bd8e-aeeb70addf01","year":2010},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.626395Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:62b0fe1598e0ba97deb3ab2e63f9da9090ab658d44b9ec90a525fd1d78fac9d9","observation_id":"98882c76-b400-4060-ba91-240c29ae677f","resolution":{"observed_at":"2026-08-15T22:15:35.845565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.829929Z","title":"Convex optimization: Algorithms and complexity","venue":null,"work_id":"83b2986b-3526-42e6-ad75-57c07041465a","year":2015},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.630702Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:ffd355d8b98cf040e3f14e8d10a1f64f1f69ccfd49517ba5f3b21654547d5afe","observation_id":"a0a13c69-33b6-4456-8a61-7c91c78c977a","resolution":{"observed_at":"2026-08-15T22:15:35.834247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.818460Z","title":null,"venue":null,"work_id":"34dfb7e8-5604-43f5-a95f-c475a9a1f446","year":1979},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.634432Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:4cf5ffeab951ad2af1f20618c65485fd7cdab3ef5a2f2ce534c264010590ea03","observation_id":"1cb8087d-7943-49a5-873e-a9bbecc6bcbd","resolution":{"observed_at":"2026-08-15T22:15:35.822232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.806757Z","title":"LIBSVM : A library for support vector machines","venue":null,"work_id":"8aae8198-7ac4-49b0-8fc0-3e84839e707f","year":2011},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.639352Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:72585da6b3ca1cf3301ae348063696801a13c8d27d4612a7934a1d54b07d6f40","observation_id":"d525b53e-dc02-4943-a976-79163e2cb18a","resolution":{"observed_at":"2026-08-15T22:15:35.810989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.795544Z","title":"Hashing-based-estimators for kernel density in high dimensions","venue":null,"work_id":"9ac6d798-fe74-4abf-819b-c7731e5a503c","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.643624Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:d53a63b9746921cf9e4b23a59371bd9c1229382f2b26c2ab9b6fe40393f5adba","observation_id":"9862d272-876d-40a3-ac79-b1b6c2205e08","resolution":{"observed_at":"2026-08-15T22:15:35.799410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.782720Z","title":"Finding frequent items in data streams","venue":null,"work_id":"e54f3874-5f78-48f8-80f3-1145b44b677e","year":2002},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.648211Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:b8e82098b2857e6436b230acd7b53a217d5354ade8f63400b15e6d0ab24fd84b","observation_id":"118742b0-6bcd-4731-b73a-4a17f8c55847","resolution":{"observed_at":"2026-08-15T22:15:35.787257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.772062Z","title":"Colwell, and Adrian Weller","venue":null,"work_id":"f26cb1c8-b04e-4856-ade6-f581da4a454c","year":2021},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.652743Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:0c31db0958d2524a3fcff97938b594fc1e0a0cb355eaaa14581f616acc6f0122","observation_id":"7b6eec7c-a595-4b9f-a4c1-45b6523fa48e","resolution":{"observed_at":"2026-08-15T22:15:35.775820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.761310Z","title":"Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions","venue":null,"work_id":"b456de8d-aa16-4fe7-a676-65e952dfc3b1","year":2016},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.657494Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:b2af1a2d760071fca59ab3a151ab920c0046fc96812717b08039c5b2d7faf6ad","observation_id":"3cefcb03-da29-4af0-a834-42d221cb6a57","resolution":{"observed_at":"2026-08-15T22:15:35.765157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.750841Z","title":"Kernel pooling for convolutional neural networks","venue":null,"work_id":"4655675e-6c4c-4ff5-92e1-47ea2ec72fe2","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.661943Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:9f199ced62db6d875f9f9cfc3c30779b1ad89a9bdf4a1781e3777b023ba525d7","observation_id":"669d5148-c1ef-45a7-93e0-0c4bf393671a","resolution":{"observed_at":"2026-08-15T22:15:35.754759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.739285Z","title":"Learning to evaluate image captioning","venue":null,"work_id":"4e4f661f-14bf-4572-85e3-16188dea97aa","year":2018},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.665462Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:0cc805a58f3b83c64484080a68576d8ba22db48abe3b8ae7da986a95d4594367","observation_id":"68839cd9-e07c-4c5d-925e-e788f53c316d","resolution":{"observed_at":"2026-08-15T22:15:35.743095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.728347Z","title":null,"venue":null,"work_id":"892edcea-4acd-49eb-9c2b-be3473748ae7","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.669768Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:7a7b545a3858968ccd44ed489b14a47686b7b5ef036c6ff8672848aa4063551f","observation_id":"65242386-e90a-40d2-99b8-97fd919d65bf","resolution":{"observed_at":"2026-08-15T22:15:35.732423Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.717607Z","title":null,"venue":null,"work_id":"67ce5b63-55e2-4768-883e-ef1933b876ba","year":2021},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.674324Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:585223123a1b7f5b324f01e73a0da5b7b790aea5b572c790da1436575ced15ce","observation_id":"95ddf5fe-c996-4fde-83a8-8da018626819","resolution":{"observed_at":"2026-08-15T22:15:35.721504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.705727Z","title":"Woodruff","venue":null,"work_id":"c13dd98f-4808-4437-8793-79dcdd5ec409","year":2018},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.678788Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:c5fab13de18cec97663bfcb38b92b01e4410c5670cc8e61cdad48be585eb7e6f","observation_id":"d66c8629-a299-49d9-bf0f-f3f3c03b064f","resolution":{"observed_at":"2026-08-15T22:15:35.710353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.693257Z","title":"KONG: kernels for ordered-neighborhood graphs","venue":null,"work_id":"da0a90f5-0771-4cc3-83b4-6d9a1aad583d","year":2018},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.683946Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:87aafaad05307bfaedaec8639ac1dcbd7d8716e16f829629ba1f709ed6ea92d9","observation_id":"52e70d6a-acb6-42e1-a54f-116b6a2c592d","resolution":{"observed_at":"2026-08-15T22:15:35.698515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.679169Z","title":"LIBLINEAR : A library for large linear classification","venue":null,"work_id":"a5ff4b59-ac77-4204-a9a0-5218c6b6a551","year":2008},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.687809Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:59b8c17331e2ed18b0421d10c4167f68d1beca05ed2921ec6090db59afd6c9bd","observation_id":"50712615-426a-4840-b194-c62fc6febc05","resolution":{"observed_at":"2026-08-15T22:15:35.683091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.666808Z","title":"Scalable attributed-graph subspace clustering","venue":null,"work_id":"265055f6-25ea-4deb-868d-a2bb276b8a98","year":2023},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.691640Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:957b82f12459a39c496762a35af16b73633b329fa68cee91456153500cafa722","observation_id":"daba73f3-ce5f-45b7-8b71-40a458b04c57","resolution":{"observed_at":"2026-08-15T22:15:35.670823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.655348Z","title":"What can a single attention layer learn? a study through the random features lens","venue":null,"work_id":"0ccfb978-616f-4dd9-ba5b-6cf1f0f598c1","year":2023},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.695326Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:cc09578e77af44f6a12a60fcae2bc86718c358b8fc3938f73db7b9f6ef702e78","observation_id":"be2d9bf6-95ad-41d6-ae02-9c08c4cf7208","resolution":{"observed_at":"2026-08-15T22:15:35.659422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.643508Z","title":"Multimodal compact bilinear pooling for visual question answering and visual grounding","venue":null,"work_id":"e34204b9-0726-45a4-93a7-1b6a624853ae","year":2016},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.698938Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:854b7fc101c077f8cbf8d4a53a674d03537ef1b21bbe0ce2e15b737d815f7ade","observation_id":"f8acaac9-55a4-4100-90a8-4cd0165b32da","resolution":{"observed_at":"2026-08-15T22:15:35.648009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.630516Z","title":"Compact bilinear pooling","venue":null,"work_id":"7353ec9e-35a1-4c39-91d8-647686560c4e","year":2016},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.702606Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:79b94c0863b90ad36d66e2bbfecbbd5499c636045df29ee1d8c209455cdbc6ba","observation_id":"c214a91a-ac4e-4eea-b30d-68284f2c2321","resolution":{"observed_at":"2026-08-15T22:15:35.635090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.619253Z","title":null,"venue":null,"work_id":"a8e6c8f5-0aa2-44ff-afbb-4fb0aa38cd24","year":2016},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.706387Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:b7ce6454da3a3821e7fd460226b0ad77af9f8900febbc0740db2e32bfeb93e94","observation_id":"7ad355e3-6d53-4148-9626-bb2af9531343","resolution":{"observed_at":"2026-08-15T22:15:35.623090Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.607502Z","title":"Compact random feature maps","venue":null,"work_id":"b8df4967-864f-48c8-a92a-7faa291ec91b","year":2014},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.709895Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:a38641f0c8e03b463ffeb719375be1f8faa31c186307be4a7854c8141a5f74a7","observation_id":"97cb3623-0b06-4fe7-b6b4-b4ed4618300d","resolution":{"observed_at":"2026-08-15T22:15:35.611279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.595938Z","title":"Polynomial tensor sketch for element-wise function of low-rank matrix","venue":null,"work_id":"d6e339e4-02d7-4aa4-9486-64b3cad5972f","year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.713340Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:f97ad2b4ff6d59a734a59efc81f05ba322a72b0aec021b046b37cd50101f9b35","observation_id":"6e5d57ca-31ee-4e73-9633-ae48ef8604ff","resolution":{"observed_at":"2026-08-15T22:15:35.600083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.583208Z","title":"Declaring independence via the sketching of sketches","venue":null,"work_id":"b2c12a2a-bef0-4d0e-9ac0-a0e59b788676","year":2008},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.717026Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:eb02736e35f57da7228345c592afefe4bbda868cc7b44291af6bd4ab4c9d886b","observation_id":"b54fac22-e18c-41b4-8e91-4a3b47cdc6f1","resolution":{"observed_at":"2026-08-15T22:15:35.587614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.570690Z","title":"Text categorization with support vector machines: Learning with many relevant features","venue":null,"work_id":"6c99fe03-362d-48cd-8421-dd962e76fd52","year":1998},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.720652Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:74d9a8fdfaddf75a80d6e31857296d88c2349aa6088178cf2cf2ac240d880c6b","observation_id":"61b5895c-0cab-4386-a8ae-00cd9ef658c4","resolution":{"observed_at":"2026-08-15T22:15:35.575489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.558095Z","title":"Training linear SVM s in linear time","venue":null,"work_id":"cc80c093-1f4e-4123-8619-7c32d85b9d2b","year":2006},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.724795Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:4dd8aa4747882352e4cebdcdabb50489024b0477d0c646dc8974d3a502ae8127","observation_id":"cd26873c-9b39-4241-ad73-6ae19586e870","resolution":{"observed_at":"2026-08-15T22:15:35.562187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.546305Z","title":"Fast alignment-free similarity estimation by tensor sketching","venue":null,"work_id":"0b4e5297-704f-4879-a6cd-3779c1f708bc","year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.728376Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:666b85640a58f15bf7ce8202c24c26c5988bdb45a3b3f5054b916745f638212d","observation_id":"3e62d996-d4e1-4bce-8084-b61d0ae987cc","resolution":{"observed_at":"2026-08-15T22:15:35.550759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.533263Z","title":"Random feature maps for dot product kernels","venue":null,"work_id":"00d979de-42cb-490e-b5b8-40d622dae308","year":2012},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.732030Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:dc1a979a5bf2ead373cc6fb6b1c4f1f443e0efc2072a965c09a8c3ae77417dfe","observation_id":"4f3b9e46-486a-412f-b3df-a5808e998781","resolution":{"observed_at":"2026-08-15T22:15:35.538164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.518582Z","title":"Algorithm Design","venue":null,"work_id":"b50878ab-c082-4993-ad4d-c0b3c1dd3f4c","year":2005},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.735801Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:256fdcc3ea0c56bc98a34fb64597a3fa8b77228a23c0e5f692fd8b0aeb406456","observation_id":"d9c5bd67-f6f3-4c86-96d7-308d98b62f4b","resolution":{"observed_at":"2026-08-15T22:15:35.522764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.507509Z","title":"Principled neuromorphic reservoir computing","venue":null,"work_id":"d71c435c-4027-41c0-9b7a-462c1323c300","year":2025},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.739369Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:295cdbd424ad6e093a5d9ec4eeab8e6cf9bb99c9cab9f5c3705aef17f1c77f3f","observation_id":"6d3f1a13-77dd-461b-912e-f313644a0601","resolution":{"observed_at":"2026-08-15T22:15:35.511575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.495304Z","title":"Sampling methods for the N ystr \\\" o m method","venue":null,"work_id":"87a88fa7-34aa-423a-86a8-a339810059b7","year":2012},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.742825Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:bf0de3589f337f449b4d2264195e5467e8ca9594ebf768fc4791728c18da8327","observation_id":"e409b3dc-1433-4694-8fa9-63f6f6a34838","resolution":{"observed_at":"2026-08-15T22:15:35.499850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.483923Z","title":"Lewis, Yiming Yang, Tony G","venue":null,"work_id":"ae506ba6-42e7-44fb-acb1-24eb7af46e8d","year":2004},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.746398Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:20ee8f576c8a36da61db700f227c7c8f3d3e12c363e3f6deff1a26f068ef9f25","observation_id":"2a4b3b83-3d10-4a95-9003-a9f07e392ad9","resolution":{"observed_at":"2026-08-15T22:15:35.487712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.471938Z","title":"Sgm-net: Skeleton-guided multimodal network for action recognition","venue":null,"work_id":"9a87e268-92f9-4486-ad3f-f99d937bd684","year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.749852Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:0d2e3a786ad2bbf4c7c84b7cb132567982b58314e1ccb5c2b08478eea0b7f79f","observation_id":"834d19f8-7bd2-4292-8786-461e003dbca1","resolution":{"observed_at":"2026-08-15T22:15:35.476346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.460035Z","title":"Towards a unified analysis of random fourier features","venue":null,"work_id":"d2f36d3b-49d0-4cab-9dc5-ff8100e000c3","year":2019},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.754289Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:e1fe7c5a72aeb5e5a9ec184b56ec1d482f23c3c6c679616e2ace524a99af98c2","observation_id":"ac49ea50-900a-45f5-ba83-0ef25782f49d","resolution":{"observed_at":"2026-08-15T22:15:35.464178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.447395Z","title":null,"venue":null,"work_id":"be2f3eb2-13e7-4fbb-9f14-464fe69a94e1","year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.758119Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:a35fdac4891aabdceea94ae2dedd080f69c2500d722247954daf1cf3b681af29","observation_id":"98ff1659-af84-475c-8842-5c94f08e29ce","resolution":{"observed_at":"2026-08-15T22:15:35.451656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.435223Z","title":null,"venue":null,"work_id":"fa62461e-03f2-403c-8da9-1955b870c2e9","year":2021},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.761585Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:c939d88c69262cde61f0f4ebdf9bd7e12e0292a60c6453e5b0eb3379ab515428","observation_id":"a4578c23-7a37-4f37-9f74-7648ff4a7a67","resolution":{"observed_at":"2026-08-15T22:15:35.439238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.422095Z","title":null,"venue":null,"work_id":"474697b8-0357-4dee-a4cf-63ee8f2e5eff","year":2022},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.765554Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:353c659c94ff987f8dce7d79eab317ba28c1e48ef4ac482aec7533fde404c01d","observation_id":"5d0e42de-b7e4-4057-811f-7bb51e3a0327","resolution":{"observed_at":"2026-08-15T22:15:35.426999Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.410246Z","title":"Smola, Zoubin Ghahramani, and Bernhard Sch \\\" o lkopf","venue":null,"work_id":"85fa090e-d2e1-453f-83f8-3e131f786301","year":2014},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.769773Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:16d6f9ec7cd96495df61c1750f6441bc9707abaeefa8c8f4f6f69a15d77fa14a","observation_id":"d0e61278-2db1-4a5d-8840-43659ec6e54e","resolution":{"observed_at":"2026-08-15T22:15:35.414030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.397854Z","title":null,"venue":null,"work_id":"e8a728c2-756d-45b2-a7dd-026ba08afcf4","year":2016},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.773312Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:27a99a2b9edfe00bd6c5525ce9b7c530dba76156c16600ed300a3ef087efe031","observation_id":"8f4879c4-695c-4da7-a16d-a62dd0be0f57","resolution":{"observed_at":"2026-08-15T22:15:35.402087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.385138Z","title":"Low-rank tucker decomposition of large tensors using tensorsketch","venue":null,"work_id":"8e8e221d-6b0e-43ab-bd6c-0e59d20e94eb","year":2018},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.777133Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:2a710382e6e24b3d15a2094bf4df886035ae933bcc0222c854c1b96aa84169ab","observation_id":"d70779e2-26b4-4f87-aab7-8da0210962a5","resolution":{"observed_at":"2026-08-15T22:15:35.389333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:34.780911Z","title":"Randomized numerical linear algebra: Foundations and algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.780911Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:64f595c948e0479abad7f2e997c2c801783c0ac86f92c7cdf3b3678e701f31c1","observation_id":"9b134a46-58e5-4e55-96dc-dbe00a9e0c2a","resolution":{"observed_at":"2026-08-15T22:15:34.780911Z","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-15T22:15:35.364313Z","title":"Woodruff","venue":null,"work_id":"c2d98b62-ffa3-4901-804c-232b5e09d8a2","year":2019},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.785294Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:fbac672ea321f28e91cdd79b8c44c9eae99ca9ce7f1a8264e886c6e35a93917a","observation_id":"034703d4-2737-4c6b-91d3-73c3c46ddc0a","resolution":{"observed_at":"2026-08-15T22:15:35.369174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.351592Z","title":"Kernel mean embedding of distributions: A review and beyond","venue":null,"work_id":"0198eb46-4888-482d-b641-3c37f849667c","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.789116Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:c05c97ff4819b379b04d85521b640d3d7e23909d22ac7f84694d3d32b4291310","observation_id":"eb727666-6d71-49b2-81bf-cf59b96dd9e0","resolution":{"observed_at":"2026-08-15T22:15:35.355843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.339511Z","title":"An improved training algorithm for support vector machines","venue":null,"work_id":"2cd49866-4a24-45f9-b5c4-45c4ec7395b1","year":1997},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.792872Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:9debc54cf6156556bc14eb5c5a374ed8efdd1ed8143b8807f9a80dd18e54023c","observation_id":"58894945-df4c-4fcb-ad42-82805b02c6cc","resolution":{"observed_at":"2026-08-15T22:15:35.343556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.328831Z","title":"Compressed matrix multiplication","venue":null,"work_id":"a3784ad2-ae09-4a32-b879-6a7fab687f6e","year":2013},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.796914Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:df5ff71004c50b8430b3f84fc0abf20b59b0bbc9cb7b2ae7383262c6a6ffa270","observation_id":"32d2b624-a93b-4143-ad13-e5dad684f6c2","resolution":{"observed_at":"2026-08-15T22:15:35.332704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.315541Z","title":"Pedregosa, G","venue":null,"work_id":"5b3e92c4-cd71-40ae-8cd2-cbbe575cdf32","year":2011},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.800510Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:067dabb4bf856af34e80b4f90c1f83bdba8b005d3977165304615a83bb922594","observation_id":"caf3b4d4-73e3-473b-b4d9-d87c5815aba4","resolution":{"observed_at":"2026-08-15T22:15:35.320591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.304448Z","title":"Yu, and Sanjiv Kumar","venue":null,"work_id":"c3cdd260-320e-4f76-821b-65b9c02b156a","year":2015},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.804017Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:f166a333d9391b7ab24e8c19b4b9831940f6fc551016b60a553c25149ca12c0f","observation_id":"8949535f-fab9-4eac-b9a7-7a3d283c9130","resolution":{"observed_at":"2026-08-15T22:15:35.308441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.293001Z","title":"Fast and scalable polynomial kernels via explicit feature maps","venue":null,"work_id":"f56bd391-f78a-4b99-a306-b4ca0e694369","year":2013},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.807841Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:3bf8f3bfdf3d5f3a852744a8d2b3090d25216c4a7bb59162c946890af4793762","observation_id":"cef6af61-1d2c-4b89-8462-d82f1a7e7cdb","resolution":{"observed_at":"2026-08-15T22:15:35.297375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.280393Z","title":"The power of simple tabulation hashing","venue":null,"work_id":"f8fb991f-1fdc-4f00-b272-5398db2d9913","year":2012},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.811734Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:4ee1707f8d1cc8258c7d251240bcb20f34b724aa0a014a39333b369476fb9adf","observation_id":"614131fc-e2a8-47ba-b13b-115ae7a778f7","resolution":{"observed_at":"2026-08-15T22:15:35.284373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.267464Z","title":"Random features for large-scale kernel machines","venue":null,"work_id":"e633a417-b1dc-4e28-849b-679b4c804d2f","year":2007},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.815376Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:83d50087ad8a4d34ddf28c7e080abad741d6abe530dc9d6b5a87d800a4fa4b0a","observation_id":"0544b0bf-d7b7-46e4-a21e-28bd6ef1cd7c","resolution":{"observed_at":"2026-08-15T22:15:35.271466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.254998Z","title":"Learning action recognition model from depth and skeleton videos","venue":null,"work_id":"f145a04a-a86b-4928-bc7e-927d64705b02","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.819078Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:b1e8e2307284f339d83e01dbdd646906d255727568ab22f2cfab18af2ba8e26c","observation_id":"e6773cd1-3425-4c74-afbc-6224f63bd352","resolution":{"observed_at":"2026-08-15T22:15:35.259745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.242450Z","title":"Generalization properties of learning with random features","venue":null,"work_id":"904ce50d-023c-46a8-81e4-416ae8e4579b","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.822891Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:988c417f185a1f0d66e010ff727344f25af85e6ec3750662616971d7dd81a02e","observation_id":"6b17208d-94fb-4284-995f-1144dc2f3c2e","resolution":{"observed_at":"2026-08-15T22:15:35.246489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.230160Z","title":"A spectral analysis of dot-product kernels","venue":null,"work_id":"8d98243d-79bc-4dc2-ac60-be0b1c89afc2","year":2021},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.826827Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:db0295de7b543d4c4c30a8936a8908b7a4187ffb4cc24c0af49e06ba6c49bf1b","observation_id":"4edba1b4-cab2-4844-a925-ad622b684289","resolution":{"observed_at":"2026-08-15T22:15:35.235007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:34.830513Z","title":null,"venue":null,"work_id":null,"year":1942},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.830513Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:2c736bb0acb5396b1e733f306152baed82fd43e29ec49fb3c3ddc8a68aca743d","observation_id":"b4f39d00-c89a-46e1-b1e9-9c09d050fb43","resolution":{"observed_at":"2026-08-15T22:15:34.830513Z","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-15T22:15:35.217378Z","title":"Learning with Kernels: support vector machines, regularization, optimization, and beyond","venue":null,"work_id":"d064f7bb-aace-4d38-953c-a827a64b5f20","year":2002},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.834262Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:c541beed0211c5d363b43042fbd937e36acb695b18ecaf805b05fae47a79776c","observation_id":"ed9ef049-40c1-4ac3-b4de-7fe0a63f275c","resolution":{"observed_at":"2026-08-15T22:15:35.221556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.205231Z","title":"High-order attention models for visual question answering","venue":null,"work_id":"b4535843-6bee-47c1-af0e-79d2819858b7","year":2017},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.838304Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:3f7aee93d6dc138e2967a983ba6a81380f8218e3ce745014ce1c5ba84880a28a","observation_id":"e1d2c0e2-de97-4370-a196-6cff22700599","resolution":{"observed_at":"2026-08-15T22:15:35.209307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.193659Z","title":"Pegasos: P rimal estimated sub-gradient solver for SVM","venue":null,"work_id":"33bee9b1-7fb8-4a17-8fc7-fc3256f4171d","year":2011},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.841877Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:286530cceb2402286b2036137fd874b91d5b3fa557be3c2d428b99af4997d83c","observation_id":"d35a721b-dbfd-4332-ba85-972cfc950d2b","resolution":{"observed_at":"2026-08-15T22:15:35.197994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.181135Z","title":"Kernel Methods for Pattern Analysis","venue":null,"work_id":"bfb18f50-8bb4-465b-9ea7-55704db84287","year":2004},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.845536Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:8f9336c700b68ba932af4c92ad42876815294b0052037ee72c86644a5123fe97","observation_id":"53292b93-f168-4232-9367-108c73e4d0d2","resolution":{"observed_at":"2026-08-15T22:15:35.185644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.169028Z","title":"Higher-order count sketch: Dimensionality reduction that retains efficient tensor operations","venue":null,"work_id":"93c14db8-0694-464e-a41e-8927febba6f8","year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.849550Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:934be54344de78df9893c31a15529d678c756a3ddca1867eb5b0ccf1b47c1ebf","observation_id":"46c23198-29dc-4c36-82e9-a287f38d8b3b","resolution":{"observed_at":"2026-08-15T22:15:35.174068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.155465Z","title":"Relative error tensor low rank approximation","venue":null,"work_id":"9361142c-a357-4ed3-b00e-d6487a3d2303","year":2019},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.853458Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:16a8978919f86149d22e20aaf449411a5a59d181952286deecbf34be31d4194c","observation_id":"9214e368-9571-4fdd-aad8-4076b6a300d0","resolution":{"observed_at":"2026-08-15T22:15:35.160677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.143092Z","title":"Sriperumbudur and Nicholas Sterge","venue":null,"work_id":"c9bfddc9-cd49-4ec0-943f-13d429c16a31","year":2022},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.858560Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:b562ac3d7eab38ade75a8fc46dd305edfccc819ae521bebfce66a81fbf1f8103","observation_id":"89fcd6bc-2c37-4a58-95f3-44462462ebef","resolution":{"observed_at":"2026-08-15T22:15:35.147240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.131037Z","title":"Sriperumbudur and Zolt \\' a n Szab \\' o","venue":null,"work_id":"e8aaaf85-f5f5-4cef-b05d-838c421b770e","year":2015},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.862653Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:776156be7b028a9cf1b9b206267f5bfd35fc2ce707300f116628e73b9226a0ba","observation_id":"3802ebb8-a7eb-49f7-8b9b-52b8aaa71332","resolution":{"observed_at":"2026-08-15T22:15:35.134890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.118635Z","title":"Few-shot learning for domain-specific fine-grained image classification","venue":null,"work_id":"0e5ed305-aa49-4294-802b-e1e1b34257fa","year":2020},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.866408Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:af17bcf522e4e598472e81888486dbcd203277b99501b13187da5c423b9f474c","observation_id":"21e4ae2e-dcc0-44f8-8522-74f4fc7a3625","resolution":{"observed_at":"2026-08-15T22:15:35.122648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.106939Z","title":"Gilbert, and Ambuj Tewari","venue":null,"work_id":"07461d12-7866-4e05-be17-a2fd4cb851e1","year":2018},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.871492Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:4b99b1db05b7e73bde6a005000570980d34b4a8a60517e7a9ecd2907e7e24c5e","observation_id":"aa157a96-466c-41ee-974a-caf4f4aee1de","resolution":{"observed_at":"2026-08-15T22:15:35.110779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.095823Z","title":"Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation","venue":null,"work_id":"52a9ecd1-54cd-4b7a-8bf0-7b32b8a43eca","year":2012},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.875449Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:95c34204b8772455b93eaaa678edcb86fc5e577d0083f27da5b9bacafdb37024","observation_id":"deec714b-bb99-4262-8774-1f004721deb2","resolution":{"observed_at":"2026-08-15T22:15:35.099947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.083995Z","title":"Tanimoto random features for scalable molecular machine learning","venue":null,"work_id":"8bb243d0-d57f-4722-b052-57b8b9f8c5f9","year":2024},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.879441Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:4e88405656380942457f6acc5ba2743d93eca32487245aec48f31bc7d92fb471","observation_id":"1a60b980-b47a-4008-b1af-d24e36b9cf9e","resolution":{"observed_at":"2026-08-15T22:15:35.087944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.071805Z","title":null,"venue":null,"work_id":"4c23d188-fd30-457d-af8b-f75873384ba1","year":2011},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.882947Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:77b73f588d82ce0f0c58abcd3fa063db3e5202c9af405ff85f9af3465b397728","observation_id":"7f4b8ffe-c59f-46d7-be8c-ce7e5d358946","resolution":{"observed_at":"2026-08-15T22:15:35.075829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.058894Z","title":"Smola, and Anima Anandkumar","venue":null,"work_id":"f00858c6-d532-4160-8e3f-0c0850eb501d","year":2015},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.886801Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:fc22d8785417691e25d30ae70fcd634bcb18fe1cb839522e9fa492f084464033","observation_id":"7886473c-ba9e-40e5-8b1e-d109529441d7","resolution":{"observed_at":"2026-08-15T22:15:35.063949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.046486Z","title":"Weinberger, Anirban Dasgupta, John Langford, Alexander J","venue":null,"work_id":"e82ea1e4-1edf-4db9-89c5-400e0f9e1f4c","year":2009},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.890512Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:4f5803b262c3b8ffdb3ff04fc98aa555b201051218333cc89c00cfc683f58281","observation_id":"bef60109-0ca2-4b62-b2a1-dfa857cecd4b","resolution":{"observed_at":"2026-08-15T22:15:35.050835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.034003Z","title":null,"venue":null,"work_id":"d16195a8-0f49-4955-a9df-f4f48bbee5a7","year":2000},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.894871Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:c89b74bd69339c6e5c5e17e7daf09f26c96f8b1da2d6669107cd7691abef9cdf","observation_id":"0323accd-c1c2-44e9-bc85-b64e1e317e31","resolution":{"observed_at":"2026-08-15T22:15:35.038398Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.020710Z","title":"Woodruff","venue":null,"work_id":"9b03447c-28e9-4b6b-b016-52f4d04173b9","year":2014},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.898448Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:8ad527d990eea4dc7d03652b039c9ceca93829fc5310d49316ff2ab99a57420d","observation_id":"2d169091-328b-431b-925b-0aca06604e54","resolution":{"observed_at":"2026-08-15T22:15:35.025117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:35.007635Z","title":"Aggarwal","venue":null,"work_id":"be3332c3-e7a8-4d66-aaa6-0e3ec1721549","year":2018},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.902233Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:8b9438e408b689060bfac7d3f2d0bff3153a628ae2c3f3de07dd217eb57adff2","observation_id":"34164961-b105-4f47-9d86-20a52b410039","resolution":{"observed_at":"2026-08-15T22:15:35.011941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:34.994958Z","title":"Scalable DBSCAN with random projections","venue":null,"work_id":"7275e573-1fef-4960-ac7d-011d28fadcf2","year":2024},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.906577Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:4450e5e455d07d781d76dd3e1d3fe84a4eaea034c67402ed4c8f8139c1af22d3","observation_id":"997aab76-654e-4c2c-a7f8-877fd93c751f","resolution":{"observed_at":"2026-08-15T22:15:34.999423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:34.982791Z","title":"Nystr \\\"o m method vs random fourier features: A theoretical and empirical comparison","venue":null,"work_id":"827197ef-b88c-452a-8dfb-899fa73c3ce2","year":2012},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.910337Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:2d35ac996cabf19d5c5cd6bc0c8deb9638d7b23d4dd284e08317cf89873abaae","observation_id":"2e3929fe-d0d8-4e83-a1d0-7fc5ab5be764","resolution":{"observed_at":"2026-08-15T22:15:34.986977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:34.969272Z","title":"On the power and limitations of random features for understanding neural networks","venue":null,"work_id":"ce28a9f5-2204-4004-a993-9ef08c30ae4c","year":2019},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.913951Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:eda9b9e743be7b454dc33da08e2f0b1020e1c8afa63f895be8b6b071f0674113","observation_id":"bdcb3bf1-b22f-415c-a193-91daf0471683","resolution":{"observed_at":"2026-08-15T22:15:34.974405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T22:15:34.954465Z","title":"Scaling neural tangent kernels via sketching and random features","venue":null,"work_id":"2480a367-0305-4dd7-b997-88e7c8348ec3","year":2021},"citing_paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-15T22:15:34.917614Z"},"links":{"citing_paper":"/paper/2505.08146"},"observation_digest":"sha256:26c4673d2a395e5b5509e810405d84352d4a3dd9a60d05c537146ddb75f600fc","observation_id":"1b4cd4b5-b943-44f2-8ddf-228e61fb9f16","resolution":{"observed_at":"2026-08-15T22:15:34.960339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.08146","last_updated":"2025-05-18T05:01:24Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T22:00:05.999478Z","submitted_at":"2025-05-13T00:47:17Z","title":"Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation"},"reference_resolution":{"displayed":84,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":67},"total_outbound_references":84},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 84 of 84 outbound references and 1 inbound Pith citation observation for arXiv:2505.08146."}