Pith. sign in

Paper Citation Record · LEDGER

Neural Attention Models in Deep Learning: Survey and Taxonomy

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2112.05909 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T05:29:25.309690Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-04T12:39:49.435256Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation caf678d0-260c-47ad-b13a-a16b46debf81 · inbound

Ensemble-Based Survival Models with the Self-Attended Beran Estimator Predictions cites this paper.

Ensemble-Based Survival Models with the Self-Attended Beran Estimator Predictions Neural Attention Models in Deep Learning: Survey and Taxonomy

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-07T05:29:25.309690Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T05:29:25.309690Z digest=sha256:f8534ec4e483d5c8e5d669ff6c6ca14e42faf0f2e8eed316114c19ba1d7e348e

Observation 9cf84808-24a3-4ba9-9637-5815367014f6 · inbound

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method cites this paper.

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method Neural Attention Models in Deep Learning: Survey and Taxonomy

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-04T12:39:49.436661Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-06-26T06:23:24.212997Z digest=sha256:1e7d7db020f569e10166b54fcfe1536fdfaffdf1868d86525017b86d52aec4a4