{"as_of":"2026-08-11T14:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dcacd829ebb13b4897569df4d0bfdbbdbe759b3a73bb0a8abdd5442b3c5e62ee","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-11T06:34:44.6726+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-10T22:48:53.398156Z","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-10T22:48:55.320992Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.19068","last_updated":"2023-10-27T12:16:14Z","snapshot_observed_at":"2026-07-06T15:35:26.335169Z","submitted_at":"2023-05-30T14:29:24Z","title":"Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints","version":2},"cited_work":{"arxiv_id":"2305.19068","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.19068","snapshot_observed_at":"2026-08-10T22:48:55.320992Z","title":"Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints","venue":"cs.CL","work_id":"8dfa341e-bb54-4db5-aae2-3734318d75d8","year":2023},"citing_paper":{"arxiv_id":"2501.00759","last_updated":"2025-07-10T07:45:30Z","snapshot_observed_at":"2026-08-11T13:56:28.127958Z","submitted_at":"2025-01-01T07:05:32Z","title":"Enhancing Transformers for Generalizable First-Order Logical Entailment","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T22:48:53.398156Z"},"links":{"cited_paper":"/paper/2305.19068","citing_paper":"/paper/2501.00759"},"observation_digest":"sha256:11e72f43e14b5cbd75584efd4ec2e070d66731a9ebf303f8f9157a3d998491fc","observation_id":"43c2acc9-d56c-409a-bacf-b3b85bce421d","resolution":{"observed_at":"2026-08-10T22:48:55.328646Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.19068/citation-record","integrity":"/paper/2305.19068/integrity","json":"/paper/2305.19068/citation-record.json","paper":"/paper/2305.19068"},"outbound":[],"paper":{"arxiv_id":"2305.19068","last_updated":"2023-10-27T12:16:14Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T15:35:26.335169Z","submitted_at":"2023-05-30T14:29:24Z","title":"Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.19068."}