{"as_of":"2026-08-17T13:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f8cd7ca26fe6e344e84eea20c011151f5d97c248e777375482f844160cc7f95","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:58:02.795184Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T06:07:32.270916Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.15911","last_updated":"2025-05-18T15:13:22Z","snapshot_observed_at":"2026-08-16T13:49:37.065191Z","submitted_at":"2024-05-24T20:10:10Z","title":"Learning accurate and interpretable tree-based models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15911","snapshot_observed_at":"2026-08-15T20:58:02.795184Z","title":"Learning accurate and interpretable decision trees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11636","last_updated":"2025-05-16T19:00:02Z","snapshot_observed_at":"2026-08-15T20:48:31.376005Z","submitted_at":"2025-05-16T19:00:02Z","title":"Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T20:58:02.795184Z"},"links":{"cited_paper":"/paper/2405.15911","citing_paper":"/paper/2505.11636"},"observation_digest":"sha256:7311914e3154598f4159aec8858f80a49e028a8458065b21933bd271d4ea6a05","observation_id":"9c13bb80-01df-4b80-be5b-5302f07d75a3","resolution":{"observed_at":"2026-08-15T20:58:02.795184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15911","last_updated":"2025-05-18T15:13:22Z","snapshot_observed_at":"2026-08-16T13:49:37.065191Z","submitted_at":"2024-05-24T20:10:10Z","title":"Learning accurate and interpretable tree-based models","version":2},"cited_work":{"arxiv_id":"2405.15911","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.15911","snapshot_observed_at":"2026-08-08T06:07:32.270916Z","title":"Learning accurate and interpretable tree-based models","venue":"cs.LG","work_id":"78e933c7-b1b1-4d51-b45a-20f1a51b11c6","year":2024},"citing_paper":{"arxiv_id":"2608.05585","last_updated":"2026-08-06T04:16:17Z","snapshot_observed_at":"2026-08-16T04:34:29.392274Z","submitted_at":"2026-08-06T04:16:17Z","title":"An inverse mixed-integer optimization framework for learning interpretable models of expert decision making","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T06:07:30.128998Z"},"links":{"cited_paper":"/paper/2405.15911","citing_paper":"/paper/2608.05585"},"observation_digest":"sha256:12e74f45da28c913a6bc0af13dfb3659440e65e40bb9edeb862ae66bd30759e3","observation_id":"8e686a3b-147f-4f8c-84e7-09b61d679a0c","resolution":{"observed_at":"2026-08-08T06:07:32.276481Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.15911/citation-record","integrity":"/paper/2405.15911/integrity","json":"/paper/2405.15911/citation-record.json","paper":"/paper/2405.15911"},"outbound":[],"paper":{"arxiv_id":"2405.15911","last_updated":"2025-05-18T15:13:22Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:49:37.065191Z","submitted_at":"2024-05-24T20:10:10Z","title":"Learning accurate and interpretable tree-based models"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.15911."}