{"as_of":"2026-08-13T11:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5fe6a4904269b1a6d3f79af1fbd312b0bd29b2c0626dd995352a347885740fcd","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:32:59.184836Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2412.17468/citation-record","integrity":"/paper/2412.17468/integrity","json":"/paper/2412.17468/citation-record.json","paper":"/paper/2412.17468"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.04025","last_updated":"2020-10-28T18:03:30Z","snapshot_observed_at":"2026-07-06T08:56:16.158936Z","submitted_at":"2020-02-10T18:53:30Z","title":"Can Graph Neural Networks Count Substructures?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.04025","snapshot_observed_at":"2026-08-11T05:32:59.064897Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.064897Z"},"links":{"cited_paper":"/paper/2002.04025","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:742c97d9246b7d295907e191d5e495342b2233ea84ffdda914b6e186bdec9bf2","observation_id":"85c0fca2-4eb9-431c-b583-f26327ebb088","resolution":{"observed_at":"2026-08-11T05:32:59.064897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1101.5211","last_updated":"2011-01-27T05:51:11Z","snapshot_observed_at":"2026-08-13T05:06:46.392165Z","submitted_at":"2011-01-27T05:51:11Z","title":"The Weisfeiler-Lehman Method and Graph Isomorphism Testing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1101.5211","snapshot_observed_at":"2026-08-11T05:32:59.072685Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.072685Z"},"links":{"cited_paper":"/paper/1101.5211","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:d05a9ccb78b110262fa37d7cc934b880f75803e7f6d4ebbd497d67e1e9f4389f","observation_id":"b8cc3862-b3e6-4cfc-bb64-13ae6cf28f11","resolution":{"observed_at":"2026-08-11T05:32:59.072685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07835","last_updated":"2022-03-17T16:41:15Z","snapshot_observed_at":"2026-08-12T07:02:03.927823Z","submitted_at":"2021-02-15T20:27:56Z","title":"Topological Graph Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07835","snapshot_observed_at":"2026-08-11T05:32:59.102048Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.102048Z"},"links":{"cited_paper":"/paper/2102.07835","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:da555bd0f864750755bd9fd27eeaa53d9cd6bbfc255273433bd25d81dc12b66c","observation_id":"1183973d-3d57-4d34-84b1-336685d0acba","resolution":{"observed_at":"2026-08-11T05:32:59.102048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11136","last_updated":"2020-06-09T11:28:26Z","snapshot_observed_at":"2026-08-10T02:20:27.775874Z","submitted_at":"2019-05-27T11:33:19Z","title":"Provably Powerful Graph Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11136","snapshot_observed_at":"2026-08-11T05:32:59.147235Z","title":"Maron, H","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.147235Z"},"links":{"cited_paper":"/paper/1905.11136","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:abd46810324e405c278f3d6e28d589627831aebde223d8561eb12770f8362e03","observation_id":"37f175f1-a268-41d6-bf0e-92a4d0ecd9f3","resolution":{"observed_at":"2026-08-11T05:32:59.147235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-11T05:32:59.160189Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.160189Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:ba826cd0534ff770bd6d7efa88a28e9809b063ef8a7d56524ef62e7c50dc5af0","observation_id":"99f239df-0fbb-44ed-8bbd-f6a157bfbf82","resolution":{"observed_at":"2026-08-11T05:32:59.160189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.11702","last_updated":"2020-03-26T01:49:24Z","snapshot_observed_at":"2026-08-02T03:43:31.234790Z","submitted_at":"2020-03-26T01:49:24Z","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.11702","snapshot_observed_at":"2026-08-11T05:32:59.022821Z","title":"Balcilar, G","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.022821Z"},"links":{"cited_paper":"/paper/2003.11702","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:87f712632cca5f087538357d4fa6f3e1308e4bfb71590b55513c76b3c11a6bb7","observation_id":"f454c28a-cf90-4089-8ba9-201e8e0f67c6","resolution":{"observed_at":"2026-08-11T05:32:59.022821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-11T05:32:59.112693Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":1992,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.112693Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:ef8bd72d5c18a1e85d6b1932680857ca996d25e1de517e301658b6719a5c7434","observation_id":"03895822-850b-45f3-a364-7abdfa4218d5","resolution":{"observed_at":"2026-08-11T05:32:59.112693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.04041","last_updated":"2018-02-16T07:12:19Z","snapshot_observed_at":"2026-08-13T05:07:23.173353Z","submitted_at":"2017-07-13T09:36:05Z","title":"Deep Learning with Topological Signatures","version":3},"cited_work":{"arxiv_id":"1707.04041","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.04041","snapshot_observed_at":"2026-08-11T05:32:59.625950Z","title":"Deep Learning with Topological Signatures","venue":"cs.CV","work_id":"c89aa9ab-c24a-4d46-a489-b654a2d99f41","year":2017},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.093198Z"},"links":{"cited_paper":"/paper/1707.04041","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:2ff8e03b37f1e714faeb8321b1c361e4aa37dc9b1ae67d7b106ccaea3fbe52d9","observation_id":"17e84db4-2d5e-4cf6-9eb9-ce354d86263e","resolution":{"observed_at":"2026-08-11T05:32:59.635408Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","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-11T05:32:59.125075Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.125075Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:87d7ce0e94a760a2d84ba7ba88410149c134cbf14509c941da2397042a06ae6c","observation_id":"3fbca16d-37b1-4f55-9e6a-c13d9e7bef98","resolution":{"observed_at":"2026-08-11T05:32:59.125075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.08804","last_updated":"2019-02-20T08:54:36Z","snapshot_observed_at":"2026-07-06T06:46:20.429430Z","submitted_at":"2018-06-22T18:04:46Z","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.08804","snapshot_observed_at":"2026-08-11T05:32:59.179618Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.179618Z"},"links":{"cited_paper":"/paper/1806.08804","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:aef3ef5e3d685997ac7527c2f2a95a06bb1904387ef6024c0ea9b4c21ccfecdc","observation_id":"16e1593b-466c-4804-adfc-9e5f199561f2","resolution":{"observed_at":"2026-08-11T05:32:59.179618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.02144","last_updated":"2018-01-07T06:14:55Z","snapshot_observed_at":"2026-08-01T08:18:51.314463Z","submitted_at":"2018-01-07T06:14:55Z","title":"Covariant Compositional Networks For Learning Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.02144","snapshot_observed_at":"2026-08-11T05:32:59.136021Z","title":"Kondor, H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.136021Z"},"links":{"cited_paper":"/paper/1801.02144","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:c1a540d86474531d7250265ff935223eefeed79914179987080d9aeaf86cca19","observation_id":"1365cc4d-c711-43ca-97d5-8108912abca2","resolution":{"observed_at":"2026-08-11T05:32:59.136021Z","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-11T05:32:59.824415Z","title":"Weisfeiler and A","venue":null,"work_id":"31298406-c315-4a9f-8608-4d2bbf20222d","year":1968},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.154644Z"},"links":{"citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:fd0efaa569969fe2913f2e03d2040c42b29b86d313e354320d67a5f67fcb416b","observation_id":"03d2baf6-8570-4cea-8acf-5de39eaa891c","resolution":{"observed_at":"2026-08-11T05:32:59.834756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12189","last_updated":"2019-12-12T01:31:23Z","snapshot_observed_at":"2026-08-08T14:16:12.306661Z","submitted_at":"2019-04-27T18:01:35Z","title":"Learning metrics for persistence-based summaries and applications for graph classification","version":2},"cited_work":{"arxiv_id":"1904.12189","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.12189","snapshot_observed_at":"2026-08-11T05:32:59.235517Z","title":"Learning metrics for persistence-based summaries and applications for graph classification","venue":"cs.CG","work_id":"41c14861-cef5-4714-b820-6d4b033b0722","year":2019},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.184836Z"},"links":{"cited_paper":"/paper/1904.12189","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:898964fe4c4b4d49905291431c0b8874072cb953b0f777f68778a406b520eac4","observation_id":"24b6f35f-618c-4997-badc-372e49653afd","resolution":{"observed_at":"2026-08-11T05:32:59.262426Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:32:59.860920Z","title":null,"venue":null,"work_id":"6b086e69-9031-49d1-a87d-97f7ef38dcf4","year":2019},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.054756Z"},"links":{"citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:f37bc1480ff2c17f82a9acae9fa8456b09bd270fa6f20405e5c3479368fc3fc8","observation_id":"8ecdf388-8f20-4c01-8133-159fd46030d8","resolution":{"observed_at":"2026-08-11T05:32:59.868375Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04319","last_updated":"2021-06-08T13:26:56Z","snapshot_observed_at":"2026-07-06T11:17:05.506265Z","submitted_at":"2021-06-08T13:26:56Z","title":"Breaking the Limits of Message Passing Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04319","snapshot_observed_at":"2026-08-11T05:32:59.035034Z","title":"Balcilar, P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.035034Z"},"links":{"cited_paper":"/paper/2106.04319","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:5faa34f58e9c556126419e0b0ec00f611e0d90d9bc83de681e2f6889baf35db5","observation_id":"24cf284f-f40a-48db-a74e-07db5ff4228b","resolution":{"observed_at":"2026-08-11T05:32:59.035034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09252","last_updated":"2021-07-05T13:22:05Z","snapshot_observed_at":"2026-08-07T11:18:52.864157Z","submitted_at":"2020-06-16T15:30:31Z","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09252","snapshot_observed_at":"2026-08-11T05:32:59.041682Z","title":"Bouritsas, F","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.041682Z"},"links":{"cited_paper":"/paper/2006.09252","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:d4671174c8a9e33c668ee8a943fd1b77c336573f57f040b7dbe5fa2ce02599a9","observation_id":"e4409524-ea89-46e2-a7b2-c3c95c508d8c","resolution":{"observed_at":"2026-08-11T05:32:59.041682Z","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-11T05:32:59.081177Z","title":"Fey and J","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T05:32:59.081177Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2412.17468"},"observation_digest":"sha256:3827de9d0d4e06be2dc376b57959e64400ddbaa1f203544e8a55ee002df6933a","observation_id":"1499f29f-c5ae-4c44-9351-244edd17b713","resolution":{"observed_at":"2026-08-11T05:32:59.081177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.17468","last_updated":"2024-12-23T10:46:44Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T05:07:15.465613Z","submitted_at":"2024-12-23T10:46:44Z","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":17},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2412.17468."}