{"as_of":"2026-08-16T17:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05187af1e5fedba28559f0fc9ade5f6566d0f9971938cc14f01eb9047349e049","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:20:12.948201Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.08037/citation-record","integrity":"/paper/1908.08037/integrity","json":"/paper/1908.08037/citation-record.json","paper":"/paper/1908.08037"},"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-14T12:20:13.346944Z","title":"A comprehen- sive survey of graph embedding: Problems, techniques, and applications","venue":null,"work_id":"ef65dd70-375a-4b8c-800b-f74222367489","year":2018},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.827626Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:9f68c096b1ce718e6aff7567d2d9b200e037fb1c9dfc411c4c5309e442ce980a","observation_id":"9b173f20-7f65-498d-a8f1-c914b9bc644a","resolution":{"observed_at":"2026-08-14T12:20:13.358032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:12.833117Z","title":"Graph embedding techniques, applications, and performance: A survey","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.833117Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:ca3030e1fc95cedd722db713338b161585a8ed6c86e4d6dca67bbda103f3bd3a","observation_id":"e60cbc77-27eb-4030-818c-0c7270dd419b","resolution":{"observed_at":"2026-08-14T12:20:12.833117Z","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-14T12:20:13.324190Z","title":"node2vec: Scalable feature learning for net- works","venue":null,"work_id":"c41d3905-e841-4030-a1c3-df1b80d3e348","year":2016},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.838421Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:1c8adb33619a92bd462e32f0b01f22952dc44c84c9c9e0cc2058fa6d0ed59170","observation_id":"532be7dc-eed5-4cbe-a39b-002caa4c19ad","resolution":{"observed_at":"2026-08-14T12:20:13.328674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.307597Z","title":"Dynamic probabilistic models for latent feature propagation in social networks","venue":null,"work_id":"26b39313-c758-485f-9b53-8badfc25c8bc","year":2013},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.843708Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:2da2a8411a005005522cf9857affb2b1aceee04d8e01828f973115d055de7280","observation_id":"4c86137a-bf9a-46e3-b33c-f4b69fb8de15","resolution":{"observed_at":"2026-08-14T12:20:13.313879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.290957Z","title":"Spread of information through a population with socio- structural bias: I","venue":null,"work_id":"a39bae43-4fa0-4e50-9b06-65ef342638db","year":1953},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.852333Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:daf5c541dca6d3c13589e4c6315e7b262dd6367a5118589a2154a31e6edf5cc9","observation_id":"5621b37a-e4f7-4051-bc4a-b30e77c392a3","resolution":{"observed_at":"2026-08-14T12:20:13.295801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.270005Z","title":"The pager- ank citation ranking: Bringing order to the web","venue":null,"work_id":"24d65b68-31fe-449d-b807-453f0e4e83f3","year":1999},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.858220Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:947d355933293c34f163d76159f986d77d7c1d99c8d668d41c3c43f39061a255","observation_id":"d6104862-8937-4a08-a2ea-0c5be467ae37","resolution":{"observed_at":"2026-08-14T12:20:13.277653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.249235Z","title":"Textrank: Bringing order into text","venue":null,"work_id":"d313059d-7f2a-4a53-9f6f-862f1a169a0b","year":2004},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.863710Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:675b029e16baf17bc05ff037207c2c7d52928f404d5fd6271e5bba29dcb2a9b9","observation_id":"88f4cc87-fd51-469d-b4b1-f298d1c60db0","resolution":{"observed_at":"2026-08-14T12:20:13.255142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.230682Z","title":"Link prediction based on graph neural networks","venue":null,"work_id":"f9d8c468-495c-47e6-ad85-061515cda998","year":2018},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.867639Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:28671ed1e2f4c886102a1e64bfe821e06c3a94bd5fdb6927e69e853343786d02","observation_id":"1a2844c9-d200-40f1-9e55-b9f23a87c705","resolution":{"observed_at":"2026-08-14T12:20:13.239921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-14T12:20:12.874695Z","title":"Variational graph auto-encoders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.874695Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:2689cce21dfc03d9f6e3e98c46e4399d63697397c19440a54304749c7dbc6433","observation_id":"60db339f-e1a2-4ce0-afba-640415b60352","resolution":{"observed_at":"2026-08-14T12:20:12.874695Z","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-14T12:20:13.214098Z","title":"Distributed large-scale natural graph factorization","venue":null,"work_id":"6a01898b-48b3-4540-9ea8-4db5716ec928","year":2013},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.879133Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:f1463e20faf64843f82da6d7b905df04a15503cb5015370e45ad98e9eb0aa8f2","observation_id":"4b634627-7021-4c9e-a23d-a85dd51312de","resolution":{"observed_at":"2026-08-14T12:20:13.219677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:12.883419Z","title":"Structural deep network embedding","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.883419Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:25bed23bb7179c94b66d7653e34afff9d61640f593f1a5bdb1921f9f976478d1","observation_id":"c859ae99-8bc1-477d-9d60-8945b19f074b","resolution":{"observed_at":"2026-08-14T12:20:12.883419Z","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-14T12:20:13.186767Z","title":"Asymmet- ric transitivity preserving graph embedding","venue":null,"work_id":"87edc44f-444a-4d41-b7c1-70e6fca25ea3","year":2016},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.887757Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:13efd8b1e6b5f92d460d234ccbe3050aac442384a8e20bf0732aa769ef7346c7","observation_id":"1046efda-793e-405f-918f-1b5d5dac223a","resolution":{"observed_at":"2026-08-14T12:20:13.191240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.169901Z","title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","venue":null,"work_id":"0a1179ac-7a0d-4ff6-92b1-7834209a7cdd","year":2002},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.892457Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:e4c217e8d01edc54537715d2ac1bf13bc94014c99720dd9b95ec1500a02a826f","observation_id":"ac213469-89ef-45e4-9281-3e02e8e8de5d","resolution":{"observed_at":"2026-08-14T12:20:13.176958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.154820Z","title":"Nonlinear dimensionality reduction by locally linear embedding","venue":null,"work_id":"8f2d7d6e-4254-4c08-87e7-9d25d75543d4","year":2000},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.898202Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:d595e5e21435c69def20cd5338951648bac52125bfb4e0cf27814c453f9e0ede","observation_id":"b8612c97-731f-4354-9c72-898f7c3ec652","resolution":{"observed_at":"2026-08-14T12:20:13.159839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.138400Z","title":"Optimization by simu- lated annealing","venue":null,"work_id":"1acacac9-dd08-41fa-8244-8d4d3d100e28","year":1983},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.903013Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:85f9d2038eddec23ed4410f2bc0a26f10af811ce3958f9fcd4ef02f83e6329f7","observation_id":"63800fb0-242b-4904-ba0a-e42801794ba1","resolution":{"observed_at":"2026-08-14T12:20:13.143205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.122648Z","title":"The Organization of Behavior","venue":null,"work_id":"d850232c-17b4-40b8-9674-4181956e261a","year":1949},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.907908Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:073a11df822a5dd6dc6182104ea67039cd12816e4be67428cda073f9cd91c4b6","observation_id":"22f0be25-5842-4c3e-8fa2-f87e301a9d77","resolution":{"observed_at":"2026-08-14T12:20:13.128639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.105872Z","title":"Hebbian learning and predictive mirror neurons for actions, sensations and emotions","venue":null,"work_id":"c2f03847-9940-4fc3-9328-538c9870481e","year":2014},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.913277Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:5efed2b52da93a57dbed257ce8e8bffbb1c89a40b57b8cd1af21d31e0634ac5c","observation_id":"70050f55-5220-4732-b80c-af3b4638f957","resolution":{"observed_at":"2026-08-14T12:20:13.111447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.090914Z","title":"Network-oriented modeling","venue":null,"work_id":"94a37bda-720d-4502-b834-55e0aac60332","year":2016},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.917573Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:82df6148145afa194111d358d9d8d6d23bfd7f57c121ae6497980f17bdd83999","observation_id":"4a973b82-a109-4f3a-b6a0-2ed54a1052a7","resolution":{"observed_at":"2026-08-14T12:20:13.095533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-14T12:20:12.922190Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.922190Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:7b7cb441aac19f86bb10b349b60076ac848ac86132367d5028886a43af421b8e","observation_id":"b1b4a380-99c5-49b0-8611-6fa919e8ed6d","resolution":{"observed_at":"2026-08-14T12:20:12.922190Z","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-14T12:20:13.077344Z","title":"How far can you go with hebbian learning, and when does it lead you astray? Processes of change in brain and cognitive development: Attention and performance xxi , 21:33–69, 2006","venue":null,"work_id":"40532f7e-b169-4d05-842a-c31370719a5d","year":2006},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.928135Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:b0be9f0845b9bb64340de4713deaa8541b840a12f994e8a5c49285cff5fccac9","observation_id":"33d61a37-05a7-48dc-80c2-59d878536d36","resolution":{"observed_at":"2026-08-14T12:20:13.082170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.062371Z","title":"Gem: A python package for graph embedding methods","venue":null,"work_id":"92e393be-7d48-4e75-8516-4c6072e8c3f9","year":2018},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.933373Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:5554a7670f77c569a1d2642165733384ee5605dc0171901517e370a9fe46fe77","observation_id":"9d177867-9170-4590-a815-a4c74a0cdbb6","resolution":{"observed_at":"2026-08-14T12:20:13.067378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:20:13.044450Z","title":"Poincar ´e embeddings for learning hier- archical representations","venue":null,"work_id":"379766c5-6a39-406b-8dc2-7f3d525350a3","year":2017},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.937784Z"},"links":{"citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:7bab842867780e8aad5a73524233088214e2ecf12bae015cbd04774620ed394f","observation_id":"eeb9efde-e06e-4ec5-addb-8da38e2ef7c3","resolution":{"observed_at":"2026-08-14T12:20:13.051225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.01703","last_updated":"2019-11-28T09:12:07Z","snapshot_observed_at":"2026-08-14T18:32:30.612024Z","submitted_at":"2018-09-05T19:30:54Z","title":"HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.01703","snapshot_observed_at":"2026-08-14T12:20:12.942843Z","title":"Hyper- bolic recommender systems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.942843Z"},"links":{"cited_paper":"/paper/1809.01703","citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:83c93d983a14178e14677de17e7bf342dfa3cf92c63e149946ac5ae3078b4b07","observation_id":"e5f1c6d5-c628-461b-9eb7-c3f22d102579","resolution":{"observed_at":"2026-08-14T12:20:12.942843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.08648","last_updated":"2019-02-22T19:32:28Z","snapshot_observed_at":"2026-08-15T00:29:25.003755Z","submitted_at":"2019-02-22T19:32:28Z","title":"Scalable Hyperbolic Recommender Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.08648","snapshot_observed_at":"2026-08-14T12:20:12.948201Z","title":"Scalable hyperbolic recommender sys- tems","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:20:12.948201Z"},"links":{"cited_paper":"/paper/1902.08648","citing_paper":"/paper/1908.08037"},"observation_digest":"sha256:e9cffbece780a42d9a4bb8e6fd289027af9f76790d54e7ee4da735dd7ad0b7c5","observation_id":"899b286b-5ed8-4968-a41f-a8e38f0056a8","resolution":{"observed_at":"2026-08-14T12:20:12.948201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.08037","last_updated":"2020-02-20T21:25:36Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:33:55.301018Z","submitted_at":"2019-08-21T02:45:43Z","title":"Hebbian Graph Embeddings"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":24},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:1908.08037."}