{"as_of":"2026-08-14T07:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f3d7286faa2a8008bfaaf5ea36adeb8ef26a63bd0160f0277123f317d7d2874","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-14T06:32:32.682623+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-13T21:23:42.421490Z","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-13T23:44:30.139314Z","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:a466dcfe7d40251dae37721a4df2b61604caf9322fc89e6eeb29757f9e616be6","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:1d651b83f18d7ae6ab3ee7d59e3a276f6a43e9c2e671916bb98f98e67abc8873","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-13T21:23:42.421490Z","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:11ed614e75a3cc434d4b85f93d8098dcca62616286f1fe0cfcdbdac310b51bf1","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-13T21:23:42.421490Z","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:31add92cd769568c0bab8013c68a0c37e3597247559359e3b2ce3bbe19a7c2a7","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-13T21:23:42.421490Z","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:590cc11358d0eb7ad98da20241105e0da98e172494ea30cd8a9b8e594baf9fd5","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-13T21:23:42.421490Z","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:ff4181400a3cfb4467c999a0702097969173e6fcf952899405388a50cb4b5f82","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-13T21:23:42.421490Z","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:f1cf6eee2df8f20362bdbdd6c65eb8d2ffd6aa0c844834a6df782130b1c53078","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-13T21:23:42.421490Z","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:414f32d98d8c105dd53141c0ee0b67a6a3b4d89a307bf7446062597a790da8b3","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-13T21:23:42.421490Z","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:e6a147e28ec9a60b28aead14174078d88cfa40f92b2d76eb79ba48f8dbfa802c","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-13T21:23:42.421490Z","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:1f1466994532866a11e5af551dccec0d2b98a7232d82a79955b8484ee2f930c3","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-13T21:23:42.421490Z","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:9b14e181218b4ffa854e31191d4f003c6f54fd010b9a04883e021a49ba165747","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-13T21:23:42.421490Z","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:d1c879be14e372379140efae8ea09960de67e5fe991d43846f81313f425cee9e","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-13T21:23:42.421490Z","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:efb5a9c2f9663709b14e920f0f2bfa06359fedcb74422b7a62ce6349d2a0dc48","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-13T21:23:42.421490Z","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:6a6a5170069fa32e40a7a44974205c7c4ec3aee3ec3bf5436aed8e13ad24763c","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-13T21:23:42.421490Z","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:c8b7df7934a384acefa35f51bf011207e7d5df7f8e129f763267dee1c9648f39","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-13T21:23:42.421490Z","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:c479f0a242a5c5bd74f998ff9ddc77253c80285f791c3defb831443556b01928","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-13T21:23:42.421490Z","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:84726cad17068f71e9480838c3beb26bf36544b296449db3d07d1f178dbf1720","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-13T21:23:42.421490Z","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:780971a002b4c8d93338e65153f47349caf54e6a2854fcab496754143bc2f49c","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-13T21:23:42.421490Z","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:1656b38d419d441cc2b51900098403199fa167d14b0a9d9e3a2b074b5c5dc947","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-13T21:23:42.421490Z","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:93f64e934ad70ed6e732ac67ec9ad62129f7b248dbf91b854bc59e2eccaf9757","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-13T21:23:42.421490Z","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:891817b3f756d0bdc84967f0aa9cbc400321cf504f2123814248fab291d706b2","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-13T21:23:42.421490Z","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:08c821e335b4fef388242b66ef9d2181169c4dbefae0f557d2da30ef3a7a08ca","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-13T21:23:42.421490Z","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:2aa92ade904c106f897eb22fe37777d1f445e58c0544aecfb65330f0c014e82f","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-13T21:23:42.421490Z","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:32d7fc2b695118976368c81ac268ef425bd75b5b4a4e736a89f1dfcd80939d34","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-13T21:23:42.421490Z","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:5a1c84b09031c4d9287355cbf4b799d3303c67390cbc32a1f51faf1f2a791a59","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-13T21:23:42.421490Z","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:bf6e18b498c52c0a3ae8c070477cdecba087aef53a57354a31764951724c3539","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-13T21:23:42.421490Z","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:73511377cc1697dd49b9fc516ac411a723826051c2eda72eee3407937440488b","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-13T21:23:42.421490Z","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:b34711be9222b1a082d010d1e5f628244790dc9e60529f075673679a6c5d9e78","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-13T21:23:42.421490Z","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:7e797c1137cf17479f8557a8b3d6e50827aaf4c0cba1c329b81902991f8a4278","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-13T21:23:42.421490Z","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:207750589d1d9def24d413f3b97a24c827bd9f9bd29cbd5f4857c72eeee008c2","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-13T21:23:42.421490Z","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:43a444152deac71c4768863b65da8e466de3b49777daa0fa3a324ed704f454f7","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-13T21:23:42.421490Z","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:8b72d7638686ce77f552fbb0f75f856a546d7dc7a90a0f2a294e09dee745429f","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-13T21:23:42.421490Z","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:c55c5d3ce6f749ea84670e75db2437705659a62d5aff080cf20ce9074fcfec26","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-13T21:23:42.421490Z","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:7b4e6883c7e5c85b71cdef165e6b23aeda791a9ebf969f6a9489284b2d0a7272","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-12T16:49:47.327391Z","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-13T21:23:42.421490Z","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:e7baca5237b9d188791e3ec39ea296561df8724389f7e45da199aa3093c78a12","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-13T21:23:42.421490Z","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:7a8eaa4b39779cd001ee2705749448e71c68a5ce24daa2c7b635522d61e3fdf1","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-13T21:23:42.421490Z","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:baeb951e6dcf844fda772adad423334e3c5a38fcb8718d898d7c8eac8c0436af","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-13T21:23:42.421490Z","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:2c247c48ec91606f86c6e5dd540e55da584d25ffadc058299137bef7cd6ad3ef","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-13T21:23:42.421490Z","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:e6223505e6e54774af47b4f0af94fef326c94c79452bdd0d3b1c3a9dc0690bf9","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-13T21:23:42.421490Z","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:58990eda2dcd2a38ab34e53f0ae7ab61f8c203fb87a8a27129492f93aba0ef26","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-13T21:23:42.421490Z","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:310c44e11ea0ea73cbe9cf048fe4d775b556c57ed48fb8a36b4818872403248f","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-12T22:01:17.689516Z","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-13T21:23:42.421490Z","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:3d8cf3f680199098cf22780520cb2f0cc7878f09733d865e640634d125e88a9f","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-13T21:23:42.421490Z","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:2b67a4ec93d4ccfbca227d8cd7c12ff7db23556736d49ff29efd89b707bc33e2","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-13T15:13:02.013138Z","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-13T21:23:42.421490Z","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:28ff2d63770dd99372343d150d9db2839be4d2a768152309716cef5f8344ea9a","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:59838fc52e15fbd5ea1a3d214a84be6cd75aa498e90ddd70d87b7debf9c6e008","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-13T21:23:42.421490Z","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:8acac6e908dc759afa50ec1f82903b9215275809d654dca563477f78ec703108","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-13T21:23:42.421490Z","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:a9251fa1c105104f360bc598378ef6b7d2d1546a958790ff11c78f5588a622eb","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-13T21:23:42.421490Z","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:a73db97a134e5da3d28dc0cdb777c91fd7aaffe713f3a1d4bfa5993a6b5961c4","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-13T21:23:42.421490Z","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:8dc5dbb4213089ae2678276155e45584f9cfac43c57cf5c1999e07a1baba2188","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-13T18:33:14.644659Z","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-13T21:23:42.421490Z","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:598487e3c33f8654db2be58a48a82ea5941f566f47067884bfa3bd4d3dd34125","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-13T21:23:42.421490Z","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:d773abb26a2d18a0c85d989b38779e0c096c9bab095f25fec3ae9087eca21a49","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-13T21:23:42.421490Z","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:dac08318c047f1178a844a5e50709b29e7c0e1c69152c8512775ccd47f011573","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-13T21:23:42.421490Z","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:d062847abeb1004201cec7191e7a4b998df940aaebfd23613b9808f3690132b4","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-13T21:23:42.421490Z","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:79b3dbc28a4bb9ca732074e5405ad35c7e1627f757cc8b8f57496db108f712d6","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-13T21:23:42.421490Z","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:db4b32b2350a8e40bce75993529f646b6f4908d54b001e91687984b953ca232e","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-13T21:23:42.421490Z","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:e34a146cb9d1fba29d93ccdfd4475396d17398647b6de64a0f2a87d9a2260ece","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-13T21:23:42.421490Z","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:a384b4741ae4ede077c75fa93eb6ed5f78fcb44976d751104649a797748bff99","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-13T21:23:42.421490Z","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:58375fd7b1be1eea9bca776ba949241bf9f804c29c998334c43ecedc0ae05261","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-13T21:23:42.421490Z","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:48e33e21604f3e4c944b54ff67afc9f93207527dbd92de2a24f60f06598ae376","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-13T21:23:42.421490Z","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:76d9ccad73f70aa3721cad2a98775a84250f9b8441a536711c909d1bac8259b2","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-13T21:23:42.421490Z","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:dbbb5c3dd78510f584921c2e1f4a66bfec8a58844765c6ee7037ada2e2951b99","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-13T21:23:42.421490Z","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:4b0e5d96fe886d9712d180baa9125a13be2fa6faaa6da28960ef100b7ce58209","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-13T21:23:42.421490Z","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:4ebaf7a33dc71e690514aebfa76f5eab08aa9832d63dc739e36d6bb811926923","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-13T21:23:42.421490Z","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:bbd1a88400133b2cfc058596d1873b17fcb9ef4e26a61df829abc46397298dcb","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-13T21:23:42.421490Z","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:30788c78faa080f2b113b9969d5190284054778fb06bfd4ccbc9013d3f9fce41","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-13T21:23:42.421490Z","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:45c0517a9a669313f2b1e708d524d365aaa52fc28b533fca1e0ff810b9c12240","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-13T21:23:42.421490Z","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:48da064a0ae03cfdef1c019d410ff1c521df93e7d85e59665f907fa0477cc9d5","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-13T21:23:42.421490Z","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:75c1de08159a14fa16ef024c6e8871ee50278a0aae1a28d7ae6bba5561cc89a1","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-13T21:23:42.421490Z","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:27fced7a05bc44cf4c37bca1552871b13d146e3a7f98d203d7bc22277b8e6aac","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-13T21:23:42.421490Z","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:11ea36e1138caa73f9fc9f6696c550c14f3518b4d8651192ca704f957be4e0b7","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:767ca5f137fcff8a29cf25b855c039d6b209f1309080db47b0f0fbf60b61896b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:0965c460487491c33a146381ee5b9dd3e4e726f4226d2c8c35c6ba92bc043328","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:71c42cb729afa722a701572f0357af086687a0651bd3548a6b6bebe5393cfaef","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:e731ae47c23ff1e221bd8147b53fe4642d194519c2de896a400ff2583cfa9de6","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:f5cfdfd8099ab06f0dda05ac6a717096d0f8a84732518392d793ea795aad4775","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:dea5f11514c8f4b7da1fabd0b84c95e62d58582f6e55b0d9ce3c216ef865d903","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:94778daea287768ae8bc4d38f0bc08dbb05ce1ca2599724325441fac54807806","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:7e07e831fd8d71703932b2250ba444da0ed9fcd4dc2f414400e0b50b70beaadd","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:636ba0eff632d3c520339124e5f05ad9fc75c14c39b5970dad65bd025ff811c8","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:0e9c4c5fe383e7e50c4e3e951309a001376a94f2aa0f0381898c83a103d6ffcc","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T11:03:56.596694Z","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-13T21:23:42.421490Z","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:465c551434cb04553ba5d7f32ebc00a9c7a383ba86e6d355b0234c8f5d2ff3bf","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-13T21:23:42.421490Z","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:31270bbcbc298d5fe2eb559bd953e354c743b65f1d803f51086d5c4f15a93434","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:c1dd02c194e3984c2a10520d2d7dbf82b09f4edd11e2d671346545603fbedafc","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T05:54:29.330788Z","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-13T21:23:42.421490Z","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:1a6923a09dffaa40e5c335c0364790d6831bb63a1023d755de527d0aaa60a3f2","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-13T21:23:42.421490Z","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:99aa8faad2736d8516e8d3e33c4d062a04ec6b5e744e9a75dd5b2fe46f29409f","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:f568403683689f489c2521068e001a5e444ad73e3c2321a6c970314e03f8f7d5","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:069a0e261ac63b5b8e904f15858a90c498b46106da9b59c71b2d4e26bf9ed918","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:5b4b62b42ecdcd4f6e5b46dd4e7118a2d39ebe1d0200218ef2bd3cb1a4ec6136","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:0807741d642c1235c44675a4edd8914247fd48aee85573ada8801c917ec1cef3","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:cc61548c2632d30f7ad9594234f0b745d22b91e71d25b882db9ec115bce7f708","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:41c0c4d4112097af804a0f249d03527caedd65ffdca4e07e5ec23785de9f5c9b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:b4df2c479cbc1063b828cbdd3fb80bff7c6dda2a0ce75cf5a1c6bd287d9c04df","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:ad5223b0ef28bd6780879c562a264f1373d8c6e7f567f5724c65a4fddacaf11a","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:fd8f55651df7824b34da60f3b82d26cc4713e02bc5ae90b5209fe6c21ff24258","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:897df1d35388bcf869a8a80c4c82d6b397b30be47c2262fd1e4c2afc1bbd2097","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:d5b77c70f6e6aec45c38c3d080ee45b961574cc0b86373dd80a334f7d1c2da3d","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:89ef187077da4b23c7dbec0680e78cd22a4db8d4c996eb5f0259545bb59cf8f8","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:5e34c0805ca0af25b6fae815abf1a2579cc3d82dc4d633c49b5a15a77416b30a","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:663323970f4e858de89b115988fb6ad4dce626ede521458d0a42d98ba9010df0","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-13T21:23:42.421490Z","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:bda7e9ce079e112c3fd870b18619c3af4e303ff8adb7d11a4d985befb9ec1ae9","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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:6f0c24609510eb2b9ecabd3614c1b3ff06dcaf859043c2b132d9c522438e98c7","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T21:23:42.421490Z","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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 144 outbound references and 1 inbound Pith citation observation for arXiv:2411.09999."}