{"as_of":"2026-08-08T01:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e39e47b7a0fac505e9428a38000c0304b7c7578367db518bb33211bbc7592e3","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-07T06:34:17.273281+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-07T04:47:25.595564Z","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-05-16T17:18:09.665030Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.05569","last_updated":"2025-03-11T16:06:25Z","snapshot_observed_at":"2026-07-06T17:27:20.784234Z","submitted_at":"2024-02-08T11:10:39Z","title":"Training-Free Message Passing for Learning on Hypergraphs","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05569","snapshot_observed_at":"2026-08-07T04:47:25.595564Z","title":"Hypergraph node classification with graph neural networks.CoRR, abs/2402.05569, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09682","last_updated":"2025-06-11T12:59:21Z","snapshot_observed_at":"2026-08-07T13:45:49.779612Z","submitted_at":"2025-06-11T12:59:21Z","title":"Wasserstein Hypergraph Neural Network","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:47:25.595564Z"},"links":{"cited_paper":"/paper/2402.05569","citing_paper":"/paper/2506.09682"},"observation_digest":"sha256:de9420ecf47ee646725cc3cb4420ed48b01f81d2dc2e4dd5d462981f51e59a23","observation_id":"4968e61d-5c67-4a88-9486-48763c0b1f0c","resolution":{"observed_at":"2026-08-07T04:47:25.595564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05569","last_updated":"2025-03-11T16:06:25Z","snapshot_observed_at":"2026-07-06T17:27:20.784234Z","submitted_at":"2024-02-08T11:10:39Z","title":"Training-Free Message Passing for Learning on Hypergraphs","version":6},"cited_work":{"arxiv_id":"2402.05569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05569","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simplifying hypergraph neural networks","venue":null,"work_id":"04447b60-77aa-4c29-a391-beb3442660ad","year":2024},"citing_paper":{"arxiv_id":"2601.03173","last_updated":"2026-04-25T01:09:44Z","snapshot_observed_at":"2026-07-06T22:40:51.136169Z","submitted_at":"2026-01-06T16:52:09Z","title":"Predicting Time Pressure of Powered Two-Wheeler Riders for Proactive Safety Interventions","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-16T17:13:53.565291Z"},"links":{"cited_paper":"/paper/2402.05569","citing_paper":"/paper/2601.03173"},"observation_digest":"sha256:c21e46e31d336639452baac698e3227ea444d8d7c6311018e2bb6b704b0962c6","observation_id":"c073d7a6-2fd9-44e5-84dd-72dbba459e81","resolution":{"observed_at":"2026-05-16T17:18:09.667832Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.05569/citation-record","integrity":"/paper/2402.05569/integrity","json":"/paper/2402.05569/citation-record.json","paper":"/paper/2402.05569"},"outbound":[],"paper":{"arxiv_id":"2402.05569","last_updated":"2025-03-11T16:06:25Z","latest_version":6,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:27:20.784234Z","submitted_at":"2024-02-08T11:10:39Z","title":"Training-Free Message Passing for Learning on Hypergraphs"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.05569."}