{"as_of":"2026-08-20T23:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:061ecfb296f92ccd9154f56d5c3c09ead3e18973bd69dffcb194fadf32e06c32","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-20T06:33:59.587034+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-11T16:40:24.041559Z","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-07T10:19:09.570649Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.00387","last_updated":"2020-11-01T00:21:59Z","snapshot_observed_at":"2026-08-17T12:13:55.246504Z","submitted_at":"2020-11-01T00:21:59Z","title":"Be More with Less: Hypergraph Attention Networks for Inductive Text Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.00387","snapshot_observed_at":"2026-08-11T16:40:24.041559Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.09922","last_updated":"2024-12-13T07:22:13Z","snapshot_observed_at":"2026-08-17T12:12:19.056120Z","submitted_at":"2024-12-13T07:22:13Z","title":"Low-Resource Fast Text Classification Based on Intra-Class and Inter-Class Distance Calculation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T16:40:24.041559Z"},"links":{"cited_paper":"/paper/2011.00387","citing_paper":"/paper/2412.09922"},"observation_digest":"sha256:1fb39668d4ffec4f93da4c17f73ad85b896d1371365ea68adbb64e77a5aa50f8","observation_id":"df51f69b-4e6f-4054-aab6-c15fb7944074","resolution":{"observed_at":"2026-08-11T16:40:24.041559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.00387","last_updated":"2020-11-01T00:21:59Z","snapshot_observed_at":"2026-08-17T12:13:55.246504Z","submitted_at":"2020-11-01T00:21:59Z","title":"Be More with Less: Hypergraph Attention Networks for Inductive Text Classification","version":1},"cited_work":{"arxiv_id":"2011.00387","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.00387","snapshot_observed_at":"2026-08-07T10:19:09.570649Z","title":"Be More with Less: Hypergraph Attention Networks for Inductive Text Classification","venue":"cs.CL","work_id":"f03c0b64-4f9f-40f2-95c4-9a3254c7723d","year":2020},"citing_paper":{"arxiv_id":"2506.05626","last_updated":"2025-06-29T19:40:42Z","snapshot_observed_at":"2026-08-16T08:33:10.595904Z","submitted_at":"2025-06-05T22:59:39Z","title":"Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:45.084913Z"},"links":{"cited_paper":"/paper/2011.00387","citing_paper":"/paper/2506.05626"},"observation_digest":"sha256:1cd00b4bfb914b9c5fb98a5cd4b30d325a5b12109b841ca76a37f874505655f1","observation_id":"4a4c6727-12c2-444c-b447-85b624009810","resolution":{"observed_at":"2026-08-07T10:19:09.656020Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2011.00387/citation-record","integrity":"/paper/2011.00387/integrity","json":"/paper/2011.00387/citation-record.json","paper":"/paper/2011.00387"},"outbound":[],"paper":{"arxiv_id":"2011.00387","last_updated":"2020-11-01T00:21:59Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-17T12:13:55.246504Z","submitted_at":"2020-11-01T00:21:59Z","title":"Be More with Less: Hypergraph Attention Networks for Inductive Text Classification"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"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."}