{"as_of":"2026-08-13T04:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96117c8b7a0c0915d95c63f24ba390931947c1dd292ec4d77c7cd45774f71575","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:43:56.802162Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.18649/citation-record","integrity":"/paper/2411.18649/integrity","json":"/paper/2411.18649/citation-record.json","paper":"/paper/2411.18649"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:56.719318Z","title":"Hosmer and S","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.719318Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:1d285146fcd0fd4e87ba07ea17651878d0a39ccd2f8c8fb1db610db67cc463ce","observation_id":"033af203-130b-4134-b585-5bd24386471c","resolution":{"observed_at":"2026-08-12T11:43:56.719318Z","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-12T11:43:56.723912Z","title":"The Regression Analysis of Binary Sequences,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.723912Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:d509634fd4aaeee0dfe6f685f1a796b7dca06ded3373635ae351413219a9ca40","observation_id":"11f8b10b-e82d-4ea1-91ee-a52a7a596584","resolution":{"observed_at":"2026-08-12T11:43:56.723912Z","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-12T11:43:56.727857Z","title":"Bagging predictors,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.727857Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:2f0f87215665c89df5e10b0a145231c0687f1d161a14590588000e473cceddb2","observation_id":"8577a449-2272-4c7a-9a85-77e73c05cc9c","resolution":{"observed_at":"2026-08-12T11:43:56.727857Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.307131Z","title":"A Decision Theoretic Generalization of On-Line Learning and an Application to Boosting,","venue":null,"work_id":"e2c569c9-9a50-4956-b1cd-aa98458e7ec8","year":2010},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.731892Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:ef0c24ccadc9f3e72e9c166de09376799ce410d95699c0d6b37b18f4d2cc83a6","observation_id":"2e39dd57-9cc6-4b56-bc5c-d139a7ed8b8a","resolution":{"observed_at":"2026-08-12T11:43:57.311520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:43:56.735706Z","title":"The mythos of model interpretability: In machine learning, the concept of interpretability is both important and slippery","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.735706Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:7e9b70a167f612efb1d69b9db60145ac85fc6e75429de79b90098fa9f6d301a2","observation_id":"f2019d64-e447-4b3a-a910-788624e2793b","resolution":{"observed_at":"2026-08-12T11:43:56.735706Z","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-12T11:43:56.740069Z","title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.740069Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:c611c84e9e6a8452a7dc885a4128d38df19280ca594242458858385cf4a5689a","observation_id":"ad835d17-ab3c-42cb-9cad-5d278587dde7","resolution":{"observed_at":"2026-08-12T11:43:56.740069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.08608","last_updated":"2017-03-02T19:32:10Z","snapshot_observed_at":"2026-08-13T03:10:58.738032Z","submitted_at":"2017-02-28T02:19:20Z","title":"Towards A Rigorous Science of Interpretable Machine Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.08608","snapshot_observed_at":"2026-08-12T11:43:56.745081Z","title":"Towards A Rigorous Science of Inter- pretable Machine Learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.745081Z"},"links":{"cited_paper":"/paper/1702.08608","citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:6803f7f877a3b0e7da32c758a94527ff16f05e3b862f532dc90fbd56806abbc8","observation_id":"1b34df79-890a-4e18-9b59-79ca0e994c79","resolution":{"observed_at":"2026-08-12T11:43:56.745081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.281136Z","title":"A brief introduction to boosting,","venue":null,"work_id":"e16fabd8-f908-4891-bb5f-e89114155236","year":1999},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.757832Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:1f99e4abcd32c8abfb6ac90b4e2eed258b7e08758cacd8383d29b63bf5517958","observation_id":"6e54ab5a-cbc9-4c21-ab5b-062c0490418b","resolution":{"observed_at":"2026-08-12T11:43:57.285319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.268012Z","title":"The mythos of model interpretability,","venue":null,"work_id":"8e685e37-047a-4a18-ad0f-cb00efefded5","year":2018},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.761818Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:f413fa954a1a90f9878d9e95a0df21bc84ae6e48bc967585f579111771fe5053","observation_id":"3f4c2c24-403b-41be-966d-ec80b47d409a","resolution":{"observed_at":"2026-08-12T11:43:57.272194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:43:56.765794Z","title":"Random forests,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.765794Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:8e11a7dc15948ea9c4c6efba585cbbfb13cdc5ef5d2784006e7edb6e540369cc","observation_id":"5018359a-da72-4ee2-b32a-6a989786c04c","resolution":{"observed_at":"2026-08-12T11:43:56.765794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.293976Z","title":"Greedy function approximation: A gradient boosting machine","venue":null,"work_id":"9e89908e-bfbd-4c2c-9791-b0004df17f02","year":null},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.769755Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:8c2d67b94fd3d35c479ba47184f54be40b00393379d052a87e4c425f5b7ab810","observation_id":"ee72dc30-59f3-41e5-84fe-93b93688d0b6","resolution":{"observed_at":"2026-08-12T11:43:57.298453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:43:56.777846Z","title":"Application of the logistic function to bio-assay,","venue":null,"work_id":null,"year":1944},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.777846Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:03844ac3e5b54c56dd8fcf668880981d5ee03278a8e295d4c65ce5162483db46","observation_id":"224e50d5-2058-45d8-9654-0acff124e0cb","resolution":{"observed_at":"2026-08-12T11:43:56.777846Z","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-12T11:43:56.773981Z","title":"Available: https://doi.org/10.1214/aos/1013203451","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.773981Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:b37677a286d4bffe0adf4b1cee191190f28f68ae4606b4852c15d4d987cc240b","observation_id":"de53cae2-d367-4cce-9c85-162447d6dc32","resolution":{"observed_at":"2026-08-12T11:43:56.773981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.245372Z","title":"Logistic regression for data mining and high-dimensional classification,","venue":null,"work_id":"783269cb-daa4-4f36-806c-25560a8c4a3b","year":2004},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.786106Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:d66c8daca6ebc3e1e5a4d0c80c7feb139c3795b78594a81f8d9cfbbaf467ed39","observation_id":"4f64d948-8f6e-499b-9f9b-90b5fa7a5206","resolution":{"observed_at":"2026-08-12T11:43:57.249787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:43:56.781955Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.781955Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:44358c2de485caf5de95c6528bc8f852f949e076c02e23f1bfd56da34a362758","observation_id":"991bcc11-5703-4bee-97ee-1da4deeb1bca","resolution":{"observed_at":"2026-08-12T11:43:56.781955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.218452Z","title":"Backpropagation through time: what it does and how to do it,","venue":null,"work_id":"2a8feb2d-2596-4485-96df-5fd07def8f6c","year":1990},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.794012Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:65c2da11dc20140de785a0c88c8f513006d393c81020dcf3f1237ffb75a9dd1b","observation_id":"e712a425-6e7e-40b5-bce0-49488f87dbae","resolution":{"observed_at":"2026-08-12T11:43:57.222638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.232000Z","title":"Ensemble methods in machine learning,","venue":null,"work_id":"5f1ca505-a854-4706-a8b6-89c45dabda4a","year":2000},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.790140Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:1adb8bd55a35a46aa13b48a0844e9bc2bf301d33ee3b54557d3cc7543f729525","observation_id":"3766f6b9-3d3f-465d-86f1-50c926686582","resolution":{"observed_at":"2026-08-12T11:43:57.236048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:43:57.192588Z","title":"Learning Complex, Extended Sequences Using the Principle of History Compression,","venue":null,"work_id":"4e4c7398-771d-4699-ae6d-94eecca89953","year":1992},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.802162Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:c8c4e7999cfe255699fade9d6190d3f37a8f12529f51bd67edfe5a3c84eb4df6","observation_id":"8a18da89-af67-4945-984f-60c7fe5d2fa6","resolution":{"observed_at":"2026-08-12T11:43:57.200084Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T11:43:56.798083Z","title":"Induction of decision trees,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T11:43:56.798083Z"},"links":{"citing_paper":"/paper/2411.18649"},"observation_digest":"sha256:a02d5d03dc90daac65dbfa1a17b97461eecc251cc27fd539e64d9b7c70a0839f","observation_id":"de8862b2-22ce-4c3e-b4dc-c525f392dc90","resolution":{"observed_at":"2026-08-12T11:43:56.798083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.18649","last_updated":"2024-11-27T00:22:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T11:38:01.431011Z","submitted_at":"2024-11-27T00:22:55Z","title":"Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":19},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2411.18649."}