{"as_of":"2026-08-10T07:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:770d07d15a53ea3f65e30314d9c0ff4887d0485b5bf65bbec2235831dce9c5ca","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T23:49:09.395061Z","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-08T23:49:09.544884Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.01780","last_updated":"2021-04-11T19:26:10Z","snapshot_observed_at":"2026-07-06T07:31:16.541264Z","submitted_at":"2019-02-05T16:40:34Z","title":"Learning Decision Trees Recurrently Through Communication","version":3},"cited_work":{"arxiv_id":"1902.01780","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.01780","snapshot_observed_at":"2026-08-08T23:49:09.544884Z","title":"Learning Decision Trees Recurrently Through Communication","venue":"cs.LG","work_id":"9bc29074-f013-4542-b913-c18fff6072de","year":2019},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-09T22:34:59.670635Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.395061Z"},"links":{"cited_paper":"/paper/1902.01780","citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:bf388b3b3874bdc4c4952333e5c84eafc6b1740767bd5482c1027b7d9ba1b0c3","observation_id":"ba7c3ade-2752-4e0d-ab0e-61e2be373de2","resolution":{"observed_at":"2026-08-08T23:49:09.548105Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1902.01780/citation-record","integrity":"/paper/1902.01780/integrity","json":"/paper/1902.01780/citation-record.json","paper":"/paper/1902.01780"},"outbound":[],"paper":{"arxiv_id":"1902.01780","last_updated":"2021-04-11T19:26:10Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:31:16.541264Z","submitted_at":"2019-02-05T16:40:34Z","title":"Learning Decision Trees Recurrently Through Communication"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1902.01780."}