{"as_of":"2026-08-08T22:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:293d7c782d213f7e13174c7a7d3bbef75d8febae4ffe0193f5aee4459f6db394","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:46:34.496359Z","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-18T08:46:07.672103Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.07451","last_updated":"2023-06-03T01:42:37Z","snapshot_observed_at":"2026-08-06T10:05:29.484362Z","submitted_at":"2021-06-14T14:23:08Z","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.07451","snapshot_observed_at":"2026-08-07T00:55:54.695081Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.12468","last_updated":"2025-06-17T03:17:11Z","snapshot_observed_at":"2026-08-07T00:46:40.868394Z","submitted_at":"2025-06-14T12:14:15Z","title":"Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:55:54.695081Z"},"links":{"cited_paper":"/paper/2106.07451","citing_paper":"/paper/2506.12468"},"observation_digest":"sha256:2cb3cb5238fdf9d7f8a7120a14b5e103cfd427996523e0ff568d2e2a2da5c393","observation_id":"c164346f-7753-4302-8089-a80c0da6ab88","resolution":{"observed_at":"2026-08-07T00:55:54.695081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.07451","last_updated":"2023-06-03T01:42:37Z","snapshot_observed_at":"2026-08-06T10:05:29.484362Z","submitted_at":"2021-06-14T14:23:08Z","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","version":2},"cited_work":{"arxiv_id":"2106.07451","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.07451","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c4e18735-3053-4fc9-875a-021476127541","year":2021},"citing_paper":{"arxiv_id":"2510.08952","last_updated":"2026-05-05T05:35:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-10T02:59:19Z","title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T08:45:51.992431Z"},"links":{"cited_paper":"/paper/2106.07451","citing_paper":"/paper/2510.08952"},"observation_digest":"sha256:0a7164d878110c02d9cb4677f53d50428e1cfc7b2135e55ce8bd5fe21d4289e3","observation_id":"6357413f-b228-4377-9de0-b5d866e1fe47","resolution":{"observed_at":"2026-05-18T08:46:07.676015Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2106.07451","last_updated":"2023-06-03T01:42:37Z","snapshot_observed_at":"2026-08-06T10:05:29.484362Z","submitted_at":"2021-06-14T14:23:08Z","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.07451","snapshot_observed_at":"2026-08-01T13:29:57.109558Z","title":"Transactions on Machine Learning Research , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.109558Z"},"links":{"cited_paper":"/paper/2106.07451","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:e7418dd442b46781259abe111ac75b8b1322c55ddf43eca0c874c2c05cca4774","observation_id":"8638cb88-1128-4501-9033-97af44ed0fbd","resolution":{"observed_at":"2026-08-01T13:29:57.109558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.07451","last_updated":"2023-06-03T01:42:37Z","snapshot_observed_at":"2026-08-06T10:05:29.484362Z","submitted_at":"2021-06-14T14:23:08Z","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.07451","snapshot_observed_at":"2026-08-08T18:46:34.496359Z","title":"Noise-robust graph learning by esti- mating and leveraging pairwise interactions,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.04377","last_updated":"2026-08-05T02:36:58Z","snapshot_observed_at":"2026-08-08T21:11:15.760526Z","submitted_at":"2026-08-05T02:36:58Z","title":"Towards Trustworthy Hypergraph Neural Networks under Label Noise","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T18:46:34.496359Z"},"links":{"cited_paper":"/paper/2106.07451","citing_paper":"/paper/2608.04377"},"observation_digest":"sha256:35e6799072c2a1b9269c00e0ff733a25c081d8088ad02a02b3935e1b072d2fef","observation_id":"63c5e77c-1685-4f89-81c8-9b7fc038d05f","resolution":{"observed_at":"2026-08-08T18:46:34.496359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2106.07451/citation-record","integrity":"/paper/2106.07451/integrity","json":"/paper/2106.07451/citation-record.json","paper":"/paper/2106.07451"},"outbound":[],"paper":{"arxiv_id":"2106.07451","last_updated":"2023-06-03T01:42:37Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T10:05:29.484362Z","submitted_at":"2021-06-14T14:23:08Z","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions"},"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 4 inbound Pith citation observations for arXiv:2106.07451."}