{"as_of":"2026-08-21T07:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c230c49e3fd32d9bb949aa2b0170ca82036877b5fbdb1b4d1a18441b715be38","coverage":[{"denominator":204,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:14:39.187041Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2508.17083/citation-record","integrity":"/paper/2508.17083/integrity","json":"/paper/2508.17083/citation-record.json","paper":"/paper/2508.17083"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:14:38.350992Z","title":"Supervised hashing with kernels","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.350992Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:153b12b76012f09d4314f5492c11e018fa71c8ae7002624df2667edf115ce256","observation_id":"3a363db6-1d66-4eae-955d-ca80c57a6fe3","resolution":{"observed_at":"2026-08-15T17:14:38.350992Z","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-15T17:14:38.366942Z","title":"Similarity search in high dimensions via hashing","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.366942Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:039463438cc299278e9ba16254dde92249eb7cddbe67ac8c9593df831aec96d8","observation_id":"c62749da-7e78-47e1-8669-2054e611a809","resolution":{"observed_at":"2026-08-15T17:14:38.366942Z","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-15T17:14:38.388632Z","title":"Similarity estimation techniques from rounding algorithms","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.388632Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:4ef2880191bdd78bd90b908bd4e0baa3db6c69f4ffb72cb2c37c5c444e12a97f","observation_id":"053aab27-b6f5-417a-a9e1-224ee254fbd1","resolution":{"observed_at":"2026-08-15T17:14:38.388632Z","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-15T17:14:38.396097Z","title":"Semantic hashing","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.396097Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:c273c4ee014ad2cc70f4d4f31f0e47ba4265be07c355cccb638093474886be50","observation_id":"97849fc3-3982-4fcd-8582-de143b90fa49","resolution":{"observed_at":"2026-08-15T17:14:38.396097Z","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-15T17:14:38.403504Z","title":"Spectral hashing","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.403504Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:c6069b9fe4b078955870be9921d767ec63dc4225915043107c023a385417af13","observation_id":"04fc16ee-54a7-445d-8fbf-8c0bdd1dbb31","resolution":{"observed_at":"2026-08-15T17:14:38.403504Z","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-15T17:14:38.425495Z","title":"Spherical hashing","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.425495Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:5e184ae048fc16e901384d878cb215c5f11662c7bd0432815a7f1a9443a81674","observation_id":"928a516a-3587-4eff-b1ac-256bc2c8c5a8","resolution":{"observed_at":"2026-08-15T17:14:38.425495Z","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-15T17:14:38.440433Z","title":"Semi-supervised hashing for large-scale search","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.440433Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:5fc229b7d6668fb54a3a55f76dfebc1d260c02fc4210e44495e825841e2aa9e5","observation_id":"2b86f17e-a3b5-4c56-8a15-a20cf751bce6","resolution":{"observed_at":"2026-08-15T17:14:38.440433Z","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-15T17:14:38.451866Z","title":"Hash function learning via codewords","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.451866Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:051fff199e00c365f7b0150b9617e9986f03f6fe77fc56a1317ffde84b179fdc","observation_id":"e53eb77e-072b-4b7f-ad44-aa8d1ef402c6","resolution":{"observed_at":"2026-08-15T17:14:38.451866Z","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-15T17:14:38.461888Z","title":"Visual saliency guided complex image retrieval","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.461888Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:c006bb485e820a6e646f5f4c1b913e8b44194c468ba21b532d51bdcd92eda0f1","observation_id":"3502b36d-7b25-4150-bca4-903cbd6fee9b","resolution":{"observed_at":"2026-08-15T17:14:38.461888Z","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-15T17:14:38.473250Z","title":"Feature extraction and a database strategy for video fingerprinting","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.473250Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:6e2f4580675f6368ea416699055f4873847a2e2a737190a77d305b3dda06078a","observation_id":"bfdbf4ae-732e-432a-a8a2-0d69ff55939f","resolution":{"observed_at":"2026-08-15T17:14:38.473250Z","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-15T17:14:38.483188Z","title":"A robust and fast video copy detection system using content-based fingerprinting","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.483188Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:10342aa0683dad46c210619417490b119883a4e0212634bc9976908f409bd7a4","observation_id":"c89f25cb-579f-450e-b4ff-7d77428e6009","resolution":{"observed_at":"2026-08-15T17:14:38.483188Z","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-15T17:14:38.491572Z","title":"Fast matching for video/audio fingerprinting algorithms","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.491572Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:9734610216572dd6ff0addc40e06324e1ecc848aeea1bc29b6280f852f9f4a0b","observation_id":"58c0e351-1812-438a-a460-48b914b7b5da","resolution":{"observed_at":"2026-08-15T17:14:38.491572Z","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-15T17:14:38.501385Z","title":"Audio fingerprinting: nearest neighbor search in high dimensional binary spaces","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.501385Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:3a8a301d5def0e53db3a0e9f61bb0d608718dc76e87b4e310fde32c02bda3a46","observation_id":"e2eb86cd-baef-445a-ad71-07cc6437152d","resolution":{"observed_at":"2026-08-15T17:14:38.501385Z","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-15T17:14:38.507529Z","title":"Cellfishing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.507529Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:8c506ed7d3b4f87ec1fca15ab32427a4f04625124ec6d004a0291916f03a819a","observation_id":"19f344ea-74c1-4581-bdf2-2f8de22bf3bc","resolution":{"observed_at":"2026-08-15T17:14:38.507529Z","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-15T17:14:38.514128Z","title":"Efficient iot-based sensor big data collection--processing and analysis in smart buildings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.514128Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:58ba00784f5db41876e6b75663eba847cecd4e56b89399ac387e15c77477e2a5","observation_id":"af6bbcd2-09da-4e06-8973-4382e5d9baa8","resolution":{"observed_at":"2026-08-15T17:14:38.514128Z","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-15T17:14:38.519544Z","title":"Security, privacy & efficiency of sustainable cloud computing for big data & iot","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.519544Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:105677a5fa0dd0fa584552dff9a331f4e58c03745ec8e7bbdc34c7397b5f438f","observation_id":"baec2ff0-634c-49aa-ae80-612d67802da8","resolution":{"observed_at":"2026-08-15T17:14:38.519544Z","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-15T17:14:38.527434Z","title":"Four-image encryption scheme based on quaternion fresnel transform, chaos and computer generated hologram","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.527434Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:e0cdaff2a699eb5effbee660c6b02686661c137fba3f58645e3e59b4b700e9cd","observation_id":"149b78e7-dec0-4ec1-9897-9772d9f03b87","resolution":{"observed_at":"2026-08-15T17:14:38.527434Z","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-15T17:14:38.535060Z","title":"Cellatlassearch: a scalable search engine for single cells","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.535060Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:6d2dbeee3182783e39aea02b0218375b47043d42319d02c56799aae9afc8a991","observation_id":"2e720b51-31ee-4439-846d-511da886ad11","resolution":{"observed_at":"2026-08-15T17:14:38.535060Z","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-15T17:14:38.542268Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.542268Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:41b092213fe56059a0a5adbf4268896c32a6d809a1a4a3dccb79a67e56e85ecc","observation_id":"75b6d795-a1a7-4429-8f30-bc7f1009f0cd","resolution":{"observed_at":"2026-08-15T17:14:38.542268Z","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-15T17:14:38.548860Z","title":"Fast exact search in hamming space with multi-index hashing","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.548860Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:fb5408411c563152a3397b59a1b503989462f77a44bc45bfc98fb99158c8e2ad","observation_id":"8c2b7ead-1989-424f-9d42-aec8bae6d09e","resolution":{"observed_at":"2026-08-15T17:14:38.548860Z","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-15T17:14:38.555835Z","title":"Fast nearest neighbor search in the hamming space","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.555835Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:39eb08f4f9dd2b64b1d7fd2e7bf2e1a89846033110c32d75fff584181da6fe5e","observation_id":"32418d34-422b-41cb-acaf-0c1070a4aa63","resolution":{"observed_at":"2026-08-15T17:14:38.555835Z","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-15T17:14:38.566137Z","title":"A fast approximate nearest neighbor search algorithm in the hamming space","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.566137Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:9791da372bb50edc9370d8bfef6e72fd011c4f598141ecc9ffc7c281a639c415","observation_id":"08e9da66-24a1-4c0b-b953-98e090459bd5","resolution":{"observed_at":"2026-08-15T17:14:38.566137Z","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-15T17:14:38.573217Z","title":"Lsh forest: self-tuning indexes for similarity search","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.573217Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:c13aa58466cd4b6ef32fa70d79c0428a43cf2aadf1e2f7e2a8173b6ab783c778","observation_id":"d522836e-fc00-4ec0-9870-f5eaeec51d57","resolution":{"observed_at":"2026-08-15T17:14:38.573217Z","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-15T17:14:38.584825Z","title":"Random projection trees and low dimensional manifolds","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.584825Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:0dcf4564a7e3cd1f12cd9b5641c6365ce2d7b4f4abc8571baeb371d6832b6dca","observation_id":"e5a6f1a3-c3b7-4392-be7c-d1882fdba140","resolution":{"observed_at":"2026-08-15T17:14:38.584825Z","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-15T17:14:38.595699Z","title":"Randomized partition trees for exact nearest neighbor search","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.595699Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:67e3184011504f8dc4ce8a912f89e77c303142a6e890c31efc94fc655cdb7b7b","observation_id":"d1c37214-ed1e-433a-b0d8-458bdf363f0d","resolution":{"observed_at":"2026-08-15T17:14:38.595699Z","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-15T17:14:38.604212Z","title":"Multidimensional binary search trees used for associative searching","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.604212Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:465c0108df22b73e2bbdb97c33b919c0a76ad5befcb0bac786bd8698637b9c3a","observation_id":"36470d5c-53c1-4c8f-92e9-aea2af0c4d14","resolution":{"observed_at":"2026-08-15T17:14:38.604212Z","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-15T17:14:38.610771Z","title":"Olshen and oj","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.610771Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:9b3a47b95d729513cb42a4faaa0575dbe72e6a703d84116dd488e269aea2c49c","observation_id":"1fa0d100-8f2a-4e27-b4d3-04569d743d59","resolution":{"observed_at":"2026-08-15T17:14:38.610771Z","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-15T17:14:38.616761Z","title":"Random forests","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.616761Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:54eccc12024eb5f088c8e63d1bb3395e2f0d6200977473768b3d434e03b6585b","observation_id":"9f6463cc-5c32-47d3-8ffd-aa9aa084a98d","resolution":{"observed_at":"2026-08-15T17:14:38.616761Z","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-15T17:14:38.624494Z","title":"Extremely randomized trees","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.624494Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:52afdb8f9281e95c195d751535cd1dae029eb6a0e7783372194278bad193c341","observation_id":"8fa85c46-1460-447b-b99b-ad2025ff5d0d","resolution":{"observed_at":"2026-08-15T17:14:38.624494Z","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-15T17:14:38.631658Z","title":"Five balltree construction algorithms","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.631658Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:b5cccf7582cab9ce886cf91e44e8a276d3e35969d095832ab67b5718d5b06430","observation_id":"063aae6a-670f-44dd-821b-5f7f808e65be","resolution":{"observed_at":"2026-08-15T17:14:38.631658Z","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-15T17:14:38.640255Z","title":"An optimal algorithm for approximate nearest neighbor searching fixed dimensions","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.640255Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:4355bfc71a770e964a586efc9ad9c25abd329caa74667b0373bb2c38a81bc4f0","observation_id":"db2db464-86a8-4fcd-9aa9-cf01269dfa8b","resolution":{"observed_at":"2026-08-15T17:14:38.640255Z","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-15T17:14:38.650714Z","title":"Birch: an efficient data clustering method for very large databases","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.650714Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:d30f78fb365e03093cd0ffd260cfbc9f14bd60651ca86b7f55d99cbaea1798e8","observation_id":"ac69ef21-e244-4dc8-a98e-219db9e40153","resolution":{"observed_at":"2026-08-15T17:14:38.650714Z","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-15T17:14:38.656409Z","title":"hdbscan: Hierarchical density based clustering","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.656409Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:061e6430a9a8c5026652a19384e4225e5c761416d4f74ff5aea45554ed69eef6","observation_id":"f8e07678-22ac-4643-964f-32d55ef8e704","resolution":{"observed_at":"2026-08-15T17:14:38.656409Z","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-15T17:14:38.663385Z","title":"Agglomerative clustering via maximum incremental path integral","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.663385Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:d2ed79bf419650269e74802b05010b29d8ef04ea8429450d716878fd76ae3fe0","observation_id":"338944b8-e931-4b9f-a200-df0a5dea1928","resolution":{"observed_at":"2026-08-15T17:14:38.663385Z","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-15T17:14:38.671091Z","title":"Isolation forest","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.671091Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:224a65b0efce39bd7d76f5991009a69928bcd37407dd1e4e7f38277f32ed14a4","observation_id":"d02c8696-3dd4-48a4-95e7-4def50d81d5c","resolution":{"observed_at":"2026-08-15T17:14:38.671091Z","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-15T17:14:38.681330Z","title":"Adaptive random forests for evolving data stream classification","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.681330Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:8b84e4f90523e3e502063306b5775a8ca1380b6f71814b2ea5bfd947b91eedc0","observation_id":"2dfffdb7-775a-4f4e-bf40-1a77ee22e74b","resolution":{"observed_at":"2026-08-15T17:14:38.681330Z","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-15T17:14:38.690960Z","title":"Discovery of rare cells from voluminous single cell expression data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.690960Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:b7576ad755da8d9d29818998b9d139a6046bcdf9b190886f5469c3f409f9cddb","observation_id":"580a4da7-b621-4890-8158-e0aecea09ad6","resolution":{"observed_at":"2026-08-15T17:14:38.690960Z","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-15T17:14:38.698025Z","title":"Classifying many-class high-dimensional fingerprint datasets using random forest of oblique decision trees","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.698025Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:6a3b71da66b3171ef11f975b6eb0f96800eb5a26ed8255029583c0c53c0a4ae8","observation_id":"a94c8f05-6114-4bec-9415-765618d71152","resolution":{"observed_at":"2026-08-15T17:14:38.698025Z","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-15T17:14:38.712288Z","title":"Random forest in remote sensing: A review of applications and future directions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.712288Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:5cbe46c685a8bba5c453718351a21e9e6c69dd0882b641ef23c26d75d9fb59f4","observation_id":"856e4f69-d4f8-4101-8386-da6fcad77ce9","resolution":{"observed_at":"2026-08-15T17:14:38.712288Z","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-15T17:14:38.718961Z","title":"Oblique random forest based on partial least squares applied to pedestrian detection","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.718961Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:9343a42717cf7f76a7450f72b6f1636ecb567d23fe4dad50b4865b2220b823a1","observation_id":"374ced82-20fb-45f4-b86f-ad44b05926b8","resolution":{"observed_at":"2026-08-15T17:14:38.718961Z","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-15T17:14:38.726081Z","title":"Oblique random forest ensemble via least square estimation for time series forecasting","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.726081Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:2e6f3629753c77415cc8c81ac755d5851058de8c35f20e08cc9f9b8a2a184648","observation_id":"cb8c5b5d-b786-445c-8866-50e1d4f10ffc","resolution":{"observed_at":"2026-08-15T17:14:38.726081Z","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-15T17:14:38.732506Z","title":"Robust visual tracking using oblique random forests","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.732506Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:c6d879329464c64076f05d60bed19a02d0117a923006108b4c48a92a2f94d6e6","observation_id":"25350849-080d-4b24-ad4c-68977e796cb0","resolution":{"observed_at":"2026-08-15T17:14:38.732506Z","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-15T17:14:38.738881Z","title":"Random forests for genomic data analysis","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.738881Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:ae37990aaffd7d3437fa9eea032bb677471108fdb5bd4c92f06463e854747e40","observation_id":"8e05c676-03fd-4da7-b173-b9ff3a9a37b3","resolution":{"observed_at":"2026-08-15T17:14:38.738881Z","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-15T17:14:38.746200Z","title":"Resource-efficient machine learning in 2 kb ram for the internet of things","venue":null,"work_id":null,"year":1935},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.746200Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:7f76865b25d895b7cdb75852d126bdd4b68b5cb9c3e23005a3109b84573cfff2","observation_id":"2f768b53-870d-4919-b12a-faa1d8b1d992","resolution":{"observed_at":"2026-08-15T17:14:38.746200Z","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-15T17:14:38.751622Z","title":"Robust head pose estimation using dirichlet-tree distribution enhanced random forests","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.751622Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:24e6985b7855014481f45ef6bbae6476b49d574e51647792d0fe640aea7a6425","observation_id":"c31c317e-1859-4877-b466-20713db6f5b5","resolution":{"observed_at":"2026-08-15T17:14:38.751622Z","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-15T17:14:38.757434Z","title":"Ferret: a toolkit for content-based similarity search of feature-rich data","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.757434Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:832af5348458a7fa3a8873503add5469b21378853d70f73ac33e9995332aa5c5","observation_id":"195698f3-faff-47c3-9e89-83bb9d12ece2","resolution":{"observed_at":"2026-08-15T17:14:38.757434Z","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-15T17:14:38.763291Z","title":"Sizing sketches: a rank-based analysis for similarity search","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.763291Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:19cc3fff8c67f75f85333a43a47de80e9c65ba426e37e52cb5d5cf42b4c8a4bd","observation_id":"8029b05f-aa00-4f47-93fc-d5382a263868","resolution":{"observed_at":"2026-08-15T17:14:38.763291Z","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-15T17:14:38.772813Z","title":"A method and server for predicting damaging missense mutations","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.772813Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:5a73a81f5903fa859d17d3c6380bc33391e9fa848660780b8e5b13d4034f6ee4","observation_id":"51c03e8d-56de-49ef-9c59-88b9db20a67e","resolution":{"observed_at":"2026-08-15T17:14:38.772813Z","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-15T17:14:38.782426Z","title":"Sift missense predictions for genomes","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.782426Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:f8ee04deaa0d6d378f4884b501ebbb64945580e3c0a8e504eaaa31838927e9c9","observation_id":"abe8f7f7-83f8-4c03-9f29-6f608c64f505","resolution":{"observed_at":"2026-08-15T17:14:38.782426Z","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-15T17:14:38.789001Z","title":"Disease variant prediction with deep generative models of evolutionary data","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.789001Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:de6ec22828324123cbee36ce21f3c2a4ecb9beed00d4c821484233dbfc5b156c","observation_id":"71e9c9d8-4c64-41a8-845c-87b58b4a7e4d","resolution":{"observed_at":"2026-08-15T17:14:38.789001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-15T17:14:38.795841Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.795841Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:f2a0d3aa2f14c996c3937f7a893f6d969f905af55222e2244063981edae83601","observation_id":"774345e6-b852-4f33-9df4-6a87665bc659","resolution":{"observed_at":"2026-08-15T17:14:38.795841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-15T17:14:38.804823Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.804823Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:b989a4f7d8d21d15fbaf20b3df7f54047407d5568c158c6a74409695c3a1ce25","observation_id":"ae173d17-7952-490c-8a1c-6d878606fbb7","resolution":{"observed_at":"2026-08-15T17:14:38.804823Z","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-15T17:14:38.812216Z","title":"Do we need hundreds of classifiers to solve real world classification problems? The Journal of Machine Learning Research , 15(1):3133--3181, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.812216Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:cb43687b8174f7cf5c07065523616c58ece3c0ac065a72fad6dbad605bec7f97","observation_id":"3f707704-e13c-4376-b761-19907d90094e","resolution":{"observed_at":"2026-08-15T17:14:38.812216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1408.2927","last_updated":"2014-08-13T07:29:12Z","snapshot_observed_at":"2026-08-14T23:23:19.723333Z","submitted_at":"2014-08-13T07:29:12Z","title":"Hashing for Similarity Search: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1408.2927","snapshot_observed_at":"2026-08-15T17:14:38.818785Z","title":"Hashing for similarity search: A survey","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.818785Z"},"links":{"cited_paper":"/paper/1408.2927","citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:246195741bfa2d6cc5399f2d82e07579df03dddbc7ebe399b1749562f29adfcb","observation_id":"7e903c02-8e19-465b-95bc-189fe4dc69a9","resolution":{"observed_at":"2026-08-15T17:14:38.818785Z","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-15T17:14:38.826844Z","title":"Approximate nearest neighbor search on high dimensional data-experiments, analyses, and improvement","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.826844Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:25a97bb682a10efd6d154b32d0825c9dba5568d3303b6be9938e767021396434","observation_id":"4254f670-8188-4f90-a2bb-e2f979eedf87","resolution":{"observed_at":"2026-08-15T17:14:38.826844Z","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-15T17:14:38.834873Z","title":"Hbst: A hamming distance embedding binary search tree for feature-based visual place recognition","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.834873Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:b5433e59e915624edbc25d89547fab598c90d82370636c485e35e4f5745ea086","observation_id":"8dcec356-2e08-42f8-9557-6a2f227d4914","resolution":{"observed_at":"2026-08-15T17:14:38.834873Z","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-15T17:14:38.848190Z","title":"Locality-sensitive hashing without false negatives","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.848190Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:2b5a2b39477be7e0fd57679ead53eb6b9c35db065e1626ff3a0092d1878e00ff","observation_id":"9d26c1f1-8fc4-449f-aa9c-58aa9af0fc5e","resolution":{"observed_at":"2026-08-15T17:14:38.848190Z","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-15T17:14:38.868845Z","title":"Scalability and total recall with fast coveringlsh","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.868845Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:8000b7c40afd77626698c7d2d1c154f99b0f66fa93e94fc40737897efd804510","observation_id":"68379371-591e-4115-abc6-2e5a07634525","resolution":{"observed_at":"2026-08-15T17:14:38.868845Z","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-15T17:14:38.875736Z","title":"Online nearest neighbor search in binary space","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.875736Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:51656134609154284c36a552782cbb7df8be58128843afbbae1eda382984e630","observation_id":"32663f78-797e-4409-b910-0683f52a2324","resolution":{"observed_at":"2026-08-15T17:14:38.875736Z","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-15T17:14:38.883054Z","title":"Online nearest neighbor search using hamming weight trees","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.883054Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:9523c43e01285afd131483b382bd0e6b7106e888e07f3e1a70785fe2e20f3350","observation_id":"ef7635b6-aedc-41b3-a5bb-52b58c5e1146","resolution":{"observed_at":"2026-08-15T17:14:38.883054Z","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-15T17:14:38.889844Z","title":"Fast and compact hamming distance index","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.889844Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:25ee2f88ccdbdff2a014549093c0232a569a4432de7d3f676d1a9c9f0d06d7d1","observation_id":"5ee5fbf6-2f28-4c31-940e-76da37df4db4","resolution":{"observed_at":"2026-08-15T17:14:38.889844Z","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-15T17:14:38.895707Z","title":"o nen, Teemu Pitk \\","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.895707Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:8d105037d9b25c54db2cc4d2c13e7ddcbaeb8cfc64c15d741f4f3d79525cbd9e","observation_id":"2ffae1cd-1557-4c0c-be31-b477870b0554","resolution":{"observed_at":"2026-08-15T17:14:38.895707Z","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-15T17:14:38.903097Z","title":"dropclust: efficient clustering of ultra-large scrna-seq data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.903097Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:4ef91299ac3d43ed63fe832f146b9df35cb2c107f6a936773f472c4fd0274a3d","observation_id":"41b2c24b-3410-4329-ab1e-9643322bff32","resolution":{"observed_at":"2026-08-15T17:14:38.903097Z","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-15T17:14:38.909696Z","title":"dropclust2: An r package for resource efficient analysis of large scale single cell rna-seq data","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.909696Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:99e6f4d929882b2e9f9b9cf0914fcb66d4180d9b58ff03854d2f9ed14a91c6e5","observation_id":"8951c41c-00dc-42ae-ace8-b7d28341c697","resolution":{"observed_at":"2026-08-15T17:14:38.909696Z","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-15T17:14:38.916805Z","title":"Cellfishing","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.916805Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:948571f01348d4799fdce7dc0803c0489a784f7d0af7c3c4a8c88ae83944341b","observation_id":"88e079cc-3bfb-4d6d-a01f-e605e5906563","resolution":{"observed_at":"2026-08-15T17:14:38.916805Z","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-15T17:14:38.924818Z","title":"The evolving concept of cell identity in the single cell era","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.924818Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:aed77322efc0d57b72de66af87baf076e999488db368e29cc903733bf782bd38","observation_id":"88778a34-4f50-4645-9edb-5353ec4e54f3","resolution":{"observed_at":"2026-08-15T17:14:38.924818Z","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-15T17:14:38.935827Z","title":"Defining cell types and states with single-cell genomics","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.935827Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:029c939295c1e85dbf42e5da541e31af258394d9e178cacb13bf3386fae607e0","observation_id":"481e3128-7c84-476d-bddc-92ae05eac7f6","resolution":{"observed_at":"2026-08-15T17:14:38.935827Z","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-15T17:14:38.944819Z","title":"Cell state transitions: definitions and challenges","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.944819Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:59c9c15fc0511bfe1d3866b61cc9a9be0b3c1f01440d4864d672b47460b54b5e","observation_id":"89ff3165-cb1b-408e-858e-f8b3e35132a4","resolution":{"observed_at":"2026-08-15T17:14:38.944819Z","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-15T17:14:38.970908Z","title":"Scalable nearest neighbor algorithms for high dimensional data","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.970908Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:e67938e3121a8c92222b4d7c6f31ca2bbd9ba03c812e32041e934f67fdc6bdb3","observation_id":"aed568cb-d7f0-4ffa-9785-ab1a78141d6f","resolution":{"observed_at":"2026-08-15T17:14:38.970908Z","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-15T17:14:38.977959Z","title":"A single-cell transcriptomic map of the human and mouse pancreas reveals inter-and intra-cell population structure","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.977959Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:3a1424460fa24e0bd16344f8af49ea448a10521226d3d5cb1a461fd9cb01f995","observation_id":"ea65bb71-fe25-409e-ad57-a1d8ef3f2a10","resolution":{"observed_at":"2026-08-15T17:14:38.977959Z","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-15T17:14:38.985073Z","title":"Cell type atlas and lineage tree of a whole complex animal by single-cell transcriptomics","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.985073Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:25348ab7379f4e5fb83589cccef31ca29a4e8a98274d0fce811457e4593d0e7c","observation_id":"0dacfd35-f338-4540-814f-8318e407c2c3","resolution":{"observed_at":"2026-08-15T17:14:38.985073Z","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-15T17:14:38.990885Z","title":"Comprehensive classification of retinal bipolar neurons by single-cell transcriptomics","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.990885Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:eddaf6ff39b123d28dd75b72bb6b0ddd34d26347560aef59c754edc874bbc416","observation_id":"ee18c10d-bda3-4f8c-92ab-8c04b5ec8a35","resolution":{"observed_at":"2026-08-15T17:14:38.990885Z","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-15T17:14:38.996058Z","title":"Deep discrete supervised hashing","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:38.996058Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:4ee7ada9f112ccef75443c03f5aa86aae7bfb63f0b2504fb4b0e33c7aa015adf","observation_id":"30b8a522-3e32-4438-ad71-9453f90f2eee","resolution":{"observed_at":"2026-08-15T17:14:38.996058Z","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-15T17:14:39.003542Z","title":"Supervised hashing with latent factor models","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.003542Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:a9db59addb2be5e7d2b3e696387f9d8631302d857999415909f0d1e9fb8b6288","observation_id":"3df52bf3-ac47-47ed-8fc5-3d5f91653d9e","resolution":{"observed_at":"2026-08-15T17:14:39.003542Z","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-15T17:14:39.009780Z","title":"Asymmetric deep supervised hashing","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.009780Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:d791e87b5f6330d38f987b334f7040173e5a39562f01a22cbfccd564a7308a6c","observation_id":"95a3b1da-b569-474a-8993-8bcc5ad93d3b","resolution":{"observed_at":"2026-08-15T17:14:39.009780Z","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-15T17:14:39.019928Z","title":"Combi: Compressed binary search tree for approximate k-nn searches in hamming space","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.019928Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:be4d777aef9fe11cc8040d07fa5d631aad69746222bbeefb1d02ba04fa2e90bb","observation_id":"1d0ff926-3292-498b-a9d9-96bab572515f","resolution":{"observed_at":"2026-08-15T17:14:39.019928Z","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-15T17:14:39.029632Z","title":"Ensemble methods in machine learning","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.029632Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:e515ffa6831567e7852e8f3a079bc8eefc4e0ff9602e775108d708cb56b99b93","observation_id":"d1d61939-e5e2-4150-8aaf-2d2610f1213a","resolution":{"observed_at":"2026-08-15T17:14:39.029632Z","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-15T17:14:39.037069Z","title":"Greedy function approximation: a gradient boosting machine","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.037069Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:cdc2782603bc25d4242d11c923d9ac2d1f5c995a18ce880a4b399f7d67b3bfde","observation_id":"936ac3f3-5fb6-4afc-ab6a-e31721e9435d","resolution":{"observed_at":"2026-08-15T17:14:39.037069Z","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-15T17:14:39.047216Z","title":"Xgboost: A scalable tree boosting system","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.047216Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:c15c756f6927d0acd1ffea23a6109e5641a7271d61dcf7346c6a31a9c0350393","observation_id":"527711f0-a0e0-4bbe-8891-f57158dd6b7b","resolution":{"observed_at":"2026-08-15T17:14:39.047216Z","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-15T17:14:39.054135Z","title":"Oc1: A randomized algorithm for building oblique decision trees","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.054135Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:1fceb31319867c7b079d1eea78009bd2f6712c3076ffce3c71aa50ca2ff63f4e","observation_id":"9d1928e8-6616-45d3-8036-f7a9eacb41fa","resolution":{"observed_at":"2026-08-15T17:14:39.054135Z","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-15T17:14:39.060494Z","title":"A system for induction of oblique decision trees","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.060494Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:782361b4d60182f2f2fa037d0e0c9707f5ed518a17197f0d97fa9b10eab147eb","observation_id":"ae142443-8aed-4b60-8c1c-3f6eabfbc4db","resolution":{"observed_at":"2026-08-15T17:14:39.060494Z","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-15T17:14:39.068117Z","title":"On oblique random forests","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.068117Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:923d1210ebf889632cc8ae9562254ac13af7d43855902e9c8b9a80bc0cb29b8a","observation_id":"d14e5041-a599-4f54-9767-67649425669d","resolution":{"observed_at":"2026-08-15T17:14:39.068117Z","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-15T17:14:39.076248Z","title":"Hhcart: An oblique decision tree","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.076248Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:05724e18001d382dc21820d5ca7c567bc1214377d6c32f57ceb2b712f3c87a38","observation_id":"e90916da-e13a-4855-a30b-4fc6a61873bf","resolution":{"observed_at":"2026-08-15T17:14:39.076248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.00659","last_updated":"2025-08-07T14:46:05Z","snapshot_observed_at":"2026-08-21T05:54:37.198220Z","submitted_at":"2019-09-02T10:50:14Z","title":"Guided Random Forest and its application to data approximation","version":2},"cited_work":{"arxiv_id":"1909.00659","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.00659","snapshot_observed_at":"2026-08-15T17:14:40.209906Z","title":"Guided Random Forest and its application to data approximation","venue":"cs.LG","work_id":"2af9bd0c-58ba-4c90-952f-728cdf3fb991","year":2019},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.085190Z"},"links":{"cited_paper":"/paper/1909.00659","citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:a7db45932d0610eae2939c3a821c5e501f6be8490d7c9587f20d40e963d95c90","observation_id":"0f50291d-38f5-4e70-9750-13d5f7a2e6c9","resolution":{"observed_at":"2026-08-15T17:14:40.221309Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T17:14:39.094113Z","title":"Classification and regression trees","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.094113Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:5e9df883ef8f57e2080d5bc5b0367675b24797d30c3abfc349456027139bf01b","observation_id":"adc709c9-60c2-453c-bd61-d27d7bc7a510","resolution":{"observed_at":"2026-08-15T17:14:39.094113Z","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-15T17:14:39.101061Z","title":"A support vector machine approach to decision trees","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.101061Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:60d070f1728ed0944c99be172c2650d84f59cc239013ecab05dc96dc5791283c","observation_id":"6f4a813a-b41a-431b-bd26-cbeded32b2bc","resolution":{"observed_at":"2026-08-15T17:14:39.101061Z","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-15T17:14:39.108970Z","title":"A pyramidal delayed perceptron","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.108970Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:8bc4d2a4dc0a58623d743e1235ae0faf1f1f6d1e96390367308c176df5305065","observation_id":"295d5366-75ee-4e6c-b952-69a10fd7f1b4","resolution":{"observed_at":"2026-08-15T17:14:39.108970Z","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-15T17:14:39.116241Z","title":"Binary classification by svm based tree type neural networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.116241Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:fc0863a5a89b631cc1b7e58cfe7821a0432dca9a92615543dfcc73365e2e1bca","observation_id":"47cc692c-b73d-4807-81c1-93ebe2b45d01","resolution":{"observed_at":"2026-08-15T17:14:39.116241Z","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-15T17:14:39.123416Z","title":"Mml inference of oblique decision trees","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.123416Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:a2ddcdd212aaf969e25e1be2a0149f7648f864f121f2dfa18eaf67a63644a10d","observation_id":"fe9f730b-ce45-45e0-a49f-a9cd3eaeeaab","resolution":{"observed_at":"2026-08-15T17:14:39.123416Z","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-15T17:14:39.130551Z","title":"Decision forests with oblique decision trees","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.130551Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:dd4964da2d74ae28b14e038d86a97bf9bf78d2326bad82a6ff94c34bdb619811","observation_id":"c4621b7c-bd3e-455b-a9de-ea9c1821aab0","resolution":{"observed_at":"2026-08-15T17:14:39.130551Z","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-15T17:14:39.137140Z","title":"An information measure for classification","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.137140Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:7e7e0b3a09ca865634418bc3b8dbb5bd9cc7bead57442662ebb44d21ae676ca0","observation_id":"9e0d6741-1181-4190-8d36-9e9216cdb264","resolution":{"observed_at":"2026-08-15T17:14:39.137140Z","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-15T17:14:39.143703Z","title":"Hybrid extreme point tabu search","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.143703Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:f2257aebe71fe2fd2c666fdc2441165bfec117081f717c585f5d9a5a6b53a95c","observation_id":"88ab74a8-e5d2-428e-89ba-e7bcc1ba801b","resolution":{"observed_at":"2026-08-15T17:14:39.143703Z","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-15T17:14:39.149053Z","title":"Decision-tree-based multiclass support vector machines","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.149053Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:01c3caec807a1a432b002b2151e6506e39eb33180dd0ec52e5ed4cb21794da0b","observation_id":"38008e54-20ee-4d79-a6ee-8cbeab099445","resolution":{"observed_at":"2026-08-15T17:14:39.149053Z","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-15T17:14:39.154353Z","title":"An improved algorithm for decision-tree-based svm","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.154353Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:71da86b9e3053e3fbe597f1a3d6683e7784817af1574ed081babd451615f6c46","observation_id":"77dea2e1-ec89-4407-b7bd-2be2446d79cc","resolution":{"observed_at":"2026-08-15T17:14:39.154353Z","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-15T17:14:39.159377Z","title":"Geometric decision tree","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.159377Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:2a88d4a245fda47b2c8af26d6775cd8a689c2aca2cc2aeca77c970c200c2fd4c","observation_id":"7f28fd81-2018-4c6f-854e-d2debef1a778","resolution":{"observed_at":"2026-08-15T17:14:39.159377Z","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-15T17:14:39.164798Z","title":"Multisurface proximal support vector machine classification via generalized eigenvalues","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.164798Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:b4b690cb56fd6de643c8349fece6e0bfbae5d07dd3231f86e6a54fc8a366f4d3","observation_id":"94daaaf5-9511-4aca-bcdb-4de3b0ae546c","resolution":{"observed_at":"2026-08-15T17:14:39.164798Z","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-15T17:14:39.170872Z","title":"Oblique decision tree ensemble via multisurface proximal support vector machine","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.170872Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:07e147cb243207e13b86e5ab54e2d69791897f194da7855533991eed1c080c2a","observation_id":"277d85c2-b6d2-4705-b7d3-0073a2c1c283","resolution":{"observed_at":"2026-08-15T17:14:39.170872Z","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-15T17:14:39.176877Z","title":"Rotation forest: A new classifier ensemble method","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.176877Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:65e6e6c86492abd9bbf77287587c80f694d0a34385e75ff224419733e24df011","observation_id":"22b34d95-6eeb-4701-bf67-36bacda7d205","resolution":{"observed_at":"2026-08-15T17:14:39.176877Z","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-15T17:14:39.182123Z","title":"An experimental study on rotation forest ensembles","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.182123Z"},"links":{"citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:75dd6504cfb233900d02ee04e9b8a53cb7af76360507ac89714d65c7c8a4b555","observation_id":"e2f41129-ec10-407d-ab53-ec224a8b9baa","resolution":{"observed_at":"2026-08-15T17:14:39.182123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.06155","last_updated":"2015-06-24T21:23:43Z","snapshot_observed_at":"2026-08-14T22:43:41.354446Z","submitted_at":"2015-06-19T20:42:47Z","title":"CO2 Forest: Improved Random Forest by Continuous Optimization of Oblique Splits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.06155","snapshot_observed_at":"2026-08-15T17:14:39.187041Z","title":"Co2 forest: Improved random forest by continuous optimization of oblique splits","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-15T17:14:39.187041Z"},"links":{"cited_paper":"/paper/1506.06155","citing_paper":"/paper/2508.17083"},"observation_digest":"sha256:c7e572f6678739bdcec5b31785176b356c4cfb9824ad306097c287d7ef4da6a3","observation_id":"e6c7006b-d3d8-4864-a023-78085a3732c4","resolution":{"observed_at":"2026-08-15T17:14:39.187041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.17083","last_updated":"2025-08-23T16:49:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T04:40:17.089021Z","submitted_at":"2025-08-23T16:49:42Z","title":"Learning ON Large Datasets Using Bit-String Trees"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":99,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":204},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 100 of 204 outbound references and 0 inbound Pith citation observations for arXiv:2508.17083."}