{"as_of":"2026-08-08T02:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ebd3aef1258bde2c5181f2f548edd82b7ada2b956bdeb8b9aa479b155cc30812","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:29:12.643821Z","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-11T17:46:14.395890Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.06532","last_updated":"2019-06-15T11:44:42Z","snapshot_observed_at":"2026-07-06T08:00:34.188554Z","submitted_at":"2019-06-15T11:44:42Z","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06532","snapshot_observed_at":"2026-08-06T16:29:12.643821Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.13620","last_updated":"2025-07-22T08:44:20Z","snapshot_observed_at":"2026-08-06T16:17:40.618812Z","submitted_at":"2025-07-18T03:25:07Z","title":"Tri-Learn Graph Fusion Network for Attributed Graph Clustering","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T16:29:12.643821Z"},"links":{"cited_paper":"/paper/1906.06532","citing_paper":"/paper/2507.13620"},"observation_digest":"sha256:a03daf1f931bb4ac85e7b4a849b079fa9071cc7e5527cc0f6fb5e43d58af197c","observation_id":"2505125b-701d-4128-ade4-195ce2b84f58","resolution":{"observed_at":"2026-08-06T16:29:12.643821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06532","last_updated":"2019-06-15T11:44:42Z","snapshot_observed_at":"2026-07-06T08:00:34.188554Z","submitted_at":"2019-06-15T11:44:42Z","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06532","snapshot_observed_at":"2026-08-06T16:24:07.744033Z","title":null,"venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2507.13765","last_updated":"2025-07-18T09:17:04Z","snapshot_observed_at":"2026-08-07T03:05:57.815310Z","submitted_at":"2025-07-18T09:17:04Z","title":"Dual-Center Graph Clustering with Neighbor Distribution","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:24:07.744033Z"},"links":{"cited_paper":"/paper/1906.06532","citing_paper":"/paper/2507.13765"},"observation_digest":"sha256:fc013fe510c7ad10a695496ebbbe9a1967b6d2bb3dd9848b3d1b12f6d0ff2156","observation_id":"fbec106f-426a-4f1a-97fe-a30ae2dc0794","resolution":{"observed_at":"2026-08-06T16:24:07.744033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06532","last_updated":"2019-06-15T11:44:42Z","snapshot_observed_at":"2026-07-06T08:00:34.188554Z","submitted_at":"2019-06-15T11:44:42Z","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","version":1},"cited_work":{"arxiv_id":"1906.06532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.06532","snapshot_observed_at":"2026-07-04T23:42:54.155834Z","title":"arXiv preprint arXiv:1906.06532 , year=","venue":null,"work_id":"a9e7c0be-7c4b-44c4-aec4-937e5315095b","year":1906},"citing_paper":{"arxiv_id":"2605.05476","last_updated":"2026-05-06T21:53:49Z","snapshot_observed_at":"2026-07-06T23:18:07.750358Z","submitted_at":"2026-05-06T21:53:49Z","title":"A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks","version":1},"reference_index":148,"source":"arxiv_source","source_observed_at":"2026-05-08T17:08:49.668765Z"},"links":{"cited_paper":"/paper/1906.06532","citing_paper":"/paper/2605.05476"},"observation_digest":"sha256:e95a4cd9a7909d3b80b34385bdca9b3061c45fbf41f7a5697bb3d12ead5d3b0f","observation_id":"88f04393-4ead-48df-abc4-35877203ff6b","resolution":{"observed_at":"2026-07-04T23:42:54.155834Z","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/1906.06532/citation-record","integrity":"/paper/1906.06532/integrity","json":"/paper/1906.06532/citation-record.json","paper":"/paper/1906.06532"},"outbound":[],"paper":{"arxiv_id":"1906.06532","last_updated":"2019-06-15T11:44:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:00:34.188554Z","submitted_at":"2019-06-15T11:44:42Z","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach"},"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 3 inbound Pith citation observations for arXiv:1906.06532."}