{"as_of":"2026-08-16T17:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b2419fd05526f4208d942eba8078001923bdb7c560e0347e6ae1c06cb647784","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:34:35.552460Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"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.02947/citation-record","integrity":"/paper/1908.02947/integrity","json":"/paper/1908.02947/citation-record.json","paper":"/paper/1908.02947"},"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-14T14:34:36.043124Z","title":"Linked data - the story so far","venue":null,"work_id":"36fdfe9a-1b0a-4ed5-b1f4-86d973a18a5b","year":2009},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.487610Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:b7e270df8012fbbe63530313c65b3c8b34dfeaa8f52715ed22da9c97bb9356d1","observation_id":"540c7e7c-c07f-4d12-bdc7-51b0f68a2448","resolution":{"observed_at":"2026-08-14T14:34:36.046853Z","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":"10.1007/978-3-540-76298-0_5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:34:36.033297Z","title":"Kernel methods for mining instance data in ontologies","venue":null,"work_id":"fe116fd2-9d53-4864-bf1c-c2b4ab51b520","year":2007},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.491575Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:386a086656f09fa4ef86396d9e76ca000d099b47888c90dfa7000f65b71d784e","observation_id":"528f8ad3-b661-4e84-b427-64cc9c6049c3","resolution":{"observed_at":"2026-08-14T14:34:36.036842Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:34:36.023457Z","title":"Webb, Dragos D","venue":null,"work_id":"e91dd684-3322-444c-8246-0666412b0782","year":2015},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.495018Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:6a5b7377318890d155c4f6d1d46036119c25b97fb9689a58618e902df7a5253e","observation_id":"d9538048-b748-4f98-9e8b-7ec75d38a55e","resolution":{"observed_at":"2026-08-14T14:34:36.026898Z","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-14T14:34:36.013084Z","title":"Deep neural networks for learning graph representations","venue":null,"work_id":"71c7006f-ccea-46bb-8b60-b4c6d6fa8f1e","year":2016},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.498465Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:ca4d80593433d038890b21998346150a03f7f7198c1763fb508d340b47608330","observation_id":"1d886248-442f-43a2-98df-594a8389701b","resolution":{"observed_at":"2026-08-14T14:34:36.016769Z","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-14T14:34:35.502125Z","title":"Aggarwal, and Thomas S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.502125Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:c54be42cf204b76caf2fd1f66f3247c4cb2bfb141b96f66dc650ff47002df0e8","observation_id":"08cb31de-4283-4eac-99ba-98d03807bb9e","resolution":{"observed_at":"2026-08-14T14:34:35.502125Z","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-14T14:34:35.505523Z","title":"Biased graph walks for RDF graph embeddings","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.505523Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:d6ffd133b6fbecd172f7d36f028d4f7f887cd57eb54fd8b32fe462fe56e3b7dd","observation_id":"9db27508-6275-4d71-a2e8-06207aad588b","resolution":{"observed_at":"2026-08-14T14:34:35.505523Z","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":"10.1007/978-3-642-40988-2_39","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:34:35.592010Z","title":"A fast approximation of the weisfeiler-lehman graph kernel for RDF data","venue":null,"work_id":"baf67ae7-8be1-4cc5-9335-f24c163af6cf","year":2013},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.509006Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:5598fadb16feaf98d72a66b642cb5595bfd9bb7ee6c2c78dad0f851051f68b06","observation_id":"3cb1a3f6-8446-437d-9d27-16774bcbaa8d","resolution":{"observed_at":"2026-08-14T14:34:35.595247Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.websem.2015.08.002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:34:35.580321Z","title":"Substructure counting graph kernels for machine learning from RDF data","venue":null,"work_id":"8c043691-53e7-4e1e-ab8d-273b7f91954f","year":2015},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.512188Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:a49308632c3517aaff6f67e7b93595cd6292936bccfc87f4ad649df3b21c6613","observation_id":"c2988b16-a4a5-492e-b575-6cd9ae1d4841","resolution":{"observed_at":"2026-08-14T14:34:35.585745Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:34:35.515368Z","title":"node2vec: Scalable feature learning for networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.515368Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:d61fe20c1c36f37cca30dab1c809394e367c5a83f8e51a9244e1d530d3a8b5d5","observation_id":"172c8baf-aca7-4ea4-8e52-51459ba2fa61","resolution":{"observed_at":"2026-08-14T14:34:35.515368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.05163","last_updated":"2015-06-16T22:31:09Z","snapshot_observed_at":"2026-08-14T22:44:08.546380Z","submitted_at":"2015-06-16T22:31:09Z","title":"Deep Convolutional Networks on Graph-Structured Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.05163","snapshot_observed_at":"2026-08-14T14:34:35.518417Z","title":"Deep convolutional networks on graph-structured data","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.518417Z"},"links":{"cited_paper":"/paper/1506.05163","citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:54d918134709513d0097f7e847a297b5033a6bcfdbdc8062e3b7aa38e78f8d6a","observation_id":"3005f0d9-1651-436a-b34c-524f652c3338","resolution":{"observed_at":"2026-08-14T14:34:35.518417Z","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-14T14:34:35.521981Z","title":"SNAP Datasets : Stanford large network dataset collection","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.521981Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:4e1054cd522a9caa2d1472ac3e9ee57427c340b60b01f870facb3e19ed1158fe","observation_id":"c428a87e-3370-4c85-ad43-f293610cfeac","resolution":{"observed_at":"2026-08-14T14:34:35.521981Z","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-14T14:34:35.996976Z","title":"McCormick","venue":null,"work_id":"311ba153-449e-41ee-8af2-45032e4e03cb","year":2016},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.524769Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:52b6e2fc08d6c706c1597283f5abbcbdda585c02c3edea4ec2058d009cccfe87","observation_id":"daf018cd-51a9-4ec8-afe6-ac053b7cc7b8","resolution":{"observed_at":"2026-08-14T14:34:36.000693Z","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-14T14:34:35.527942Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.527942Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:fe4df0eba3a22ce7feb51dbc65e9aa70c53de8560f70611c4bf6c7533431de16","observation_id":"e53629e5-dfdb-4f65-871f-0576e168e925","resolution":{"observed_at":"2026-08-14T14:34:35.527942Z","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-14T14:34:35.986830Z","title":"Learning convolutional neural networks for graphs","venue":null,"work_id":"1c94eb76-1f27-437b-9c0f-ebae1aa0d45f","year":2016},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.531303Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:6c051f19335f7e34e71147871b1007c510faf1a43d17e5c1e3e7ab50168ede6b","observation_id":"b334f4a5-1218-44da-8ae7-7e1a0d553a22","resolution":{"observed_at":"2026-08-14T14:34:35.990458Z","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-14T14:34:35.534288Z","title":"Deepwalk: online learning of social representations","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.534288Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:75d417db1459739b939573e1bc7a0d324024daaa971eefc2ab12f407f17602fe","observation_id":"c2d94703-bae2-460e-b34f-a092d4a44432","resolution":{"observed_at":"2026-08-14T14:34:35.534288Z","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-14T14:34:35.976137Z","title":"Software Framework for Topic Modelling with Large Corpora","venue":null,"work_id":"7021aed3-08a6-44ab-a657-4dc2e5f12645","year":2010},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.537269Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:2ae8829dcc6ff6ad96aa06cfb434b2dceda5dc8fb4ac03ba8c4d3ded5d4befa6","observation_id":"db51d8c2-ff22-4e96-96c9-4a7f9182c881","resolution":{"observed_at":"2026-08-14T14:34:35.979851Z","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-14T14:34:35.540307Z","title":"o tzsch, Freddy L \\' e cu \\' e , Fabian Fl \\","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.540307Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:2f5d839a03e99bb5c3281a8919099ae44e26f5f661bf63c470abbe2e6526f5d5","observation_id":"618b9b7d-7c4b-456a-8ba0-b3efaa1ca340","resolution":{"observed_at":"2026-08-14T14:34:35.540307Z","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":"10.1007/978-3-319-46547-0_20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:34:35.964323Z","title":"o tzsch, Freddy L \\' e cu \\' e , Fabian Fl \\","venue":null,"work_id":"6c2e8ce9-50d7-4474-a26d-fc4fdb571852","year":2016},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.543338Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:7599027a873f68a7eac893d07dc57e6e694ce4ab449c36fe65dcd1d84bbde265","observation_id":"c7ad1438-4456-45eb-847c-43fbd3b32b49","resolution":{"observed_at":"2026-08-14T14:34:35.969229Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/978-3-319-11964-9_16","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:34:35.953817Z","title":"Adoption of the linked data best practices in different topical domains","venue":null,"work_id":"4d4a09c7-3450-4baa-8cc6-7a7de7272679","year":2014},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.546603Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:64ee72111e6be121f253c459b48e840e9981384d82336e3adab9c3e1e20db7b8","observation_id":"2919b5cd-cb4b-4457-98d7-2814dd81a242","resolution":{"observed_at":"2026-08-14T14:34:35.957757Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:34:35.549435Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.549435Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:e2189af721be2059179c264bc0b7290c526118f8584bc894f5a77ae42f793f82","observation_id":"d7460318-d351-4d1a-9518-beb87aba660c","resolution":{"observed_at":"2026-08-14T14:34:35.549435Z","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-14T14:34:35.943832Z","title":"BioSNAP Datasets : Stanford biomedical network dataset collection","venue":null,"work_id":"8d22e248-aa9a-4a81-8073-9b58de559c74","year":2018},"citing_paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:34:35.552460Z"},"links":{"citing_paper":"/paper/1908.02947"},"observation_digest":"sha256:4184fdceb58ad25f4792342fed57c0efd43bbe2b22693ddd0fa0e8c39a1a39e9","observation_id":"dc8a6b7c-36ba-41f0-b849-ef0da0558375","resolution":{"observed_at":"2026-08-14T14:34:35.947326Z","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"}}],"paper":{"arxiv_id":"1908.02947","last_updated":"2019-08-08T06:45:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:34:19.265807Z","submitted_at":"2019-08-08T06:45:05Z","title":"Graph Node Embeddings using Domain-Aware Biased Random Walks"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":5,"verified_fuzzy":7},"total_outbound_references":21},"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 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:1908.02947."}