Pith. sign in

Paper Citation Record · LEDGER

Be More with Less: Hypergraph Attention Networks for Inductive Text Classification

As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2011.00387.

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

pith.paper-citation-record.v1
2011.00387 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-20T06:33:59.587034+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-11T16:40:24.041559Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T10:19:09.570649Z

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 df51f69b-4e6f-4054-aab6-c15fb7944074 · inbound

Low-Resource Fast Text Classification Based on Intra-Class and Inter-Class Distance Calculation cites this paper.

Low-Resource Fast Text Classification Based on Intra-Class and Inter-Class Distance Calculation Be More with Less: Hypergraph Attention Networks for Inductive Text Classification

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-11T16:40:24.041559Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T16:40:24.041559Z digest=sha256:1fb39668d4ffec4f93da4c17f73ad85b896d1371365ea68adbb64e77a5aa50f8

Observation 4a4c6727-12c2-444c-b447-85b624009810 · inbound

Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods cites this paper.

Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods Be More with Less: Hypergraph Attention Networks for Inductive Text Classification

Reference 98

Resolution
verified exact
local_arxiv, observed 2026-08-07T10:19:09.656020Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T10:18:45.084913Z digest=sha256:1cd00b4bfb914b9c5fb98a5cd4b30d325a5b12109b841ca76a37f874505655f1