{"as_of":"2026-08-08T12:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0dfcfa1f5be2bd02f0d88ee001657fec3854c9d68b1f3a554a21fb87db8298e","coverage":[{"denominator":234,"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-07T12:18:11.548967Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.24758/citation-record","integrity":"/paper/2505.24758/integrity","json":"/paper/2505.24758/citation-record.json","paper":"/paper/2505.24758"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3418294","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:29.318290Z","title":"Knowledge graphs","venue":null,"work_id":"6fcfbef3-0909-466b-90ff-99566ce010e7","year":2021},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.187392Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:ffb9dcf07e8c0ae4771fd46cd0cded30e32fd5885a81d1302d97206ec0389f14","observation_id":"d5e432b0-5a74-4740-a054-37f5bfa53ab3","resolution":{"observed_at":"2026-08-07T12:18:29.899807Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:02.297506Z","title":"The Future is Big Graphs: A Community View on Graph Processing Systems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.297506Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:cccfc62da547b7dce6c7cd10b8256cff49f07c21ad21dbe2fdb641ea9bae1edf","observation_id":"3bccace9-06f9-4fbf-a4ed-89fa2b1fb851","resolution":{"observed_at":"2026-08-07T12:18:02.297506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/database/baad045","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:28.949594Z","title":"The importance of graph databases and graph learning for clinical applications","venue":null,"work_id":"4d745bd9-e199-4b2d-b26a-dde546594045","year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.378805Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:ef05d6a7f8fa88c8a159490e405b0eb692e730cf29bda2388057f1b521f694c6","observation_id":"1ec8c3b0-5518-4916-8515-8cdffe9c19c7","resolution":{"observed_at":"2026-08-07T12:18:29.040464Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2302.35823","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:34.136835Z","title":"The World of Graph Databases from An Industry Perspective","venue":null,"work_id":"35054afd-aad7-47db-b9ff-daf135a6d3ae","year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.509169Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:7cd3d6903590ff26c73523e2582e269968708244a2fc5b27ed997b4160e11454","observation_id":"1c572285-7480-4371-a92b-1153a534c705","resolution":{"observed_at":"2026-08-07T12:18:34.252332Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:02.622940Z","title":"Experimental Evaluation of Graph Databases: JanusGraph, Nebula Graph, Neo4j, and TigerGraph","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.622940Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:d2b3cdfdf41b326998393e8330f2fd2efb522ea00cef11086de3a9a0dfdef4ab","observation_id":"db683a00-6db8-43b0-8543-488d769dd809","resolution":{"observed_at":"2026-08-07T12:18:02.622940Z","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-07T12:18:02.702159Z","title":"Knowledge Graphs for the Life Sciences: Recent Developments, Challenges and Opportunities","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.702159Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:309e68d40f7f9bc0c08fea6c5b68eff720ee8c1cf0b65ad4ff5de2815698adfa","observation_id":"0a9b6b69-b5cd-4fef-b2ee-33650cb01532","resolution":{"observed_at":"2026-08-07T12:18:02.702159Z","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-07T12:18:02.825159Z","title":"In: A Comparative Survey of Graph Databases and Software for Social Network Analytics: The Link Prediction Perspective","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.825159Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:0c3199547cd5432618a184af5e092c3253858947fe055dd87b8a37bf7b6cd7bc","observation_id":"fa273669-ec3a-4f37-b3cd-e9889fffd947","resolution":{"observed_at":"2026-08-07T12:18:02.825159Z","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-07T12:18:02.938024Z","title":"A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:02.938024Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:0ab29670d64f0217ee057398df89a92e94970280d30e5d37fb316d53aba7a1e8","observation_id":"0f01978d-3097-4e6b-8c3c-f35a4c520e41","resolution":{"observed_at":"2026-08-07T12:18:02.938024Z","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-07T12:18:03.026626Z","title":"A Review of Graph Databases","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.026626Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:a2b098419660d02d38440f88ca342280a9d9ac0dd2a705d179e446d912107783","observation_id":"e6120fd4-a5d8-4a0c-bfaf-071eaab49884","resolution":{"observed_at":"2026-08-07T12:18:03.026626Z","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-07T12:18:03.143023Z","title":"What is a Graph Database?; 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.143023Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:912491f119d2801e4225a099d93a4ca3e31ae4388485b0ba251ecda6bc15335c","observation_id":"313f1254-1b84-462b-9f03-cbb6270643d0","resolution":{"observed_at":"2026-08-07T12:18:03.143023Z","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-07T12:18:03.219712Z","title":"Graph pattern matching in GQL and SQL/PGQ","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.219712Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:b03f2d4a15bafaf250d9e995e689f8b98174c0e94f76fb5c25a1fecc343705e2","observation_id":"d3a2087f-64ca-41fe-b03d-54d4025d3550","resolution":{"observed_at":"2026-08-07T12:18:03.219712Z","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-07T12:18:03.315077Z","title":"The gremlin graph traversal machine and language (invited talk)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.315077Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:80fdc87c5bca3ee991ce20cf0b41d681541cb665fca7eb0dfb5bfe82daf15879","observation_id":"3f3cb7d4-e892-4bd5-9cc4-0ddf50f9e6d6","resolution":{"observed_at":"2026-08-07T12:18:03.315077Z","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":"0414.29604","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:33.803693Z","title":"PGQL: a property graph query language","venue":null,"work_id":"bf25864c-87b0-4af6-b87c-0d800db82d48","year":2016},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.393702Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:23d61d4d9c65a97c82d1e32b9b5e25fd59eecec56919cf544082eeca2e4f22c4","observation_id":"22e52ac5-e6af-427b-9ca5-685e9c765699","resolution":{"observed_at":"2026-08-07T12:18:33.914162Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:03.508376Z","title":"The Property Graph Database Model.; 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.508376Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:2108ff810ee22ba6396c5f9d029062d76ab018d349468a2bbdfc3e053954d209","observation_id":"70ec336a-5591-4def-a83c-765cb002cdd3","resolution":{"observed_at":"2026-08-07T12:18:03.508376Z","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-07T12:18:03.574157Z","title":"openCypher: New Directions in Property Graph Querying","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.574157Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:8c3136e9eb4e7a9bb2b9a506a061533011a0cb307519fd2974c82e225578c523","observation_id":"448f8141-8b28-459c-a3e6-6ea86210c2f8","resolution":{"observed_at":"2026-08-07T12:18:03.574157Z","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-07T12:18:03.656357Z","title":"[Accessed 17-December-2025]","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.656357Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:e349df1b5cf850344a76d288853fdebe44bf618279f41ad1ae6adc0a19a64d3b","observation_id":"6ad8e0cd-fef7-4097-9be7-11e01dac8a7e","resolution":{"observed_at":"2026-08-07T12:18:03.656357Z","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":"4540.35346","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:33.634181Z","title":"Multilayer graphs: a unified data model for graph databases","venue":null,"work_id":"77d0fdeb-c8bc-44df-962b-3e03a082f364","year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.765326Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:1c1b60ee28926a703646187087415f22a53995cebcc6d8fd9ef6c95a3932380d","observation_id":"9736d0fd-aacb-43a1-9433-bcaa8a42fe66","resolution":{"observed_at":"2026-08-07T12:18:33.690891Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00778-021-00711-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:28.649927Z","title":"A survey of RDF stores & SPARQL engines for querying knowledge graphs","venue":null,"work_id":"79a52fe2-6e5f-4515-b30a-56ef6827001e","year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.842864Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:cebcccfe2c9535381026acfbac8a8b7ae5cd9c3f225e5d5f7eccbf8c6975c349","observation_id":"463b1a34-0c53-47b1-b18c-48d97dcdc739","resolution":{"observed_at":"2026-08-07T12:18:28.783167Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:03.939077Z","title":"A design space for RDF data representations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:03.939077Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:fcf2fd6740ad5be5016a31828bee7f9092bfa316fa184026505cb816d85c5d88","observation_id":"7c1a1363-7f55-44ab-92d2-c153672be25b","resolution":{"observed_at":"2026-08-07T12:18:03.939077Z","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-07T12:18:04.086872Z","title":"Reifying RDF: What Works Well With Wikidata? In: Liebig T, Fokoue A, editors","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.086872Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:b2803a3d5bcd568c7cf143a134d58efd1aa790341d759227890727382124d575","observation_id":"17eb9621-c3ce-44f1-8f61-476f47c62c5e","resolution":{"observed_at":"2026-08-07T12:18:04.086872Z","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-07T12:18:04.146059Z","title":"Graph Data Management: Fundamental Issues and Recent Developments","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.146059Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:637394f90b5cdaed28b4bd82ff1bf896acd482bc76b38b33a3e21af933296a70","observation_id":"72b05c7b-5882-41b3-b6de-aad0ee55dc77","resolution":{"observed_at":"2026-08-07T12:18:04.146059Z","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-07T12:18:04.295202Z","title":"MillenniumDB: An Open-Source Graph Database System","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.295202Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:c97482a36e53ec6936d654bc5d9880c44c41127ce02e2356ae3566da82365fb9","observation_id":"4c4c0bc2-c7c9-44f6-b7e5-b7e49e69484b","resolution":{"observed_at":"2026-08-07T12:18:04.295202Z","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-07T12:18:04.426540Z","title":"openCypher Queries over Combined RDF and LPG Data in Amazon Neptune","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.426540Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:b558726db1022fbb544c820962f17e6779b47db7c03b3c27d926947b8a7587ec","observation_id":"7fa7aa02-044e-4e47-8882-3ee5e76640a4","resolution":{"observed_at":"2026-08-07T12:18:04.426540Z","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-07T12:18:04.484322Z","title":"KGTK: A Toolkit for Large Knowledge Graph Manipulation and Analysis","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.484322Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:73e7ac8d6cb5d5064d7abe90b6bba843a86a18e9907801a1588b2c6a85aaba1f","observation_id":"a98f1bf6-8997-4dc3-90b3-64b19774d08c","resolution":{"observed_at":"2026-08-07T12:18:04.484322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/sw-223273","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:28.069932Z","title":"The OneGraph vision: Challenges of breaking the graph model lock-in","venue":null,"work_id":"d2c72ff4-9126-419d-9f51-6242ffdf0b20","year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.669981Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:ed816258e79f1f074bc0e8d62830efa03240169353ec1a10f51eb1e7a131cde0","observation_id":"2e329762-f99f-44ea-9497-13d1b52b47c0","resolution":{"observed_at":"2026-08-07T12:18:28.210005Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:04.736874Z","title":"SPARQL 1.1 Query Language; 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.736874Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:4f530c688779e805b0182a803628fdb11a052be70e83cc8a0ce494c42792572e","observation_id":"093e7228-a38e-4962-994d-bc16fb09901f","resolution":{"observed_at":"2026-08-07T12:18:04.736874Z","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-07T12:18:04.822435Z","title":"Cypher: An evolving query language for property graphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.822435Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:09e649582e268ad8637b0039d9bb752b9f2342c7c02efacbe9aae606ec342ac7","observation_id":"80193caa-771f-4903-a26a-626b4ec64869","resolution":{"observed_at":"2026-08-07T12:18:04.822435Z","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-07T12:18:04.921051Z","title":"What is openCypher?; 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:04.921051Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:d9c16e1eeee07ae432533d46e79a68654a2b6860e063ef41c2e3ce14e7110a1b","observation_id":"1061d1ae-8b9c-4d38-a935-60dad88a1f3a","resolution":{"observed_at":"2026-08-07T12:18:04.921051Z","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-07T12:18:05.019446Z","title":"ISO/IEC 39075:2024 Information technology — Database languages — GQL; 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.019446Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:9106747c4b2a53e38fc03aa4934354871c137ce86d7096b432808be95baae46f","observation_id":"0d6df16d-c35f-4e47-921a-540b10ae9022","resolution":{"observed_at":"2026-08-07T12:18:05.019446Z","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-07T12:18:05.114122Z","title":"ISO/IEC 9075-16:2023 Information technology — Database languages SQL - Part 16: Property Graph Queries (SQL/PGQ); 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.114122Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:5fd9d6200a1856fe463c2bb1a3068e5840375cc94b83c12cd24b94364e5d39a6","observation_id":"0e495f1b-191c-466b-9385-e8faec3b4b05","resolution":{"observed_at":"2026-08-07T12:18:05.114122Z","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-07T12:18:05.205237Z","title":"Foundations of Modern Query Languages for Graph Databases","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.205237Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:4cc21ab1a073ff378e0efef065c7da5972029454c48f20e2c50881ec129a38ea","observation_id":"18e50767-fa4d-490b-b2b0-35f7c026225d","resolution":{"observed_at":"2026-08-07T12:18:05.205237Z","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-07T12:18:05.328276Z","title":"G-CORE: A Core for Future Graph Query Languages","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.328276Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:b7aeb8d6e2e4b6f8a2640934738c477a8c24b7771d440919a52a725d14212d14","observation_id":"c63df20d-d494-4a5a-8279-756dd724f86a","resolution":{"observed_at":"2026-08-07T12:18:05.328276Z","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-07T12:18:05.421838Z","title":"Graph Pattern Matching: Do We Have to Reinvent the Wheel? In: Proceedings of Workshop on GRAph Data management Experiences and Systems; 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.421838Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:7f490c6721fd718ab9127e03a3498707be38b99aa26aaac66c1042fee05b6cb1","observation_id":"7bab8826-a82a-4103-bbdc-05a025d57ea0","resolution":{"observed_at":"2026-08-07T12:18:05.421838Z","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-07T12:18:05.474925Z","title":"openCypher - Source Code; 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.474925Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:fe6cebfd3301eeb311ba20bdd2007ee3aae58cc2f4abff0ceb9190988dbc982c","observation_id":"750226af-8321-49e1-8706-2025c946f243","resolution":{"observed_at":"2026-08-07T12:18:05.474925Z","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":"3103.18631","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:33.453341Z","title":"Spark: Cluster Computing with Working Sets","venue":null,"work_id":"30f1ef44-8471-4c00-8540-87a20aaf64b9","year":null},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.586455Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:21824e332e76bfea57ab1e16f3b7cae30673542296fd39eb2c5dd101dd394316","observation_id":"1e4e09e4-0bd9-4ab4-9465-8f81f559c0fe","resolution":{"observed_at":"2026-08-07T12:18:33.493317Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:05.719689Z","title":"Graphflow: An active graph database","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.719689Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:4fa349c318e18eb8884a2defbae3601f10486f0abe610005f0f2a12943ea090d","observation_id":"b87ec2b2-21bb-4a19-987c-a6aadc51903a","resolution":{"observed_at":"2026-08-07T12:18:05.719689Z","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-07T12:18:05.878096Z","title":"RedisGraph GraphBLAS Enabled Graph Database","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:05.878096Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:8fb0406467c4028ec7a7c1c91cb46ec426d8d2b215d0d9982a3436eb69461ac7","observation_id":"08c3bf70-2fc3-44a0-a84e-63ca8c8464bb","resolution":{"observed_at":"2026-08-07T12:18:05.878096Z","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-07T12:18:06.003633Z","title":"The graph story of the SAP HANA database","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.003633Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:d9252ebd77c424f1f011f310bbb1f4e657811729ad4c2d4c2492138b593e5bac","observation_id":"6aa1f3f4-fd22-4b72-bc88-63094e09720a","resolution":{"observed_at":"2026-08-07T12:18:06.003633Z","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-07T12:18:06.122414Z","title":"Cypher for Gremlin - Source Code; 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.122414Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:92f8022022b564885b5cfeec0d0dcd518908933c7ce2b17ad0a0dbf01ffdb475","observation_id":"2dd58b72-726d-4718-ba37-702633c50c66","resolution":{"observed_at":"2026-08-07T12:18:06.122414Z","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-07T12:18:06.262053Z","title":"Cypher-based Graph Pattern Matching in Gradoop","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.262053Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:73998bf4726eb0e4c4086ba6bfe37339d88544f6065d9d160211642c8e38dce6","observation_id":"47ec5dd4-e5e7-4125-ba32-a30484e88051","resolution":{"observed_at":"2026-08-07T12:18:06.262053Z","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-07T12:18:06.471514Z","title":"Ruruki - In-Memory Directed Property Graph; 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.471514Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:4300e48a22fb2dae6c9cc688d511e9398f75db991130e243b53edc0a8174ba34","observation_id":"22f5e747-28a9-4872-8378-77bfdcb0683b","resolution":{"observed_at":"2026-08-07T12:18:06.471514Z","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-07T12:18:06.531541Z","title":"Property Graphs in Oracle Database 23ai: The SQL/PGQ Standard; 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.531541Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:674c10d48689aad4e81ead7a29c5d4c37080eb1608bbd1149e7b35897682499f","observation_id":"1c0879b4-cc27-4710-8992-363299c903a3","resolution":{"observed_at":"2026-08-07T12:18:06.531541Z","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-07T12:18:06.635860Z","title":"SQL Property Graph Queries (SQL/PGQ); 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.635860Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:a03eeea4c348655f134ac37704ef43c755936ea6d8638c5afddcc927e8c6bd5c","observation_id":"3bef503d-551a-4905-a6ea-6ede433ed385","resolution":{"observed_at":"2026-08-07T12:18:06.635860Z","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-07T12:18:06.754305Z","title":"DuckPGQ: Bringing SQL/PGQ to DuckDB","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.754305Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:968aead456f1ef5fc796682a06e86b786a0f8ccc8babe370616f61c04ec2097e","observation_id":"e3a02843-2c7b-4b22-9c2e-cc1d1f2bbb4f","resolution":{"observed_at":"2026-08-07T12:18:06.754305Z","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-07T12:18:06.832961Z","title":"Spanner Graph and ISO standards; 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.832961Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:5acf9c6811f770ed8b1dc0fa4ff3a3846217801f8b64a18cbd15ff0994c193f1","observation_id":"31e67fe2-cc1e-4226-96e8-9bdffb26b231","resolution":{"observed_at":"2026-08-07T12:18:06.832961Z","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-07T12:18:06.917582Z","title":"GQL is Here: Your Cypher Queries in a GQL World; 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:06.917582Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:239e65748cff507fbefa48cda450c33c915f8d7111b516f885c17651af5d54d3","observation_id":"7a9875c3-5004-417b-8c8f-cb8f839c4198","resolution":{"observed_at":"2026-08-07T12:18:06.917582Z","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-07T12:18:07.012263Z","title":"Announcing NebulaGraph Enterprise v5.0 RC release: Delivering Full-Fledged GQL Support","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.012263Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:52592e271d222d6fe9df87e5446dc47e2bca3096fede5a148ce9a3c2f8a20318","observation_id":"4d672c18-d55e-4d84-9bc3-18b95bc3d4e1","resolution":{"observed_at":"2026-08-07T12:18:07.012263Z","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-07T12:18:07.176477Z","title":"Ultipa Graph Database; 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.176477Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:db71425dd0cd0235a904bfc7440eec1574b382b7524784781a31819d2bfb6458","observation_id":"f963a9fe-c156-4152-8577-a5806e6c1fe1","resolution":{"observed_at":"2026-08-07T12:18:07.176477Z","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-07T12:18:07.262951Z","title":"GQL language guide; 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.262951Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:c7a96521c4c178f047c4d18ccab4efb31b2df24774f2db307ba622fe15c419cc","observation_id":"6704eb5e-62a0-47ef-b188-620bf1640ab4","resolution":{"observed_at":"2026-08-07T12:18:07.262951Z","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-07T12:18:07.349338Z","title":"Apache TinkerPop; 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.349338Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:49cfd0993b13318683cee2a2e3f49b4231c0e8ae51d94b55d57199023b24fa74","observation_id":"55e700c3-be6b-4090-85ef-500dbabd7795","resolution":{"observed_at":"2026-08-07T12:18:07.349338Z","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-07T12:18:07.425543Z","title":"Titan: Distributed Graph Database; 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.425543Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:cb539ceaddaca9ecaeb0312bd0ba28768f5ab6d3b7fb902105da2fb5078afb30","observation_id":"9f44eb0f-60cb-4d88-a935-0d8bd0d75568","resolution":{"observed_at":"2026-08-07T12:18:07.425543Z","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-07T12:18:07.536832Z","title":"JanusGraph: Distributed Graph Database; 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.536832Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:89c7ec99c2a897637273507011845f62ea13e8e97c7def179f4120f73fa658bd","observation_id":"5a2c3527-95aa-491f-a472-f17010a44d9d","resolution":{"observed_at":"2026-08-07T12:18:07.536832Z","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-07T12:18:07.648281Z","title":"DataStax Enterprise Graph; 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.648281Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:18442decb3845aab7de55c66b94d75768d97a47a2a8a43abc58e48f138a3af17","observation_id":"a8078876-6bb1-4c53-a313-432afd575aeb","resolution":{"observed_at":"2026-08-07T12:18:07.648281Z","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-07T12:18:07.730484Z","title":"OrientDB: A NoSQL, Open Source MMDMS","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.730484Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:9760f18698d00ab83fe22533dd35e189121652ee489cc66a030e206806aa9bad","observation_id":"03ecd77a-47c7-4927-ab43-569d695a933a","resolution":{"observed_at":"2026-08-07T12:18:07.730484Z","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":"4716.23847","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:32.967606Z","title":"A Programmatic Introduction to Neo4J","venue":null,"work_id":"861b67d2-17ac-465d-b106-745a50eedc4d","year":2012},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.816933Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:11fc48b735413e31014057d18fc704fb12c57eb713d27e73af79f1b41e09bf96","observation_id":"1a66d2e8-b79d-45b2-9f0d-166ebae921c3","resolution":{"observed_at":"2026-08-07T12:18:33.073724Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:07.896950Z","title":"Objectivity/DB; 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.896950Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:5b9dee0a6f921e50a9b843694fd94a317e87a11790428273ed82bd33431b4c90","observation_id":"9e4da38c-ef2b-4457-827b-671f8ec9722c","resolution":{"observed_at":"2026-08-07T12:18:07.896950Z","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-07T12:18:07.992909Z","title":"Introduction to Azure Cosmos DB","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:07.992909Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:18aba543deea9bd34a588d01d3373b32aea2361d756a4cf1ce3716545d20211b","observation_id":"39cafbdb-272a-4e26-bbfd-96229b4716e5","resolution":{"observed_at":"2026-08-07T12:18:07.992909Z","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-07T12:18:08.076938Z","title":"Amazon Neptune: Graph Data Management in the Cloud.; 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.076938Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:dcf3bca2f855d2cb7cf9f1b91f32735ca7a9de751dcd9b42775a015ee53cb03a","observation_id":"26b926c0-80ce-467d-84d6-c1b5cdfcf8d9","resolution":{"observed_at":"2026-08-07T12:18:08.076938Z","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-07T12:18:08.158076Z","title":"Scaling Apache Giraph to a trillion edges","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.158076Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:4066437d0a11f80789623393061cf20bb2af7712f7f5c6ad574b67cac9a9322b","observation_id":"c9ef7ae1-4f26-430b-a620-63911d303e2e","resolution":{"observed_at":"2026-08-07T12:18:08.158076Z","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-07T12:18:08.241572Z","title":"Spark SQL: Relational Data Processing in Spark","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.241572Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:326658d2c4f66fa4f7c79251848c73df9ef2f2991162916b72c6b2461625f829","observation_id":"618e16cd-e62f-4b3a-a803-dd90b1f4547d","resolution":{"observed_at":"2026-08-07T12:18:08.241572Z","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-07T12:18:08.330760Z","title":"Semantics and complexity of SPARQL","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.330760Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:82b148250c1d002afa5ee3a393fcdbd9efaba63080a1d8fcab174c9811028f96","observation_id":"1f5e07df-3ecb-45ae-afd3-f8b9c98a3f81","resolution":{"observed_at":"2026-08-07T12:18:08.330760Z","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-07T12:18:08.450913Z","title":"Scalable SPARQL querying of large RDF graphs","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.450913Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:3f2d3b624c7de81ce3e2b1eb95ba8e550b145afeae00207de09e7d8b25018ef8","observation_id":"da456f49-8a38-4ec9-956e-e1e55895f1e9","resolution":{"observed_at":"2026-08-07T12:18:08.450913Z","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-07T12:18:08.541874Z","title":"S2X: graph-parallel querying of RDF with GraphX","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.541874Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:a3d681e9fe6c704f802364640e62953c77d9fb504162e89ce22a4ead632cf711","observation_id":"acd8dc54-0edc-47a0-9dba-091bbd770071","resolution":{"observed_at":"2026-08-07T12:18:08.541874Z","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-07T12:18:08.626791Z","title":"Efficient processing of SPARQL queries over graphframes","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.626791Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:32bdb67104f9893a7df1e02fb83759989ac1a449401b99768e0370a25b8d9d49","observation_id":"d11743f5-405a-4f77-8180-a11394829b0a","resolution":{"observed_at":"2026-08-07T12:18:08.626791Z","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-07T12:18:08.705964Z","title":"Virtuoso, a Hybrid RDBMS/Graph Column Store","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.705964Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:be653b3fdf3a7b76bc2753c9c4cdfd0b6245825fdee6c6647aec2559b327c3ad","observation_id":"a8c91ff2-f8a5-4d58-b2c8-08c1b6b42732","resolution":{"observed_at":"2026-08-07T12:18:08.705964Z","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-07T12:18:08.772104Z","title":"Jena TDB; 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.772104Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:cdd7ac0857905fdfea182d9f6e539bed97a3c17eb6a3f303d9c5a155d8305a0e","observation_id":"f4c2ca75-2dce-4321-aa73-fe7c24f9df71","resolution":{"observed_at":"2026-08-07T12:18:08.772104Z","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-07T12:18:08.836857Z","title":"Blazegraph High Performance Graph Database; 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.836857Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:8f39a124d587a73d057c28d6be785db166edbaed523f4c33b0c6c478fc312972","observation_id":"28a945bf-82f9-4eac-be18-42a4e6def83a","resolution":{"observed_at":"2026-08-07T12:18:08.836857Z","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-07T12:18:08.934965Z","title":"AllegroGraph; 1984","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:08.934965Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:d7800e7daaa426bc0a4df4cb5aa35a9daadf2961f8a0e0a1c2b2041b9745d198","observation_id":"9d793e8d-3ee2-4b89-97d6-fecde4fc8b89","resolution":{"observed_at":"2026-08-07T12:18:08.934965Z","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-07T12:18:09.006665Z","title":"Enterprise Knowledge Graph platform; 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.006665Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:9f39ee95270ae07bd43fe6d5b1ba07e3ecb9c244f1cfbb7fdc18c5d2b0bbe816","observation_id":"c4238902-f1e1-41ca-9b9f-cb77fe96b534","resolution":{"observed_at":"2026-08-07T12:18:09.006665Z","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-07T12:18:09.120612Z","title":"QLever: A Query Engine for Efficient SPARQL+Text Search","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.120612Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:54a9dfcd241c7b9ecd81bcdb73fa327b01d30ceca84370f1fc3a7bd0af071509","observation_id":"c568446c-a2a9-43cd-b878-265b8f99da2b","resolution":{"observed_at":"2026-08-07T12:18:09.120612Z","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-07T12:18:09.233865Z","title":"Benchmarking SPARQL Engines on Wikidata Queries","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.233865Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:57ddbbf8bb75816463b6f280ca3b5cb9784517cd05ca03275dd7e0aa83d5baf4","observation_id":"61d2c4f0-84c1-4204-ba29-957a832bab9e","resolution":{"observed_at":"2026-08-07T12:18:09.233865Z","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-07T12:18:09.405193Z","title":"GraphQL; 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.405193Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:c0231a4bf9e29dc0ed3d9b1eba144ff758544773f9fb2e7d914fdb8a04f34da5","observation_id":"fda885f0-1b9b-4d6b-861f-ae1a701fd751","resolution":{"observed_at":"2026-08-07T12:18:09.405193Z","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-07T12:18:09.490159Z","title":"An initial analysis of Facebook’s GraphQL language; 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.490159Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:0f16b9787007dfcc3d439515d9d0fa02da64a22eaddb9b4dec611d5b3a9e5e0d","observation_id":"58c64e01-28e1-468c-a7a1-01c13de271d5","resolution":{"observed_at":"2026-08-07T12:18:09.490159Z","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-07T12:18:09.581448Z","title":"Semantics and complexity of GraphQL","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.581448Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:860aaba693f64719f546f5ac82fffd8fcaf9a2e74c77878d32af41fa0d072787","observation_id":"21b96600-0b3c-424f-b70d-520df827116b","resolution":{"observed_at":"2026-08-07T12:18:09.581448Z","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-07T12:18:09.683188Z","title":"Neo4j and GraphQL; 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.683188Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:842ae463238de652b7ee44aa472982f3f9e59f70134438c3f4983192b5fcbfa6","observation_id":"85c6e6a1-50dd-49e6-800c-77feb2e5df89","resolution":{"observed_at":"2026-08-07T12:18:09.683188Z","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":"8713.38749","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:32.524669Z","title":"A Graphical Query Language Supporting Recursion","venue":null,"work_id":"de554d80-b82d-4ae0-ba8a-5e91a536d9c5","year":1987},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.751986Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:64cd84f983aae954c222f5ac3000caca1aec029e39cdd70ba601b1f853ebb6aa","observation_id":"f24b5c94-7e3e-48fa-abe3-12a524232b4b","resolution":{"observed_at":"2026-08-07T12:18:32.624403Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8514.29859","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:32.185866Z","title":"GraphLog: a Visual Formalism for Real Life Recursion","venue":null,"work_id":"be9e848a-231b-47e6-a92f-b6862abf38cb","year":1990},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.827960Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:82a78a3823103038145ba9e2e587f197114b8565b319708405ea2463032a4550","observation_id":"f41c83e6-85c1-46a8-8147-aca0253c7ae2","resolution":{"observed_at":"2026-08-07T12:18:32.309643Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:09.896781Z","title":"G-Log: A graph-based query language","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.896781Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:02f63a5d31857ad1b9ef75e5b108ca27192c23da5f6bfafdfab226f99cb9c400","observation_id":"3a7ff254-8b27-440f-8c35-2269cbbea930","resolution":{"observed_at":"2026-08-07T12:18:09.896781Z","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-07T12:18:09.961519Z","title":"Existing Languages ; 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:09.961519Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:159b47cf8e83ba9331cf18b9e85f26e48c159ee2da7a3d8c7d23cc4928b0a742","observation_id":"07bd84f7-5bd7-4558-9f1e-fdbc57c959c1","resolution":{"observed_at":"2026-08-07T12:18:09.961519Z","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-07T12:18:10.037696Z","title":"Querying Graphs with Data","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.037696Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:eeea9ba42e252b18764a844212aead89b4fe6d4370b1d897740ad37dce0f194a","observation_id":"82256df2-57e9-41c9-abf7-bed9e9b7323c","resolution":{"observed_at":"2026-08-07T12:18:10.037696Z","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":"2762.26276","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:31.905972Z","title":"A Query Language for a Web-Site Management System","venue":null,"work_id":"4bcedb2f-cc1b-4e30-8150-43dfd27b6e3e","year":1997},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.097906Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:4c194b35d2507c76aad9383603f7cd36eb8f1a570fab6f610c0c1466bf0ae9ff","observation_id":"5b88fb67-631e-421e-b70d-12b1c319f6d3","resolution":{"observed_at":"2026-08-07T12:18:31.992128Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:10.186053Z","title":"Regular Queries on Graph Databases","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.186053Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:89b9a0c5f150cbdef65617b93218127abbfe7aa3ba095ddbb5814d6f7a69dcf4","observation_id":"a2445923-1419-42c2-8117-d1da04ceffc2","resolution":{"observed_at":"2026-08-07T12:18:10.186053Z","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-07T12:18:10.233291Z","title":"Declarative and distributed graph analytics with GRADOOP","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.233291Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:3ec793d458e35c9cf68ce86784572f25202777955a321cea9c7271228fe12ce4","observation_id":"df1b4891-5cd8-4518-a3b3-b4b3f8b91db1","resolution":{"observed_at":"2026-08-07T12:18:10.233291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4842-4335-0_9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:18:27.794816Z","title":"GraphFrames","venue":null,"work_id":"67eb3cb5-2b7a-4f08-a152-ab63236c0436","year":2019},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.324817Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:83fbea18f0b50f15bfa35299c6c93cc090c4353d38fc979e4ea8138ae586898c","observation_id":"cf56f53f-d3a2-4b13-a91e-6bc5212e1ae5","resolution":{"observed_at":"2026-08-07T12:18:27.910282Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:18:10.374299Z","title":"PandaDB: Understanding Unstructured Data in Graph Database","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.374299Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:091313cf5725a425985014556dfb09f65013955312fb5c511549b040ae9389a9","observation_id":"be4a69e7-5d9d-4940-8569-2a3c1f9909d1","resolution":{"observed_at":"2026-08-07T12:18:10.374299Z","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-07T12:18:10.442337Z","title":"Ubiquitous B-tree","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.442337Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:778e60075b68a9642ada9a3179c9362b813ec91ac7630d0cc27109b7ee241488","observation_id":"c3b0f9dc-6022-4fe2-a5ef-befb6b1d79f8","resolution":{"observed_at":"2026-08-07T12:18:10.442337Z","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-07T12:18:10.507785Z","title":"Modern B-tree techniques","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.507785Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:835a3b4a47e25c8e17b1df85fdddc82686540a802654677b40133bab41d09d6a","observation_id":"e9d6da26-2a3a-4114-a0cd-24723a3fe4e0","resolution":{"observed_at":"2026-08-07T12:18:10.507785Z","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-07T12:18:10.587089Z","title":"Managing gigabytes: compressing and indexing documents and images","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.587089Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:8b69886201825caee8e08aa3d54c7deb357bcc8c18b5460d386cc46025db1ba1","observation_id":"9407c577-5c2b-4288-b5dc-b5ffb146b80d","resolution":{"observed_at":"2026-08-07T12:18:10.587089Z","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-07T12:18:10.655588Z","title":"Inverted files for text search engines","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.655588Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:13c8f9114f2bebe5c80e9b505f14aac17560b07e85e8f89f2b2ae6c67b5b03b9","observation_id":"94247fca-7c51-40bf-83fc-371114b5f43f","resolution":{"observed_at":"2026-08-07T12:18:10.655588Z","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-07T12:18:10.732523Z","title":"Optimization of inverted vector searches","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.732523Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:928907bdef8e0a5b58d6fbfbb1c9ba95d4ec9f01ae2b26ecaebe4d68aebf71ac","observation_id":"0f18fbe9-7870-4687-938b-cc900882fcc0","resolution":{"observed_at":"2026-08-07T12:18:10.732523Z","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-07T12:18:10.829824Z","title":"Graph database applications and concepts with Neo4j","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.829824Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:777a761cf2231fa799e44a5cf89c72187792ba9b11ae60f24cf0685f90ee5667","observation_id":"5671e2b2-b77e-4000-b7b0-6b7a0d9dafa8","resolution":{"observed_at":"2026-08-07T12:18:10.829824Z","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-07T12:18:10.925678Z","title":"Sortledton: a universal, transactional graph data structure","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:10.925678Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:3bbcab4323fe63e0b296436d2b8e54ab06ffa3af8da11357df34f72f869b7fe9","observation_id":"db860049-5e06-445f-915e-d5b3c151f706","resolution":{"observed_at":"2026-08-07T12:18:10.925678Z","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-07T12:18:11.003662Z","title":"ArcadeDB - Source Code; 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.003662Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:7b0cecaf286a7d4c59ab7625a57703dbd73483d39c08694155d1dc560f547a83","observation_id":"f8268a3d-25fd-4c2f-850e-9aa7e772b832","resolution":{"observed_at":"2026-08-07T12:18:11.003662Z","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-07T12:18:11.082750Z","title":"The log-structured merge-tree (LSM-tree)","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.082750Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:83b80d171cfb49dd9b65d0d2fd7ece3c14512b05b18d1768025a7d578250cdfa","observation_id":"e35944d6-dd58-436a-bb63-1f80e8e2d99b","resolution":{"observed_at":"2026-08-07T12:18:11.082750Z","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-07T12:18:11.149861Z","title":"LiveGraph: A transactional graph storage system with purely sequential adjacency list scans","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.149861Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:0fffa515cb3c528f46b7a766d16a5d7c93d087d9298b0ee9af0cfbedfb8a31cc","observation_id":"0a41aeeb-35ab-46cb-96cd-7a1514c78ad9","resolution":{"observed_at":"2026-08-07T12:18:11.149861Z","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-07T12:18:11.214396Z","title":"ByteGraph: a high-performance distributed graph database in ByteDance","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.214396Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:255fb3656cbe5d3f9fe31201b25d498b684f103819e999cc2e18c2c23fc09a91","observation_id":"21efbf16-6a36-45e1-b88b-22b6b42ddb16","resolution":{"observed_at":"2026-08-07T12:18:11.214396Z","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-07T12:18:11.275756Z","title":"Succinct Data Structures and Delta Encoding for Modern Databases; 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.275756Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:f0b95d7244611d832e2e7dfc689eb67bf9a10ac2bd12a0d3bd3e227c44e1f061","observation_id":"fe28b000-1887-4dda-8052-290a57365c49","resolution":{"observed_at":"2026-08-07T12:18:11.275756Z","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-07T12:18:11.338346Z","title":"Exchange and consumption of huge RDF data","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.338346Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:bd875608af2641bc86fb6d9ef588379a9416d350710aea16317f03655ee74744","observation_id":"d1c2d8f4-e220-48c2-a7f8-e21653a1a1ec","resolution":{"observed_at":"2026-08-07T12:18:11.338346Z","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-07T12:18:11.440169Z","title":"RDF-3X: a RISC-style engine for RDF","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.440169Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:9fc511483aab70ad2cb20e1a7ec3ababee592de0b6d834c66fd0b924a6b93709","observation_id":"51f94905-b7f6-401a-b2d7-f31984f0f139","resolution":{"observed_at":"2026-08-07T12:18:11.440169Z","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-07T12:18:11.548967Z","title":"KÙZU Graph Database Management System","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases","version":4},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T12:18:11.548967Z"},"links":{"citing_paper":"/paper/2505.24758"},"observation_digest":"sha256:b6d238f468ed3730b48feaa15bbab4803f5fe1a9a2ad9ae58b8de3fe4440de29","observation_id":"f62f9b92-ea6f-4a6d-a547-36b7b016350e","resolution":{"observed_at":"2026-08-07T12:18:11.548967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.24758","last_updated":"2026-07-01T17:04:56Z","latest_version":4,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T12:11:38.664875Z","submitted_at":"2025-05-30T16:18:58Z","title":"Survey: On the Landscape of Graph Databases"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":87,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":234},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 234 outbound references and 0 inbound Pith citation observations for arXiv:2505.24758."}