{"as_of":"2026-08-10T06:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8822dd3cff3edb3213d387a9979b08d9318829be5e10c5f09e1f8c011e89f99","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:15:36.394238Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2507.07138/citation-record","integrity":"/paper/2507.07138/integrity","json":"/paper/2507.07138/citation-record.json","paper":"/paper/2507.07138"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:15:32.706291Z","title":"Friends and neighbors on the web.Social Networks, 25(3): 211–230, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:32.706291Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:f2826df1dbd71c5f78c39a554675e451836aea684885786fba4e234a96ec4749","observation_id":"95d24edb-a2f5-48e6-94f2-aa871485e4e0","resolution":{"observed_at":"2026-08-06T19:15:32.706291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-09T22:21:00.246820Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"cited_work":{"arxiv_id":"2502.09365","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.09365","snapshot_observed_at":"2026-08-06T19:15:36.834141Z","title":"Simple Path Structural Encoding for Graph Transformers","venue":"cs.LG","work_id":"58cc4e3f-066b-49e1-ade7-dbe28d4d6971","year":2025},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:32.794147Z"},"links":{"cited_paper":"/paper/2502.09365","citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:ef140d9580d62f9c0182137fbc3fa681ea58c15010a613d2cb191c23d594aec1","observation_id":"31ebb34f-efc8-46dd-80a4-5e587bdadeca","resolution":{"observed_at":"2026-08-06T19:15:36.960659Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:32.892866Z","title":"An optimal lower bound on the number of variables for graph identification.Combinatorica, 12(4):389–410, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:32.892866Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:d3e1c86cb120290a9a330c217cccb9c892deb9c82fafd4335ca72f6ac4542377","observation_id":"44c28062-baa2-4eee-b187-fa4cb82f86d6","resolution":{"observed_at":"2026-08-06T19:15:32.892866Z","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-06T19:15:42.568763Z","title":"Bronstein, and Max Hansmire","venue":null,"work_id":"fe0b913a-0982-41a8-9519-e65b78bb8216","year":2023},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:32.993974Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:d332dbc918f3c22c6c3c2d18995edaa33231b0753dcc63cb3b2bcf63ed5662e1","observation_id":"fd3e89bc-45e0-4d4b-b2f1-3e38bea35546","resolution":{"observed_at":"2026-08-06T19:15:42.619230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:42.418674Z","title":"Edge classification on graphs: New directions in topological imbalance","venue":null,"work_id":"77f5f017-2901-48c2-92df-e52a91a96f7a","year":2025},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.077091Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:88d4cf05be2dbc5e85aa198bf64b6abbbab5b9df5cd8ca057abd0a94b46dfaa8","observation_id":"a2ed9a2e-4c88-4856-9502-fdbb28f79f25","resolution":{"observed_at":"2026-08-06T19:15:42.469598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.3555","last_updated":"2014-12-11T06:46:53Z","snapshot_observed_at":"2026-08-10T04:10:43.257455Z","submitted_at":"2014-12-11T06:46:53Z","title":"Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.3555","snapshot_observed_at":"2026-08-06T19:15:33.179038Z","title":"Empirical evaluation of gated recurrent neural networks on sequence modeling.arXiv preprint arXiv:1412.3555, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.179038Z"},"links":{"cited_paper":"/paper/1412.3555","citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:cb9ffe75c81d281c8e98f8d29e41556262a06d80f50d3945ebffd72a39be4b3b","observation_id":"3e8fb04e-ce2f-47df-9e6c-82ec2b5ff28e","resolution":{"observed_at":"2026-08-06T19:15:33.179038Z","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-06T19:15:42.294349Z","title":"Cormen, Charles E","venue":null,"work_id":"69c71132-c035-4bcb-8ffa-1d29c4c22785","year":2009},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.262758Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:ff774ee0fa002fdcb1ea5c13cd241f1854c40efeb049a05c33df354aacc245fb","observation_id":"7cb046cb-02db-456b-8449-e4d9aef30a5a","resolution":{"observed_at":"2026-08-06T19:15:42.349559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:42.170991Z","title":"Generalizations of k-dimensional weisfeiler–leman stabiliza- tion","venue":null,"work_id":"a8e29ddd-b837-49f8-8c9a-05251ab45edb","year":2020},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.360711Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:232c820e13a829749754b6a0310cba8344605ba5d9cd9561e1dd23bcbdf67569","observation_id":"84b6e30c-b9ce-4bda-8a6f-588f3c12e9f4","resolution":{"observed_at":"2026-08-06T19:15:42.231156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:41.942992Z","title":"Thelinkregressionproblemingraphstreams","venue":null,"work_id":"489db374-d29f-4603-9757-1401e76827f4","year":2019},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.453462Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:99aa5adf2f8c9658216100ebb56dd17fd9ba1a36aea95262b38f4d3bb2822f50","observation_id":"84bf3830-db83-4db4-afe2-8ecd8196f958","resolution":{"observed_at":"2026-08-06T19:15:42.097511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:33.552580Z","title":"node2vec: Scalable feature learning for networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.552580Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:f91a6dfeabe3557411301aaec9ac41784d1aaae70665d96dadcdaddd4575945e","observation_id":"782672af-7b51-4830-8c9d-3b3603115d06","resolution":{"observed_at":"2026-08-06T19:15:33.552580Z","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-06T19:15:33.642119Z","title":"Exploring network structure, dynamics, and function using networkx","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.642119Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:e8e55133eed7cb850ec5bb29fb8e0ba75159415c511af018fa00a8922d0d9d78","observation_id":"a5c6c88b-12ee-4b87-a581-52207908f683","resolution":{"observed_at":"2026-08-06T19:15:33.642119Z","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-06T19:15:41.665199Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"669097c8-fa6c-4939-b3c3-b8b084adb98e","year":2017},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.702357Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:6e6c26d0d5adc1a159fb85c4f7ec05d1c7b3b4cc1f783fc06294b60ea195e3f3","observation_id":"ecc48b01-91eb-431c-af2d-53bf9da9cad4","resolution":{"observed_at":"2026-08-06T19:15:41.815395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:33.767864Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.767864Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:ff33368501240bacbb517f5e43849a0808337b6c5b08cefa88bb0e491106dd8a","observation_id":"eec8ca77-ed7c-4a4c-8ba5-41d8822504d3","resolution":{"observed_at":"2026-08-06T19:15:33.767864Z","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-06T19:15:33.879537Z","title":"Long short-term memory.Neural computation, 9(8): 1735–1780, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.879537Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:b71a69b5029a86b66e569183105dca4b804c72e939f1487a5f921a0d98fb8754","observation_id":"0ca2ca38-f79b-4570-994c-73c8421b3fd9","resolution":{"observed_at":"2026-08-06T19:15:33.879537Z","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-06T19:15:41.455953Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":"bd2c979b-1769-4c5b-9fcd-614f4db2bbca","year":2020},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:33.995413Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:0a08b6e5f52a3ac90f999eb795cc3a9eb996c2e655f25448ed533e8125c6de1b","observation_id":"08ff7a8b-10e3-478e-a946-749b1d02a62c","resolution":{"observed_at":"2026-08-06T19:15:41.516720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:34.081316Z","title":"Prediction of protein–protein interaction using graph neural networks.Scientific Reports, 12(1):8360, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.081316Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:be20089bcac0cf9e472f90a8fca638b579a3c58f59416e5fdec0ab9831ababf6","observation_id":"5ad7ba7d-47f9-46ee-9086-2701f25f9f19","resolution":{"observed_at":"2026-08-06T19:15:34.081316Z","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-06T19:15:34.140884Z","title":"A new status index derived from sociometric analysis.Psychometrika, 18(1):39–43, 1953","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.140884Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:3c00e853f281ec5526dae28c123227f5ad106fff799e83503e49f1fea430610c","observation_id":"cf6cfd9b-d1c5-464a-adcc-39c47ddd4af4","resolution":{"observed_at":"2026-08-06T19:15:34.140884Z","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-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-06T19:15:34.248259Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.248259Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:143821e9bb163d59d7b3f28ad338762079d611cd97085831594e800b74b3d493","observation_id":"315bbbae-4424-4d42-b903-658c5f0a4e17","resolution":{"observed_at":"2026-08-06T19:15:34.248259Z","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-06T06:17:37.090691Z","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-06T19:15:34.311265Z","title":"Variational graph auto-encoders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.311265Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:322c7a3bfc5ada68bd8b72204c43508803ef0c9fe9663f8b83a5fce6683f0111","observation_id":"a088b8e8-366b-4e32-8318-d15a761dae6e","resolution":{"observed_at":"2026-08-06T19:15:34.311265Z","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-06T19:15:41.293173Z","title":"Evaluating graph neural networks for link prediction: Current pitfalls and new benchmarking","venue":null,"work_id":"b10c55ec-b5a4-4070-bc5e-55c441777247","year":2023},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.415271Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:39e0c0462201bc2217a5725787a17f7ec0acac5a00d6c1c8b9ada86fb4709c76","observation_id":"1d2eafb1-0634-411f-a1dc-a0c463bd5980","resolution":{"observed_at":"2026-08-06T19:15:41.354086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:41.073585Z","title":"Distance encoding: Design provably more powerful neural networks for graph representation learning.Advances in Neural Information Processing Systems, 33:4465–4478, 2020","venue":null,"work_id":"f46c2f4f-59ba-4247-b8d3-daebe1b14862","year":2020},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.522859Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:c71225428578336ee6a2fe90bd6398df93f05123f0bd83bb095dfa0e5ff1a5fa","observation_id":"06405f63-729c-4e2d-8a55-8024e4086864","resolution":{"observed_at":"2026-08-06T19:15:41.178296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:40.765594Z","title":"Line graph neural networks for link weight prediction.Physica A: Statistical Mechanics and its Applications, page 130406, 2025","venue":null,"work_id":"0f1277b3-8626-422b-b4d2-1cbf4d2aa17c","year":2025},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.650304Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:4274a75bdb881d5e0dbc5bdf21c40ce5871f6673cabc89da6fe75ed30089a8b1","observation_id":"f784b1df-dc8a-4849-9167-462d78f03a64","resolution":{"observed_at":"2026-08-06T19:15:40.910965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6863.95697","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:15:36.644775Z","title":"The link prediction problem for social net- works","venue":null,"work_id":"fb8a9fcc-d5da-49b9-9a48-f7f217e38c2f","year":2003},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.723704Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:8f47d1863f5e8952b7b33a4ddc1d250a4dcdce5b90e3e7827d67114c657f5d40","observation_id":"a5466ac8-77e0-44a0-a845-a2e140b0abfa","resolution":{"observed_at":"2026-08-06T19:15:36.706954Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:40.504384Z","title":"Computational complexity of the weisfeiler-leman dimension","venue":null,"work_id":"1d9245b5-288b-41fd-8649-fc84f1852b64","year":2025},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.835393Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:e2eff5ba79ff34afde5f7bb899fd0783f465127fba271e0213a357523a410367","observation_id":"fea567eb-8d40-4287-a321-2c19e2853fe8","resolution":{"observed_at":"2026-08-06T19:15:40.612804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:40.291016Z","title":"Linkpredictionincomplexnetworks: Asurvey","venue":null,"work_id":"b90f264e-8391-43ad-b5e8-47b7b6fa6cfb","year":2011},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:34.945252Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:508dcfee994f2220d5b0a30dbd5e63d5e93e3a26fe0f4f33ad7c3bc8838538ba","observation_id":"7ab41edb-031a-4167-96ad-903d9abd258b","resolution":{"observed_at":"2026-08-06T19:15:40.418763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:40.029705Z","title":"Link prediction via matrix factorization","venue":null,"work_id":"7e636f6f-f329-47fc-b796-d3c4773acfaa","year":2011},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.035143Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:e194bcdd6be82406e63e22ba422521093f3f590356184772949514bf7099eace","observation_id":"00c9e8a0-baeb-49a7-a47c-a47886683633","resolution":{"observed_at":"2026-08-06T19:15:40.157871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:35.127291Z","title":"Weisfeiler and leman go neural: Higher-order graph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.127291Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:87d6f8ad8206d2767c26fc697b1189cf505f4626d053b60ab88c30572531c33e","observation_id":"29b0d07e-7d13-4cc2-bf44-7ef7ad6f09c2","resolution":{"observed_at":"2026-08-06T19:15:35.127291Z","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-06T19:15:35.239385Z","title":"Clusteringandpreferentialattachmentingrowingnetworks","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.239385Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:1b437a4182c244c13c22c0b90a028357af0b443ecbfab94ad4af2240e10cdc92","observation_id":"3dcb9246-b19e-4501-b269-a00292e085d1","resolution":{"observed_at":"2026-08-06T19:15:35.239385Z","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-06T19:15:39.813522Z","title":"A review of relational machine learning for knowledge graphs.Proceedings of the IEEE, 104(1):11–33, 2015","venue":null,"work_id":"b35f63c6-f4ab-4c53-b82a-885943cf1de9","year":2015},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.311515Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:faf055a0814193af05b9b032203dcf7b2d5d32cde41be288564927c29bbb3bfd","observation_id":"a7017222-74c1-430c-b3ea-37db47b87a7e","resolution":{"observed_at":"2026-08-06T19:15:39.903657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:35.378389Z","title":"Knowledge graph embedding for link prediction: A comparative analysis.ACM Transactions on Knowledge Discovery from Data (TKDD), 15(2):1–49, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.378389Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:54024427565bb984f7f90874c5202482457e220c626b001ffbf31bea3552ecdb","observation_id":"5ec297ae-94f8-44d4-b89f-df264212e814","resolution":{"observed_at":"2026-08-06T19:15:35.378389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.00452","last_updated":"2020-09-22T01:08:22Z","snapshot_observed_at":"2026-08-07T20:20:19.535043Z","submitted_at":"2019-10-01T14:37:22Z","title":"On the Equivalence between Positional Node Embeddings and Structural Graph Representations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.00452","snapshot_observed_at":"2026-08-06T19:15:35.452690Z","title":"On the equivalence between positional node embeddings and structural graph representations.arXiv preprint arXiv:1910.00452, 2019","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.452690Z"},"links":{"cited_paper":"/paper/1910.00452","citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:244e0dad7487819cfd0ce79d0b123f944728244e3861b567509e99466366d33c","observation_id":"f86027f0-500f-48e0-b7a4-30b011fad79f","resolution":{"observed_at":"2026-08-06T19:15:35.452690Z","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-06T19:15:35.527820Z","title":"Attention is all you need.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.527820Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:910face6619beb52f373fad85fcffe44894a00d85f41fd5b5b358a642e0c6626","observation_id":"b4cfa627-b43c-4d1d-b11d-39c3745afe7f","resolution":{"observed_at":"2026-08-06T19:15:35.527820Z","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-06T19:15:35.606238Z","title":"Graph attention networks.stat, 1050(20):10–48550, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.606238Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:6adc45f8fb8be35eef286837d22f4d7bfedaa18951fa939f3bf9139e6db891c3","observation_id":"98f4f4d0-6865-4957-8a50-82da9c889ecf","resolution":{"observed_at":"2026-08-06T19:15:35.606238Z","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-06T19:15:39.581317Z","title":"Graph attention networks","venue":null,"work_id":"dafb9d1e-11a5-4a60-bf7d-5b12bd150560","year":null},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.654942Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:0acc2205511d2047cfb4df9deb15d4b68adfdc58ef71cf53d865882934a9bbec","observation_id":"ab9f108a-b015-4208-932b-fbf6b1c8e13a","resolution":{"observed_at":"2026-08-06T19:15:39.678019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:38.766021Z","title":"Equivariant and stable positional encoding for more powerful graph neural networks","venue":null,"work_id":"5ff00c15-3f14-484b-a421-17975025aef9","year":2022},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.740995Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:dac1e4a4bf59b140bc683abd258c3114ad665a3c7f54edd733cfd7baabd9182c","observation_id":"d02edf43-5ebb-496a-b2d6-30d20ccd9606","resolution":{"observed_at":"2026-08-06T19:15:38.892811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:38.550076Z","title":"Neural common neighbor with completion for link prediction","venue":null,"work_id":"64883213-39dc-412b-9b43-c4256b48989d","year":2024},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.788060Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:2893a033a3311dea0f9bb45783325f48443468b40041f6ca2167e1b404d481e5","observation_id":"3d0f6af5-58c3-4b82-87b6-c407c3698ad8","resolution":{"observed_at":"2026-08-06T19:15:38.631341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:35.864112Z","title":"Apan: Asynchronous propagation attention network for real-time temporal graph embedding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.864112Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:c99650533b0aa2b7eca1dc2ee77b4e2104de0124426847dbfec7e45eac75b998","observation_id":"762eb34e-e48f-44a1-9405-374dd042e1a5","resolution":{"observed_at":"2026-08-06T19:15:35.864112Z","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-06T19:15:35.919969Z","title":"How powerful are graph neural networks?, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.919969Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:355ede138d845b666c83324b2f460cdcd3d2582e831eac42bc78aff8b04d8707","observation_id":"5f744f58-7955-41f0-a497-a26a426271a7","resolution":{"observed_at":"2026-08-06T19:15:35.919969Z","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-06T19:15:38.328671Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":"c67e40e2-9d92-4186-a08c-41ac82cbdc4d","year":2016},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.970900Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:02a40bb7f6fb0aaab8315e978006b235d86faf51246f82ac39285553c368d1f2","observation_id":"b0e442ad-6817-41a4-884b-1acf01a802fb","resolution":{"observed_at":"2026-08-06T19:15:38.415322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:36.019759Z","title":"Do transformers really perform badly for graph representation?Advances in neural information processing systems, 34:28877–28888, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.019759Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:7075f246c99289b9e83c1cb8c50bf88ad489f4e1f7f1ebb7a5c31b8179fc2de2","observation_id":"adaefc00-b2c6-4f60-abec-64ea44158356","resolution":{"observed_at":"2026-08-06T19:15:36.019759Z","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-06T19:15:38.078402Z","title":"Graph convolutional neural networks for web-scale recommender systems","venue":null,"work_id":"d6b4553d-3807-4f19-aca8-0dd0b137a3d0","year":2018},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.066761Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:7aa6c90a0f5c7175eeac742b250c47a65c258ad34163b256ec09db92dbc4647f","observation_id":"9e39f895-32d1-4e6c-8203-ad3a40b7c3c9","resolution":{"observed_at":"2026-08-06T19:15:38.199404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:37.800169Z","title":"Neo-gnns: Neighborhood overlap-aware graph neural networks for link prediction.Advances in Neural Information Processing Systems, 34:13683–13694, 2021","venue":null,"work_id":"fbee68d4-00f1-4275-bb4b-c3cac6735f1e","year":2021},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.114153Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:2bd68f1d379d9e587bcd14f68c2df4e900f7c212de3b23d45b4250426d41364c","observation_id":"e4397669-eb2b-4788-b79e-3e4a21b8aaf0","resolution":{"observed_at":"2026-08-06T19:15:37.913933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:36.173030Z","title":"Link prediction based on graph neural networks.Advances in neural information processing systems, 31, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.173030Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:851a54baa3b961ab115d818ef4635cdd07cc6f9c621b6957d4473d18d76a5f89","observation_id":"a634f899-90f4-4023-8aba-745713255f21","resolution":{"observed_at":"2026-08-06T19:15:36.173030Z","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-06T19:15:37.592869Z","title":"Labelingtrick: Atheoryofusing graph neural networks for multi-node representation learning.Advances in Neural Information Processing Systems, 34:9061–9073, 2021","venue":null,"work_id":"193190e5-e9ab-4034-a0bd-1060e31b81a6","year":2021},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.221698Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:98f387f036960bc7d1dd7733c0359420aad4c458b303eb568533bff76bbe4851","observation_id":"1bd891e7-5e39-4ef1-9fb4-b40b6de78138","resolution":{"observed_at":"2026-08-06T19:15:37.657678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:37.362859Z","title":"Progresses and challenges in link prediction.Iscience, 24(11), 2021","venue":null,"work_id":"0401fee1-1d0e-4c24-b163-80999effbc71","year":2021},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.265734Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:fc6dfdadd1fb15e10bb52b4ead5431b55239ab6e0a99da02d1e7de364c0f5b4f","observation_id":"82f238f1-0e54-4457-bf58-a1707f158780","resolution":{"observed_at":"2026-08-06T19:15:37.490374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:36.318937Z","title":"Predicting missing links via local information","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.318937Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:0c66220c1f5a1542b9e13aa683359f31bf863c716e453415f35a96a2e7444166","observation_id":"8b1db422-8be2-48fa-9af7-06a0fc2e9044","resolution":{"observed_at":"2026-08-06T19:15:36.318937Z","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-06T19:15:37.081406Z","title":"Neural bellman-ford networks: A general graph neural network framework for link prediction.Advances in neural information processing systems, 34:29476–29490, 2021","venue":null,"work_id":"3564a487-4561-4914-a44a-ab572f1504dc","year":2021},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:36.394238Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:306ac1e43d4628f776ba09b0e71d03780ce4f6e2c1604a30e0ddc1265577b7de","observation_id":"68867ffe-812a-434e-a398-aa96fea3bd70","resolution":{"observed_at":"2026-08-06T19:15:37.156742Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:15:39.048927Z","title":null,"venue":null,"work_id":"ec5131fb-d7b8-4068-9c94-089ecd5a74ff","year":null},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:35.690949Z"},"links":{"citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:53bcdc49082af6a2d9b5878eb907e9da9d0fbb13957edb7ed75b5d514e906237","observation_id":"1e3087f6-0198-42ec-a4e9-04f08113e0c8","resolution":{"observed_at":"2026-08-06T19:15:39.166922Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":23,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":48},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2507.07138."}