{"as_of":"2026-08-15T14:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5913ddcf961c4c088041add35ffeb90485f9e0a846250cf97064851d7eff4634","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T17:16:08.064853Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.14741/citation-record","integrity":"/paper/2501.14741/integrity","json":"/paper/2501.14741/citation-record.json","paper":"/paper/2501.14741"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T17:16:08.855959Z","title":"Extensions of Lipschitz mappings into a Hilbert space,","venue":null,"work_id":"cf096d2e-a7cd-4602-aa68-f92ca267f52c","year":1984},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.704143Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:34e2e1df9c3b1463f93ffb069a08a8221caf5d5d4b5eec724913a632daac3e2b","observation_id":"4e6a6804-5f36-4a40-87a1-62b82d095b0e","resolution":{"observed_at":"2026-08-11T17:16:08.860144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.842547Z","title":"Approximate nearest neighbors: Towards removing the curse of dimensionality,","venue":null,"work_id":"03a779b7-efaa-4636-af88-448a5c8d8f4f","year":1998},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.709422Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:d5f8996978bd4c0479e274081dda7510841717b3b0b3ef810cac5943438164d6","observation_id":"c75d2909-833d-413d-87a0-0d87762533ef","resolution":{"observed_at":"2026-08-11T17:16:08.846579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.829464Z","title":"Latent semantic indexing: A probabilistic analysis,","venue":null,"work_id":"5e876490-caa9-4982-b0ef-d8749d2b1dc8","year":2000},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.714130Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:e07492b79f5da4d4bd8f66d3ce4071ddd3981dd3bfc0595c8b403c69cd79f2a4","observation_id":"e16eb563-857f-45f4-8516-008a2eb25451","resolution":{"observed_at":"2026-08-11T17:16:08.833628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.815729Z","title":null,"venue":null,"work_id":"05488e36-24a6-4782-a921-39712d77770d","year":2005},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.718694Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:208b8ef430b5cad6798e7aa30fc9282bcfb40a66b60c72bc404db65abca9bd1a","observation_id":"c38e783e-5e54-43e3-b62a-e68fcf9444cc","resolution":{"observed_at":"2026-08-11T17:16:08.820161Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.802722Z","title":"Holographic reduced representations,","venue":null,"work_id":"fbd92902-575f-4725-8365-58d5bf1a0ae2","year":1995},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.723242Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:697487e017ca3b7e6d6d3e301033ffca5784b3de492cf96b62ce10bb8ea96fa0","observation_id":"0e80a0cb-c82b-4aac-9e0c-fb8ea3062a7a","resolution":{"observed_at":"2026-08-11T17:16:08.806815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.789671Z","title":"Fully distributed representation,","venue":null,"work_id":"f27933c0-b5ca-4b60-9034-b294df38cce1","year":1997},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.728999Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:44191ca76a4d6f8859dbfbb2f5f1f32a214059d141c48c5599917157338fb894","observation_id":"2c2b5d38-ee63-4104-9bbd-322198086229","resolution":{"observed_at":"2026-08-11T17:16:08.793706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.775688Z","title":"A survey on hyperdimensional computing aka vector symbolic architectures, Part I: Models and data transformations,","venue":null,"work_id":"89e1cc45-4e5c-4909-93a6-866b4204c228","year":2022},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.733936Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:c658cf31b89b1019ea78e358dab89497d5b78e4c005117b4921d6605bd0308c5","observation_id":"81fe350a-aeb5-4a88-8d0a-34999050fea8","resolution":{"observed_at":"2026-08-11T17:16:08.779880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.762306Z","title":"Vector symbolic architectures answer Jackendoff’s chal- lenges for cognitive neuroscience,","venue":null,"work_id":"2b1e6584-33f8-47a2-ac05-0a1737ec82b1","year":2003},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.738341Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:62d5021979bed3c05b40bb512426a52a252a2f946273e90eb3ea8a56c3a58c2b","observation_id":"911c7c71-ffa2-418c-83e9-27004d26ec76","resolution":{"observed_at":"2026-08-11T17:16:08.766456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.749295Z","title":"A survey on hyperdimensional computing aka vector symbolic architectures, Part II: Applications, cognitive models, and challenges,","venue":null,"work_id":"5f63acc5-9957-4520-b806-f870135b012d","year":2023},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.742764Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:1aa6a0c8312caa0e2fe90ca0f4065be1634695889cfbea73409796647b40a2e7","observation_id":"b67cdad8-9e15-42f8-9d12-8317f5a36b00","resolution":{"observed_at":"2026-08-11T17:16:08.753313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.04371","last_updated":"2018-05-30T12:47:50Z","snapshot_observed_at":"2026-08-15T09:42:22.960884Z","submitted_at":"2017-06-14T09:13:33Z","title":"A survey of dimensionality reduction techniques based on random projection","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.04371","snapshot_observed_at":"2026-08-11T17:16:07.747180Z","title":"A survey of dimensionality reduction techniques based on random projection,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.747180Z"},"links":{"cited_paper":"/paper/1706.04371","citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:44d51ac7c91a2fd89c2ba33fbb8afe1d348cc1e0141e9af86496a534fe2baebf","observation_id":"480c1427-1d77-4949-a166-0bcc4504447c","resolution":{"observed_at":"2026-08-11T17:16:07.747180Z","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-11T17:16:08.736305Z","title":"Database-friendly random proj.: Johnson-Lindenstrauss with binary coins,","venue":null,"work_id":"948f289b-cace-4f03-826c-0eccb1f085ac","year":2003},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.752136Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:5ba546f587cf13eb5d6c76f39bef4b2583e9e53227dfcb16b911411d7b8fe14a","observation_id":"5f64db9e-0392-4a38-a574-447b3c00bccb","resolution":{"observed_at":"2026-08-11T17:16:08.740088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.723815Z","title":"Very sparse random projections,","venue":null,"work_id":"cdbef29a-0ce5-4abb-8ed6-0737a23b0c21","year":2006},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.756639Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:cc84e3f68adbf62c6f69f6ae1ed3dc3625c84652df1a5362042afbabae7ffadc","observation_id":"ece9d614-c6d3-4582-9994-c8c2cd389bd2","resolution":{"observed_at":"2026-08-11T17:16:08.727638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.710835Z","title":"Sparser Johnson-Lindenstrauss transforms,","venue":null,"work_id":"d33fb5e5-bf45-4e28-a74c-8afed0151784","year":2014},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.760978Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:c00cf5be2bcee9f430fa8d7e7215074fbc0fbf04c4db18b79b08056acde1b01a","observation_id":"c0770032-b097-4151-b48f-53bb6669b4c1","resolution":{"observed_at":"2026-08-11T17:16:08.715038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.697798Z","title":"Random indexing of text samples for latent semantic analysis,","venue":null,"work_id":"8289740c-98d0-4e23-bafa-c29346987eb8","year":2000},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.765493Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:b677b172638e38d83f1cda2300dd2844078b273b716e4824fd3b2c42b605c16c","observation_id":"970d367d-0fbe-483c-ad8a-8d2c9ec8e64b","resolution":{"observed_at":"2026-08-11T17:16:08.701875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.684126Z","title":"Vector-based semantic analysis: Representing word mean- ings based on random labels,","venue":null,"work_id":"4a945da3-9361-475b-9018-d99853e303ac","year":2001},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.770159Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:d540b981e362da5f646887feba66f67d3b28a1caea99995b6c071d265f222edd","observation_id":"ef2370a2-b512-4a5c-b555-f2b8eacdcc70","resolution":{"observed_at":"2026-08-11T17:16:08.688361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.671082Z","title":"Vector and distributed representations reflecting semantic relatedness of words,","venue":null,"work_id":"8979b9df-224f-4d62-aa55-69439dd2daec","year":2005},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.774472Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:7acb531840d0dc936dc1d18fbd9361968ce4ce3f2f7563dcb8b819ad1dae5c26","observation_id":"f75b55e3-1acd-41db-807a-88756409e0ea","resolution":{"observed_at":"2026-08-11T17:16:08.674936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.658309Z","title":"Similarity estimation techniques from rounding algo- rithms,","venue":null,"work_id":"bd6a4ec1-986e-4226-8229-f428411de3f8","year":2002},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.778828Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:da2634ebe21d7ae5821d3b14c6735f36afe99685e3c9ffa31326ca8b4228c2c2","observation_id":"11febeb8-7bfc-41ed-a4b4-3f095f51c534","resolution":{"observed_at":"2026-08-11T17:16:08.662220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.645489Z","title":"Searching for text information with the help of vector representations,","venue":null,"work_id":"058e5c48-5a94-4c91-b678-1bc042cf5c68","year":2005},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.783285Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:faf38dd65b3403717df05393dcff814dc9cc3a018f40a1d9875d5f999b228f9b","observation_id":"e0433a36-fdb9-4dea-a499-c02a44ba6b02","resolution":{"observed_at":"2026-08-11T17:16:08.649526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.631231Z","title":"Formation of similarity-reflecting binary vectors with random binary projections,","venue":null,"work_id":"88a7bf5b-9ec2-43ef-bbda-e75c72b3c785","year":2015},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.787819Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:fdd9adfe1b3dda298c36b81f9fe747b2d7839ed4babc5683fe17022820c0e6b6","observation_id":"73362492-e0fb-4480-a26a-3b88abb4eb01","resolution":{"observed_at":"2026-08-11T17:16:08.635662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.616944Z","title":"Randomized projective methods for the construction of binary sparse vector representations,","venue":null,"work_id":"12be06e3-80ae-409a-8675-0081c89cdcbf","year":2012},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.792417Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:2c83a5040e56e72215026e7e258282dedd0341f170221d8249c1eb2cc3d1d076","observation_id":"82342277-33b8-4c1d-9949-bdeb03b68101","resolution":{"observed_at":"2026-08-11T17:16:08.621448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.602786Z","title":"Estimation of vectors similarity by their randomized binary projections,","venue":null,"work_id":"cf5dfaf1-a70b-4c4c-a0b5-cb350675c271","year":2015},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.796915Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:300b665b4259ed47d83c659e7069c5f110819cc72a689bcc7f274cf28fd84404","observation_id":"b33820aa-4b0d-42c4-8c23-6d0206520c92","resolution":{"observed_at":"2026-08-11T17:16:08.607286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.588753Z","title":"A neural algorithm for a fundamental computing problem,","venue":null,"work_id":"37eeaa4d-fef7-42e3-a1dc-beed4cbfe1e4","year":2017},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.801406Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:8806efdf4ada14e57069fdb22a083111f0a34f37641ae8a07f03277c5748cee2","observation_id":"30e3bf4e-ba0c-4b8b-be63-99a0648922f2","resolution":{"observed_at":"2026-08-11T17:16:08.593057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.575349Z","title":"The Drosophila mushroom body: from architecture to algorithm in a learning circuit,","venue":null,"work_id":"3372870f-f5df-45d0-8c22-b39fff2949a9","year":2020},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.805901Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:eb81253c883796dfe3122a09acf4f26a0f08a1db2f209e52aa337c866adb0fc7","observation_id":"83c6af74-ef4e-4632-90a1-6da2aca667cb","resolution":{"observed_at":"2026-08-11T17:16:08.579366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.562063Z","title":"Kanerva, Sparse distributed memory","venue":null,"work_id":"66fe93a4-73a1-4241-a676-60371365dc08","year":1988},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.810747Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:31ec1520dc5d6eb4420d4d656cf3dd4f8f134c29a2700fe43ac27e81e72dba11","observation_id":"6457b19f-8de1-4676-8eab-1c1607f5c171","resolution":{"observed_at":"2026-08-11T17:16:08.566227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.549148Z","title":"High-dimensional computing with sparse vectors,","venue":null,"work_id":"ab42cc14-62f6-410d-9ca8-f77255efb0a7","year":2015},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.815025Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:4cda7e1cb87166cf03a7b42a444e4353bb48e9e2d0b70f057a50281589636ee7","observation_id":"70408b50-f861-491e-bc71-944e879ca283","resolution":{"observed_at":"2026-08-11T17:16:08.553091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.535958Z","title":"Neural distributed autoassociative memories: A survey,","venue":null,"work_id":"b9937761-3c0c-459c-9b4e-c99be17dd3ab","year":2017},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.819491Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:ff4ea488e646e7e1b0fdc604c0f44c86c09488b6c15be1b60ffd3109678ac137","observation_id":"2d024324-54fa-45a0-b006-61c6ab43b201","resolution":{"observed_at":"2026-08-11T17:16:08.540113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.522884Z","title":"Variable binding for sparse distributed representa- tions: Theory and applications,","venue":null,"work_id":"c524bb25-93e3-4437-9710-2cd2d2d25ea3","year":2023},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.823826Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:e466313f61ecba950bfde41e3ea78cefe32fa4be9e3bdb47db89faef5124d318","observation_id":"95fe8312-cbfc-4646-a547-bf29010b7151","resolution":{"observed_at":"2026-08-11T17:16:08.526829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.510033Z","title":"Product quantization for nearest neighbor search,","venue":null,"work_id":"8939cbcd-c8c2-450b-9fe0-edcba188a054","year":2011},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.828856Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:fee21a1fde20ce0a11192681a88a2accaa879797539462806a43fc7798597dd9","observation_id":"2b62f3e3-e12f-40e4-8e3e-7a5c331b9e76","resolution":{"observed_at":"2026-08-11T17:16:08.514227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.495737Z","title":"GloVe: Global vectors for word representation,","venue":null,"work_id":"87dafbbe-4da6-4bf7-888a-86e142060b8a","year":2014},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.834159Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:e64b0bf207d2d383369e54f91bff293b9ea7b4eab702199477cff463bd5bf60f","observation_id":"61979f6c-20d6-43df-affa-91072696367e","resolution":{"observed_at":"2026-08-11T17:16:08.500585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.482441Z","title":"Gradient-based learning applied to document recogni- tion,","venue":null,"work_id":"43e3e159-6089-4464-a32a-cbb5d832c573","year":1998},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.838941Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:3c489b646c36586de0f1fdb1a7bd28ee523c3d4a691998e721fbc071e674be6e","observation_id":"0ef7188a-4f17-46f6-87f9-593653163b5b","resolution":{"observed_at":"2026-08-11T17:16:08.486523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.469490Z","title":"Compressed hashing,","venue":null,"work_id":"2b446f6f-c4da-492c-b168-599d39bc994b","year":2013},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.843511Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:5ea422003a4ff754ba0ba4d436d8273c36d6755e4c9b6a5b581062fb873ce178","observation_id":"e0d00122-86fa-47bb-b201-ad209e294574","resolution":{"observed_at":"2026-08-11T17:16:08.473420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.456687Z","title":"Random convergence of olfactory inputs in the Drosophila mushroom body,","venue":null,"work_id":"17cf9059-c733-4aa2-bcaf-6f4b7e9c5c62","year":2013},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.847993Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:4cde3a552a0db4789dac275be64fdfb66ec0407735a25ab189753918a41e00ec","observation_id":"213ba26c-01c2-47f3-ac84-7aff36833fa3","resolution":{"observed_at":"2026-08-11T17:16:08.460665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.443465Z","title":"Expansion of inf. in the binary autoencoder with random binary weights,","venue":null,"work_id":"e2c330e7-a4ed-475b-ba5c-fe9d6a080502","year":2021},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.852512Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:427129f733ccd37fbdf8969ce48b139a41819730f1b939bbe2c2f007f2d1bcb0","observation_id":"dd971b84-6bcf-4622-9173-1a3fa5b163af","resolution":{"observed_at":"2026-08-11T17:16:08.447446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.430320Z","title":"Can a fruit fly learn word embeddings?","venue":null,"work_id":"a8f2451e-e50b-4cbe-bd10-a7bed53f4505","year":2021},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.856831Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:2a85d456f47e0ee5705cf950086d87513ec46afe6e590462ea2d55f2775dbe59","observation_id":"5ec8a6ef-7de1-44b9-99af-2b85c4a61287","resolution":{"observed_at":"2026-08-11T17:16:08.434417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.416591Z","title":"Attention approximates sparse distributed memory,","venue":null,"work_id":"c1302cf6-8cca-4924-8fc1-8792a00ed92b","year":2021},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.861583Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:4d1f5d7005af16a00eeff3d51bf408d30aa84f0e44fa4ca7326c461243203265","observation_id":"2e14ee7d-3507-4b62-82a0-992c15705aab","resolution":{"observed_at":"2026-08-11T17:16:08.420536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.403363Z","title":"Reducing catastrophic forgetting with assoc. learning: A lesson from fruit flies,","venue":null,"work_id":"0df73628-e69a-4f28-918b-5a2f0d217db5","year":2023},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.865957Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:ab5116c8f148bb2b841494529cc1550f7d7937d65aa2d3568b58e31c3bc84a81","observation_id":"95c3ebb6-ae9e-4c32-8a61-10e4ff6fa816","resolution":{"observed_at":"2026-08-11T17:16:08.407446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.389950Z","title":"Discrete key-value bottleneck,","venue":null,"work_id":"e1256edb-a345-401c-81fa-cf5a176e29d8","year":2023},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.870241Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:02437ae56cd4dfa5ac3dd7f6439c920c13fd7b90d5bea6d6f67a6f3b67f1f4a4","observation_id":"1fe7731b-f30d-4ec3-bfcf-949543276fc6","resolution":{"observed_at":"2026-08-11T17:16:08.394064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.375837Z","title":"Sparse distributed memory is a continual learner,","venue":null,"work_id":"7e14017c-aa49-4b25-8d1e-f563d4d37c47","year":2023},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.874753Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:b9e3b417658ff1f5b82c21f11557842b10eb3ef2cc011a3c0547ff5f4c3e95eb","observation_id":"801effff-8ce3-411d-9738-0b1f501a4e6e","resolution":{"observed_at":"2026-08-11T17:16:08.380809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.362998Z","title":"Random features for large-scale kernel machines,","venue":null,"work_id":"7b19607f-eef5-4e0f-82a9-eb9fc6950463","year":2007},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.879042Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:2427057e1de88514c24595b131845dba662dab6835ffd6638cd11b7b88c02921","observation_id":"40b5c919-d0a6-40a9-9a9d-8ce39819a102","resolution":{"observed_at":"2026-08-11T17:16:08.366992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.349190Z","title":"Computing on functions using randomized vector representations (in brief),","venue":null,"work_id":"d0309f47-50bf-41ed-91c3-ec6e84b93f29","year":2022},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:07.999556Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:689d2e22280b2a32c903b046195f5c5ad2f6b9076aeb4ff722160ce4750c8895","observation_id":"8d761668-e50f-4820-8d84-d99e47f024f0","resolution":{"observed_at":"2026-08-11T17:16:08.353334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.09868","last_updated":"2023-02-08T18:33:13Z","snapshot_observed_at":"2026-08-15T09:42:45.955206Z","submitted_at":"2022-09-20T17:25:14Z","title":"Streaming Encoding Algorithms for Scalable Hyperdimensional Computing","version":4},"cited_work":{"arxiv_id":"2209.09868","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.09868","snapshot_observed_at":"2026-08-11T17:16:08.159143Z","title":"Streaming Encoding Algorithms for Scalable Hyperdimensional Computing","venue":"cs.LG","work_id":"56f7f6a9-1657-4cf8-aa36-b5bdb5f28572","year":2022},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.003808Z"},"links":{"cited_paper":"/paper/2209.09868","citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:3c0ea179d08196898768ef65a46e2591dafcd26f0aff722d6485e93308cb8a4a","observation_id":"c47cc5dd-aea4-4068-8cb9-de72d50973f1","resolution":{"observed_at":"2026-08-11T17:16:08.163499Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.335987Z","title":"Bio-inspired hashing for unsupervised similarity search,","venue":null,"work_id":"54ea5fb4-1358-4a2e-8e6b-0a37505f8467","year":2020},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.008071Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:5888e65d5e0c39cf1778ad6a2d25ba47de68184093dacd8193f3ae4069a242c4","observation_id":"7a1e030e-70e2-49bb-926f-04a4d07ee6d1","resolution":{"observed_at":"2026-08-11T17:16:08.340041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10759","last_updated":"2024-04-26T17:41:37Z","snapshot_observed_at":"2026-08-13T00:28:53.902359Z","submitted_at":"2024-04-16T17:36:21Z","title":"Laplace-HDC: Understanding the geometry of binary hyperdimensional computing","version":2},"cited_work":{"arxiv_id":"2404.10759","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.10759","snapshot_observed_at":"2026-08-11T17:16:08.138851Z","title":"Laplace-HDC: Understanding the geometry of binary hyperdimensional computing","venue":"cs.LG","work_id":"cd69b7e4-c214-4381-af81-80a1eb9a19ea","year":2024},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.011592Z"},"links":{"cited_paper":"/paper/2404.10759","citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:e33dfbd455d98c5d659bfb91863e05eeb73707a3c326f1f20869aa9e53917d32","observation_id":"a420d18e-fe4a-4bb8-96e2-a605a8f8c181","resolution":{"observed_at":"2026-08-11T17:16:08.143706Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.323012Z","title":"Sparse neural networks with large learning diversity,","venue":null,"work_id":"3c1cd3cb-ecce-43ad-89e7-a95a7d38bb47","year":2011},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.016024Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:3336bdf05a72c685a204d733da15cc7be8d09f898b1ca6fccdb36491c0b098d9","observation_id":"4ce74a12-05f5-4e2d-b905-258a6a9e9773","resolution":{"observed_at":"2026-08-11T17:16:08.327069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.310024Z","title":"Iter. retrieval and block coding in auto- and hetero-assoc. memory,","venue":null,"work_id":"ae6ab74a-42a1-4be0-964c-b4bcc93ca7ca","year":2020},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.020022Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:986e6c4defe94656066604c9749be1f101a61e860c52c9bbfd1902c2e1167465","observation_id":"13fa36f9-da82-40e1-bf82-f1a71475b24f","resolution":{"observed_at":"2026-08-11T17:16:08.314082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.03741","last_updated":"2020-06-05T23:36:59Z","snapshot_observed_at":"2026-08-15T09:42:48.733605Z","submitted_at":"2020-06-05T23:36:59Z","title":"Expressivity of expand-and-sparsify representations","version":1},"cited_work":{"arxiv_id":"2006.03741","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.03741","snapshot_observed_at":"2026-08-11T17:16:08.117249Z","title":"Expressivity of expand-and-sparsify representations","venue":"cs.NE","work_id":"deb2e0da-6a9a-4ee9-8208-9e6e8988112a","year":2020},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.024185Z"},"links":{"cited_paper":"/paper/2006.03741","citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:2ce63e5e381695cf4c98423eef9592f6de50d8c3ce975dddeea6d34af1b8e619","observation_id":"2347003d-3dea-49b3-b66d-c185c945ca6a","resolution":{"observed_at":"2026-08-11T17:16:08.123546Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.296635Z","title":"A theory of sequence indexing and working memory in recurrent neural networks,","venue":null,"work_id":"640f850f-a8ac-4826-941e-840a7caac012","year":2018},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.028826Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:cc46a3c27680c3ed3593b5b3bdb576ea25859b5243b46ec7a3f0fa2a112f179d","observation_id":"5d0d9242-9428-4ab7-9734-11587ec1957e","resolution":{"observed_at":"2026-08-11T17:16:08.300761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.282639Z","title":"A comparison of vector symbolic architectures,","venue":null,"work_id":"fb99b2ac-0c30-4c45-af5f-e79868bf9c9c","year":2022},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.032595Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:ba2dd87393d34224b00ce0e259d280bc07ef717cd7144eacbf5f83ac2e290a82","observation_id":"4ea9d081-7ff2-416f-b198-22e543c2a972","resolution":{"observed_at":"2026-08-11T17:16:08.287426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.268339Z","title":"Near-channel classifier: Symbiotic communication and classification in high-dimensional space,","venue":null,"work_id":"1de687ba-fdd6-4cd9-8af7-d2d7bd92ce18","year":2021},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.036744Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:e7a3c18f4b6766a05697731650414d57e89a4a1eb021c226f5a4a2f55d675783","observation_id":"6f591be1-202f-4d0e-a0f5-b099ad32aa84","resolution":{"observed_at":"2026-08-11T17:16:08.272949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.254029Z","title":"A theoretical perspective on hyperdimensional computing,","venue":null,"work_id":"02f3b73e-4a6b-47d0-85a6-b7d21c05f1ad","year":2021},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.040747Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:eb9893f7390c770196a3a2acb0ceabd776761655fb09336fab115abb4bcb9f53","observation_id":"32a8baae-1c4d-43d1-89bd-649cb1815a90","resolution":{"observed_at":"2026-08-11T17:16:08.258111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.10352","last_updated":"2023-02-14T20:50:04Z","snapshot_observed_at":"2026-08-14T23:58:26.899198Z","submitted_at":"2023-01-24T23:43:25Z","title":"Capacity Analysis of Vector Symbolic Architectures","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.10352","snapshot_observed_at":"2026-08-11T17:16:08.044679Z","title":"Capacity analysis of vector symbolic architec- tures,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.044679Z"},"links":{"cited_paper":"/paper/2301.10352","citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:4be4b8e08e6ebf8044c1eb16ab311e86a7db46916580d3394541902bf59b51a4","observation_id":"0131643b-040e-48d1-a31b-c7e40b6c02e1","resolution":{"observed_at":"2026-08-11T17:16:08.044679Z","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-11T17:16:08.240668Z","title":"Efficient decoding of compositional structure in holistic representations,","venue":null,"work_id":"013c6004-775c-440c-b3e9-86fe105d61cf","year":2023},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.049306Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:1274b0798a16d92946768b95eb85322a9ec28e3560bc16a25e4a75e725e21e1d","observation_id":"20c06429-84a2-4464-9c8c-3b4f44dd869d","resolution":{"observed_at":"2026-08-11T17:16:08.244680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.226454Z","title":"Hyperdimensional computing as a frame- work for systematic aggregation of image descriptors,","venue":null,"work_id":"bcb4c1b4-37ac-453e-8eee-ecf008684707","year":2021},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.053132Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:1e040e2d0927fca2a8d402e876f9126ee89fb3df0c5112887ff29a17bd88d803","observation_id":"e6eaf725-ee45-4ea7-b474-7b84867b52f5","resolution":{"observed_at":"2026-08-11T17:16:08.230963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.212157Z","title":"Modification of holographic graph neuron using sparse distributed representations,","venue":null,"work_id":"ffaa6b44-7684-4614-9dd6-1242d2fae9c8","year":2016},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.057165Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:7da1eadb74804712f552d5e5af55b55a4ac9c10f50b82a7d98b84680e23cc6f1","observation_id":"caa8d14e-b087-4eae-be24-7c5e15226054","resolution":{"observed_at":"2026-08-11T17:16:08.216851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.198473Z","title":"Classification using hyperdimensional comput- ing: A review,","venue":null,"work_id":"372bfe3c-f7f9-4a67-bdcb-b9f4990d50a0","year":2020},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.061036Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:1f9034fbc27de74399c63feb29ad9e5a7ba1b7aaa18250f044b7cb499c3a271f","observation_id":"dd103b6d-cbed-4891-bb30-963a2d2ffd7b","resolution":{"observed_at":"2026-08-11T17:16:08.202647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-11T17:16:08.064853Z","title":"UCI machine learning repository,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T17:16:08.064853Z"},"links":{"citing_paper":"/paper/2501.14741"},"observation_digest":"sha256:b3cd5380bf03ad10a7cb3fa40dc7114a94f763e0f10a59297d256dfb1e0125f1","observation_id":"8a53725a-82c8-4574-b970-5f659ae70ba8","resolution":{"observed_at":"2026-08-11T17:16:08.064853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.14741","last_updated":"2024-12-12T12:51:13Z","latest_version":1,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-15T05:26:17.936484Z","submitted_at":"2024-12-12T12:51:13Z","title":"On Design Choices in Similarity-Preserving Sparse Randomized Embeddings"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":3,"verified_fuzzy":49},"total_outbound_references":56},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2501.14741."}