{"as_of":"2026-08-19T11:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2439c13651fde63d279337a3f89478d2b20bccf6903d8658bb00343c230632eb","coverage":[{"denominator":144,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T20:07:23.084989Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T19:14:36.499618Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T19:14:36.634331Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"cited_work":{"arxiv_id":"2411.09999","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.09999","snapshot_observed_at":"2026-08-11T19:14:36.634331Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","venue":"cs.DB","work_id":"3af3cf29-e297-4f2c-8959-137e1baf216b","year":2024},"citing_paper":{"arxiv_id":"2412.07050","last_updated":"2024-12-09T23:20:08Z","snapshot_observed_at":"2026-08-15T05:15:53.942564Z","submitted_at":"2024-12-09T23:20:08Z","title":"Advancing clinical trial outcomes using deep learning and predictive modelling: bridging precision medicine and patient-centered care","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T19:14:36.499618Z"},"links":{"cited_paper":"/paper/2411.09999","citing_paper":"/paper/2412.07050"},"observation_digest":"sha256:468a74e29f36945f02032ef3b2663e3ff61118803a73c15a07e5567ebd3c7dd2","observation_id":"572cc986-ddf5-4a6f-8c16-30cd09c60f5c","resolution":{"observed_at":"2026-08-11T19:14:36.637372Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.09999/citation-record","integrity":"/paper/2411.09999/integrity","json":"/paper/2411.09999/citation-record.json","paper":"/paper/2411.09999"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T20:07:22.115408Z","title":"Towards enhancing the robustness of scale-free iot networks by an intelligent rewiring mechanism","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.115408Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:2ab45a80513fe8a1c94b31337f02bc34bc94609e282e6a7f3fc7191555296a57","observation_id":"12459dda-3267-4454-9adc-0962ab34f064","resolution":{"observed_at":"2026-08-12T20:07:22.115408Z","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-12T20:07:22.124950Z","title":"Iot based recent trends in engineering and its applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.124950Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:b90f851f0c66900e047c720935bb2dd0029a1747dc2985487ded778b5a7479c6","observation_id":"05319f4e-54fe-45cf-9a10-2c43fc2e03b2","resolution":{"observed_at":"2026-08-12T20:07:22.124950Z","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-12T20:07:22.138460Z","title":"Catalytic and binding sites prediction in globular proteins through discrete markov chains and network centrality measures","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.138460Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:b1197b57ebf5cd36a9b54e5634bb38b67837a320d5f3a2d4fe15757bd00d2405","observation_id":"9c583616-4db4-493a-852a-d74edf25ca5e","resolution":{"observed_at":"2026-08-12T20:07:22.138460Z","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-12T20:07:22.148807Z","title":"Distance measures for embedded graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.148807Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:0f2ee6e6818d175125c5835ede02bbf8dbd4ba7e62e1680d223d7bb87bf1ed7a","observation_id":"686a7dd9-ca44-4e12-bf91-9ee159e71df1","resolution":{"observed_at":"2026-08-12T20:07:22.148807Z","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-12T20:07:22.159302Z","title":"Ganie, and Yilun Shang","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.159302Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:af2192f2e39e6088456cb3dffc50547ca06d64284735b1550f494476e1489272","observation_id":"c8433bf9-ce6a-47ab-8279-ac391f00ed93","resolution":{"observed_at":"2026-08-12T20:07:22.159302Z","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-12T20:07:22.168462Z","title":"On identifying the critical nodes and vulnerable edges for increasing network security","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.168462Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6452337003f83dfcca630bc9d663cc1950d39c6e7cc073e1657c9c6ebc2ac918","observation_id":"b8369b46-24fa-42d7-b4c1-cbee52494ea9","resolution":{"observed_at":"2026-08-12T20:07:22.168462Z","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-12T20:07:22.179618Z","title":"Reciprocal degree distance and graph properties","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.179618Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:c5eed5d8a84ef601f7fdf0bac9e7aec4abdbfb6cfee758fcc32c549b36883fad","observation_id":"ad89ce27-5add-46b9-af3c-24508e31017a","resolution":{"observed_at":"2026-08-12T20:07:22.179618Z","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-12T20:07:22.191205Z","title":"Mapping rdf databases to property graph databases","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.191205Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:84d75c08575561646cd0452259c3250f2a0c5523a96520c1df762ff0aabe4cae","observation_id":"f1cd7564-b585-4ea0-be2b-7d0903217707","resolution":{"observed_at":"2026-08-12T20:07:22.191205Z","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-12T20:07:22.199474Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.199474Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:08bf436bd474effa04bbda3a4efeeb324451cd27ce88874c5f0ce65baff1ae34","observation_id":"5c2d938e-f791-471d-b874-306077efaf7a","resolution":{"observed_at":"2026-08-12T20:07:22.199474Z","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-12T20:07:22.207535Z","title":"Empirical evaluation of a cloud-based graph database: the case of neptune","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.207535Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:41ec2f2c402f47de63a1db97e428e195e440da357ce6018277b31904f1a04e89","observation_id":"f7acc2fc-5977-4341-935c-dc3bc381a2a4","resolution":{"observed_at":"2026-08-12T20:07:22.207535Z","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-12T20:07:22.218462Z","title":"Species environmental niche distribution modeling for panthera tigris tigris ‘royal bengal tiger’using machine learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.218462Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:cdd80b7eaa6bade95f37ec256dba5ad0dd665e6a2ca5053710c7f2d999ab7548","observation_id":"a8ed7d6d-ec2b-4d88-bd2f-55f1bee92f72","resolution":{"observed_at":"2026-08-12T20:07:22.218462Z","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-12T20:07:22.226645Z","title":"Assessing the computational limits of graphdbs’ engines-a comparison study between neo4j and apache spark","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.226645Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:50c0acc87e29e6216d33a31a0f6f605ae25c7503b24385d68e5d065f022f8008","observation_id":"66862da3-3ee3-4364-8c09-1e21f5dd2ae9","resolution":{"observed_at":"2026-08-12T20:07:22.226645Z","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-12T20:07:22.237679Z","title":"Term-graph anti-unification","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.237679Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:0b4cd76a0226e47b7855003045388a250464f098429c43bb990ecba826b6fbcc","observation_id":"ff680706-ae12-4ef2-9694-cd9c11691e05","resolution":{"observed_at":"2026-08-12T20:07:22.237679Z","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-12T20:07:22.246661Z","title":"Analysis of native multi-model database using arangodb","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.246661Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:7a0da5ff7b26eca2874ef4a365cf9e918f2a4f4e575d8e800c61150d82361ec5","observation_id":"63797fe7-201d-4d7f-ab94-9b9da4b59c79","resolution":{"observed_at":"2026-08-12T20:07:22.246661Z","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-12T20:07:22.254383Z","title":"Data fusion and graph analysis in fraud transaction detection: walkthrough of a case study","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.254383Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:034d1ff1ae61be3ec28ffa25e2d7eb55590858c44306096394271988afaa8338","observation_id":"d19dac9e-cb7c-4534-a7cb-0c75cfded646","resolution":{"observed_at":"2026-08-12T20:07:22.254383Z","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-12T20:07:22.262828Z","title":"Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.262828Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:02f3e4f8391c2f442621a2a9b274dd19958f2fd713ad059fb669d05a2f3d6d96","observation_id":"89f57423-3ae9-4a9c-8e47-d89bbf10b582","resolution":{"observed_at":"2026-08-12T20:07:22.262828Z","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-12T20:07:22.281392Z","title":"Deep learning with graph convolutional networks: An overview and latest applications in computational intelligence","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.281392Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:bfc18d0002e86093ecfa54331d3483aa572c3b08f879cdca6f272a2a3b58f0cb","observation_id":"0d1f2e6a-b409-498b-9475-6f820a62b369","resolution":{"observed_at":"2026-08-12T20:07:22.281392Z","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-12T20:07:22.292156Z","title":"Hybrid par- allel implementation of multiple sequence alignment software clustalw on intel xeon phi","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.292156Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:5602a2770c1a0dec7e92bedfd8e3926789b1c5212d6e5034cce36dad33ec4dab","observation_id":"b7895dcc-d4be-48a2-812e-f6ca11471550","resolution":{"observed_at":"2026-08-12T20:07:22.292156Z","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-12T20:07:22.301273Z","title":"The influence of color, color as influence: structuring tools for the design of a graphic design project","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.301273Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:16f6b5cf0362eb93e1c63aa54187494212217fd45d2345974243e5fb2433b94e","observation_id":"27953eb3-bc28-4aba-9fda-01017d6629dc","resolution":{"observed_at":"2026-08-12T20:07:22.301273Z","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-12T20:07:22.309031Z","title":"Algorithm for solving multicriteria problem of appointments on the networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.309031Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:7aae7befaa6e26f4720e6cf9eec3aae53632dbd4ec1aba7bc0e0327642c5dcef","observation_id":"656932f9-6638-4b72-a014-b24ca88fb0c4","resolution":{"observed_at":"2026-08-12T20:07:22.309031Z","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-12T20:07:22.316406Z","title":"Inductive link prediction banking fraud detection system using homogeneous graph-based ma- chine learning model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.316406Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:71faa3cf16805ea7be0ec2baa376e3b25c9d59b4bf9454d8e62e04baee91140f","observation_id":"26fb6bb6-29e5-4d6e-9365-af328dd69bb8","resolution":{"observed_at":"2026-08-12T20:07:22.316406Z","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-12T20:07:22.325585Z","title":"A comprehensive survey of graph embedding: Problems, techniques, and applications","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.325585Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:638b21ab8ede039d94faa62e2a0f3951c3862a3cb06f86a904408002981cf6a4","observation_id":"2931cad1-4176-4719-b266-b80ac8380c26","resolution":{"observed_at":"2026-08-12T20:07:22.325585Z","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-12T20:07:22.333233Z","title":"Combinatorial optimization and reasoning with graph neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.333233Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:2d31708ee0858625d162028d676056127780084ea6cea6591b2074ac47e891af","observation_id":"0be900bd-78ff-4750-aca4-591ddf172769","resolution":{"observed_at":"2026-08-12T20:07:22.333233Z","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-12T20:07:22.342116Z","title":"Efficiency comparison of pathfinding algorithms a* and dijkstra’s in two dimensional grid","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.342116Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:df9a7b95f3acb99718c86549473119966397971bf16cf9541cb60d1edf33ab45","observation_id":"f93f15ae-3ca7-48e9-8aa5-4abe0322f241","resolution":{"observed_at":"2026-08-12T20:07:22.342116Z","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-12T20:07:22.354230Z","title":"Multi-view attribute graph convolution networks for clustering","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.354230Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:ad0c890749f00958881a5e35da0b9f1ebc6aa8007fb12287fe2fbd8b02d0bfde","observation_id":"fe2729a7-eada-4bcc-9312-291bb991d3fc","resolution":{"observed_at":"2026-08-12T20:07:22.354230Z","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-12T20:07:22.363001Z","title":"Graphrc: Accelerating graph processing on dual-addressing memory with vertex merging","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.363001Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:75cadb9977146e32641cffff37a64cd5579f37bdbe41f45a24da207ea8fcf813","observation_id":"498accdb-2c56-4b88-8820-5a1b8129dc94","resolution":{"observed_at":"2026-08-12T20:07:22.363001Z","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-12T20:07:22.369749Z","title":"Applications of link prediction in social networks: A review","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.369749Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:62863bff10883f0cf17d2168acc9dc5318c46d845bce8c5bfcea2769605a626d","observation_id":"3ccc8e28-9790-446e-b71f-3dd87024fb78","resolution":{"observed_at":"2026-08-12T20:07:22.369749Z","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-12T20:07:22.378649Z","title":"Temporal pattern recognition in graph data structures","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.378649Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:7f7cbc33a03bdd05dacb2a6092fd248277721a129d16066ff09b0d0d2e14d9f6","observation_id":"dc0e4e57-bcda-49c3-bf49-5c14fd20945a","resolution":{"observed_at":"2026-08-12T20:07:22.378649Z","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-12T20:07:22.388954Z","title":"Efficient vector influence clustering coefficient based directed community detection method","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.388954Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6a8dc11b29df4be4cb1f8c53fdf6f294114ffbb70e112fd241256c7dbbf3e498","observation_id":"e2a0f6c9-f228-4fc1-9012-32887ce3b3f2","resolution":{"observed_at":"2026-08-12T20:07:22.388954Z","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-12T20:07:22.398450Z","title":"Review paper oncom- plexity reduction in relational database using neo4j graph database","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.398450Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:eadca97ad74630f78fec0d6e0c5c63ea453506b344fab4cfc16e4329ec8e5863","observation_id":"fd3c2508-b123-44a1-bcc1-2971a9cc13c8","resolution":{"observed_at":"2026-08-12T20:07:22.398450Z","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-12T20:07:22.407455Z","title":"Query-based performance comparison of graph database and relational database","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.407455Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:4756bff04f6f3a00d965d337a98df02dd3e62ba5ec7b3b4d2cb7ebfbd505bb13","observation_id":"983c92f8-d305-4d0f-8d0a-d0e90bbde0c4","resolution":{"observed_at":"2026-08-12T20:07:22.407455Z","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-12T20:07:22.414944Z","title":"Thanou, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.414944Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:9364317f825d2db57126431235f48031f0e0822c9d2a765859d51d99288a9dab","observation_id":"1f37a2fc-bb86-4031-9495-3f6e8695a09c","resolution":{"observed_at":"2026-08-12T20:07:22.414944Z","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-12T20:07:22.422208Z","title":"On the rank of the distance matrix of graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.422208Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:0f9c68ea15f1e1df91323ba072b4e8e6b969b7cbd944211bbd88aeee871903c7","observation_id":"5ea8a61d-8cd2-4f9c-8265-73351bdfc2ca","resolution":{"observed_at":"2026-08-12T20:07:22.422208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08795","last_updated":"2019-11-20T10:02:19Z","snapshot_observed_at":"2026-08-19T11:24:38.858504Z","submitted_at":"2019-11-20T10:02:19Z","title":"On Node Features for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08795","snapshot_observed_at":"2026-08-12T20:07:22.433787Z","title":"On node features for graph neural networks","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.433787Z"},"links":{"cited_paper":"/paper/1911.08795","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:71ae758aa56c6b28a455bf96a406140714a61755fadb0d4fce2bdba3a71e194e","observation_id":"f0466178-6a3a-49bf-837d-a01fdb81613b","resolution":{"observed_at":"2026-08-12T20:07:22.433787Z","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-12T20:07:22.444488Z","title":"A methodological eval- uation of natural user interfaces for immersive 3d graph explorations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.444488Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:b851796de64ad1774151358a4f77753df84789f1e8102735f2c2be48ef775485","observation_id":"0a078756-f1d7-4deb-9938-5a2828b937cb","resolution":{"observed_at":"2026-08-12T20:07:22.444488Z","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-12T20:07:22.455777Z","title":"Reactome graph database: Efficient access to complex pathway data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.455777Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:00e010b0382a29c0021e7ec1111454098cef765c83b2965496570bd1d32f3b2c","observation_id":"13051982-cfe4-4911-abd5-cf4e6462f98f","resolution":{"observed_at":"2026-08-12T20:07:22.455777Z","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-12T20:07:22.465245Z","title":"Graph theory in paediatric epilepsy: a systematic review","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.465245Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:2d648fb13767b213522ee251de9de08317062d55006c6eb76384eeb77a315352","observation_id":"995c1972-20a7-4d02-ab93-7be113b51f96","resolution":{"observed_at":"2026-08-12T20:07:22.465245Z","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-12T20:07:22.472481Z","title":"Graphscope: a unified engine for big graph processing","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.472481Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6b084d1a4f8f22ac75184509f8553865dd0c596405848839dadec78aef4cf438","observation_id":"bf3f5361-a0fd-4ad8-98f1-6e9426b19d20","resolution":{"observed_at":"2026-08-12T20:07:22.472481Z","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-12T20:07:22.490744Z","title":"Detection of influential nodes using social networks analysis based on network metrics","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.490744Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:73adde5c89b7e9f99d3e9dd5b7d66d698c4f9cf7cfacc36516b97363b18be5f2","observation_id":"6a2ca9b6-ca01-4494-8a7a-b6731dcb9310","resolution":{"observed_at":"2026-08-12T20:07:22.490744Z","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-12T20:07:22.499607Z","title":"Graph neural networks for recommender system","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.499607Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:aba564899e75829ba0e0151acf67fd3d074e49c9985fd53f28dceeec4b68c3b3","observation_id":"c547dd5c-4939-4dbe-89d9-d1aea75d9baa","resolution":{"observed_at":"2026-08-12T20:07:22.499607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09981","last_updated":"2019-08-20T03:00:40Z","snapshot_observed_at":"2026-08-14T16:43:17.922684Z","submitted_at":"2019-04-22T07:13:10Z","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09981","snapshot_observed_at":"2026-08-12T20:07:22.508170Z","title":"Graph- nas: Graph neural architecture search with reinforcement learning","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.508170Z"},"links":{"cited_paper":"/paper/1904.09981","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:4be9fe56b7ae6475221d26c99553ff58921f1810f1e14bc85318a188b8c68b0f","observation_id":"2b1d281d-2b4f-4ff6-abe9-9ab704b366d8","resolution":{"observed_at":"2026-08-12T20:07:22.508170Z","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-12T20:07:22.533862Z","title":"Incre- mental strong connectivity and 2-connectivity in directed graphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.533862Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:5a8eaad501e04d26ca125747e19a491c8cc13508d6d1c39029d11f888c598aa9","observation_id":"2a466a1c-75b8-4a54-bd54-971c9cacbbbf","resolution":{"observed_at":"2026-08-12T20:07:22.533862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.00090","last_updated":"2022-06-30T20:19:49Z","snapshot_observed_at":"2026-08-16T16:49:06.662018Z","submitted_at":"2022-06-30T20:19:49Z","title":"Graph Similarity Based on Matrix Norms","version":1},"cited_work":{"arxiv_id":"2207.00090","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.00090","snapshot_observed_at":"2026-08-12T20:07:23.769589Z","title":"Graph Similarity Based on Matrix Norms","venue":"cs.DM","work_id":"256ff3a4-586f-4a04-b2bb-002bc2fcecc6","year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.542069Z"},"links":{"cited_paper":"/paper/2207.00090","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6d941afd864d7e566dead324eaa8a9646b2c329c03de47e9b96f62bf8f604b83","observation_id":"24a86847-7e6c-4a03-a5df-8f072821b516","resolution":{"observed_at":"2026-08-12T20:07:23.778294Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:22.551589Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.551589Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:13b7c255f8a8d4f2bbae92a4ca4ad0d433cc445e8b37a2f8343d052b838881db","observation_id":"40eb7ad1-5362-46e0-9d99-0d44dd30b07f","resolution":{"observed_at":"2026-08-12T20:07:22.551589Z","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-12T20:07:22.564736Z","title":"b embedding vertex intrinsic relevance in network analysis: the case of betweenness","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.564736Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:c0fa56d0ad539562f440083b47618c1a463cb57d89b847d92fdf292331979f9d","observation_id":"61ffb8ef-e099-4291-8e57-6a9e385d150c","resolution":{"observed_at":"2026-08-12T20:07:22.564736Z","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-12T20:07:22.571917Z","title":"Challenges with graph interpretation: A review of the literature","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.571917Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:55b9b9a3d51f492d86296a6076c23ef0e0c4fe56f55d3ed993205b6e358db63b","observation_id":"d8ad7c96-d3a9-4ef1-bc49-5bb5f54a8b5b","resolution":{"observed_at":"2026-08-12T20:07:22.571917Z","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-12T20:07:22.578798Z","title":"Overlapping community detection using multi-objective approach and rough clustering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.578798Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:577f55ba8918c4361b1f6b6c97a5c9662255064e01e9813a51a3360896a9b618","observation_id":"b3ae1a1c-b75f-4f1d-8c4a-126f04e257fe","resolution":{"observed_at":"2026-08-12T20:07:22.578798Z","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-12T20:07:22.585075Z","title":"Improving graph neural network for session-based recommendation system via non-sequential interactions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.585075Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:eaf28e54bc58c9efd29ecfc9072d064c15d026d5d8d1f2b01bd92a2bd9ccdf5d","observation_id":"a27c1fe6-fbeb-496c-a9de-d81bd6f376c5","resolution":{"observed_at":"2026-08-12T20:07:22.585075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.02867","last_updated":"2021-08-05T22:10:24Z","snapshot_observed_at":"2026-08-16T18:04:56.294822Z","submitted_at":"2021-08-05T22:10:24Z","title":"Enterprise Analytics using Graph Database and Graph-based Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.02867","snapshot_observed_at":"2026-08-12T20:07:22.591916Z","title":"Enterprise analytics using graph database and graph-based deep learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.591916Z"},"links":{"cited_paper":"/paper/2108.02867","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:8e4f05e72da3b2abd6f39a55052915247cd4cdfda16ec9cbdb4da45b3516d77f","observation_id":"33a435c5-87a9-436b-b5df-f7ebbb426bda","resolution":{"observed_at":"2026-08-12T20:07:22.591916Z","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-12T20:07:22.604742Z","title":"Collabora- tive filtering via graph signal processing","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.604742Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:53c49ce0facc677055178dd623dfacd676ca84166abc9e50f10fc9f98da74365","observation_id":"7ee6eb0e-5bb3-440d-af81-149086d3316e","resolution":{"observed_at":"2026-08-12T20:07:22.604742Z","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-12T20:07:22.617712Z","title":"A multi- level clustering technique for community detection","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.617712Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:a4f2e59592022cecba3c44382705fa10cc9d38dcc655e2e5f3dbaed806e7ed59","observation_id":"76722566-9260-4689-9f5c-2af9b60ecb29","resolution":{"observed_at":"2026-08-12T20:07:22.617712Z","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-12T20:07:22.624944Z","title":"A graph theory-based modeling of functional brain connectivity based on eeg: a systematic review in the context of neuroergonomics","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.624944Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6c5183c0a648fcbdb9317c2c9ffaa74ee9251d07d2d30ebc8a7b1ed1817a4d9d","observation_id":"8b4307e6-d328-4d49-ae6d-9c3eb773cd2b","resolution":{"observed_at":"2026-08-12T20:07:22.624944Z","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-12T20:07:22.633448Z","title":"Web tool for graph embeddings representation techniques evaluation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.633448Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:49afe6bb2e50bf59d68c068b4d85cd332c7c761aec68d39df6d6671d1a3bee41","observation_id":"144ba6a1-8947-432c-a9bb-3cfc9739b620","resolution":{"observed_at":"2026-08-12T20:07:22.633448Z","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-12T20:07:22.644113Z","title":"Learning graph databases: Neo4j an overview","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.644113Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:c47bb70c47f50e781ca8f70353c24891dbbef86897f5556bfe9e944d3de1eb72","observation_id":"448fee54-40b5-4900-ad33-8f0469be1071","resolution":{"observed_at":"2026-08-12T20:07:22.644113Z","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-12T20:07:22.656546Z","title":"Building graphs with maximum connectivity","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.656546Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:df38e498dbf9dd49634e1b9124f86ae0c1e3069af1e6b7ca82ae5e75b3df0e7e","observation_id":"6c420d0e-5cdc-48dc-9d4f-faa3ec7aa8d4","resolution":{"observed_at":"2026-08-12T20:07:22.656546Z","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-12T20:07:22.667665Z","title":"Graph neural network for traffic forecasting: A survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.667665Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:b0ab39a64e11a12ec2736812879f346be47b70ead20b6cb849f9c17571715fdd","observation_id":"a45bc74b-ebbd-4199-88d7-0633ad6310c1","resolution":{"observed_at":"2026-08-12T20:07:22.667665Z","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-12T20:07:22.678262Z","title":"Scalable and optimal planning based on pregel","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.678262Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6ada67c9f9812556ace663c4e3efc3538fd96a4f5ff231e7d1936fcfe32cbe1a","observation_id":"6fef0e3b-aebf-4b63-bd33-c229ebb6b3d4","resolution":{"observed_at":"2026-08-12T20:07:22.678262Z","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-12T20:07:22.684541Z","title":"Application of deep learning methods in biological networks","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.684541Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:cb89f7f0a88f924b725986c3b33584b7612b1d66d4f35d84387ee4c13abcfb41","observation_id":"d421a7f9-b07c-4607-a25f-bb3266cdab16","resolution":{"observed_at":"2026-08-12T20:07:22.684541Z","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-12T20:07:22.691060Z","title":"Kgnn: Harnessing kernel-based networks for semi- supervised graph classification","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.691060Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:799d0b146c5a4dc04582461e430763a1b74d815d4ba7dc2f7e063663b794bfde","observation_id":"dfe63be0-0313-4116-b1b3-4a79a75bc871","resolution":{"observed_at":"2026-08-12T20:07:22.691060Z","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-12T20:07:22.699793Z","title":"Declarative and distributed graph analytics with gradoop","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.699793Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:069beabea68e73e39636a6f812bf6ae6b350ea42d1309f6f6e1679386d041b27","observation_id":"fc951a14-ea95-4b16-82da-31e4a3381cfc","resolution":{"observed_at":"2026-08-12T20:07:22.699793Z","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-12T20:07:22.709006Z","title":"Near-storage accelerator for bulk graph ingestion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.709006Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:f3105d07db2161a1cbfeddd5398eb61a771f372fbd36cf830e3e7b22cb39d06d","observation_id":"a7b696df-941d-459a-93ab-e263d0a43987","resolution":{"observed_at":"2026-08-12T20:07:22.709006Z","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-12T20:07:22.716728Z","title":"A circular layout algorithm for attributed hierarchical graphs with ports","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.716728Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:a21f34b70a6071151592ef3494f7a2bc579f3769830682dadc1f76f72212bbdb","observation_id":"87081092-3a69-453d-b08d-52703509e023","resolution":{"observed_at":"2026-08-12T20:07:22.716728Z","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-12T20:07:22.723192Z","title":"Graffinity: Visualizing connectivity in large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.723192Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:204249d8c9fbe3295d3f3d97731151db27839d19ae8e9b35e112c8cf7f3d993d","observation_id":"c3fec963-354a-42c5-a84a-7c83e1d9e7d9","resolution":{"observed_at":"2026-08-12T20:07:22.723192Z","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-12T20:07:22.738686Z","title":"A shortest path graph attention network and non-traditional multi- deep layouts in robotic mobile fulfillment system","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.738686Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:ff2fc4e90a29cf7f1e64b9c65a468f3ed0feb3adec54fea47b29501b858dc42e","observation_id":"52ad535d-9cab-47cd-a6a3-bd2da74e78ec","resolution":{"observed_at":"2026-08-12T20:07:22.738686Z","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-12T20:07:22.745441Z","title":"What is a complex graph? Physica A: Statistical Mechanics and its Applications , 387(11):2637– 2652, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.745441Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:879acfd6ba70687c2b408fa11229ef3025999b64dced707e802b2455d095808b","observation_id":"75004e1c-cf6a-40b1-902b-48e70fc3775b","resolution":{"observed_at":"2026-08-12T20:07:22.745441Z","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-12T20:07:22.756082Z","title":"Graph rewriting techniques in engineering design","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.756082Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:3f57d06093b74636d099e3330f381ad9603bb94c6c495bb029279b41908f4d06","observation_id":"d9d5ee9e-5801-4590-8bdc-7396fea72ae7","resolution":{"observed_at":"2026-08-12T20:07:22.756082Z","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-12T20:07:22.765928Z","title":"An efficient graph visualisation framework for refactorerl","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.765928Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:0585d79d983f8c350f75df82b2ce56ededaed18fca1c5073725c45c258db6d60","observation_id":"cd09b6c6-57fe-4604-8d9c-5bfdc3384f57","resolution":{"observed_at":"2026-08-12T20:07:22.765928Z","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-12T20:07:22.777496Z","title":"Data-to-question generation using deep learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.777496Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:14a815b543be13d0680131442272c1b32c7ba1a0ca96f84ec1ec41e907ee535c","observation_id":"89189087-766b-4257-958d-d6178d039ce5","resolution":{"observed_at":"2026-08-12T20:07:22.777496Z","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-12T20:07:25.596062Z","title":"A guide to conquer the biological network era using graph theory","venue":null,"work_id":"9f2b95d4-d203-43dd-8a4c-bd3fbde54a80","year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.785581Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:2342902e85ccb302691c1e7cc83b1f5a11cb8e25428fa996f1b1b4df136f9cc4","observation_id":"da9636c5-0c60-40f9-9abb-be0ddc2302fb","resolution":{"observed_at":"2026-08-12T20:07:25.602974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.567427Z","title":"Efficient edge rewiring strategies for enhancement in network capacity","venue":null,"work_id":"16d215d9-ce42-418b-bf60-6deb313e9b06","year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.795136Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:317d54f8ca40d4866701bfba4768a827efbf96d1028467559d8af4f085df920e","observation_id":"d89d5d6a-0176-43bc-a603-2c46fdafbdab","resolution":{"observed_at":"2026-08-12T20:07:25.575150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.546952Z","title":"Conte, Hiroki Arimura, and T","venue":null,"work_id":"47390104-7ff7-4a25-ae9b-b6c90d35f935","year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.802136Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:fdc2cd5038e6cae13c57e96720dd0f16f16eee74f72bfa6fa20f1f7a7cac0c6d","observation_id":"cdb9501e-e7c8-4e77-916e-16e82551d21d","resolution":{"observed_at":"2026-08-12T20:07:25.552934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.511906Z","title":"Efficiency analysis of con- ventional and weighted grid-based pathfinding algorithms: A perfor- mance comparative study","venue":null,"work_id":"ebcdca92-a3d2-4029-89f0-30c75134aa72","year":2024},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.813848Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:799064125e219c3913ae19a48756ddd111642658569c2aacf0e5dcbf09455650","observation_id":"2375405d-c305-4a3a-9f2a-841c52bdccc6","resolution":{"observed_at":"2026-08-12T20:07:25.517783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.487542Z","title":"Measuring and improving the core resilience of networks","venue":null,"work_id":"fe8c8437-6b26-4a00-8dc9-859202f9ad68","year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.821614Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:cf268c2df66c91355076e685a65c5c704983f3187979c1b6e5eaa08da1e7a4f1","observation_id":"c05c90de-f311-4d09-9c7d-c31344a520a2","resolution":{"observed_at":"2026-08-12T20:07:25.494394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.460496Z","title":"The maximum eigenvalue of the brain functional network adjacency matrix: Meaning and application in mental fatigue evaluation","venue":null,"work_id":"47d2620d-de58-4a8a-979e-456fa2a39e33","year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.833787Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:2904ab1fa0ce42aaa2ef61603dd8f350cd30ea6de72758a82eeaf3645a60b551","observation_id":"323f18ce-26bf-47e6-b5c3-113735af5285","resolution":{"observed_at":"2026-08-12T20:07:25.467543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.440545Z","title":"Fraud detection based on graph neural networks with self-attention","venue":null,"work_id":"209f05fc-e173-4c87-9a65-511b8f071fe1","year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.839976Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6f15537e104f46921c1a2a0eb1e55feda7c97bee3a4b096a577755fe0d13ab40","observation_id":"45a60646-fa1b-42e7-8e37-3c89114618e4","resolution":{"observed_at":"2026-08-12T20:07:25.446279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.409207Z","title":"Re- alizing memory-optimized distributed graph processing","venue":null,"work_id":"a4bd5144-db39-44b6-bb19-3490a0c85cc2","year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.846965Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:9e83f66051669c88de55ff38a3f7e971913342e1663e1dc4e8f1397bb46d5e89","observation_id":"c6ab9bef-e555-4cee-b1ac-04cc24459f0a","resolution":{"observed_at":"2026-08-12T20:07:25.415890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.385911Z","title":"On aesthetics for user-sketched layouts of vertex-weighted graphs","venue":null,"work_id":"b503efb4-c68d-462f-be66-3c0ce4baab42","year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.852534Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:feb2558d7f9c7056eaf0b9a3c7ae1c70f0e850165087edf51107339a14d75e8d","observation_id":"88cf9ea8-0ceb-4db5-af63-cdb09cd10520","resolution":{"observed_at":"2026-08-12T20:07:25.392491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.362143Z","title":"A performance optimization scheme for migrating hive data to neo4j database","venue":null,"work_id":"efccf574-e4c2-41ca-b9c6-1b531448ef3d","year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.866684Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:873398a2700d2cb5d444df8fe0c8bc009a126ec7af5d3a5b796f647859b09972","observation_id":"e829ec68-d96a-4b84-ba4e-fc140879979b","resolution":{"observed_at":"2026-08-12T20:07:25.371788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.340256Z","title":"From one to all: Learning to match heterogeneous and partially overlapped graphs","venue":null,"work_id":"4769376e-977e-48e5-b7a5-be6a72699560","year":2022},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.874963Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:a9d6637a908f5a076c495779e9c3e85f5e1ae4c4a4dfc2c3c065fa2fc0bf99a8","observation_id":"055214e6-abcd-494b-bedc-0a05bcd45336","resolution":{"observed_at":"2026-08-12T20:07:25.346436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.00865","last_updated":"2023-07-03T09:08:01Z","snapshot_observed_at":"2026-08-16T15:19:13.871304Z","submitted_at":"2023-07-03T09:08:01Z","title":"A Survey on Graph Classification and Link Prediction based on GNN","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.00865","snapshot_observed_at":"2026-08-12T20:07:22.883228Z","title":"A survey on graph classification and link prediction based on gnn","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.883228Z"},"links":{"cited_paper":"/paper/2307.00865","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:eca40488e02c248a5abb16ad7b7803ba3cb2ba5db891a13d580ca20cf5c7ec48","observation_id":"e93ae49f-3171-4ed6-b1c5-bf3f4e852f64","resolution":{"observed_at":"2026-08-12T20:07:22.883228Z","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-12T20:07:25.313845Z","title":"Graph-aware collabo- rative filtering for top-n recommendation","venue":null,"work_id":"eaf68a91-defd-4d08-8964-bf5242fc8994","year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.898719Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:9975d3eaa5e68e42ff009d06a73d6f2571e584a4fcee8557600fb70aa9d5097e","observation_id":"9042f562-3d31-4fe0-b3e5-8b618e1cfc27","resolution":{"observed_at":"2026-08-12T20:07:25.320767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.290563Z","title":"Emj series on statistics and methods part iv: Presenting and summarizing data using graphical tools","venue":null,"work_id":"32005b3b-20e9-4d64-94db-f5903b62cb36","year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.908566Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:5bd254796075b592b5ffa387177c3d773792fc1450904940f7240818e4e72095","observation_id":"d84852b8-a19a-4531-9916-ea8d34bbd542","resolution":{"observed_at":"2026-08-12T20:07:25.298960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05185","last_updated":"2024-10-30T15:18:14Z","snapshot_observed_at":"2026-08-17T13:00:22.845676Z","submitted_at":"2023-10-08T14:47:13Z","title":"Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05185","snapshot_observed_at":"2026-08-12T20:07:22.916569Z","title":"Text2nkg: Fine-grained n-ary relation extraction for n-ary relational knowledge graph construction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.916569Z"},"links":{"cited_paper":"/paper/2310.05185","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:aa2df591fdfb04b28aa354a40f1296544118b59e56eb811e4317eaf24ac35b26","observation_id":"f5ea60c7-ba94-4ba7-9118-79bd8b410d8c","resolution":{"observed_at":"2026-08-12T20:07:22.916569Z","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-12T20:07:25.266084Z","title":"Stream- ing graph neural networks","venue":null,"work_id":"b9ba5405-5b06-45e4-90d9-6bca8b8d4855","year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.925859Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:e8cd93803639499b1e23cdd08bdaf32e6281c805b2de69539f061695de542817","observation_id":"5b42511a-eb6a-4b4b-a13e-9365bde0fbd6","resolution":{"observed_at":"2026-08-12T20:07:25.272356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.239506Z","title":"Relating aesthetics of the gui text elements with readability using font family","venue":null,"work_id":"027e29fe-e7c4-4a53-af82-0bdcd0cc8c3f","year":2018},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.941607Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:479a9e5990ed843c825edad5dded9537707d98bd48819b7fde85a123882a2293","observation_id":"eb45b506-a233-4049-b4e9-96913c445527","resolution":{"observed_at":"2026-08-12T20:07:25.247531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.210188Z","title":"Graph theory: A comprehensive survey about graph theory applications in computer science and social networks","venue":null,"work_id":"bd836753-4af4-4204-acb0-206d628e5afc","year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.950329Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:91c69d8997d7a7c9626b5360b17f8850ee64c21dc801920551a80b3af0628956","observation_id":"288ee372-2f3e-41ba-ba3e-6c23f2c0aa28","resolution":{"observed_at":"2026-08-12T20:07:25.218018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.176680Z","title":"Diametral paths in total graphs of complete graphs, complete bipartite graphs and wheels","venue":null,"work_id":"299ff30b-c8fb-4ab4-a9d7-572f617dd2f9","year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.961700Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:f97d7673e0bb3c73385833bc9e4031ceabfed28f38ca9ad0c3f874f7c70bc3aa","observation_id":"f85f19cc-e8d1-4561-afac-aca49edd4f89","resolution":{"observed_at":"2026-08-12T20:07:25.190160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.134727Z","title":"A vertex-similarity clustering algorithm for community detection","venue":null,"work_id":"14cb7e47-c07c-4456-b9c6-858283237df7","year":2020},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.971288Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:5b3b33bd6e9d049edbf598aeb59c44c7089abcd0cf976364cd2f4a32b9638453","observation_id":"9a986be3-ca95-438b-8dce-e9f34fffca42","resolution":{"observed_at":"2026-08-12T20:07:25.151974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.101855Z","title":"Lagraph: A community effort to collect graph algorithms built on top of the graphblas","venue":null,"work_id":"74b1596d-fc47-44e9-b506-cd8cc574d723","year":2019},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.977150Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:d3340caa7250031ac4ef4ee6b7b9028a86dc674505011f34a41e2de49c57934a","observation_id":"218c4848-83c0-4ff9-8743-117d4459aeb9","resolution":{"observed_at":"2026-08-12T20:07:25.110835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.077853Z","title":"A comparative study of mongodb, arangodb and couchdb for big data storage","venue":null,"work_id":"5b9d2ac4-4cf6-4de1-9cb1-0424407b4b4b","year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.989468Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:78d283551f27d8f74abfb86b10e4f46adfef45ca7f6a43a842f546e93df95538","observation_id":"6a4a310c-90f6-4342-83fd-7cdc5857155b","resolution":{"observed_at":"2026-08-12T20:07:25.084551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.046799Z","title":"Resilience analysis of new york city transportation network after snow storms","venue":null,"work_id":"47790b96-d365-402c-821e-be72994c88ba","year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.001961Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:3ab5ddf81e8d5fd8059427b1ceae5cf704ebe80f37862878bd6fca36303034c4","observation_id":"2c5c8924-c82c-45e6-ac81-de5c3b545ed5","resolution":{"observed_at":"2026-08-12T20:07:25.062026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:25.019108Z","title":"Classifying the influential individuals in multi-layer social networks","venue":null,"work_id":"8ce81d32-7f2a-479d-b4f7-4fb1bfc480b6","year":2019},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.017194Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:89ed5288945847ff7d4fc81b2339ba01884905f5cf05b448938b0791710de122","observation_id":"86ef3e28-26a1-4283-9b7a-62acd9d096e6","resolution":{"observed_at":"2026-08-12T20:07:25.029124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:24.991125Z","title":"Variable neighborhood search","venue":null,"work_id":"2d9fd8b9-d7d3-4dea-8d3f-f8e7608484ef","year":1997},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.024928Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:df1f126b87990a0c757d6b25f7f16f85e9b485581065a31804545e50dfa8a55f","observation_id":"7f898fac-9682-4ef7-b724-44302a5d19e6","resolution":{"observed_at":"2026-08-12T20:07:24.998242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:24.964728Z","title":"Language and hardware acceleration backend for graph processing","venue":null,"work_id":"db61863b-a71f-40e9-87fb-9614e6e9771b","year":2017},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.033301Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:a662391fe12a62223ea27987f58bfe707326b99c01a9c621ef1ee8d36020b92a","observation_id":"9cfb4f57-1111-4d0a-8972-65186c5c0324","resolution":{"observed_at":"2026-08-12T20:07:24.974207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:24.935467Z","title":"Financial fraud detection using graph neural networks: A systematic review","venue":null,"work_id":"f1934bb4-b69e-47fb-9844-4c7844f1cf3f","year":2024},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.040292Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:6b67b5a7c3a547fa7103ac3270ae8412ec510e6306bc22b77a5f7adb7fc9aeb4","observation_id":"c92b13f3-05bb-42c5-9b78-2b3fd5683193","resolution":{"observed_at":"2026-08-12T20:07:24.945606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:24.910656Z","title":"Heterogeneous in- formation fusion based graph collaborative filtering recommendation","venue":null,"work_id":"cba4e7d1-acbe-404b-aa75-2cd4249f61f1","year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.049647Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:59b82df3dd42fcb525ebd05c037bc61962aa4f35813f64038482206611d8a2bc","observation_id":"a88b3267-67fd-43cc-b5b4-772f3d78fb90","resolution":{"observed_at":"2026-08-12T20:07:24.920465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:24.883164Z","title":"M n– polynomials of some special graphs","venue":null,"work_id":"650797a1-b748-4ebc-b11e-21bf674dfa14","year":1986},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.062350Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:5e23a3467b42284880d4c6a56a45b75afcf55d04ae5f5a29f3fff928d4d77425","observation_id":"8d859cd5-b84f-4bad-81ea-3e2c2b718d95","resolution":{"observed_at":"2026-08-12T20:07:24.891856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:23.071149Z","title":"Biological network analysis with deep learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.071149Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:255ae7739baa118f2bc53bbf9236fbdf3320699435ea7ed7e4d6cdea79eeece4","observation_id":"cb0cd99b-687e-4315-9e2d-e4c459b71dc8","resolution":{"observed_at":"2026-08-12T20:07:23.071149Z","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-12T20:07:24.823704Z","title":"Example-based explanations for streaming fraud detection on graphs","venue":null,"work_id":"ffbf236b-88f9-4a03-a26f-af4633fcfa7a","year":2023},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.079648Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:f47e9b5c906c981ffb50cd09aac2c0588a06c6e4f08caedd5998393b10b02fda","observation_id":"fb0b5ca3-2b97-405b-ba48-a103c9c5791d","resolution":{"observed_at":"2026-08-12T20:07:24.834924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T20:07:24.797646Z","title":"Network analysis with the aid of the path length matrix","venue":null,"work_id":"e91ec144-7e5e-4717-a27e-57899b53c88e","year":2024},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:23.084989Z"},"links":{"citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:b045e14d4211705c492795cf80a8fce4426ab4a24f0c14c5befebd1bb65b1e4b","observation_id":"16a54ba2-9348-4f5c-96ed-875493adac4a","resolution":{"observed_at":"2026-08-12T20:07:24.807680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-16T01:42:09.150391Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":70,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":144},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 100 of 144 outbound references and 1 inbound Pith citation observation for arXiv:2411.09999."}