{"as_of":"2026-08-07T23:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3034b173ed8b3454615eb3e30415b6e0ee86a981a1f15e146d829e4708d8744c","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-07T06:34:17.273281+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-06T18:45:17.402718Z","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-05T22:39:51.991646Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.04412","last_updated":"2020-04-09T08:15:39Z","snapshot_observed_at":"2026-07-06T09:11:08.325778Z","submitted_at":"2020-04-09T08:15:39Z","title":"Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04412","snapshot_observed_at":"2026-08-06T18:45:17.402718Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.07595","last_updated":"2025-07-10T09:54:37Z","snapshot_observed_at":"2026-08-06T18:34:39.171720Z","submitted_at":"2025-07-10T09:54:37Z","title":"Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:45:17.402718Z"},"links":{"cited_paper":"/paper/2004.04412","citing_paper":"/paper/2507.07595"},"observation_digest":"sha256:23e7c01d2c69eba2023967a016006a7b7bfc6b42df7dd5323819fe02715f364b","observation_id":"0d9f6941-4784-4a5e-87cd-6a7ad2ddf764","resolution":{"observed_at":"2026-08-06T18:45:17.402718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04412","last_updated":"2020-04-09T08:15:39Z","snapshot_observed_at":"2026-07-06T09:11:08.325778Z","submitted_at":"2020-04-09T08:15:39Z","title":"Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":"2004.04412","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.04412","snapshot_observed_at":"2026-08-05T22:39:51.991646Z","title":"Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion","venue":"cs.AI","work_id":"99533b55-04e2-4ff9-a30c-a8c78c07320f","year":2020},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.809934Z"},"links":{"cited_paper":"/paper/2004.04412","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:214288b3971c75b88398cf0885f1553284bedbe3c6d44c671e0c3d536d540514","observation_id":"d2b875dc-0b4a-4a9d-91a7-eb907eba807b","resolution":{"observed_at":"2026-08-05T22:39:51.996450Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.04412/citation-record","integrity":"/paper/2004.04412/integrity","json":"/paper/2004.04412/citation-record.json","paper":"/paper/2004.04412"},"outbound":[],"paper":{"arxiv_id":"2004.04412","last_updated":"2020-04-09T08:15:39Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T09:11:08.325778Z","submitted_at":"2020-04-09T08:15:39Z","title":"Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2004.04412."}