{"as_of":"2026-08-22T05:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31ec2ad459a97f4c9b6183a4eb9f5403b93e85078b73129100c14ed61a2b2c63","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:31:39.568597Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.12715/citation-record","integrity":"/paper/2504.12715/integrity","json":"/paper/2504.12715/citation-record.json","paper":"/paper/2504.12715"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.290624Z","title":null,"venue":null,"work_id":"8d21c7fc-acbc-43af-9e42-a1f9a6af5f3f","year":null},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.314645Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:116ec287a209a201174aa8c09e49118db0611c14615a0b5e60474bc363035b88","observation_id":"7546222c-2748-44cd-91c4-53c03d445c59","resolution":{"observed_at":"2026-08-16T12:31:40.295391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.325270Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.325270Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:38e8b2b8ca2c701d494be2cc1acde2fd67bbe5f6b5f220eaacc61f857b399c86","observation_id":"b14fe9f6-08cf-4d77-a940-d9a7e46689ba","resolution":{"observed_at":"2026-08-16T12:31:39.325270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01261","last_updated":"2018-10-17T17:51:36Z","snapshot_observed_at":"2026-08-17T23:08:02.689731Z","submitted_at":"2018-06-04T17:58:18Z","title":"Relational inductive biases, deep learning, and graph networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01261","snapshot_observed_at":"2026-08-16T12:31:39.331186Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.331186Z"},"links":{"cited_paper":"/paper/1806.01261","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:8601b71489e7f23d3214328e992d69b021d2d6204d0076901f8293c19cfd7a01","observation_id":"05f7b502-44ae-4f8f-9993-4b019b85ff29","resolution":{"observed_at":"2026-08-16T12:31:39.331186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.250826Z","title":null,"venue":null,"work_id":"140bc373-b068-412c-93c3-63423af42914","year":2024},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.336368Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:818ba32061551daf750b6eeec08dcc90830f82f14e5a4c48b2accbf786988a6e","observation_id":"9e36dabb-dbb3-4348-9023-87311887a0f0","resolution":{"observed_at":"2026-08-16T12:31:40.255535Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.13438","last_updated":"2022-10-24T17:52:02Z","snapshot_observed_at":"2026-08-15T04:43:16.361751Z","submitted_at":"2022-10-24T17:52:02Z","title":"High Fidelity Neural Audio Compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.13438","snapshot_observed_at":"2026-08-16T12:31:39.340920Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.340920Z"},"links":{"cited_paper":"/paper/2210.13438","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:d3617fc4beeb0b6d11ff2981a538e5812752467c53239f1a86bfa137c2ae208a","observation_id":"0337e6dd-780a-4eb4-b6c9-c8da8964edac","resolution":{"observed_at":"2026-08-16T12:31:39.340920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.235008Z","title":null,"venue":null,"work_id":"99fcb6ce-a7c5-4058-8eda-bcf36488d976","year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.345876Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:b6e73dc9304cb92d9b5ae33f17ac6bb92a0258f99a9721f85f3809a900748564","observation_id":"57b33416-583d-4182-81e7-6d50b3632fc1","resolution":{"observed_at":"2026-08-16T12:31:40.240459Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.350939Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.350939Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:8604af18858af7cc6441552c6ccc76d05483bb5bb72b27d8fc943b25c4907536","observation_id":"be44d958-9ca8-4261-8e1a-7fa55dc0cab1","resolution":{"observed_at":"2026-08-16T12:31:39.350939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-16T12:31:39.355473Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.355473Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:2cc80b1b4d2eee37c72ae24bea8dd6f9d4a54be4456ddcd0351ea57f7d42f50c","observation_id":"d4defc95-8aef-48ca-8613-02d4afc47602","resolution":{"observed_at":"2026-08-16T12:31:39.355473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.210321Z","title":null,"venue":null,"work_id":"4dc1e175-4262-41fb-87f5-c9dcb138d2e3","year":1987},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.360487Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:272228c8be6e438077de443d65e2df03f8b337dc477b0fd8b3f6911ab685aab1","observation_id":"458b5a08-df68-4a80-a2d4-99ca31c7a637","resolution":{"observed_at":"2026-08-16T12:31:40.215130Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.365109Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.365109Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:dee7086539a6b8610a76dcad6ce487aa3bf25f9f75fb04f9ffeb29de6eefc6e3","observation_id":"1363b933-5a20-43e5-84fe-06f6cb63b33b","resolution":{"observed_at":"2026-08-16T12:31:39.365109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.370062Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.370062Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:6ced9210a3d61d880d8b6514ab92c49585f15eb776a52b473233c5cb45f33766","observation_id":"f15498e6-206f-4d4f-ae16-fcc803b95b53","resolution":{"observed_at":"2026-08-16T12:31:39.370062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.175436Z","title":null,"venue":null,"work_id":"dc69ac48-8b44-4466-a70e-89bbd5bb8aa0","year":2019},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.374347Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:210b1151a442e6bae01cdf844d233cfc8a80b8588ad8bf987a363e3a5fb8e1c3","observation_id":"235fbec7-a433-495b-94b2-de4e9e758f23","resolution":{"observed_at":"2026-08-16T12:31:40.180763Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.378919Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.378919Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:0bb4005e89dc2834ad88b82d9cc9400c3827f42b2d4f5a3d612032e6d0e7310f","observation_id":"e1a40a26-bbb4-4262-8f27-21b1e88ebfc4","resolution":{"observed_at":"2026-08-16T12:31:39.378919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.383305Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.383305Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:6cce1b0e39ddbd916b6adea9672caa51e51757a316581d3f104e2f536d40dc48","observation_id":"cff087d0-9970-43ac-850e-e4fcb97028c6","resolution":{"observed_at":"2026-08-16T12:31:39.383305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.387743Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.387743Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:1a301810ed6365902fb78ca97a65faaf8abdcc8f2300d7ab7e83af0c9bbb1f4c","observation_id":"a8f90096-0b07-482c-b60e-03278ae33216","resolution":{"observed_at":"2026-08-16T12:31:39.387743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.392320Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.392320Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:108ff4d816944b5927f83a9f0a6c16efb4d6c08946f27c03726c3a5c3efb0a47","observation_id":"0ed2885c-26e1-465c-bd7d-498bbbdbb4db","resolution":{"observed_at":"2026-08-16T12:31:39.392320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12265","last_updated":"2020-02-18T19:49:48Z","snapshot_observed_at":"2026-08-19T01:50:09.544863Z","submitted_at":"2019-05-29T08:11:52Z","title":"Strategies for Pre-training Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12265","snapshot_observed_at":"2026-08-16T12:31:39.397033Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.397033Z"},"links":{"cited_paper":"/paper/1905.12265","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:e6dfdb92eb83fc0138853b6b258c6ba09faedd9110cad0fde2081902c690702d","observation_id":"35cb836e-0940-4f3e-a1fb-74d2b7617f2b","resolution":{"observed_at":"2026-08-16T12:31:39.397033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01144","last_updated":"2017-08-05T22:45:19Z","snapshot_observed_at":"2026-08-15T03:05:41.956181Z","submitted_at":"2016-11-03T19:48:08Z","title":"Categorical Reparameterization with Gumbel-Softmax","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01144","snapshot_observed_at":"2026-08-16T12:31:39.401972Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.401972Z"},"links":{"cited_paper":"/paper/1611.01144","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:dc1b3cb0e52eb9477b9ea02ee62139cdf51a96b8eb8f5734d2772a3fae25e6b7","observation_id":"b38f6c0f-2f06-4669-bd05-b4e2b0af07f1","resolution":{"observed_at":"2026-08-16T12:31:39.401972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-16T12:31:39.407206Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.407206Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:ec2e507157812e64f31b118170c82089922e54038789bd90f0b5fb7a42627a1c","observation_id":"0c824aa3-4122-4e70-8886-6b6f250ec262","resolution":{"observed_at":"2026-08-16T12:31:39.407206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-16T12:31:39.412217Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.412217Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:8a496148c6ae119d73d6f130cc59c3847047c0db7eb23291e1a41f763f798430","observation_id":"e98d97ad-0cf5-4c55-ba24-5c2ef78ae5fd","resolution":{"observed_at":"2026-08-16T12:31:39.412217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.120267Z","title":null,"venue":null,"work_id":"65f0b209-752b-48fe-a7c8-069ae12c7c57","year":1983},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.417027Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:35de434cf5ba96dd5e6974d121175245a73d5cd0725c0094795cfd65e5988e79","observation_id":"d0c4a6ef-4372-4660-83f7-490c497b61a3","resolution":{"observed_at":"2026-08-16T12:31:40.125818Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.421941Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.421941Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:917a5af6167013df05586d0c6025118f0834133467f6ebf4ea3d92d200505e1b","observation_id":"f517bf2b-f47e-450a-8ac3-02450f49e853","resolution":{"observed_at":"2026-08-16T12:31:39.421941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.092295Z","title":null,"venue":null,"work_id":"43aa0596-a326-4c2b-87dc-5e0905470544","year":2023},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.426476Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:38dbf3f67ea3b91e023c36b5f773638eefc4b05327a1283bff813257789d4d0c","observation_id":"07afd461-fe59-473f-9fc2-70efdbc0342a","resolution":{"observed_at":"2026-08-16T12:31:40.097269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.431295Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.431295Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:079af12be8bdab3847276453a7cce10ee003b286ea2393906f14a281748a0441","observation_id":"c5091014-eacd-40fa-b3a3-7350047b93a9","resolution":{"observed_at":"2026-08-16T12:31:39.431295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.055449Z","title":null,"venue":null,"work_id":"97dcd42c-20f6-4e3e-bf33-93f0a474e39c","year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.441542Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:18c031d7e5a97a9c0a82513a9b2a918ac22289a7fc50ce25adb97884b2a2fd89","observation_id":"b70255fa-5557-4835-9eda-5233a983e59f","resolution":{"observed_at":"2026-08-16T12:31:40.060593Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-16T12:31:39.446549Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.446549Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:adc4bd5ccb2239cb5c836d03c7d796039a96bce84363881a8869599c72a73645","observation_id":"c778e933-c2e2-4a7b-bc79-93a33c22608b","resolution":{"observed_at":"2026-08-16T12:31:39.446549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.451690Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.451690Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:4effec1a1354fbfbb9315fafc4310822800e7d0d504307ddd82ff3422c75585e","observation_id":"bba99ecd-98c6-4989-b655-fa58492fa409","resolution":{"observed_at":"2026-08-16T12:31:39.451690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.461114Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.461114Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:e78f27b2f7c598a8afd79f89eca2b29765acb74fc1b09e47f12cc44efcdc280c","observation_id":"d5fcc247-7625-46be-b257-260a248f6800","resolution":{"observed_at":"2026-08-16T12:31:39.461114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.465651Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.465651Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:68b2f4cd79ecd4d4724ca01571e4c6ebd53485c8054bc8b96517c59b5ce673f5","observation_id":"f25843b2-65e5-487f-929b-445dd087819a","resolution":{"observed_at":"2026-08-16T12:31:39.465651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.471252Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.471252Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:99cd38d020cd6636f45b228d338970de5fc67fc912671a7811e961c4199f85de","observation_id":"cd2c40e0-9d79-4bcc-9427-dd0099b40091","resolution":{"observed_at":"2026-08-16T12:31:39.471252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.475693Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.475693Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:b52b12b3fb967adb325b9e3cd89ab22926da3585022259e0019626f5a3791bc7","observation_id":"ebbc9edd-854a-4703-ad66-9e55d2c31244","resolution":{"observed_at":"2026-08-16T12:31:39.475693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.480179Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.480179Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:6ebc249695b6f50a220c6953c5c40f1f1a3e03dc597e6a969070369fc39ee1f9","observation_id":"cb7a88fc-6cb1-4393-a197-a681f01d70dd","resolution":{"observed_at":"2026-08-16T12:31:39.480179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.485045Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.485045Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:16d04b9f7d8610c44dc34c099cbd3ae7e8c2df5e00e3ec8629fa1c354414d71a","observation_id":"3d0bff57-aa45-4b5f-aa57-6b43213d703d","resolution":{"observed_at":"2026-08-16T12:31:39.485045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-16T12:31:39.489661Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.489661Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:d2a9577bfab1994024831c09efc3fb28c7f90a6a6e5b226fe582f0631382dd11","observation_id":"e5c01d52-ed36-4800-88b4-3672241b278e","resolution":{"observed_at":"2026-08-16T12:31:39.489661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-16T12:31:39.494508Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.494508Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:1323c2a4460713c1a72ff827abc95d5780f8bc59be9ccf62c686f1853c3280e0","observation_id":"0b06560d-5fa8-430f-b8d9-4ce58907033a","resolution":{"observed_at":"2026-08-16T12:31:39.494508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.965088Z","title":null,"venue":null,"work_id":"00752fc6-3eea-465b-9ba1-951573482622","year":2023},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.499329Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:4c69aa2ac8bfb48e0824d944912ec023abe0098f99c03f35311a643c3150f73d","observation_id":"20474cad-daf4-4bea-8057-654595a30ccf","resolution":{"observed_at":"2026-08-16T12:31:39.970761Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06514","last_updated":"2023-02-20T10:48:57Z","snapshot_observed_at":"2026-08-18T22:49:50.972808Z","submitted_at":"2021-02-12T13:36:39Z","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.06514","snapshot_observed_at":"2026-08-16T12:31:39.503774Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.503774Z"},"links":{"cited_paper":"/paper/2102.06514","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:eefaa98f0c69d812a70fdbd7b271c2c8630b440389026bcabf57a15b60b93b1b","observation_id":"f4ffa834-bd89-4e94-9df9-8102be671807","resolution":{"observed_at":"2026-08-16T12:31:39.503774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.508741Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.508741Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:d791c12fa18c4a2613622cc5ce1618c343e467d7b9be0545eb4ff6166d98deed","observation_id":"370eed03-06d9-4229-9970-eb4084ad65a5","resolution":{"observed_at":"2026-08-16T12:31:39.508741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.513235Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.513235Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:6819607f5db0f61202ba4a5867e346a39ceff6c04b42d37660e54642a2d2f2d7","observation_id":"7ab5eeb7-5742-4116-833f-67b71623e997","resolution":{"observed_at":"2026-08-16T12:31:39.513235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.517777Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.517777Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:c09a1dce2c580ff33c883f1d569749a558af74d161099e112d7d703dac048e74","observation_id":"aec06351-f9a8-46e7-85ab-9dcb7667b51a","resolution":{"observed_at":"2026-08-16T12:31:39.517777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10341","last_updated":"2018-12-21T15:44:59Z","snapshot_observed_at":"2026-08-14T18:22:57.330140Z","submitted_at":"2018-09-27T04:53:24Z","title":"Deep Graph Infomax","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10341","snapshot_observed_at":"2026-08-16T12:31:39.522522Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.522522Z"},"links":{"cited_paper":"/paper/1809.10341","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:d75ccb6ed521e28c0099723d7639cbbbded1e2dc6a348d81401dd02dee0a4211","observation_id":"828f3279-cebf-4ed7-9a05-e284cbe5f143","resolution":{"observed_at":"2026-08-16T12:31:39.522522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.527381Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.527381Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:9648cb07aff81d8c3a4bacfa2a57c99f127d670db5f2c25f5567d165b54a2dcc","observation_id":"79b93cbf-c780-4248-a67c-86ba2abd28ab","resolution":{"observed_at":"2026-08-16T12:31:39.527381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.531825Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.531825Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:92280433b2436a794a3828571d4d1a8b212303633476852471bd39ebf6b4d622","observation_id":"c88ab38c-95f8-48ab-8f93-c999fa13afbd","resolution":{"observed_at":"2026-08-16T12:31:39.531825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.536342Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.536342Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:d28d50a34e15e789635eed28e22014e1eb9fd7a54e1e16167ac7c35167350ae0","observation_id":"3b08fe7d-0158-46ed-b224-2edaebf2800a","resolution":{"observed_at":"2026-08-16T12:31:39.536342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.890122Z","title":null,"venue":null,"work_id":"3b7dc4ed-4a4c-4ca1-94ad-aed7d538a46a","year":2024},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.540911Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:08f07204398093ffd99af85b6e11ab8b65005b360d90d8abbf34880a98776068","observation_id":"469f6fe7-3bef-4a5a-8ecf-52f6ecda9933","resolution":{"observed_at":"2026-08-16T12:31:39.894914Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.545302Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.545302Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:8cfced0f786a868f21dd6b6880e3448c876ca0ccff173b398e6fb4e49b0deeff","observation_id":"98c8e3f5-f58d-43ac-90b4-29a04550cbf1","resolution":{"observed_at":"2026-08-16T12:31:39.545302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.549821Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.549821Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:0bedbd57e9b41864ee0736083f82c90f451fff1e18672af1b2e86d810d5c1d5e","observation_id":"74452796-8de1-4d77-8a33-45b436731648","resolution":{"observed_at":"2026-08-16T12:31:39.549821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.554140Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.554140Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:ce38b18afe2bf6374a45853d23d768469f32e5d1eda8d0ae0ca395ff41d64cb9","observation_id":"82dedf77-5af5-4468-9e9d-fc6040f4c664","resolution":{"observed_at":"2026-08-16T12:31:39.554140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.844787Z","title":null,"venue":null,"work_id":"c74afb66-1b36-4f28-a3ab-49bb03800b43","year":2024},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.559084Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:6b987a9c6ad171e4db57f2e7eb64118a360aac1ca4f511686188fea9f3de9d0e","observation_id":"7f326913-928b-47af-beee-6dfc35a33702","resolution":{"observed_at":"2026-08-16T12:31:39.849440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-18T19:43:01.466508Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-08-16T12:31:39.563604Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.563604Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:8ab384bd6b7fd7a235cace5861404db044c7a7cb67721491d0f69806c062e4a5","observation_id":"480874dd-ac02-4366-ab35-387b8b6758f5","resolution":{"observed_at":"2026-08-16T12:31:39.563604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.827561Z","title":null,"venue":null,"work_id":"5f475b19-896f-4bbc-b6a2-2f100d4380f4","year":2021},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.568597Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:f9fa47ab54c629e75e510b54bab3b2d516da57c9089e9a94a0b5fc0e607a9c4e","observation_id":"0dbf065f-ec8b-497f-a29f-0ebba60d86f7","resolution":{"observed_at":"2026-08-16T12:31:39.833484Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:40.275511Z","title":"Neural networks 3, 3 (1990), 277–290","venue":null,"work_id":"c3e8a043-898a-42f4-acaa-46416217a0c8","year":1990},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.320276Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:e2d87806f46e9b73cfaa70173d85da36167595c1e7ca80e5f3fc2c841ccea9d9","observation_id":"a9b122ac-d718-497d-9611-a5b8730a4ec2","resolution":{"observed_at":"2026-08-16T12:31:40.280375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04407","last_updated":"2019-01-08T00:26:13Z","snapshot_observed_at":"2026-08-20T01:51:22.071270Z","submitted_at":"2018-02-13T00:29:11Z","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04407","snapshot_observed_at":"2026-08-16T12:31:39.456373Z","title":"arXiv preprint arXiv:1802.04407 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.456373Z"},"links":{"cited_paper":"/paper/1802.04407","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:e06713ee3bd8ddce09fe364b26397055d8daf86381cb880dbbacf31d379d9069","observation_id":"3e84456a-1753-48f1-91a6-1e5c2d6fe6f5","resolution":{"observed_at":"2026-08-16T12:31:39.456373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:31:39.436428Z","title":"IEEE transactions on knowledge and data engineering 35, 6 (2022), 5879–5900","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.436428Z"},"links":{"citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:b0f5ff732168b3cea7cb6acef4f1eacd941f03e435068fa30ce675b92f3fb65e","observation_id":"38377e0f-9259-4b7e-a37e-fa671a4094e9","resolution":{"observed_at":"2026-08-16T12:31:39.436428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":53,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":54},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2504.12715."}