{"as_of":"2026-08-05T13:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c786811c4294dec00074f0bb45a7a8f9c628f34b5eab1104d4e4388bf5ffb380","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-05T06:32:48.257954+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-06-27T01:51:18.585359Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-07-31T02:04:59.922185Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2502.00190","doi":"10.48550/arxiv.2502.00190","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00190","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the effectiveness of random weights in graph neural networks","venue":"ArXiv.org","work_id":"3096b214-a827-4531-9604-04400485c200","year":2025},"citing_paper":{"arxiv_id":"2604.19162","last_updated":"2026-04-21T07:16:05Z","snapshot_observed_at":"2026-07-06T23:05:53.378585Z","submitted_at":"2026-04-21T07:16:05Z","title":"Mind the Unseen Mass: Unmasking LLM Hallucinations via Soft-Hybrid Alphabet Estimation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T02:31:45.994612Z"},"links":{"cited_paper":"/paper/2502.00190","citing_paper":"/paper/2604.19162"},"observation_digest":"sha256:ab2d2d4b3c87ca63a630449eb3e9da58e378f07100c1ba300491bd97da3cc47a","observation_id":"ba030028-90c7-4b74-bc4f-f6723d7bc1cf","resolution":{"observed_at":"2026-05-11T13:01:03.676421Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-07-31T02:04:59.922185Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2502.00190","doi":"10.48550/arxiv.2502.00190","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00190","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the effectiveness of random weights in graph neural networks","venue":"ArXiv.org","work_id":"3096b214-a827-4531-9604-04400485c200","year":2025},"citing_paper":{"arxiv_id":"2606.18001","last_updated":"2026-06-16T14:47:35Z","snapshot_observed_at":"2026-08-04T02:19:09.681640Z","submitted_at":"2026-06-16T14:47:35Z","title":"Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T01:51:18.585359Z"},"links":{"cited_paper":"/paper/2502.00190","citing_paper":"/paper/2606.18001"},"observation_digest":"sha256:6285cd2dcc64a45c4e35e1c41c7771e905440c4a013b06d1d51459c63241823a","observation_id":"98fe3903-ca0e-4008-a250-b97f32ad9c47","resolution":{"observed_at":"2026-06-27T02:00:22.152521Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00190/citation-record","integrity":"/paper/2502.00190/integrity","json":"/paper/2502.00190/citation-record.json","paper":"/paper/2502.00190"},"outbound":[],"paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-31T02:04:59.922185Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural 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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.00190."}