{"as_of":"2026-08-23T20:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f16d3bc2082b9db4e89d35c727d4fc827f0379b8dcb778134bab16863846ca7","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:13:15.608622Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2507.00839/citation-record","integrity":"/paper/2507.00839/integrity","json":"/paper/2507.00839/citation-record.json","paper":"/paper/2507.00839"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.566775Z","title":null,"venue":null,"work_id":"e5f711ed-c1e7-478c-aaff-3291acd6707f","year":2017},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.892875Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:ae1ec0b7aa9d14f431681dab2833b5ef0fb962245681f4fa43d558d68ae6f02b","observation_id":"ad9a9ad9-74c8-448e-92c1-7f29d5ab3b58","resolution":{"observed_at":"2026-08-06T21:13:16.572176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.548971Z","title":null,"venue":null,"work_id":"e63114ff-efe1-4577-b633-cb0b3bde84eb","year":2024},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.920256Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:1e57d4954f425e5ddf82c21153732820008c6d3da9e3b49be0c4328b70187bc6","observation_id":"3399db88-3fd0-4d9e-9bca-6bf38fdc0c88","resolution":{"observed_at":"2026-08-06T21:13:16.554905Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03619","last_updated":"2017-05-16T19:14:14Z","snapshot_observed_at":"2026-08-14T22:36:28.780654Z","submitted_at":"2015-08-14T19:46:48Z","title":"The GAP Benchmark Suite","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.03619","snapshot_observed_at":"2026-08-06T21:13:14.955608Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.955608Z"},"links":{"cited_paper":"/paper/1508.03619","citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:6f7188c092cbb72a454301a0daca991f5ec0fed806ca07eedd0f45a659697a51","observation_id":"6ab89b04-e8f8-4529-8d7a-e379342fe200","resolution":{"observed_at":"2026-08-06T21:13:14.955608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.530939Z","title":null,"venue":null,"work_id":"82a92b72-1dd8-4a7f-805b-d37af45aa2c2","year":2013},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:14.991085Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:df5a6d382e6b01c14243c0a601786d981767507b7c5bd7d9f1069d5ee3e2dc68","observation_id":"462a0b31-23b2-468c-8ed5-a1bf6effb584","resolution":{"observed_at":"2026-08-06T21:13:16.536409Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.514119Z","title":null,"venue":null,"work_id":"6d22d9fc-e851-487a-8dda-58c451972f53","year":2016},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.028367Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:803f7a57b6da7755cdcb49b3c4d7494e8a53d8a0041cf5462cf08efb84c75085","observation_id":"71cb15e9-2dd0-44f6-a624-dbed2761e074","resolution":{"observed_at":"2026-08-06T21:13:16.519531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T21:13:15.062123Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.062123Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:d84fdc138beea3f51b75b46015ef56e9fd9acea5d9235294a797064649dfdf56","observation_id":"ff862bb4-2837-45b4-80b4-19db9379ad42","resolution":{"observed_at":"2026-08-06T21:13:15.062123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.486788Z","title":null,"venue":null,"work_id":"17735c3a-2066-4333-8cde-576669153975","year":2019},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.096988Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:663996583b5157657f991a252af549c65a4f935dc6bf3e5b0da6ef001d16c363","observation_id":"1e25dcd5-0829-41e3-9f5f-dda53edad992","resolution":{"observed_at":"2026-08-06T21:13:16.491429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.470047Z","title":null,"venue":null,"work_id":"db5dc80d-3f79-4e08-be1f-78c4d03879c5","year":2021},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.134064Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:279798da161e57caaf04ee45d6b912fe6ff577ec25865f345baca01d73e2ddd9","observation_id":"5849e5ac-39dd-4e02-8f91-65514dfecc50","resolution":{"observed_at":"2026-08-06T21:13:16.475758Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.452509Z","title":null,"venue":null,"work_id":"54ce40a1-86c2-4247-9743-4438a9fa9850","year":2022},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.168210Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:f63b288e69b8d08cf3ef61342b4b754b14f93f418db3bf9462ff7f990b323228","observation_id":"fdc654f7-b390-4c59-acd2-14291ceb4791","resolution":{"observed_at":"2026-08-06T21:13:16.458381Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.435014Z","title":null,"venue":null,"work_id":"d16e15aa-ad48-465e-a12c-2aa2f39d64ab","year":2019},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.205175Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:947f03b7f20de21091ee52eb8899af4dd13930c8a8862787534fd359073fb73b","observation_id":"2da417c9-f9d2-47e3-b43d-391fbab9dbf3","resolution":{"observed_at":"2026-08-06T21:13:16.440186Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.418225Z","title":null,"venue":null,"work_id":"8ea02eaa-8401-4bc9-abd3-7a0e1b2195d1","year":2013},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.239683Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:dd86eee1c25e8ea75f85f2b106d013d1fcebf48d0398efb9b4aa86d78b6ac902","observation_id":"8a439aa5-7891-4a0a-acc0-41c5d437cdf5","resolution":{"observed_at":"2026-08-06T21:13:16.423255Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.401866Z","title":null,"venue":null,"work_id":"ba17740e-8008-4cb8-8fba-8ceebdc10ecd","year":2012},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.275405Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:708e9951584a1d56a25a6248ec445fb09eba68e32de79372538288aca3220c6b","observation_id":"5da85a2c-825e-49a1-b73e-7b86b2a60ffd","resolution":{"observed_at":"2026-08-06T21:13:16.407432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.385092Z","title":null,"venue":null,"work_id":"2cda4ee0-b9d6-4b68-ac41-0f6dba6dddd8","year":2021},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.312894Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:ef26e234097f174798dbdbd03b510f772d82f271ba80108330dae6e2a07acbf3","observation_id":"d7cc43c2-e9ed-47b3-b60c-89b90bb1fda5","resolution":{"observed_at":"2026-08-06T21:13:16.390755Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.365760Z","title":null,"venue":null,"work_id":"70436baf-08b0-43b4-835b-d70e60a9b5a1","year":2023},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.347840Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:39aff30082c14a5672b787b041894e76dc3db85726f889fde5663a3ede29841a","observation_id":"4c3f5c69-b23b-4fd9-b31b-97e59adc6717","resolution":{"observed_at":"2026-08-06T21:13:16.372116Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.347548Z","title":null,"venue":null,"work_id":"59eb68a8-a550-4b9f-9ab9-f5d73b2ce017","year":2022},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.383163Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:1beb9efa08d2040dd38408a02fce2c1627f880bb54bd09765b2c4b3c3cea0e27","observation_id":"5517ff53-e826-4457-836e-24f32bffefdf","resolution":{"observed_at":"2026-08-06T21:13:16.352826Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.330097Z","title":null,"venue":null,"work_id":"86aeab2f-2c61-4694-bb14-cc24d66bc229","year":null},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.389420Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:05675ac0fb65948ab600dac0ad2e6c0078a5f7e43dd7979c540cf402604c18cd","observation_id":"8c1f14e4-ad70-407b-ab1d-8560016b80e0","resolution":{"observed_at":"2026-08-06T21:13:16.335809Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.296596Z","title":null,"venue":null,"work_id":"f7dc0b5b-42c7-4ad9-8681-d3dfa33de4b5","year":2014},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.404812Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:af76373758c2a892e419a15661baa10785cdde9b90c24378fb0dd883612b4057","observation_id":"43546263-1b15-44cd-a824-6ee50b66cfae","resolution":{"observed_at":"2026-08-06T21:13:16.302321Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.279743Z","title":null,"venue":null,"work_id":"883cc3e2-f388-472b-bfcd-9713be282679","year":2018},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.411937Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:f84cef1e2ea2afba697d6bf0dd92c2f9f4ff6bf89f15e2ba01efec3ca0862392","observation_id":"49ab0766-8a84-49ad-ac52-f96abfefc8aa","resolution":{"observed_at":"2026-08-06T21:13:16.285325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.260381Z","title":null,"venue":null,"work_id":"eb17b556-81e1-4cc7-bb84-19b34b86bc41","year":2017},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.418387Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:f363fcfeed451eb3d041954503062cb68443c1e798f72005445e41a3c1c252ea","observation_id":"790d42f1-847a-49d0-a30b-62b9cc8777df","resolution":{"observed_at":"2026-08-06T21:13:16.266197Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.243761Z","title":null,"venue":null,"work_id":"0b3334d5-30bb-4a31-a6d7-94014df937d5","year":2020},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.424246Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:10af0b5cbddda62ab1bac9440b8a0f06dfbcc7a89e52a1eb1b90b06c548a2a53","observation_id":"13965d5e-266b-4e51-9986-8310653ad171","resolution":{"observed_at":"2026-08-06T21:13:16.249041Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.227331Z","title":null,"venue":null,"work_id":"9d80a20a-b4c7-4cbc-8bd9-3253a04e6ea8","year":2011},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.431232Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:b3ab2da9005d24119574476f4f8c20a6baf13200829b03427eef11d079552da5","observation_id":"2b130a9e-2f94-4efd-9593-baee5ebbc455","resolution":{"observed_at":"2026-08-06T21:13:16.232591Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.207149Z","title":null,"venue":null,"work_id":"391894a3-9876-4be8-8d63-abc911a452fe","year":2013},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.438913Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:53a71503ed18c916b4989466788d9168976c146467dc79415ccd9dcd383c9acb","observation_id":"7f13b07f-0903-438b-9780-ee3c0d1a29d2","resolution":{"observed_at":"2026-08-06T21:13:16.214653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.188486Z","title":null,"venue":null,"work_id":"61e8753b-82ee-4c8f-a075-487527278d20","year":2020},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.444810Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:37927b499a53bf61a70f9ee6f46bafc1ceb09402d19b9e9115040e5bbed0f966","observation_id":"b53a34ea-8718-480f-a369-1eaab1a03bff","resolution":{"observed_at":"2026-08-06T21:13:16.194156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.169766Z","title":null,"venue":null,"work_id":"667ce781-c619-4612-b116-d286ee1d607d","year":2017},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.450205Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:3f3f12fc593138946affae5f1c211e1163e7582b170d6b8e4da94729b6284072","observation_id":"5aec8b79-b541-4a83-bbb3-622487d6abda","resolution":{"observed_at":"2026-08-06T21:13:16.175544Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.153110Z","title":null,"venue":null,"work_id":"7fb93b4a-b683-476b-8d1c-961efd4165eb","year":2015},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.455362Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:07a2fcfc89d707b6af709b4b2a30a24081553e33a3d94e241a32ebcaad485f00","observation_id":"b7866faa-437e-48cc-889a-b61b2dde1240","resolution":{"observed_at":"2026-08-06T21:13:16.158434Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.136613Z","title":null,"venue":null,"work_id":"12868e9d-f5da-4205-a930-d590e76a22ff","year":2019},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.461248Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:5b683d8be612a0dbc5990c469a73c9f32ae5348a23fc5ab9333272e918d94b8b","observation_id":"4090bfc6-18bb-4bca-a1bf-f0afc2f6a5e6","resolution":{"observed_at":"2026-08-06T21:13:16.141931Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.119433Z","title":null,"venue":null,"work_id":"9766ed83-15a4-4f9f-a9ec-3df429975ae1","year":2014},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.467482Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:0ef4150311758e93d18d1114bfe2b27436a4988325e27f60d5f4406c075c19d9","observation_id":"66eb0a4d-5165-4884-9b75-38c2348f6f35","resolution":{"observed_at":"2026-08-06T21:13:16.124499Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T21:13:15.473974Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.473974Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:0aef8917219d576c747a210272df460fc76d177c47e629b5a98aa81c87c6d934","observation_id":"4e60a587-86ad-4298-af96-431a8cb982d9","resolution":{"observed_at":"2026-08-06T21:13:15.473974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.091751Z","title":null,"venue":null,"work_id":"cf36a5df-6496-490c-8fef-bb76dd0ad98c","year":2021},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.479202Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:92fa8a0ff81c4581596d08cf1c089d65b3de96ee4c3142134b28ad7c5000db46","observation_id":"e4a21732-7358-4e63-93b0-502c68068866","resolution":{"observed_at":"2026-08-06T21:13:16.097824Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.073832Z","title":null,"venue":null,"work_id":"f74accd9-772a-415a-9434-e09f1273ac03","year":2018},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.485035Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:c8b97e010f36d2e09186d9f8ee78824400a7a57a4c6f20c232ce6ee3b25c0e88","observation_id":"079ac45a-6db0-4350-a2aa-e6ed658a49ef","resolution":{"observed_at":"2026-08-06T21:13:16.079461Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.055751Z","title":null,"venue":null,"work_id":"5f8509a9-bed3-46db-944e-7de54bbb0741","year":2015},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.491762Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:7317dab841caf894aa47db14d5e23f29739a845146924641875632b31d9a7fe1","observation_id":"a295b365-f625-4ec0-9683-8ccb6f0ab150","resolution":{"observed_at":"2026-08-06T21:13:16.061602Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.036685Z","title":null,"venue":null,"work_id":"f5a8def2-e5e9-4795-98a8-7b51c08106a2","year":2014},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.497650Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:8977696785357f8868271bb20bde7b1d960e0ebd40cd76596f8b8e62d01b921c","observation_id":"a1836d9f-8b1f-47ed-b09d-ebad480b5c02","resolution":{"observed_at":"2026-08-06T21:13:16.043118Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T21:13:15.502849Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.502849Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:940b5cda8dba6e6920a0dde31d8d032e81aba786724989fa334ed97a664a6f86","observation_id":"33a2ce0c-c460-48b9-af7c-41d29b010f89","resolution":{"observed_at":"2026-08-06T21:13:15.502849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.507913Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.507913Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:f87408cfaea4b2b5fb115fded12bb80919fd4fccbd111e74b8414b663944d732","observation_id":"266790e4-3719-4774-ab36-6124d2f9a79c","resolution":{"observed_at":"2026-08-06T21:13:15.507913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.994040Z","title":null,"venue":null,"work_id":"9ff7bf1f-cd53-4048-9cab-ca7e0875d569","year":2023},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.513017Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:e42bfbc33d13f0645eee65459b210d2802198c879816c2949187a97b93beea89","observation_id":"d4dec81c-61aa-476f-8c9f-f6213ecd17fb","resolution":{"observed_at":"2026-08-06T21:13:16.000506Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.974094Z","title":null,"venue":null,"work_id":"9abf64b7-992b-4c7f-94fc-405110769e1d","year":2024},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.518427Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:94673ccfe0f540530981ecf3912cffc72c3c1c15769f46247130d158a3c86cfa","observation_id":"0e81f0ee-b0a5-4a87-898c-82b3b03722f0","resolution":{"observed_at":"2026-08-06T21:13:15.979953Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.955284Z","title":null,"venue":null,"work_id":"b2d94667-6c7c-4687-b577-6863add5438c","year":2013},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.523523Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:504a73488cba4bd37aca8f92e281a101d9c6523fa8b029a1f605318e250f72e7","observation_id":"7c816b02-289f-4534-bd0e-c2c919b8792e","resolution":{"observed_at":"2026-08-06T21:13:15.961978Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.936296Z","title":null,"venue":null,"work_id":"ef9be124-cb9e-4d8c-a402-e64fc7899835","year":2015},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.528449Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:0414e81a189318589bfdb1add9e08c1f4b6d62f899f6a21bceecdcc027ea858e","observation_id":"b4b64d53-22fe-4f81-8c15-895110e9186a","resolution":{"observed_at":"2026-08-06T21:13:15.941792Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.917892Z","title":null,"venue":null,"work_id":"26784e75-806a-4020-b900-1f3e650d2918","year":2019},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.533708Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:eb780ec86483692ab3bed1d3ca27e869674991ad83c70e93a1a5f5c607a140b2","observation_id":"98b8b99b-d946-480c-b362-3a964d991047","resolution":{"observed_at":"2026-08-06T21:13:15.923752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.899142Z","title":null,"venue":null,"work_id":"c17122a6-bb36-49d8-a346-8b746efc8444","year":2018},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.539015Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:d189a470215516fad6917f11a30368b1ae8fc6fa5a0227358a0680e585da0c75","observation_id":"68789aad-39c0-4a0e-9091-1cd3fee24366","resolution":{"observed_at":"2026-08-06T21:13:15.905113Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T21:13:15.544834Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.544834Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:910ab0d4a2d532b2a2e7bec9408b24bb8fceb2d4038da4ba93c5a38daf0dcf7a","observation_id":"b90733e6-1a57-4c3a-a08d-2a6211d20da6","resolution":{"observed_at":"2026-08-06T21:13:15.544834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.845707Z","title":null,"venue":null,"work_id":"457ceded-8e9f-4217-9c80-b5739a28198a","year":2017},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.555424Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:ce8f57a765203679b002485ecb11409c0e2aac34a5b1d42fe4052f23f2460ec7","observation_id":"329ff257-d690-4d8f-9424-727ae81d01b3","resolution":{"observed_at":"2026-08-06T21:13:15.851519Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06T21:13:15.561782Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.561782Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:256770756435c71c8d79a9999c23a23329e6b2139b7ad3a8c033af99dc690a92","observation_id":"9fecdec0-e029-4f2b-a89d-b0cb30cef101","resolution":{"observed_at":"2026-08-06T21:13:15.561782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.794849Z","title":null,"venue":null,"work_id":"f5654b49-1cca-4602-b729-d0551c368ada","year":2018},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.573469Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:4dcc77c8494895322499bbe9dd08a1b0c24268923340ab64e3f9393c74474d5e","observation_id":"fce0c2aa-9a87-4ce3-975d-3bc16c7af4c6","resolution":{"observed_at":"2026-08-06T21:13:15.801083Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.771931Z","title":null,"venue":null,"work_id":"5836260a-2957-48e9-8f7f-5ad07aefe6e3","year":2024},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.578855Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:75ad23887fe1e2bb18d26b04065507aef2ae2eb6c8253b644f75574bb62557e4","observation_id":"e6c08561-7d7b-4b2a-a04f-01ac33134850","resolution":{"observed_at":"2026-08-06T21:13:15.777448Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.752660Z","title":null,"venue":null,"work_id":"5b879f79-dcf7-4c3d-a3b9-91c3eb93c9ac","year":2020},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.584090Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:9258d9f455083ab8f5a294d4d270713b3d62574f0c1f07772ce7d7e06cc3d9aa","observation_id":"423d1e9b-aad5-4bf1-bf3e-0bf27edb08ef","resolution":{"observed_at":"2026-08-06T21:13:15.758678Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.734090Z","title":null,"venue":null,"work_id":"e5cf831b-d523-4e5f-ba35-13f252a1a4e8","year":2024},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.589848Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:ceec9dbb4631fc9e8ddd484fcdca82656388c350bc2d784cfc6b6f91744e5eed","observation_id":"18210468-ac82-448d-abb8-7835ee72b0a1","resolution":{"observed_at":"2026-08-06T21:13:15.739184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.713737Z","title":null,"venue":null,"work_id":"26f0f756-24e2-4193-babd-5bea907b9e03","year":2022},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.596064Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:91c26958cf3b57ffd6ccb2386f904f21c062077d0515f4c7e8b8f92f41c8fae8","observation_id":"740632b8-1ecc-429c-8963-59a86c808bbb","resolution":{"observed_at":"2026-08-06T21:13:15.720586Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.05773","last_updated":"2020-08-29T15:30:15Z","snapshot_observed_at":"2026-08-19T02:32:09.943385Z","submitted_at":"2019-10-13T15:57:13Z","title":"LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans","version":2},"cited_work":{"arxiv_id":"1910.05773","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.05773","snapshot_observed_at":"2026-08-06T21:13:15.653109Z","title":"LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans","venue":"cs.DB","work_id":"ebbc5b3f-503f-4398-8d58-f2cc8f1c1364","year":2019},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.602156Z"},"links":{"cited_paper":"/paper/1910.05773","citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:42ce2115f01670d672cc0ac8372790c3de7d8222964960d9a04c59afa4ae09a5","observation_id":"7593dd51-08a5-4866-a3b1-d581aab0c410","resolution":{"observed_at":"2026-08-06T21:13:15.661797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.695202Z","title":"The condi- tion𝑡𝑟 =𝑡− 1 enforces that writes with earlier timestamps have already advanced𝑡𝑟 , thereby preventing out-of-order commits","venue":null,"work_id":"7272fad9-d0c9-4981-b1f5-537194556904","year":null},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.608622Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:68375cdbf44db618ccd0998b56e4c31e8445ebbbd9c3be3c8f2efcf169d645e7","observation_id":"14b8590e-d2fe-4008-9e69-3635e16b102a","resolution":{"observed_at":"2026-08-06T21:13:15.700549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:16.313173Z","title":"In 10th USENIX symposium on operating systems design and implementation (OSDI 12)","venue":null,"work_id":"f349a5d5-a53e-496d-bd4a-b4bd5dcd8a63","year":null},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.395520Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:c8bfc4209a3f037d51682394c83c794e506d3d9a579cf58994c82632431993ba","observation_id":"40938aa3-5127-4be5-8b90-cd813b8813f1","resolution":{"observed_at":"2026-08-06T21:13:16.318609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.865379Z","title":"In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles","venue":null,"work_id":"4c019335-7568-45e1-8ba4-e12ca611671f","year":null},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.549894Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:a6c84d7b03be40a55fa5b13457ff96e7185f72c5df0b5a9b12fa27a4af3bb1e5","observation_id":"210db7a4-ccd3-45ea-b4bc-7f6d332642e8","resolution":{"observed_at":"2026-08-06T21:13:15.871977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:13:15.815952Z","title":"inverted list compression","venue":null,"work_id":"5031f4f8-62a2-4740-af3e-2917983716d5","year":2017},"citing_paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-06T21:13:15.568077Z"},"links":{"citing_paper":"/paper/2507.00839"},"observation_digest":"sha256:cd4692c0e9d2262eb4d8a42389f9bd37f7cbc324b1a31a0ce757945b234b2b09","observation_id":"3f1751da-87f1-407b-a87f-f1d1f3abb094","resolution":{"observed_at":"2026-08-06T21:13:15.821989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.00839","last_updated":"2025-07-01T15:09:19Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-15T18:19:49.751864Z","submitted_at":"2025-07-01T15:09:19Z","title":"RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":53},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2507.00839."}