{"as_of":"2026-08-18T08:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c54a8fd1ff89080dff99b59eea0b45fca86ecc28e87389a95ae0724483f62391","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-18T06:34:40.430872+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-16T04:27:46.755817Z","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-01T14:35:46.895841Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.02266","last_updated":"2021-05-16T16:19:53Z","snapshot_observed_at":"2026-08-14T16:36:28.067050Z","submitted_at":"2019-05-06T21:15:46Z","title":"Learning Clique Forests","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.02266","snapshot_observed_at":"2026-08-16T04:27:46.755817Z","title":"Learning clique forests","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.03812","last_updated":"2025-05-02T12:30:17Z","snapshot_observed_at":"2026-08-17T23:29:08.954780Z","submitted_at":"2025-05-02T12:30:17Z","title":"Information Filtering Networks: Theoretical Foundations, Generative Methodologies, and Real-World Applications","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-16T04:27:46.755817Z"},"links":{"cited_paper":"/paper/1905.02266","citing_paper":"/paper/2505.03812"},"observation_digest":"sha256:923631c76040a7ab133eb071e970c2a5d85e3f9ba3a12e9487792dfd2281da30","observation_id":"db77ea86-7be3-4f73-90eb-2ca6888d7f3a","resolution":{"observed_at":"2026-08-16T04:27:46.755817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.02266","last_updated":"2021-05-16T16:19:53Z","snapshot_observed_at":"2026-08-14T16:36:28.067050Z","submitted_at":"2019-05-06T21:15:46Z","title":"Learning Clique Forests","version":2},"cited_work":{"arxiv_id":"1905.02266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.02266","snapshot_observed_at":"2026-07-01T14:35:46.895841Z","title":null,"venue":null,"work_id":"e7e88071-ffc7-4a76-b856-a6c5e0c397c2","year":1905},"citing_paper":{"arxiv_id":"2605.14764","last_updated":"2026-05-14T12:26:50Z","snapshot_observed_at":"2026-08-12T16:23:02.417907Z","submitted_at":"2026-05-14T12:26:50Z","title":"Compositional Sparsity as an Inductive Bias for Neural Architecture Design","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T20:55:03.949611Z"},"links":{"cited_paper":"/paper/1905.02266","citing_paper":"/paper/2605.14764"},"observation_digest":"sha256:df72aff0fd07d564a6c6d933f603e49466df9c1242e78c01976884660fa597c9","observation_id":"0d1bd189-bc26-4c6d-a489-bb6030d3d237","resolution":{"observed_at":"2026-07-01T14:35:46.897212Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1905.02266/citation-record","integrity":"/paper/1905.02266/integrity","json":"/paper/1905.02266/citation-record.json","paper":"/paper/1905.02266"},"outbound":[],"paper":{"arxiv_id":"1905.02266","last_updated":"2021-05-16T16:19:53Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T16:36:28.067050Z","submitted_at":"2019-05-06T21:15:46Z","title":"Learning Clique Forests"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1905.02266."}