{"as_of":"2026-08-18T20:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d97e1ed467a1b9771f94d1b284dcfad53bfcf15ef5a969bb89c2ac0fcc7d3ca","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-07T05:29:25.309690Z","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-04T12:39:49.435256Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.05909","last_updated":"2021-12-11T03:35:33Z","snapshot_observed_at":"2026-08-16T17:35:27.772951Z","submitted_at":"2021-12-11T03:35:33Z","title":"Neural Attention Models in Deep Learning: Survey and Taxonomy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.05909","snapshot_observed_at":"2026-08-07T05:29:25.309690Z","title":"Santana and E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07933","last_updated":"2025-06-09T16:53:25Z","snapshot_observed_at":"2026-08-18T17:43:43.599487Z","submitted_at":"2025-06-09T16:53:25Z","title":"Ensemble-Based Survival Models with the Self-Attended Beran Estimator Predictions","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T05:29:25.309690Z"},"links":{"cited_paper":"/paper/2112.05909","citing_paper":"/paper/2506.07933"},"observation_digest":"sha256:f8534ec4e483d5c8e5d669ff6c6ca14e42faf0f2e8eed316114c19ba1d7e348e","observation_id":"caf678d0-260c-47ad-b13a-a16b46debf81","resolution":{"observed_at":"2026-08-07T05:29:25.309690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.05909","last_updated":"2021-12-11T03:35:33Z","snapshot_observed_at":"2026-08-16T17:35:27.772951Z","submitted_at":"2021-12-11T03:35:33Z","title":"Neural Attention Models in Deep Learning: Survey and Taxonomy","version":1},"cited_work":{"arxiv_id":"2112.05909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.05909","snapshot_observed_at":"2026-07-04T12:39:49.435256Z","title":"Neural Attention Models in Deep Learning: Survey and Taxonomy, 2021","venue":null,"work_id":"ca061723-8640-4170-827f-2a61670732cd","year":2021},"citing_paper":{"arxiv_id":"2606.23471","last_updated":"2026-06-22T15:17:54Z","snapshot_observed_at":"2026-08-11T03:37:56.586896Z","submitted_at":"2026-06-22T15:17:54Z","title":"Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T06:23:24.212997Z"},"links":{"cited_paper":"/paper/2112.05909","citing_paper":"/paper/2606.23471"},"observation_digest":"sha256:1e7d7db020f569e10166b54fcfe1536fdfaffdf1868d86525017b86d52aec4a4","observation_id":"9cf84808-24a3-4ba9-9637-5815367014f6","resolution":{"observed_at":"2026-07-04T12:39:49.436661Z","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/2112.05909/citation-record","integrity":"/paper/2112.05909/integrity","json":"/paper/2112.05909/citation-record.json","paper":"/paper/2112.05909"},"outbound":[],"paper":{"arxiv_id":"2112.05909","last_updated":"2021-12-11T03:35:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:35:27.772951Z","submitted_at":"2021-12-11T03:35:33Z","title":"Neural Attention Models in Deep Learning: Survey and Taxonomy"},"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:2112.05909."}