{"as_of":"2026-08-13T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9f0a97774e0c8320ed64c5efd101cf8cc3fd5506244c33d19e2f72d5ada8221","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-07T14:44:04.444075Z","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-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.17764/citation-record","integrity":"/paper/2505.17764/integrity","json":"/paper/2505.17764/citation-record.json","paper":"/paper/2505.17764"},"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-07T14:44:08.476936Z","title":"ACM Computing Surveys55(1), 1–37 (2021)","venue":null,"work_id":"a9d86e28-169a-4ddc-84ad-6e3b715dc017","year":2021},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.081666Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:26267e7fc36504efcde34d1a548b2184fced762d40d25f8b9504d38688376eb7","observation_id":"1556f16a-3680-4b7b-8847-13a438b45e54","resolution":{"observed_at":"2026-08-07T14:44:08.582966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.09860","last_updated":"2019-06-24T11:35:14Z","snapshot_observed_at":"2026-07-06T08:02:19.492472Z","submitted_at":"2019-06-24T11:35:14Z","title":"Dynamic Network Embeddings for Network Evolution Analysis","version":1},"cited_work":{"arxiv_id":"1906.09860","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.09860","snapshot_observed_at":"2026-08-07T14:44:05.756232Z","title":"Dynamic Network Embeddings for Network Evolution Analysis","venue":"cs.SI","work_id":"6d1c741f-0f60-43d1-b483-a7399425ce54","year":2019},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.239690Z"},"links":{"cited_paper":"/paper/1906.09860","citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:d0fb18e12508c3da8e5ce33401c48cd0d73b7419fbc1d6d6b68fe0784e627386","observation_id":"d4a30cad-f895-472e-8493-e665c605cdfb","resolution":{"observed_at":"2026-08-07T14:44:05.879467Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:08.316353Z","title":"In: 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","venue":null,"work_id":"aeb1574d-79cf-4adb-add4-3d10900dc83a","year":2018},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.369254Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:a6402c31e6754fba9c751a6d03e5730f596e707052ca69d1302df7efad771e05","observation_id":"ad0af6f6-8e18-4fd3-a96b-be6fc0e4411c","resolution":{"observed_at":"2026-08-07T14:44:08.401693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:02.506345Z","title":"In: Pro- ceedings of the 22nd ACM SIGKDD International Conference on Knowledge Dis- covery and Data Mining","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.506345Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:5fb8cd645d8a1a437c135695b51844135913e5a9746f3446386e05a3191be279","observation_id":"bacc6510-7283-4a69-9845-0affa8f7cf35","resolution":{"observed_at":"2026-08-07T14:44:02.506345Z","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-07T14:44:08.123706Z","title":"Physics Reports 519(3), 97–125 (2012) 14 A","venue":null,"work_id":"93325525-c64b-4376-8bc1-e7544fedc81a","year":2012},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.667318Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:918e0ca2fe34e8765199886ca58b22d5e0ad58a0374acc656ea9c49544c93a24","observation_id":"6f3408c8-b2d9-4038-8bd8-e691e86e3caf","resolution":{"observed_at":"2026-08-07T14:44:08.208379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:02.796439Z","title":"ACM Transactions on Intelligent Systems and Technology15(1), 1–55 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.796439Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:f21210c9dcb9b2108bc1e26b42aa4fcb8dc614742d68895dac3cdca3b159ca1c","observation_id":"f089c2e7-8874-44a6-9d9b-6d49f0abcabf","resolution":{"observed_at":"2026-08-07T14:44:02.796439Z","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-07T14:44:07.786635Z","title":"In: Cherifi, H., Donduran, M., Rocha, L.M., Cherifi, C., Varol, O","venue":null,"work_id":"88f968ae-5dc7-480e-9d5c-7e3fbd10e626","year":2025},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.918138Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:53f8bc2e0f906d2156d3c124164711d538e3efc4cbc79567f7d8133df9e3c56c","observation_id":"6128e498-6e77-4907-9cff-cfe1db4aedcb","resolution":{"observed_at":"2026-08-07T14:44:07.991420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:07.518167Z","title":"In: 2018 IEEE international conference on big data (Big Data)","venue":null,"work_id":"0d3d9f35-3029-4735-a779-6ae270b8b311","year":2018},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:02.979737Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:25bfac1dcdbd7ac05be7fbb0efa780726c84d4a64f23b57e2ba3e3d6cc5bf0d5","observation_id":"bb7c0bf5-4671-4a5d-b744-148d83a1ad56","resolution":{"observed_at":"2026-08-07T14:44:07.638361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:03.102010Z","title":"The Annals of Mathematical Statistics pp","venue":null,"work_id":null,"year":1947},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.102010Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:55612f721ea68a5a690eb377d1c9ce8252e316c672fe5fceb18db127fbd056e2","observation_id":"6d16d632-d4b0-4e50-8395-c9e8dfdfb9d2","resolution":{"observed_at":"2026-08-07T14:44:03.102010Z","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-07T14:44:07.193243Z","title":"In: Proceedings of the International Conference on Data Science","venue":null,"work_id":"8e3c8d6b-969e-4a8e-ba05-b0b42f6d25c2","year":2019},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.201934Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:1a7ca0b2a675ca9fcea0fdc70bacec6f6b2223c3ac0eb04c49156eae272bbb1e","observation_id":"a826e4d2-6d50-48d2-be1b-5efab5eadc78","resolution":{"observed_at":"2026-08-07T14:44:07.351076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:03.333523Z","title":"In: Companion Pro- ceedings of The Web Conference 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.333523Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:3580fdf8ade92342b78f8bb667e7d3de5fbc7ae251aa6c897da2608622730d21","observation_id":"2ddff0f5-6000-4738-af42-402fd5547219","resolution":{"observed_at":"2026-08-07T14:44:03.333523Z","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-07T14:44:06.922574Z","title":"In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","venue":null,"work_id":"01f1a9b4-66a7-4304-8a61-95b8ab29caa4","year":2017},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.404838Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:25870e9b55b3dcc5776035c6631a148cd25729d04ecd83a57e00f2fb70ab67ce","observation_id":"e0f53c87-0b86-44fa-961c-511798e77479","resolution":{"observed_at":"2026-08-07T14:44:07.067209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2494.31525","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:05.325434Z","title":"In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data","venue":null,"work_id":"21a28a88-ed7c-478d-834d-71250b88af5d","year":2018},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.552256Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:c1e1e1891f240e0a784900385b0255ee6ba454e4cb73065feae7ca0c2759b9a4","observation_id":"2146b3c4-6bd6-422c-8c9a-b2cf824f025c","resolution":{"observed_at":"2026-08-07T14:44:05.503399Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:03.670226Z","title":"In: Proceedings of the 20th ACM SIGKDD International Confer- ence on Knowledge Discovery and Data Mining","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.670226Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:de60168d95161c66f06972563e72676b3303cf32dbd1b224d8783283e6d3b985","observation_id":"f6e77aec-9041-4bdc-912c-8b9c4935e12a","resolution":{"observed_at":"2026-08-07T14:44:03.670226Z","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-07T14:44:06.638204Z","title":"Journal of Machine Learning Research 11(sept), 2487–2531 (2010)","venue":null,"work_id":"0591962b-7234-4428-8872-79cf17825eb9","year":2010},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.808977Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:2cc47f6fec295aec41a034af67e4647905cd6af22513a88f2e6ff9401c3b31ea","observation_id":"56ac9f26-4995-4d10-8e8f-59320d64cd4d","resolution":{"observed_at":"2026-08-07T14:44:06.773401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.342274Z","title":"Computing99, 1055–1079 (2017)","venue":null,"work_id":"71648b16-3ff4-4a48-ac9f-bf69204e69a1","year":2017},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.885719Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:87dde2d2208bf3324512e15902ffc5c7ce6f0c292fd98beb800c6268aabb8195","observation_id":"002c0c56-976a-4ba5-b050-37a08207798d","resolution":{"observed_at":"2026-08-07T14:44:06.477785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:03.987229Z","title":"In: Similarity Search and Applications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:03.987229Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:91365844c9cc6057067f82fac431a8e79a3f484a865d439c03321ca20259f27f","observation_id":"7c107acc-6c2f-472f-a118-93bf220fdf56","resolution":{"observed_at":"2026-08-07T14:44:03.987229Z","resolver_source":null,"status":"malformed_identifier"},"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-07T14:44:04.124527Z","title":"Information Systems 119, 102272 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.124527Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:aed2a6ed7954c841e813e3d41716855c0aca9d132abd5bb817f0e497bc133371","observation_id":"19438c69-527a-4ab4-8da1-e1e44429113e","resolution":{"observed_at":"2026-08-07T14:44:04.124527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08889","last_updated":"2021-05-19T17:58:06Z","snapshot_observed_at":"2026-08-12T14:06:32.247570Z","submitted_at":"2019-03-21T09:15:09Z","title":"Node Embedding over Temporal Graphs","version":3},"cited_work":{"arxiv_id":"1903.08889","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.08889","snapshot_observed_at":"2026-08-07T14:44:04.913218Z","title":"Node Embedding over Temporal Graphs","venue":"cs.LG","work_id":"3f4b1fa3-b77c-4754-9754-73ff72b21136","year":2019},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.238877Z"},"links":{"cited_paper":"/paper/1903.08889","citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:d15408e5c643f8688313c9e218a7c47d0fca738fe5550cce76554f22933a4944","observation_id":"ea4e1382-3bf4-4dd9-8e9d-e8bb9310853b","resolution":{"observed_at":"2026-08-07T14:44:05.010993Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/sam.11676","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Statistical Analysis and Data Mining: The ASA Data Science Journal 17(2), e11676 (2024)","venue":"Statistical Analysis and Data Mining The ASA Data Science Journal","work_id":"7e65b63e-4cf3-445b-813c-fd837ca2b4df","year":2024},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.341380Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:b4b08d56586cb2828ccb403bf8ec9b9d870723bc4f4fe0758d60c962fc11853e","observation_id":"9daaec75-0b81-40f2-861d-df4ba8f55fe0","resolution":{"observed_at":"2026-08-07T14:44:04.718710Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:06.007802Z","title":"In: 2019 International Joint Conference on Neural Networks (IJCNN)","venue":null,"work_id":"d285c909-2008-45a4-9d93-9923a2ccebcb","year":2019},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.444075Z"},"links":{"citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:6bad5ad4510d71ac10baaa0af51d4d161976295bdd2060af9f542bcd66fc790b","observation_id":"a4ae1c48-1c32-4232-aca8-86487bf4db25","resolution":{"observed_at":"2026-08-07T14:44:06.175048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":10},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2505.17764."}