{"as_of":"2026-08-10T21:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f07ec4a4678da30ffa57276598e1dc8a48ebc605e7c4e6045366c97304c94e48","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-10T06:31:04.303077+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-06T19:28:20.609745Z","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-07-02T20:57:23.433138Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.04429","last_updated":"2019-11-11T18:15:12Z","snapshot_observed_at":"2026-07-06T08:36:11.628800Z","submitted_at":"2019-11-11T18:15:12Z","title":"GraphDefense: Towards Robust Graph Convolutional Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.04429","snapshot_observed_at":"2026-08-06T19:28:20.609745Z","title":"Graphdefense: Towards robust graph convolutional networks","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2507.05540","last_updated":"2025-07-07T23:43:24Z","snapshot_observed_at":"2026-08-10T11:52:05.612664Z","submitted_at":"2025-07-07T23:43:24Z","title":"Robust Learning on Noisy Graphs via Latent Space Constraints with External Knowledge","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:28:20.609745Z"},"links":{"cited_paper":"/paper/1911.04429","citing_paper":"/paper/2507.05540"},"observation_digest":"sha256:1a5b24a77fe8d76d1d81553eca06dde6962220736226f5c0a883ab061b5fdc26","observation_id":"c3f9edc2-4ef1-4308-90b0-ab36b260f94a","resolution":{"observed_at":"2026-08-06T19:28:20.609745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.04429","last_updated":"2019-11-11T18:15:12Z","snapshot_observed_at":"2026-07-06T08:36:11.628800Z","submitted_at":"2019-11-11T18:15:12Z","title":"GraphDefense: Towards Robust Graph Convolutional Networks","version":1},"cited_work":{"arxiv_id":"1911.04429","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.04429","snapshot_observed_at":"2026-07-02T20:57:23.433138Z","title":null,"venue":null,"work_id":"7fe5a388-7eca-459d-8396-7d086bfa45bd","year":1911},"citing_paper":{"arxiv_id":"2606.08067","last_updated":"2026-06-06T09:29:27Z","snapshot_observed_at":"2026-08-08T06:41:05.890520Z","submitted_at":"2026-06-06T09:29:27Z","title":"Beyond Homophily: Towards Generalized Graph Reconstruction Attack and Defense","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T20:01:09.550423Z"},"links":{"cited_paper":"/paper/1911.04429","citing_paper":"/paper/2606.08067"},"observation_digest":"sha256:e9a9fb27747ca01bc95ac9ba5a9dddfc766bbf7c11cef1902d2925aaabc1bd06","observation_id":"e23553b9-89b0-4328-9411-81464fcd9444","resolution":{"observed_at":"2026-07-02T20:57:23.434569Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1911.04429/citation-record","integrity":"/paper/1911.04429/integrity","json":"/paper/1911.04429/citation-record.json","paper":"/paper/1911.04429"},"outbound":[],"paper":{"arxiv_id":"1911.04429","last_updated":"2019-11-11T18:15:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:36:11.628800Z","submitted_at":"2019-11-11T18:15:12Z","title":"GraphDefense: Towards Robust Graph Convolutional 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1911.04429."}