{"as_of":"2026-08-06T06:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8af6f52b84a6865fdfece3c3176859b019e843df44b985d9ce8a233908321dd5","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-05-20T07:36:37.630198Z","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-20T07:38:09.276589Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.05563","last_updated":"2020-10-12T09:32:20Z","snapshot_observed_at":"2026-07-06T10:03:30.927329Z","submitted_at":"2020-10-12T09:32:20Z","title":"Graph Information Bottleneck for Subgraph Recognition","version":1},"cited_work":{"arxiv_id":"2010.05563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.05563","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2010.05563 , year=","venue":null,"work_id":"d3a21716-00a3-4464-8ba4-b782581f0119","year":2010},"citing_paper":{"arxiv_id":"2605.12061","last_updated":"2026-05-12T12:47:43Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-12T12:47:43Z","title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","version":1},"reference_index":161,"source":"arxiv_source","source_observed_at":"2026-05-13T04:45:34.957298Z"},"links":{"cited_paper":"/paper/2010.05563","citing_paper":"/paper/2605.12061"},"observation_digest":"sha256:f588b7161855b0a9eccebf5a74654e66d37ff4b04cd8891e04861fc305323693","observation_id":"d5753862-cfa3-4d24-bc91-60ec64d250ba","resolution":{"observed_at":"2026-05-13T04:57:17.745589Z","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":"2010.05563","last_updated":"2020-10-12T09:32:20Z","snapshot_observed_at":"2026-07-06T10:03:30.927329Z","submitted_at":"2020-10-12T09:32:20Z","title":"Graph Information Bottleneck for Subgraph Recognition","version":1},"cited_work":{"arxiv_id":"2010.05563","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.05563","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2010.05563 , year=","venue":null,"work_id":"d3a21716-00a3-4464-8ba4-b782581f0119","year":2010},"citing_paper":{"arxiv_id":"2605.19778","last_updated":"2026-05-27T07:50:54Z","snapshot_observed_at":"2026-08-01T00:55:27.707527Z","submitted_at":"2026-05-19T12:44:58Z","title":"B-cos GNNs: Faithful Explanations through Dynamic Linearity","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-20T07:36:37.630198Z"},"links":{"cited_paper":"/paper/2010.05563","citing_paper":"/paper/2605.19778"},"observation_digest":"sha256:6e01b2bc1d7d6013768b2bc75df933bd2eef03e1bc7271ad74169b4df3450cda","observation_id":"e70e17b1-6f34-4b98-a7e9-e86cf7a57fae","resolution":{"observed_at":"2026-05-20T07:38:09.279381Z","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/2010.05563/citation-record","integrity":"/paper/2010.05563/integrity","json":"/paper/2010.05563/citation-record.json","paper":"/paper/2010.05563"},"outbound":[],"paper":{"arxiv_id":"2010.05563","last_updated":"2020-10-12T09:32:20Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:03:30.927329Z","submitted_at":"2020-10-12T09:32:20Z","title":"Graph Information Bottleneck for Subgraph Recognition"},"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 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2010.05563."}