{"as_of":"2026-08-20T10:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1585e1c98fa21752a706ed9ca91be60d11c0e8a99aa0213d8b333d3dc2bb7280","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:56:16.140034Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T21:10:09.199755Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.00837","last_updated":"2017-12-12T18:33:14Z","snapshot_observed_at":"2026-08-16T11:52:29.356943Z","submitted_at":"2017-11-02T17:43:03Z","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00837","snapshot_observed_at":"2026-08-11T22:33:29.786368Z","title":"Over- sampling for imbalanced learning based on k-means and smote","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.03349","last_updated":"2025-07-03T12:42:44Z","snapshot_observed_at":"2026-08-19T09:38:18.986535Z","submitted_at":"2024-12-04T14:30:19Z","title":"Fairer Analysis and Demographically Balanced Face Generation for Fairer Face Verification","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T22:33:29.786368Z"},"links":{"cited_paper":"/paper/1711.00837","citing_paper":"/paper/2412.03349"},"observation_digest":"sha256:7359dd96ebe2d30a94c275d06ea4457cd71e990aa3d9a21122f6b2d747122500","observation_id":"8b7d0dac-f7e7-4e3a-829b-5b76c7aa5ea0","resolution":{"observed_at":"2026-08-11T22:33:29.786368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00837","last_updated":"2017-12-12T18:33:14Z","snapshot_observed_at":"2026-08-16T11:52:29.356943Z","submitted_at":"2017-11-02T17:43:03Z","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00837","snapshot_observed_at":"2026-08-08T18:53:12.444696Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06878","last_updated":"2025-02-08T13:35:00Z","snapshot_observed_at":"2026-08-20T00:41:26.364429Z","submitted_at":"2025-02-08T13:35:00Z","title":"Deep Learning Meets Oversampling: A Learning Framework to Handle Imbalanced Classification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T18:53:12.444696Z"},"links":{"cited_paper":"/paper/1711.00837","citing_paper":"/paper/2502.06878"},"observation_digest":"sha256:c0b7cc5e6a89f98b60f88c146a71eaab3481af0b7f7bc40d7c3a66be34167960","observation_id":"503ef6e0-9abe-41cf-896b-41f61ff01242","resolution":{"observed_at":"2026-08-08T18:53:12.444696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00837","last_updated":"2017-12-12T18:33:14Z","snapshot_observed_at":"2026-08-16T11:52:29.356943Z","submitted_at":"2017-11-02T17:43:03Z","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00837","snapshot_observed_at":"2026-08-16T11:56:16.140034Z","title":"2017, arXiv e-prints, arXiv:1711.00837, 10.48550/arXiv.1711.00837","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.14332","last_updated":"2025-04-19T15:53:01Z","snapshot_observed_at":"2026-08-16T11:49:06.632972Z","submitted_at":"2025-04-19T15:53:01Z","title":"Dusty stellar sources classification by implementing machine learning methods based on spectroscopic observations in the Magellanic Clouds","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T11:56:16.140034Z"},"links":{"cited_paper":"/paper/1711.00837","citing_paper":"/paper/2504.14332"},"observation_digest":"sha256:28242efa85c39c66cb4d4ce9006971c9e10114105523edcce95ce9c287c75621","observation_id":"995b15b6-0fdd-418d-92fa-36228a4a9093","resolution":{"observed_at":"2026-08-16T11:56:16.140034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00837","last_updated":"2017-12-12T18:33:14Z","snapshot_observed_at":"2026-08-16T11:52:29.356943Z","submitted_at":"2017-11-02T17:43:03Z","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE","version":2},"cited_work":{"arxiv_id":"1711.00837","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1711.00837","snapshot_observed_at":"2026-07-04T21:10:09.199755Z","title":"Oversampling for imbalanced learning based on k-means and smote.arXiv preprint arXiv:1711.00837, 2","venue":null,"work_id":"2c849520-ba01-4254-93d0-2f85b1488016","year":2017},"citing_paper":{"arxiv_id":"2605.11231","last_updated":"2026-05-13T15:26:18Z","snapshot_observed_at":"2026-08-16T13:35:49.283034Z","submitted_at":"2026-05-11T20:46:35Z","title":"LiBaGS: Lightweight Boundary Gap Synthesis for Targeted Synthetic Data Selection","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-13T02:29:49.181270Z"},"links":{"cited_paper":"/paper/1711.00837","citing_paper":"/paper/2605.11231"},"observation_digest":"sha256:9c631642a2eec8765ca9425aaa9a0af99bcee6171264cd916c3e69f32e06f06f","observation_id":"9131c20d-f2ec-4ea5-a71a-6ccc680ff8c0","resolution":{"observed_at":"2026-05-13T02:32:06.399991Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00837","last_updated":"2017-12-12T18:33:14Z","snapshot_observed_at":"2026-08-16T11:52:29.356943Z","submitted_at":"2017-11-02T17:43:03Z","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE","version":2},"cited_work":{"arxiv_id":"1711.00837","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1711.00837","snapshot_observed_at":"2026-07-04T21:10:09.199755Z","title":"Oversampling for imbalanced learning based on k-means and smote.arXiv preprint arXiv:1711.00837, 2","venue":null,"work_id":"2c849520-ba01-4254-93d0-2f85b1488016","year":2017},"citing_paper":{"arxiv_id":"2605.11231","last_updated":"2026-05-13T15:26:18Z","snapshot_observed_at":"2026-08-16T13:35:49.283034Z","submitted_at":"2026-05-11T20:46:35Z","title":"LiBaGS: Lightweight Boundary Gap Synthesis for Targeted Synthetic Data Selection","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-14T20:51:12.733192Z"},"links":{"cited_paper":"/paper/1711.00837","citing_paper":"/paper/2605.11231"},"observation_digest":"sha256:01c685b682ff9a9478f880f1cb4d9563debff78c8549de40bcb51bbcf1e6f3c7","observation_id":"e5b3013c-8f66-4d80-b772-fb5aa5e4fcfe","resolution":{"observed_at":"2026-05-14T20:52:58.614430Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00837","last_updated":"2017-12-12T18:33:14Z","snapshot_observed_at":"2026-08-16T11:52:29.356943Z","submitted_at":"2017-11-02T17:43:03Z","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE","version":2},"cited_work":{"arxiv_id":"1711.00837","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1711.00837","snapshot_observed_at":"2026-07-04T21:10:09.199755Z","title":"Oversampling for imbalanced learning based on k-means and smote.arXiv preprint arXiv:1711.00837, 2","venue":null,"work_id":"2c849520-ba01-4254-93d0-2f85b1488016","year":2017},"citing_paper":{"arxiv_id":"2606.26053","last_updated":"2026-06-24T17:30:36Z","snapshot_observed_at":"2026-07-31T00:25:42.818814Z","submitted_at":"2026-06-24T17:30:36Z","title":"When Does Synthetic Data Augmentation Improve Score-Based Imbalanced Classification?","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-25T19:03:59.234023Z"},"links":{"cited_paper":"/paper/1711.00837","citing_paper":"/paper/2606.26053"},"observation_digest":"sha256:d2515c3e82b50b0ae35b8a9bfb3bcc3c6c13d5dc898917ea61ffd226a4175da8","observation_id":"87713041-3a31-4eb0-8244-10c4b1bea1fc","resolution":{"observed_at":"2026-07-04T21:10:09.201176Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1711.00837/citation-record","integrity":"/paper/1711.00837/integrity","json":"/paper/1711.00837/citation-record.json","paper":"/paper/1711.00837"},"outbound":[],"paper":{"arxiv_id":"1711.00837","last_updated":"2017-12-12T18:33:14Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T11:52:29.356943Z","submitted_at":"2017-11-02T17:43:03Z","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1711.00837."}