{"as_of":"2026-08-08T18:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:11a603311ca17fafbab1790f2eb1150fee9ea11616a631a6b317c742fa9cbc9c","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-08T06:32:00.761636+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-06T14:50:44.556172Z","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-06T14:50:44.666546Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.04343","last_updated":"2020-04-08T17:56:58Z","snapshot_observed_at":"2026-08-07T02:46:42.508677Z","submitted_at":"2020-04-08T17:56:58Z","title":"Pruning and Sparsemax Methods for Hierarchical Attention Networks","version":1},"cited_work":{"arxiv_id":"2004.04343","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.04343","snapshot_observed_at":"2026-08-06T14:50:44.666546Z","title":"Pruning and Sparsemax Methods for Hierarchical Attention Networks","venue":"cs.CL","work_id":"c26d0a7d-d7f8-4cdd-bd22-ed72ab24e6c5","year":2020},"citing_paper":{"arxiv_id":"2507.17472","last_updated":"2025-07-23T12:52:38Z","snapshot_observed_at":"2026-08-06T14:44:50.413470Z","submitted_at":"2025-07-23T12:52:38Z","title":"BGM-HAN: A Hierarchical Attention Network for Accurate and Fair Decision Assessment on Semi-Structured Profiles","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T14:50:44.556172Z"},"links":{"cited_paper":"/paper/2004.04343","citing_paper":"/paper/2507.17472"},"observation_digest":"sha256:f86d36340cd11d4cf1cec0dffc753e777a65013951129e0edd29f100efb0919e","observation_id":"6c9438c1-5003-4538-87f1-b0a83ee89c43","resolution":{"observed_at":"2026-08-06T14:50:44.670875Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.04343/citation-record","integrity":"/paper/2004.04343/integrity","json":"/paper/2004.04343/citation-record.json","paper":"/paper/2004.04343"},"outbound":[],"paper":{"arxiv_id":"2004.04343","last_updated":"2020-04-08T17:56:58Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T02:46:42.508677Z","submitted_at":"2020-04-08T17:56:58Z","title":"Pruning and Sparsemax Methods for Hierarchical Attention Networks"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2004.04343."}