{"as_of":"2026-08-14T06:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:afa735905141dedafe893270b26de4a3914dd0cadb37d18eabc83ce45021eff8","coverage":[{"denominator":101,"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-01T09:11:01.726558Z","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-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.20881/citation-record","integrity":"/paper/2607.20881/integrity","json":"/paper/2607.20881/citation-record.json","paper":"/paper/2607.20881"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:49.763703Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:49.763703Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:10c9882e8990cf5ae2ca51395bc61ac756fc1b5d6a3048bf34d5a7c43ca4cb73","observation_id":"20835e62-6deb-4c10-bd73-7466d8f7ec42","resolution":{"observed_at":"2026-08-01T09:10:49.763703Z","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-01T09:10:49.873329Z","title":"Aguilera, Aurojit Panda, Sylvia Ratnasamy, and Scott Shenker","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:49.873329Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:cee2c8d3d1e2c5a2193f4102c293d98818a51b7db7a31d36bf46b5c4364bb193","observation_id":"dbff88e7-d37f-4cd3-89fc-e58d86b8e775","resolution":{"observed_at":"2026-08-01T09:10:49.873329Z","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-01T09:10:50.139314Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.139314Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:985ae4481d6200f0bcb979c2993636d73368045d080a2f01898c74bf029f6448","observation_id":"dacf4e5e-7b5b-423b-a749-f37a09a2cea5","resolution":{"observed_at":"2026-08-01T09:10:50.139314Z","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-01T09:10:50.279383Z","title":"Talha Imran, Ivan Puddu, Sanidhya Kashyap, Hasan Al Maruf, Onur Mutlu, and Aasheesh Kolli","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.279383Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:dfaf547633367e7f172c47ebeedfb5f9094d953aabe7d5bd1197996081277636","observation_id":"716d6408-0bad-49bc-8c8c-9cbe42844639","resolution":{"observed_at":"2026-08-01T09:10:50.279383Z","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-01T09:10:50.345661Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.345661Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:2a8ff202fea38890a5b7381658c20031a50ae9bc987c182f014dfb00336d7c0b","observation_id":"2b3e8aef-8c47-4a36-85fc-3f33803c4a06","resolution":{"observed_at":"2026-08-01T09:10:50.345661Z","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.1145/3769755","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"af06a587-b133-46f1-9db2-80856196f946","year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.434420Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:f8cce3cd74c0367083e8101c448c7c7ceb2c577c8c8847af249e1bd2fc604a59","observation_id":"5b9c2015-c4cd-4d14-88c8-9f201baf5889","resolution":{"observed_at":"2026-08-01T09:13:27.901196Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:50.531970Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.531970Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:6b8cfb51ed5d403a249570b19311905a0498fb296b81fe4771ec1b88ee36aecd","observation_id":"8955d289-eb6a-4435-ab46-a1b20eb058ad","resolution":{"observed_at":"2026-08-01T09:10:50.531970Z","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-01T09:10:50.630963Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.630963Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:b61e7e61f2853ad9e412ad26677470490269e17a5b012ba5c51969f905dec26f","observation_id":"4534afe9-ae59-433d-9e81-c5fdb3369820","resolution":{"observed_at":"2026-08-01T09:10:50.630963Z","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.1145/3709707","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"335d77fa-b733-4255-b98b-db2a0b765508","year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.791551Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:b2f113770d88d1ecdf5d804bbb9c30f047f487a2b4489e69495567108a146211","observation_id":"65dd34ea-d596-4cd5-8d70-1ee248deb14a","resolution":{"observed_at":"2026-08-01T09:13:27.391341Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:50.949667Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:50.949667Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:402986521cb54db792db597921c8448b2ecc710500868e6d6d109799e44d3707","observation_id":"c8f6695d-affa-4d0c-bbfe-b57326ccfb1d","resolution":{"observed_at":"2026-08-01T09:10:50.949667Z","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-01T09:10:51.112676Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.112676Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:17e1121f70a785f1a367f7de9d3d5eb00f2686f411dd47b0d03b454e43b00173","observation_id":"3c3810bf-9f0d-4b1e-917f-003e55763f4e","resolution":{"observed_at":"2026-08-01T09:10:51.112676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-07-06T18:05:11.700127Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-08-01T09:10:51.279709Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.279709Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:ece8ec2e86c79101928c3215686b13e98a024a2a263f0279979be631b6310a5f","observation_id":"7c8de4c6-922e-42d4-83bd-d1becab414d4","resolution":{"observed_at":"2026-08-01T09:10:51.279709Z","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-01T09:10:51.295391Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.295391Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:1b6205bd3451ca74e5abbf0e02ec2b240ba210e253a948d05520f2a59c3d0c44","observation_id":"973a776c-d502-4e83-ba1e-d5a73a606156","resolution":{"observed_at":"2026-08-01T09:10:51.295391Z","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-01T09:10:51.323848Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.323848Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:26055233f7a638c9b8984c056a9c94d26d2222414fbc136e8a22d9238c60c271","observation_id":"a25430fe-1317-41b0-8435-94d9fd7a15ec","resolution":{"observed_at":"2026-08-01T09:10:51.323848Z","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-01T09:10:51.420272Z","title":"Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.420272Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:14e67cb7e353fee1d0840df067e618c2151b441a22c94b512b478d48d7fd8346","observation_id":"9a3f8900-d11b-4097-9186-f82fb1872429","resolution":{"observed_at":"2026-08-01T09:10:51.420272Z","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-01T09:10:51.697523Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.697523Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:d61f14589e12df87ec8b6a6866935355f646225f2181f6ded18a7fc50fe8dfe8","observation_id":"462a7656-41ea-46c7-a50f-fdcbc25eef74","resolution":{"observed_at":"2026-08-01T09:10:51.697523Z","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-01T09:10:51.783807Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.783807Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:a57b903dbcc5a836a47f227cdec4efebb7baf753f18d7066cc3abc40eaad9f6f","observation_id":"704bb632-ea1a-45e8-b42a-e11e1c4577d6","resolution":{"observed_at":"2026-08-01T09:10:51.783807Z","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-01T09:10:51.872662Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.872662Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:bd0fe48befb05dedcded05c9951a419f9796561e132348ae32fa8e180fa456ce","observation_id":"08b9f778-179f-4e78-89dd-773e6f178767","resolution":{"observed_at":"2026-08-01T09:10:51.872662Z","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-01T09:10:51.970390Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.970390Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:5925f2dacf826b9dd9ee343610e0bf48bc57c1061c5fc2acfa57dffc061c8d32","observation_id":"db5fd250-6d15-42a7-8c35-24f1e8330683","resolution":{"observed_at":"2026-08-01T09:10:51.970390Z","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-01T09:10:52.077845Z","title":"Bernstein","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.077845Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:418dde7ae4caf7a5781705fe97595ccd654fa4166fff4a00476c57662d91ea32","observation_id":"b3007d65-681d-4390-b3ba-72edaaa55daf","resolution":{"observed_at":"2026-08-01T09:10:52.077845Z","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-01T09:10:52.170205Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.170205Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:76c46385606b3107536a4ac318cdef98afab2c7178468c74d41f6e1f1ae27e9d","observation_id":"1c97256f-8c89-478c-9c3a-dee2814cd8fb","resolution":{"observed_at":"2026-08-01T09:10:52.170205Z","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.1145/3769795","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"32e050d3-cec7-474c-bc65-0b3415e9bbb2","year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.267896Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:f6233602d682ada814ba935ca6751ea88ad7fe13decd9fce5d3d884c04df5adf","observation_id":"403b4c2f-ba13-4f2d-b5f8-d38c49026bae","resolution":{"observed_at":"2026-08-01T09:13:26.447946Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:52.378972Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.378972Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:57f0b96d63f5008c86e2b288b1f892dbee91de91cc439e6a9dbbb9a9d8f5d623","observation_id":"61a5014c-113e-4d44-acdf-a82df6bfed71","resolution":{"observed_at":"2026-08-01T09:10:52.378972Z","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-01T09:10:52.498935Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.498935Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:95de8e6c8bfcfa58e02495b1558d2d85736e539115a8d6588b1170d08eee458c","observation_id":"08c4070f-ab11-4e37-b25d-34c08db49928","resolution":{"observed_at":"2026-08-01T09:10:52.498935Z","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-01T09:10:52.623139Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.623139Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:924beef52de7ae492c69e1df226c6b6cb2c550244cb7cc01dc401933588f8629","observation_id":"85b37def-6120-467f-9dc9-0bf20fe2c073","resolution":{"observed_at":"2026-08-01T09:10:52.623139Z","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-01T09:10:52.746651Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.746651Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:a21cfd3296aef560d538507f350f23ec8263c4e9eacefd52c985a50e21df2545","observation_id":"562125ca-ddf1-4e16-9ec1-d2782a683335","resolution":{"observed_at":"2026-08-01T09:10:52.746651Z","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-01T09:10:52.871531Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.871531Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:64a83cf88ea538578770997d60a12faf38bc633bb073079300ce3662037de6c6","observation_id":"5069a2ad-58a1-44e7-9253-655efaf3a34e","resolution":{"observed_at":"2026-08-01T09:10:52.871531Z","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-01T09:10:52.994428Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:52.994428Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:13342fafba5add096cf5cbd6e487cb88489b44940dbdbc89afa59675d4b0dcd4","observation_id":"40035b9f-c76f-48da-89c9-22a27c9dd19d","resolution":{"observed_at":"2026-08-01T09:10:52.994428Z","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-01T09:10:53.080288Z","title":"Aguilera, Kimberly Keeton, and Vijay Chidambaram","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.080288Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:c9fd9e91a54cb8c05569b09a9af690ecf4e547b13f54070bf2f2d7964e422c2a","observation_id":"e04bbd3e-baef-4f64-ba9b-8cb47342fb5c","resolution":{"observed_at":"2026-08-01T09:10:53.080288Z","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-01T09:10:53.200944Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.200944Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:17895f60ac961734e8b4e5bfd0b19057fb985d56fb003688b8e3c57408f3b4c9","observation_id":"9b57258d-e4a5-4aaf-9d36-1ad5eb0477bd","resolution":{"observed_at":"2026-08-01T09:10:53.200944Z","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-01T09:10:53.321043Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.321043Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:71e12332e28f25f067e9ea650c26f14b307fda0767e14dd554cbd6bd007d9cb1","observation_id":"6cb3c635-b4d0-4b42-a6f4-1358d9c30339","resolution":{"observed_at":"2026-08-01T09:10:53.321043Z","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-01T09:10:53.444185Z","title":"Berger, Lisa Hsu, Daniel Ernst, Pantea Zardoshti, Stanko Novakovic, Monish Shah, Samir Rajadnya, Scott Lee, Ishwar Agarwal, Mark D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.444185Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:176dd44c4a5c21b92f7a15fb8b7b0c991e13d6debfad6edc0d9203dc4cfac4a5","observation_id":"2427ba5d-889e-419f-aaa2-f20bc52eba9d","resolution":{"observed_at":"2026-08-01T09:10:53.444185Z","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-01T09:10:53.568090Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.568090Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:01f112f348c64bf4eb465cf5252ae2e5b7e153fcc9d9dd3d3025efd527c02fba","observation_id":"52360714-270a-4de8-bbcf-1f1178c6861b","resolution":{"observed_at":"2026-08-01T09:10:53.568090Z","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-01T09:10:53.684477Z","title":"Howie Huang","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.684477Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:4faba1a525494d3266088ce44835c6bf8f9a6cee69ef3442ee612a86d83c1d84","observation_id":"0bc7c789-582a-40a3-a2a1-e111a9a8a982","resolution":{"observed_at":"2026-08-01T09:10:53.684477Z","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-01T09:10:53.808258Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.808258Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:0f8c3d903db944f405d68d819fd734d7cb7bc9cecd378ad2a9f22616a222f3db","observation_id":"acfba7b0-1cf4-4166-90a5-57b0ed9f031b","resolution":{"observed_at":"2026-08-01T09:10:53.808258Z","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-01T09:10:53.908108Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:53.908108Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:f11ccb8d14916fc6d1ed295de214867e448661440763c25d1c910061d82da3b6","observation_id":"db432498-8c30-4bd7-adc9-c63c4abc30ee","resolution":{"observed_at":"2026-08-01T09:10:53.908108Z","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-01T09:10:54.006563Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.006563Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:fee100e76a9d2780da73a60e27044d0cff6cb43da2b29c377f9f372eb6a5c379","observation_id":"c0feb9e3-5d85-40ac-ad63-1924c1a12dd4","resolution":{"observed_at":"2026-08-01T09:10:54.006563Z","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-01T09:10:54.130965Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.130965Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:641ec6839657bf5319b52c1e6b29343c999399a86235bf7ec7d0396dc25753d4","observation_id":"6aaeacca-7e46-4b50-9bcc-9bc26f0c6a0f","resolution":{"observed_at":"2026-08-01T09:10:54.130965Z","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-01T09:10:54.227317Z","title":"Lyu, and Yang- fan Zhou","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.227317Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:73c8f787aa64f05664a3057a8c1194c4173c9b4ce4cd79f64c1601a8b3957a22","observation_id":"6cdd22e6-e524-40a3-9608-b8961faeb112","resolution":{"observed_at":"2026-08-01T09:10:54.227317Z","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-01T09:10:54.338301Z","title":"Lyu, and Yangfan Zhou","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.338301Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:9f8b404ffe00705f4c58ca819d3d0167999a3d0d102754f49c2d5e773be15304","observation_id":"c2f153a1-8bad-48fe-aab9-9d727e5e888a","resolution":{"observed_at":"2026-08-01T09:10:54.338301Z","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-01T09:10:54.457548Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.457548Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:6e2e88fbf595154a8c1632029dc032b2f0a401d0659c3433f115738fcb8317a1","observation_id":"06ebe930-8bac-434a-8eea-5b1abc7ae388","resolution":{"observed_at":"2026-08-01T09:10:54.457548Z","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-01T09:10:54.567509Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.567509Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:9ccd8d685a921af90ecbc2371b909ff9ca85db6484d67f8adec922e579c3d52a","observation_id":"61392e07-e48a-4255-98f3-3f967d8daa8c","resolution":{"observed_at":"2026-08-01T09:10:54.567509Z","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-01T09:10:54.680110Z","title":"Kanaujia, and Prakash Chauhan","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.680110Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:f11af8daac3e894940be8d23af020d8d38058da5af5d4c80a6f491ec26a2fc7d","observation_id":"a5c9d722-fa54-4a35-8ac2-79a4043b4c2d","resolution":{"observed_at":"2026-08-01T09:10:54.680110Z","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-01T09:10:54.790103Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.790103Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:c39ea665dcf17d690abc2c8152c1ae9635f5bdf480a9cb5476301fe1540b53e2","observation_id":"a1a239b6-4542-4b22-9a4b-ee349e011314","resolution":{"observed_at":"2026-08-01T09:10:54.790103Z","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-01T09:10:54.899334Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:54.899334Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:459bd75636a3984a8c060c96823025d53fc9b3f6c3487deccd5e788625d2c25f","observation_id":"721ef86f-353a-4120-886a-8a8a40bd5c4b","resolution":{"observed_at":"2026-08-01T09:10:54.899334Z","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-01T09:10:55.007265Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.007265Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:08e5b36b131fb93766c55ec66db6de8f4bee7278856501ba4bdc527d580dbc13","observation_id":"66b467c8-2a29-4511-9c90-1db8537068d3","resolution":{"observed_at":"2026-08-01T09:10:55.007265Z","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.1145/3654983","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"bdc2916b-35b9-4bc4-8a5f-0cc165daffb9","year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.083323Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:d105a3721046a658a2df4152d91bcb88a63b60ea9556c997f68afb04f4aa7535","observation_id":"5e329bc0-30c9-4e40-acfe-05e2666c32e2","resolution":{"observed_at":"2026-08-01T09:13:24.347632Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:55.194342Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.194342Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:fe82789f9f35cac46e146a73352b42bba72f2e74e4f550c57eb777da884b76fe","observation_id":"5ab4c7d6-93de-4514-b391-0eaace00639d","resolution":{"observed_at":"2026-08-01T09:10:55.194342Z","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-01T09:10:55.303398Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.303398Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:adae233ac30c6de3c8002f8d3eac5c935b51060352efd88eda9a058795774bde","observation_id":"6f058d95-0b11-4935-b3cc-16a18725ba47","resolution":{"observed_at":"2026-08-01T09:10:55.303398Z","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-01T09:10:55.381248Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.381248Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:631501a84131ee53de82e7ac22dfa4cdad166cebc8bfc2ae47f876291756c2a5","observation_id":"5903fd83-eb38-4a69-bc77-6b0b92dbc529","resolution":{"observed_at":"2026-08-01T09:10:55.381248Z","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-01T09:10:55.568136Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.568136Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:bc6c270eb477d74c4aa9f3249d144f6c42060950a0ffdc5f939eed60e2481592","observation_id":"86ac6918-b919-4ae4-945f-92a605db154c","resolution":{"observed_at":"2026-08-01T09:10:55.568136Z","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-01T09:10:55.704176Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.704176Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:fbc84fd0fc28161ed7ea95d51cabbfe91ce98c82172f58e6d4f9fc7ecea32dad","observation_id":"c1207e7e-1c86-4d48-a967-9d0d338539ee","resolution":{"observed_at":"2026-08-01T09:10:55.704176Z","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-01T09:10:55.870624Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.870624Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:3001ca9db1e42f42768ceba953c210bc4a7e0b9e83f68a1d4d798845e96fcd1c","observation_id":"ab68730b-7ade-4cf3-9876-82bcb8d43737","resolution":{"observed_at":"2026-08-01T09:10:55.870624Z","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-01T09:10:56.043949Z","title":"Blelloch","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:56.043949Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:84c074c7cb7740061b70e21ca2e6fd9995025e2df158aab651484c3997a27a42","observation_id":"b12a45fe-1741-425f-ae90-c6b617ca1cb2","resolution":{"observed_at":"2026-08-01T09:10:56.043949Z","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.1145/3709720","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"777a981b-b4a8-41a4-9e3a-389e9dbc1bbf","year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:56.186354Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:da4c92b8aa2eaea9feb268f5f28a9c4562e80b4a9e4fdc2c0dbec76cdc689647","observation_id":"31fbf9a8-7887-4664-b9cb-785e4fea39ab","resolution":{"observed_at":"2026-08-01T09:13:24.127463Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:56.314440Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:56.314440Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:b394f051d71007edd6cdbbdb96fac969c33d9e835be9fe679ca0d3d727b0f994","observation_id":"c325c342-4ec1-467e-80f3-5001bdb6f4e4","resolution":{"observed_at":"2026-08-01T09:10:56.314440Z","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-01T09:10:56.455140Z","title":"Haque, Zhijing Gene Qin, Steven Hand, Mor Harchol-Balter, and John Wilkes","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:56.455140Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:0c9e60a25b9e0d12476fafcfb09db80ba7a18df47db7a2c030c07f1eff39372a","observation_id":"45629afe-56f8-4ee0-9996-934479f69ee5","resolution":{"observed_at":"2026-08-01T09:10:56.455140Z","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-01T09:10:56.592454Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:56.592454Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:a0ac42446254dd83d3be639037eadb3176fb217f6a1c153e4cf2f25a9d6e4b97","observation_id":"41109a8f-1167-48d2-9551-b130e6c0bb53","resolution":{"observed_at":"2026-08-01T09:10:56.592454Z","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-01T09:10:56.737149Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:56.737149Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:122f3f7cc72e103d2b5988d9cdcd6c6b4aadbb273b7b7ba89d1950976eabacdd","observation_id":"fbc8598b-0b58-4f1b-8e5c-bbaefb6db4ac","resolution":{"observed_at":"2026-08-01T09:10:56.737149Z","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-01T09:10:56.897677Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:56.897677Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:d93e52489c2b62109ef639dc8594781a586f5bf6e5aab70ecc6421fb71ad320e","observation_id":"a75e804d-40c2-457a-bf31-a757abafead1","resolution":{"observed_at":"2026-08-01T09:10:56.897677Z","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-01T09:10:57.078233Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:57.078233Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:5947b3bbb9a63040a4a2563974be59ffdce4acb308b0fee3336ee2365b8cebc1","observation_id":"e0fa71cd-83ca-475d-9670-b80e74245e93","resolution":{"observed_at":"2026-08-01T09:10:57.078233Z","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-01T09:10:57.267221Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:57.267221Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:09326ecbaf3844d6e0550db11398bdfc6d458f7e20a409a4371075d142b54cf6","observation_id":"be28877f-aba3-434a-aa06-91052051bd63","resolution":{"observed_at":"2026-08-01T09:10:57.267221Z","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/s00778-024-00863-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TamerÖzsu, and Walid G","venue":"The VLDB Journal","work_id":"24a596d7-08de-4551-a065-ae857e870315","year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:57.446410Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:aeb3488ca9ca4859da225922144726cf91bc58cd55293687c85039d09ebef10a","observation_id":"5688cf41-9436-4c87-982f-c13f794593c4","resolution":{"observed_at":"2026-08-01T09:13:24.018182Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:57.767144Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:57.767144Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:d529d9894f4873c58cde3a4e64aff7b2113ed474806f785acb261ccb017d703d","observation_id":"827c3beb-e26f-4127-8241-f012b2ef0e6e","resolution":{"observed_at":"2026-08-01T09:10:57.767144Z","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-01T09:10:58.060784Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:58.060784Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:65d12139aabf34d41f2a1a196fb023cb48f021c6a03258983ac09bf1fd0a0e87","observation_id":"f6a9bf82-0089-4c54-b460-af0f0dcccf88","resolution":{"observed_at":"2026-08-01T09:10:58.060784Z","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-01T09:10:58.222598Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:58.222598Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:0187def6f4c13c6b2a6a5084456a483a72dbac0774f3a63420b77c03512dc420","observation_id":"b8050c52-a35c-4051-af96-87b8d9d4bbdd","resolution":{"observed_at":"2026-08-01T09:10:58.222598Z","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-01T09:10:58.384971Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:58.384971Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:598a676e06e32584878764b619bc1b1ce21b7a38184c95b56fe1f1b955d327f2","observation_id":"96b745a3-dc26-4c65-9ff4-687474478b7f","resolution":{"observed_at":"2026-08-01T09:10:58.384971Z","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-01T09:10:58.511097Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:58.511097Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:7b2652d8035a24b3fcd9a652275dfd3d9f7e80b428035bc64918fb4df587d21e","observation_id":"3198652a-0a27-48ed-8256-8761cddcbcbc","resolution":{"observed_at":"2026-08-01T09:10:58.511097Z","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-01T09:10:58.808619Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:58.808619Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:eab475dd5e9518ac6fc6425d2c9276e9404de512c41cccdad2e949c2b448dffb","observation_id":"831cc65e-7ba0-4c24-9abd-60ec42193b9f","resolution":{"observed_at":"2026-08-01T09:10:58.808619Z","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-01T09:10:58.936861Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:58.936861Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:072b4a3232208dd33d76d8dc26a35e473ca8fe6bae02ceb819c7e5398b58e032","observation_id":"0125d53f-e800-438d-976e-29d74574ff70","resolution":{"observed_at":"2026-08-01T09:10:58.936861Z","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-01T09:10:59.069702Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.069702Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:09f2d8c2c8c640aa28e631cc83930487a0d70231f6dd7fc7a33342e3589cecb0","observation_id":"197a88ea-b29a-4c34-baba-8e0dfef3b85b","resolution":{"observed_at":"2026-08-01T09:10:59.069702Z","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-01T09:10:59.239148Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.239148Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:441278a120caf5cd32c98c898af6ae97dc75dbe72c38c94ffd4cd3912acd6810","observation_id":"44ce47c7-299f-4ef0-81fc-f1fca6f44df6","resolution":{"observed_at":"2026-08-01T09:10:59.239148Z","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-01T09:10:59.550972Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.550972Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:b8add90c1d47afcb19a487e5ad295fa2a559d0bbb43d954f5ae4072ab6e36d34","observation_id":"d06d8c7a-a5a2-49b5-ab73-8e00b66b55f3","resolution":{"observed_at":"2026-08-01T09:10:59.550972Z","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.1145/3701037","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM Transactions on Storage","work_id":"80d30a3b-5330-47b5-8a21-bce3923041ac","year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.657398Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:64cfa67a7e9d6c3d8e6180ed2c8ede153dd4bf8bea3e9a80f0189da8b2b7fe23","observation_id":"7994a37c-42e1-410c-8414-0b8291886ab4","resolution":{"observed_at":"2026-08-01T09:13:23.903440Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:10:59.716996Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.716996Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:f6c7ddacc7a13c9756d44423249c0ab38582ec665ebea65e5c454ef2d7b2cc3f","observation_id":"e5e3bcb1-16b0-4c4a-bd6a-ca4821054513","resolution":{"observed_at":"2026-08-01T09:10:59.716996Z","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-01T09:10:59.805338Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.805338Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:73f1bd05ad9df14aa2330ccc59898c7fd8fe191e0cd5be98325122d784f0b72e","observation_id":"a668cd96-8f20-4a11-a900-9e80f115530b","resolution":{"observed_at":"2026-08-01T09:10:59.805338Z","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-01T09:10:59.909806Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.909806Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:b2adaa7ba50504981d1a09d99ab48c52e31b3876161eb19c9ebec157ea95d1ad","observation_id":"c85a3413-b5b5-4333-8dec-f36f061740d4","resolution":{"observed_at":"2026-08-01T09:10:59.909806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.06153","last_updated":"2025-06-17T04:00:42Z","snapshot_observed_at":"2026-08-13T12:27:54.880961Z","submitted_at":"2023-03-10T04:37:07Z","title":"CXLMemSim: A pure software simulated CXL.mem for performance characterization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.06153","snapshot_observed_at":"2026-08-01T09:11:00.003620Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.003620Z"},"links":{"cited_paper":"/paper/2303.06153","citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:feeff8f01f3ab526f280222357c3e6e3df469f74b1bae942b090d0f616fdd7f2","observation_id":"1d5421dc-f5c9-4627-98b9-ae6c39daed59","resolution":{"observed_at":"2026-08-01T09:11:00.003620Z","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-01T09:11:00.066604Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.066604Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:5818d9ad8dfaddea4089425e1fbe655000cd53c87e607bc280a977ad54ab00a5","observation_id":"bc36cef6-cc85-4d32-ac4a-9258658a3773","resolution":{"observed_at":"2026-08-01T09:11:00.066604Z","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-01T09:11:00.154838Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.154838Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:7d6327a654a570117b6561ad2c4eaf0c29736ca71114f29a38dd2a02d8419cf5","observation_id":"f3b54965-90bf-4d87-ae13-d36bed3e1ba0","resolution":{"observed_at":"2026-08-01T09:11:00.154838Z","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-01T09:11:00.312383Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.312383Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:85857687b5e74e6066dbcf6cc1cf675783b3a2cb440575f6e0f5cc7deda89b79","observation_id":"be535f5a-f825-4eae-95f2-10a495004157","resolution":{"observed_at":"2026-08-01T09:11:00.312383Z","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-01T09:11:00.371031Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.371031Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:d1f643005e9747fc5443df6c3ae3b80c5f807dd5b0c20df5a8e39ff5c46eb6a4","observation_id":"5a3b9fd3-4133-48ed-8c70-15b1d1f5cdc1","resolution":{"observed_at":"2026-08-01T09:11:00.371031Z","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-01T09:11:00.451509Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.451509Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:20ff2bbc155c45f6b5694978ba595a5c7039763bd3f6d5623dc6c6f70ffd5613","observation_id":"dc033740-db5a-4213-97c4-d088b458aefb","resolution":{"observed_at":"2026-08-01T09:11:00.451509Z","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-01T09:11:00.576466Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.576466Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:b09db4ab54b0130bae8f7d8fde175e7770ea04c2d8d81f235778eb22a700a048","observation_id":"e62f26a5-acd0-4cbb-a54e-730c6e2899c1","resolution":{"observed_at":"2026-08-01T09:11:00.576466Z","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-01T09:11:00.697830Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.697830Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:8cb43ac9847ecbdacdee1be8fac8c2ddf723ed941159dc078f09ff63a2e61c4a","observation_id":"f06ab395-2e5b-4385-ab63-663fa6809677","resolution":{"observed_at":"2026-08-01T09:11:00.697830Z","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-01T09:11:00.786634Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.786634Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:8d1444ea357332d62804d83c6f85c3106755dbeaad5ca3f12224e6f5216ec054","observation_id":"9e2e5fa5-1c51-4913-b046-53b8e817c6fa","resolution":{"observed_at":"2026-08-01T09:11:00.786634Z","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.1145/3698818","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM Manag","venue":"Proceedings of the ACM on Management of Data","work_id":"1b744f99-16d9-4304-b465-418c63994997","year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.230659Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:da688c00def944ca048581371cb88962fe2204c4171eccb527f4bdc17091a054","observation_id":"17c27c0c-faaa-477d-99b8-fc4472a65cd7","resolution":{"observed_at":"2026-08-01T09:13:23.785739Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:11:01.020196Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:01.020196Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:1397d44c92d66649d54e008d726970aa120f72eb48b4aed17ed0284e00c575b5","observation_id":"287196f9-66d2-4c36-ba53-e0daae32bf85","resolution":{"observed_at":"2026-08-01T09:11:01.020196Z","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.1145/3709656","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"4eec94dd-7629-4ca5-a157-07f5d0045cfe","year":2025},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:01.132242Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:2df8ca3280df5deae07a7bdbfa143d4ef03ef950a44781becadca401a4b3817c","observation_id":"9d143cd3-f60d-4f16-b453-2c3d5c0232df","resolution":{"observed_at":"2026-08-01T09:13:23.674538Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:11:01.250450Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:01.250450Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:81f1ea07c245fb23fb78e58077625cd1cba879bdf5a9ad6be004418746a15277","observation_id":"5d3279a8-7216-4d48-8011-35aac9a958c5","resolution":{"observed_at":"2026-08-01T09:11:01.250450Z","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-01T09:11:01.339719Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:01.339719Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:4d0ec442505ec548192657c20663b09ee3b655d96c1e68deb4aeb69e19ae6e3a","observation_id":"5582c1ab-04ab-46a6-b2b3-a8af9c889b73","resolution":{"observed_at":"2026-08-01T09:11:01.339719Z","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-01T09:11:01.476491Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:01.476491Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:214d70d9a1d235885278df023b994642346cc47760cec8a4932edd3af4ee250f","observation_id":"265a4bd5-f876-40a9-b89a-cb7410fa4320","resolution":{"observed_at":"2026-08-01T09:11:01.476491Z","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-01T09:11:01.601361Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:01.601361Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:9b786829afc7a44be6f6b804e11053e7f87ac1fde64e2f80269b45f151c63255","observation_id":"5658f0f1-daa7-4e5a-99ba-60bc6711b6b8","resolution":{"observed_at":"2026-08-01T09:11:01.601361Z","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-01T09:11:00.899892Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:00.899892Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:b7edc46196a3d1756a8550dff5a6a8166df185fa31710111723b9d02c1d9762a","observation_id":"d527fbf0-c35e-4980-af37-945c6e8b2c7a","resolution":{"observed_at":"2026-08-01T09:11:00.899892Z","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-01T09:11:01.726558Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-08-01T09:11:01.726558Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:6e315bf65921163c9d4139342c960dcc946de73aa12c75dbabbbde44d45e2ed9","observation_id":"4c727257-40bb-41f5-b5f9-8a41a36ccf23","resolution":{"observed_at":"2026-08-01T09:11:01.726558Z","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-01T09:10:51.575466Z","title":"In10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:51.575466Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:f07fe59b1fcf33e08d56afce926426ec0ca0188dbf6aeb27f25e37f65b6f16ac","observation_id":"eb7bf276-79ec-4df4-bec9-640fdaf335c2","resolution":{"observed_at":"2026-08-01T09:10:51.575466Z","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-01T09:10:59.366634Z","title":"InProceedings of the 27th ACM Symposium on Operating Systems Principles(Huntsville, Ontario, Canada)(SOSP ’19)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:59.366634Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:5dfb856ef3b11be66760da71532b9b5a5ac8865bdd9adaca15e46a3d46cef441","observation_id":"ade15e8b-f6ca-4241-8f5b-71dac3eb4f81","resolution":{"observed_at":"2026-08-01T09:10:59.366634Z","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-01T09:10:49.982079Z","title":"InProceedings of the Fifteenth European Conference on Computer Systems(Heraklion, Greece)(EuroSys ’20)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:49.982079Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:4dc2440b65b19e53be15a77cc58fd662520df940de91379e1a1a5e0235823c00","observation_id":"81491c7f-443c-46ec-a2ac-bf7c95aef1db","resolution":{"observed_at":"2026-08-01T09:10:49.982079Z","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-01T09:10:55.487382Z","title":"https://www.cidrdb.org/cidr2022/papers/p77-ryser.pdf","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:55.487382Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:2ab91d3604e1b4053f9248bea9b12c4ba9412de6c55bfa771c77fd86e0d2a2c7","observation_id":"91e5a8b3-1f59-428d-a36e-c0e41eb1ff7f","resolution":{"observed_at":"2026-08-01T09:10:55.487382Z","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-01T09:10:57.903509Z","title":"In2024 USENIX Annual Technical Conference (USENIX ATC 24)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T09:10:57.903509Z"},"links":{"citing_paper":"/paper/2607.20881"},"observation_digest":"sha256:f4c9f8641fca64e10cce4232fde63b173eb5f6d3482e98b0bd5fd8204824faad","observation_id":"14d83bf2-d1fa-49b2-a6b9-6e58e79e2cc5","resolution":{"observed_at":"2026-08-01T09:10:57.903509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20881","last_updated":"2026-07-23T03:04:09Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-11T14:39:44.195578Z","submitted_at":"2026-07-23T03:04:09Z","title":"DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":91,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":101},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 101 outbound references and 0 inbound Pith citation observations for arXiv:2607.20881."}