{"as_of":"2026-08-21T22:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3cb9ef50709fe43c11ec289cf054d0ead931e128f579db82ca3127532c7052fe","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:24:22.532016Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"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/1909.01432/citation-record","integrity":"/paper/1909.01432/integrity","json":"/paper/1909.01432/citation-record.json","paper":"/paper/1909.01432"},"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-14T05:24:22.884936Z","title":"Emergence of scaling in random networks","venue":null,"work_id":"f039936a-b410-40ab-8d3c-fdef2918bacd","year":1999},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.426810Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:a5880caa4e37dda6ae194be6248f25242a389920ad0b9be2a8ec47ba9149c103","observation_id":"0feea6ff-48ef-4dfe-b992-39e3106b135c","resolution":{"observed_at":"2026-08-14T05:24:22.888868Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.873059Z","title":"Generation of uncorrelated random scale-free networks","venue":null,"work_id":"82b8edff-8d20-49f7-88c7-aa367cf161c5","year":2005},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.431454Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:0fc9dd43baa22c44b3512fb3281ae3c4e18ed2f207defed59af0f4ff8153fcea","observation_id":"ca6d2316-3016-4e45-b462-2ddf4b0ec590","resolution":{"observed_at":"2026-08-14T05:24:22.877231Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.861772Z","title":"Computing the optimal strategy to commit to","venue":null,"work_id":"6ac5e7a6-7a77-455a-8d77-60869b94311a","year":2006},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.435371Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:75ee8a774912b99c476df48ae8f24b9eae07cc015913be12ee8889bb9b90357e","observation_id":"2898187e-b154-42c1-b5de-e87d457dab26","resolution":{"observed_at":"2026-08-14T05:24:22.865697Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.848244Z","title":"Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation","venue":null,"work_id":"707a2f50-438f-40fd-911b-54ca93b9e9e4","year":2007},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.440265Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:11a902f5e283cec78aa34680cce9009502f6b0ce4ef1af54dd7539e8890c9e00","observation_id":"0a7d99d9-963e-4adb-9330-bdfdfc116789","resolution":{"observed_at":"2026-08-14T05:24:22.852912Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.444947Z","title":"Centrality in social networks conceptual clarification","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.444947Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:1bc3e735491808db45a487368ed6436e15aea2e474b32e321c123e7db78e676a","observation_id":"a6f76dcd-3dfd-4a7f-adfa-5891e5aa0b85","resolution":{"observed_at":"2026-08-14T05:24:22.444947Z","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-14T05:24:22.828924Z","title":"Quality- bounded solutions for finite bayesian stackelberg games: Scaling up","venue":null,"work_id":"59ec5378-c9c4-44c9-86d6-d28a5976fa4a","year":2011},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.449565Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:8be6f4d1fdc2d09466201da66227c3c2929f0fbf0426b7174ab6979ac426942f","observation_id":"42b937b3-0cf1-4000-b1c5-aa565b7a24be","resolution":{"observed_at":"2026-08-14T05:24:22.833533Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.453842Z","title":"A new status index derived from sociometric analysis","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.453842Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:1d069f935d271b04f734dc0f5f93d9bf3438efbbca3a85a6f771eacffc811fda","observation_id":"05c33366-b996-49a7-8b34-9f11ccd38c95","resolution":{"observed_at":"2026-08-14T05:24:22.453842Z","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-14T05:24:22.808664Z","title":"Ap- proximation methods for infinite bayesian stackelberg games: Modeling distributional payoff uncertainty","venue":null,"work_id":"ff833515-a602-4cc2-9a36-068033dbcc87","year":null},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.457677Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:75d19e4ba8e8b13d6c62a48d00fb5e1307844e9bd6d00a9144946d1d4489c40a","observation_id":"1fe56162-4843-4ef0-8779-bedf6ef9102f","resolution":{"observed_at":"2026-08-14T05:24:22.813011Z","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":"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-14T05:24:22.464916Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.464916Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:cb4965ee9856344101b77b4a7b860f0f8cdb288747401fd1126c6a1bba79a637","observation_id":"ef03bfd1-0f35-43d0-a766-97d2916693d1","resolution":{"observed_at":"2026-08-14T05:24:22.464916Z","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-14T05:24:22.784850Z","title":"Stackelberg vs","venue":null,"work_id":"96bca915-8824-46f8-8219-9ba0c2c0de82","year":2011},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.468980Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:6dd56d60d4f2117d466141fb652a1329a08c39b53708594dcf7fafd673466327","observation_id":"76d1a671-b5a1-46ba-83ad-7223c9701502","resolution":{"observed_at":"2026-08-14T05:24:22.789325Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.772977Z","title":"Vertex similarity in networks","venue":null,"work_id":"2fa8a47a-914d-4955-9f61-4def65dbdf9d","year":2006},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.472853Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:91a8c841273bf241ce1fc9f662ef8317cdc3ed579f5a78f556a508d89555fdff","observation_id":"433877fc-3b30-44ec-b3bf-e53191e06f45","resolution":{"observed_at":"2026-08-14T05:24:22.776996Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.760778Z","title":"Sampling from large graphs","venue":null,"work_id":"4ab6a0b6-cf4d-4ab5-a14d-d934a9c505ad","year":2006},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.476380Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:1acd8b3d3d52fa1ce37d06fe246f2ac0ab99e0bc2d7bca160c378fdbdfcbd747","observation_id":"b511ee9a-7ad1-4a1d-ba47-ec0b4a3f8797","resolution":{"observed_at":"2026-08-14T05:24:22.764662Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.749205Z","title":"Snap: A general-purpose network analysis and graph-mining library","venue":null,"work_id":"a41377d2-4288-4981-9eb1-986d5db129c6","year":2016},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.479957Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:a371d132c6391762dc38421dcbeea72186e4a9bc550495e2681ef578528daa97","observation_id":"6ae6fe00-bd4a-44c9-a8cd-6a9cb352f849","resolution":{"observed_at":"2026-08-14T05:24:22.753516Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.737370Z","title":"The link-prediction problem for social networks","venue":null,"work_id":"44ccb66a-194a-4ed5-b70b-2ea1b6b6966d","year":2007},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.483572Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:884971c057216e61806f2765c497b5394c242c4aa5ab8d3d3239a1338addf5f8","observation_id":"7d20e26a-f540-4c6f-9537-706552e23622","resolution":{"observed_at":"2026-08-14T05:24:22.741501Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.724670Z","title":"Similarity index based on local paths for link prediction of complex networks","venue":null,"work_id":"8c0d89b3-2971-4aa2-bb7c-8a9e8f459b46","year":2009},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.487277Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:f8598b9dc930c42e353985b559b6bee8c5a51e9a94091df3011ac476b133f74f","observation_id":"06ba6ad6-48d0-4330-addb-b6bce5d81774","resolution":{"observed_at":"2026-08-14T05:24:22.729542Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.712468Z","title":"Link prediction in complex networks: A survey","venue":null,"work_id":"0134b997-248a-4cda-85cd-8dca47969e35","year":2011},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.490896Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:1e3c29f5678f4f178d733911a2baab417cf9fdfacc14eb4f91645a85488ee6ca","observation_id":"e60a7542-13da-4fa2-bc72-5d5a8e194404","resolution":{"observed_at":"2026-08-14T05:24:22.716247Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.494443Z","title":"Deepwalk: Online learning of social representations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.494443Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:8abf08f9fbf1024c4658624997aea921611485674c5cb2eb6fd7572f760bd10a","observation_id":"91a73e30-762b-400d-9db4-232712d83417","resolution":{"observed_at":"2026-08-14T05:24:22.494443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03997","last_updated":"2019-07-25T13:19:32Z","snapshot_observed_at":"2026-08-14T19:46:53.018526Z","submitted_at":"2018-02-12T12:03:21Z","title":"GEMSEC: Graph Embedding with Self Clustering","version":3},"cited_work":{"arxiv_id":"1802.03997","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.03997","snapshot_observed_at":"2026-08-14T05:24:22.563322Z","title":"GEMSEC: Graph Embedding with Self Clustering","venue":"cs.SI","work_id":"9f6cff81-d13a-40ff-8ada-18a7e5a29378","year":2018},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.498188Z"},"links":{"cited_paper":"/paper/1802.03997","citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:fae3126f0b0b720de587c6809669b9cc7acecc22df9f609f065268afd832aa01","observation_id":"da48453c-f578-42e3-a614-9a599d28688e","resolution":{"observed_at":"2026-08-14T05:24:22.569768Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-14T05:24:22.692471Z","title":"Stackelberg security games: Looking beyond a decade of success","venue":null,"work_id":"9f1dcc05-3e48-4ff3-ba27-001897171b55","year":2018},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.501990Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:9651362f1e30e20bd989c6f7ae37c262bad58bac060a2690b6146b41d3db969e","observation_id":"8e1980f5-00c8-4fa6-9a18-f3760b2b0b45","resolution":{"observed_at":"2026-08-14T05:24:22.696712Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.680681Z","title":"Adversarial machine learning","venue":null,"work_id":"5b6ae1da-2019-4129-98c1-72031719f918","year":2018},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.505963Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:58abc560ea91902520526d3803dd9805ae5b6e0558d110cd332e1017be239b60","observation_id":"37fce334-f6f1-4b93-bf62-1c2a317f7043","resolution":{"observed_at":"2026-08-14T05:24:22.684715Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.668940Z","title":"Link predic- tion in social networks: the state-of-the-art","venue":null,"work_id":"a73f8edd-a755-4fab-bee8-3242b2bb168d","year":2015},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.509957Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:49be3e25bfe124dab6101f9f203a09f9ab3c1448d482f5023144c8f641181f3b","observation_id":"83a91246-66a0-46fb-8047-184194dd2db2","resolution":{"observed_at":"2026-08-14T05:24:22.673024Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.655450Z","title":"Hiding individuals and communities in a social network","venue":null,"work_id":"b8a2791b-70bc-4045-adfb-4122175e2285","year":2018},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.513679Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:69a66ec5afe762a352234571d1437b4d2b73e7b99819a35663ac76de85a8a702","observation_id":"df6a71a0-af8e-43b5-9753-354ef346981e","resolution":{"observed_at":"2026-08-14T05:24:22.660383Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.642995Z","title":"How to hide ones relationships from link prediction algorithms","venue":null,"work_id":"0f81e1d9-3f63-4203-81e1-46d3435b01a4","year":2019},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.517180Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:7463f0396f4e0277ff58fd3d20dd0ba7b8823788a1444c8da7c0f468357215ba","observation_id":"d5742e0c-3459-4adf-be8b-9d671aeb3624","resolution":{"observed_at":"2026-08-14T05:24:22.647150Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.630032Z","title":"Measuring the robustness of link prediction algorithms under noisy environment","venue":null,"work_id":"f6bf56d1-01cc-4913-9e9c-3eefbdd24ec7","year":2016},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.520800Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:9b7763040be85ee45ae7b84d0ef12748edaf78f6c0ed4ae45f3da13948e4688e","observation_id":"ee9937c1-78cc-49bd-a215-8ced10dd36cc","resolution":{"observed_at":"2026-08-14T05:24:22.634479Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.616594Z","title":"Attacking similarity-based link prediction in social networks","venue":null,"work_id":"d2d47fcd-b632-483b-9fac-4a15eaadae63","year":2019},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.524652Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:3aa38434d9f238b04b371ba51a60d9d7f836f998afd9e82751882d30b255758e","observation_id":"759d610c-60da-4bf9-b5dc-346aac024ad2","resolution":{"observed_at":"2026-08-14T05:24:22.620770Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.603411Z","title":"Adversarial attacks on neural networks for graph data","venue":null,"work_id":"9aa018bc-b838-4e9d-8e54-a58aa01da479","year":2018},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.528313Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:55a3bf099c1a94b24aa0b5b8ff5bcaff3315c83b29a64a6afe08ffb103d4f2e1","observation_id":"9176aa86-6efe-46c4-8bc6-158193531aea","resolution":{"observed_at":"2026-08-14T05:24:22.607922Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.590812Z","title":"Adversarial attacks on graph neural networks via meta learning","venue":null,"work_id":"4bb4fb5a-0777-4b70-9a05-a92b80b79299","year":2019},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.532016Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:d6c2f9ff9dc5f9654191c1eed1d9859295499e22e9fd6d031c9020f1633bd11c","observation_id":"111c205a-8761-4723-a965-4a63ed5a85be","resolution":{"observed_at":"2026-08-14T05:24:22.595296Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:24:22.796887Z","title":null,"venue":null,"work_id":"f81b1d40-e1c4-430b-8f40-61f82536d650","year":2011},"citing_paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction","version":1},"reference_index":1012,"source":"pdf_text","source_observed_at":"2026-08-14T05:24:22.461310Z"},"links":{"citing_paper":"/paper/1909.01432"},"observation_digest":"sha256:bec63ed638491a2b75b9f108c8a371fa08ed7fad0982f6e4be65203695c59800","observation_id":"386a8de8-0679-47f6-bd4d-ef8e7b487a78","resolution":{"observed_at":"2026-08-14T05:24:22.800749Z","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"}}],"paper":{"arxiv_id":"1909.01432","last_updated":"2019-09-03T20:20:45Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-21T19:45:38.550939Z","submitted_at":"2019-09-03T20:20:45Z","title":"Adversarial Robustness of Similarity-Based Link Prediction"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":28},"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 21 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:1909.01432."}