{"as_of":"2026-08-21T10:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e63965eecabc95068af146030befeb9af4499cd1500a0fd2f8b3ecc69128dac","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:59:45.403518Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/1908.11850/citation-record","integrity":"/paper/1908.11850/integrity","json":"/paper/1908.11850/citation-record.json","paper":"/paper/1908.11850"},"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-14T11:59:45.948748Z","title":null,"venue":null,"work_id":"ee3e6715-5b2b-44c3-8fc1-85f7e96aab73","year":1967},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.241838Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:a11f6f1385cac380ebacd081c68dbff14a7224927f387d61df49d2b8d29f6101","observation_id":"bda2d575-7e15-4e28-89d2-3a1c8e4b57a5","resolution":{"observed_at":"2026-08-14T11:59:45.952769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.937701Z","title":"nvm malloc: Memory allocation for nvram","venue":null,"work_id":"72eb04e4-6836-4a16-962e-4455fbda99ff","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.247233Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:660a0310bc5ea4a77368b5e73411acbff077b17258fb3d11a25c8e2b5b0bb30c","observation_id":"5fa1a41a-c631-485b-9154-f316b359a089","resolution":{"observed_at":"2026-08-14T11:59:45.941241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.926900Z","title":"The parsec benchmark suite: Characterization and architectural im- plications","venue":null,"work_id":"d24e6097-e098-4201-a1dd-e49dc60a41ed","year":2008},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.251780Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:a68c79dcd6dac52d2f8de91a4ac61f36b0fcca34e7214e7ddf0de10e17aab9ad","observation_id":"eb819db2-12ce-4b8d-af7f-ee15e8f66f42","resolution":{"observed_at":"2026-08-14T11:59:45.930667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.917600Z","title":"Caulfield, Joel Coburn, Todor Mollov, Arup De, Ameen Akel, Jiahua He, Arun Jagatheesan, Rajesh K","venue":null,"work_id":"2b6be938-bb67-4495-ab00-351f22fd0f4d","year":2010},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.255805Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:76124c8bb4903da793b83f57b938883b6c628bd1f5806d10b2d8f5f8782ded62","observation_id":"4e2c2088-d533-4888-aad3-3dd35a98cb40","resolution":{"observed_at":"2026-08-14T11:59:45.920932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.907522Z","title":"Chakrabarti, Hans-J","venue":null,"work_id":"974433d0-ecd9-4012-9e0e-4d39359ad779","year":2014},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.260099Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:3c1bd6af097ce9ab2a9247685f0719c29e5f349efa6c9759656f51657e0ba7ff","observation_id":"0b2b1590-ecda-4243-89fc-2e5eccf28754","resolution":{"observed_at":"2026-08-14T11:59:45.910935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.897168Z","title":"Persistent b+-trees in non-volatile main memory","venue":null,"work_id":"f135eeee-fab9-4e23-944c-1fdeedd8dca7","year":2015},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.263738Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:2a69a471b2f0306e4450d21d2670d432e9cfe8d56515f00bc72c30066d96f120","observation_id":"281215da-3561-430f-a32b-a55635a8e30b","resolution":{"observed_at":"2026-08-14T11:59:45.900606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.886714Z","title":"Caulfield, Ameen Akel, Laura M","venue":null,"work_id":"642d378a-0dc7-4e7e-857e-c223538989ef","year":2011},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.267943Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:9533b1ebcff67ce827129596312ee7af0b564ea9e2d1e6341152c9d5c89c7577","observation_id":"2ef58eb5-d3c4-466d-adf0-77af69e8bb21","resolution":{"observed_at":"2026-08-14T11:59:45.890478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.876552Z","title":"Nightingale, Christopher Frost, Engin Ipek, Benjamin Lee, Doug Burger, and Derrick Coetzee","venue":null,"work_id":"2f68c2f2-b016-40dc-86de-a8795a30d587","year":2009},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.271041Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:8a3aa543a6e4ecd8327ccf7bc3bac18ad388272f980b07ef25a2b86c2ef5891a","observation_id":"bace8c72-2a66-4814-9579-3c56e1b35921","resolution":{"observed_at":"2026-08-14T11:59:45.880139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.865674Z","title":"Two more approaches to persistent-memory writes","venue":null,"work_id":"a7a9566c-1163-48c1-8921-8ca5772ee946","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.274996Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:27cda2206f464f23ac9f3aea74761e6382174a2f90dc394a5567eada9ba7760d","observation_id":"04d8e210-eaf0-4825-9fe0-2382475d19a6","resolution":{"observed_at":"2026-08-14T11:59:45.869563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.855344Z","title":"Romulus: Effi- cient algorithms for persistent transactional memory","venue":null,"work_id":"52371554-ffd7-4830-9c30-75ea529d7550","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.278728Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:2c6e2c95903978cb98c17113a471ad1d92e81646553951d170001011cbb1e126","observation_id":"cd56d4a3-69d2-4241-bae1-79bd4a8d4da9","resolution":{"observed_at":"2026-08-14T11:59:45.858946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.843332Z","title":"Containers library","venue":null,"work_id":"be091f97-86a6-4b5a-a9f0-7c7a2b60d9bf","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.282027Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:388d2f75c2706835b735a8f57a523e7a3609b7facee7a6003db330b5944433b3","observation_id":"39e8c31d-71b1-4922-930e-3bb933b092f7","resolution":{"observed_at":"2026-08-14T11:59:45.847190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.831296Z","title":"The university of florida sparse matrix collection","venue":null,"work_id":"5160d3e7-54c4-468e-a692-69912d7e1f12","year":null},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.285429Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:540de772dec186d4bc61d42f6475fcd60173eaf7603eaa4fcc0b197a88cea2d1","observation_id":"7b6ca2cb-4d91-4bfd-8884-8e6bbd59194f","resolution":{"observed_at":"2026-08-14T11:59:45.835446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.821499Z","title":"Driscoll, Neil Sarnak, Daniel D","venue":null,"work_id":"6ab48fa0-0bfc-41ca-a729-ed8c9d5902b3","year":1989},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.289406Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:15fb9b7797e76badc70f7b7c2792da592270e2e7e7151fd9eb2fa7cc23ae035a","observation_id":"f1e9ca56-cadd-4146-aa9c-8c332d557bfb","resolution":{"observed_at":"2026-08-14T11:59:45.824911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.809008Z","title":null,"venue":null,"work_id":"42802e03-39d3-4dc3-b837-b2ab6b415eaf","year":2015},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.292800Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:d356df15b7020692ecd8188148171db95d27e0ce1f230594770a2bbe6e7be92b","observation_id":"48ed55c6-5cfb-4475-9cb5-c925b0c0d96d","resolution":{"observed_at":"2026-08-14T11:59:45.812860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.797219Z","title":"The recovery manager of the system r database manager","venue":null,"work_id":"6ed0b68e-4cfc-4139-8fc6-5e9bc087933b","year":1981},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.296583Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:977f13e71a9ed3afcaf8ae4ddc7551b1416d145ed5ff6bea10a5476b6785beb6","observation_id":"1fca6ce5-c804-4ce8-9efc-cdb18f96bff8","resolution":{"observed_at":"2026-08-14T11:59:45.800635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.787218Z","title":"Intel optane dc persistent memory operating modes explained","venue":null,"work_id":"8ea7bc4c-fbbf-4ccc-bd5d-265a6341cb0f","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.300179Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:9b6cc12406e4744de4cb5f9d1d00f13933bd3fabbfcf1f1dbf01be8ade199b8a","observation_id":"42e1aca2-21a3-4b0d-87c8-d300dbd7e772","resolution":{"observed_at":"2026-08-14T11:59:45.790731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.775932Z","title":"New release of pmdk","venue":null,"work_id":"2c8bd134-cba8-4e90-9312-bf775acebe75","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.303254Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:927a611c17dbf5ac4e65b5cd7296f53b0b6656fc83e10a843d406dfcae0f3874","observation_id":"e7234627-39f8-4fc0-8723-359482f93562","resolution":{"observed_at":"2026-08-14T11:59:45.779811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.766089Z","title":"Persistent memory development kit","venue":null,"work_id":"8e9323a1-31d0-4205-a245-a842a806fde5","year":null},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.306444Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:f88f73f035446a759c63b684d0c06ab1584ae33bbf8baf7aa820ebafbad75421","observation_id":"ea3d7e0b-1645-4ef7-8219-2d3af23cfcc5","resolution":{"observed_at":"2026-08-14T11:59:45.769509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.755081Z","title":"Pmdk issues: introduce hybrid transactions","venue":null,"work_id":"c018e797-f338-4c80-8ca6-2259be3cfe48","year":null},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.309691Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:facb15e69c131d40eaeb30e4239553a89d8addf67731f097b7e29397e11ea14d","observation_id":"9fca2479-edf7-4644-af36-6fbce2e766b9","resolution":{"observed_at":"2026-08-14T11:59:45.759761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.742870Z","title":"Intel optane dc persistent memory readies for widespread deploy- ment","venue":null,"work_id":"199075d9-06aa-4f5b-aa44-bf9225c32b8b","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.313365Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:564398f90b15af280a62c2115c797223d9a0a2205288135d2dbe23e2697566a0","observation_id":"4ccefa79-2032-498b-a189-4a4bb45767fb","resolution":{"observed_at":"2026-08-14T11:59:45.747586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.732355Z","title":"Intel optane dc persistent memory","venue":null,"work_id":"42c5ee37-2df4-480d-b2b3-1eb667db76a6","year":2019},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.316629Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:c82f2bfa9f3c6877a78d81d0bc30bca176a0133348e2756f068fd58bbbf52cc7","observation_id":"6450eb92-25b0-4180-a799-b51aa7808ef8","resolution":{"observed_at":"2026-08-14T11:59:45.736325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.721312Z","title":"Failure-atomic persistent memory updates via justdo logging","venue":null,"work_id":"e1448ac5-70e0-45b0-b9f8-72f807d2f7ed","year":2016},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.320124Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:6a6e766da3fef973edb0c37f80608d8ca9f7b512eff00a944a7df7c30b31236d","observation_id":"2dc91419-f016-4808-8ce1-07adff0fb8f8","resolution":{"observed_at":"2026-08-14T11:59:45.724799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.709906Z","title":"Dulloor, Jishen Zhao, and Steven Swanson","venue":null,"work_id":"edb621ba-5766-4da8-9a36-b7b1e3835edb","year":2019},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.323521Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:32e50f06da016d15c8f40dc9f8ed3b583c2d5764688b9b45e29c9b60ab53a24d","observation_id":"42c97d39-9b11-40d8-b2b5-99107f371b72","resolution":{"observed_at":"2026-08-14T11:59:45.713904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.699647Z","title":"Ef- ficient persist barriers for multicores","venue":null,"work_id":"2466c7d4-ea3a-43e4-9aa2-3695cf2ac3df","year":2015},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.326628Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:448cc0f278ace7fb176b2ca7cb9abdd5a1304c3c1ee44863ad019715b817d123","observation_id":"3f1615a5-b3d0-404a-af3d-2d5b209b14b0","resolution":{"observed_at":"2026-08-14T11:59:45.702988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.688946Z","title":"Karp and Horace P","venue":null,"work_id":"dde82f17-41d3-4224-a99a-6f17443c6656","year":1990},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.329533Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:e30d86f56cef086c74e89c71af38879f0a61fb111c4411487f2ba330c55e74c0","observation_id":"5e04b8c7-e557-4675-85d5-01faf72fc5d3","resolution":{"observed_at":"2026-08-14T11:59:45.692786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.677276Z","title":"Chen, Satish Narayanasamy, and Thomas F","venue":null,"work_id":"250e0a92-8be1-4d3b-a152-715729d5867a","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.332172Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:24d566bcebb92ce640adcd42413cdda4d94e8c2b29d960fa13dde775330b528b","observation_id":"2b0aa4a2-f85d-411f-b9cd-1796c9cef4e6","resolution":{"observed_at":"2026-08-14T11:59:45.681250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.666570Z","title":"Chen, and Thomas F","venue":null,"work_id":"8bd5818f-6ef4-44bb-afcd-e4dd5b7abd39","year":2016},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.334740Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:b6b20db02a7ead8f3e52e9f66aef95fe5e9cf3cc678bf5d7193c0ec82a27826f","observation_id":"e5ef7a46-e3f6-4142-a2c8-c9d332c20ed8","resolution":{"observed_at":"2026-08-14T11:59:45.669713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.656751Z","title":"Chen, and Thomas F","venue":null,"work_id":"e80c2f3e-1633-470e-912c-4111269b7bcf","year":2016},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.337320Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:d11935e3daa033623be6a8e51ebe5783bc0836830799964474399fae3d01ae40","observation_id":"bc351872-97e3-4f6d-b4c4-f705ad3433a3","resolution":{"observed_at":"2026-08-14T11:59:45.660474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.646291Z","title":"Vetter, Gabriel Marin, Collin McCurdy, Cristian Cira, Zhuo Liu, and Weikuan Yu","venue":null,"work_id":"378e5dd9-3441-47a9-825b-112a826fae1f","year":2012},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.339904Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:82e641ca70bb51385972ba211700909435f31f7442bc60f1e699c76ac7bca4ec","observation_id":"45f7be97-928e-4abb-b9e9-160b224bcbfc","resolution":{"observed_at":"2026-08-14T11:59:45.649798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.635971Z","title":"Dudetm: Building durable transactions with decoupling for persistent memory","venue":null,"work_id":"08b696e9-14b3-4c89-8392-8d9d9f57419e","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.342582Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:3a23106bb2181230260898e03afbbb7c1a87fd5baa7b3117df90f494aec33f7d","observation_id":"856e6360-0ea5-49ae-bfb7-5b9d47c8421c","resolution":{"observed_at":"2026-08-14T11:59:45.639754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.626006Z","title":null,"venue":null,"work_id":"be25c97c-4747-4e63-8d17-b4f4e2fb567e","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.345216Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:0506581fca3ebafe9b70dc4fcf82adcaabc9ddee69095772ac0507a33aa3d29a","observation_id":"4bcf6e90-3e1e-4761-9236-3a854e4be391","resolution":{"observed_at":"2026-08-14T11:59:45.629438Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.614735Z","title":"Pmtest: A fast and flexible testing framework for persistent memory programs","venue":null,"work_id":"93e8c00b-3c95-43f8-817e-83075fd47f4e","year":2019},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.347623Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:7b74718cc65aaffe8eb72259e38b83c9b5c308afc56c3815212f59144c5253c7","observation_id":"2e373e42-a150-4f2d-82a9-75bef2a0a0c3","resolution":{"observed_at":"2026-08-14T11:59:45.618405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.604668Z","title":null,"venue":null,"work_id":"ae1c1bd6-c602-4c99-82bd-6252eb2c8dfb","year":1977},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.350217Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:22497a80678396310bb50e8fd3fe940aeee20fed2cf21bd0fd27fe61981764c0","observation_id":"d932cc18-5eee-474f-a405-b574b16a8dc6","resolution":{"observed_at":"2026-08-14T11:59:45.607808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.594776Z","title":"Nalli, S","venue":null,"work_id":"2375db33-6ad4-4983-a392-7ef3131cc961","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.352832Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:62168e8ba89aa6e09c0ab4dc9ed1417877332ea95529b9a5b67310d082e0deb9","observation_id":"5b8e832c-fb2e-4a8c-83f0-09fbd5a8f6ef","resolution":{"observed_at":"2026-08-14T11:59:45.598279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.584164Z","title":"Morrey III, Dhruva R","venue":null,"work_id":"d9aa28c7-bb11-4524-a9ae-549eef705cc2","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.355274Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:a18165a0f37e99279ca4fca444809ee828acdceeed112c6b0857d3c1e39b8e74","observation_id":"1463663d-7090-4842-93b3-e6b4ae98c2ff","resolution":{"observed_at":"2026-08-14T11:59:45.587496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.573804Z","title":null,"venue":null,"work_id":"0ef59b3d-7daf-4b5f-ade2-3615ea3bdf3d","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.358202Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:addd4a8f7bc1e44dbdb77a1acac1de5657dabffefe00f4aaaa28158fee83e20b","observation_id":"f3c695a5-c3f3-416d-b32c-9f263e6fef9c","resolution":{"observed_at":"2026-08-14T11:59:45.577346Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.562894Z","title":"Purely Functional Data Structures","venue":null,"work_id":"03472258-6c74-4ac0-875b-590abe105a45","year":1998},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.361517Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:9059c74ea0eeee369ad15591eecfe3adfaf7bf89bdfb55e5c947ad7b9a9ba4a2","observation_id":"683adf67-21ee-4bb7-a649-b7a8608de3dc","resolution":{"observed_at":"2026-08-14T11:59:45.566900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.553513Z","title":"Chen, and Thomas F","venue":null,"work_id":"03582d42-9558-44a9-9962-7f3acdc66027","year":2014},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.364823Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:05185c14e4ac6524f0a4f2681b3d6a459de1236ab057cee6f0b51c37a8f57cdb","observation_id":"ee7402dd-8dfc-4150-bc50-c201b7f048cf","resolution":{"observed_at":"2026-08-14T11:59:45.556802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.542539Z","title":"Persistence for the masses: Rrb-vectors in a systems language","venue":null,"work_id":"3414021b-874b-400b-a793-377ca72dd43a","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.368002Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:562c75fea1448b5c2908da3ae99fd1ad356d1032a13f5567ac6f55a41e95d0ae","observation_id":"76f16c97-64fa-4f6a-bdab-008b6fc282cb","resolution":{"observed_at":"2026-08-14T11:59:45.546305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.532338Z","title":"Proteus: A flexible and fast software supported hardware log- ging approach for nvm","venue":null,"work_id":"31b49024-062e-47de-b298-aa69356dffca","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.371709Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:48b6809538c8d6bdbde7f4e1114436d4a5155db711add5c2741de614361e3ee7","observation_id":"108a8197-131c-4693-9e23-21d8d3278ade","resolution":{"observed_at":"2026-08-14T11:59:45.536144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.521849Z","title":"Hiding the long latency of persist barriers using speculative execution","venue":null,"work_id":"773dbe16-b6e7-4d29-a6b8-30b4180b421d","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.375202Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:4d9fe62dada25d4dbfc8e3ad5003cd98fe996ac4ee913afa67145a26bbd2ee23","observation_id":"0e111e29-fe30-4a44-ab2d-de1df7bff70a","resolution":{"observed_at":"2026-08-14T11:59:45.525150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.510951Z","title":"Efficient Immutable Collections","venue":null,"work_id":"fe7aec16-6724-4a70-82ed-23b991d2bd8e","year":2017},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.378714Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:90d7f7918990c374beb96ab18d272d433821288ad7fbecc2d7adc0dbc381f85e","observation_id":"1f32159a-5f5b-4d6f-900b-b2cc7e53a688","resolution":{"observed_at":"2026-08-14T11:59:45.514509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.501012Z","title":"Steindorfer and Jurgen J","venue":null,"work_id":"53eb1597-9aa5-410d-a3d8-15a704659c41","year":2015},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.382215Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:43d76c0db4df92dc724c01e2393f786db23caf70f31a8f2d05e546f95a2a59fe","observation_id":"3b0d486f-17f6-431e-94e7-5dd1830b1bb0","resolution":{"observed_at":"2026-08-14T11:59:45.504288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.489244Z","title":"Rrb vec- tor: A practical general purpose immutable sequence","venue":null,"work_id":"5a21bd91-c97e-46b2-8559-161081c3b80d","year":2015},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.385543Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:d5724fd494678a72fe2ac23e4701080edaed0184bacf05263f5a4d28242f63e7","observation_id":"751f3dae-fd0c-4858-a816-b102bd4b1feb","resolution":{"observed_at":"2026-08-14T11:59:45.493118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.478317Z","title":"Campbell","venue":null,"work_id":"ec8b924e-b73b-44db-8d68-5133f3485e39","year":2011},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.388898Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:f72f89719f2d68eadd5686fc53b9508f5f9d4679d8412d15339c7704911a1ba0","observation_id":"6f8516cd-1a3b-4ee8-b315-9a988ba52d1d","resolution":{"observed_at":"2026-08-14T11:59:45.482061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.467034Z","title":"Intel memory latency checker v3.6","venue":null,"work_id":"103e9d28-f569-4dea-b95e-c6b65a20ac0c","year":2018},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.392639Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:bc1e4ec3760b117af3b0214ed1addaf56da4f63f5ac65770e9f4508f240b4d41","observation_id":"2f54f712-6393-4ac2-a1f2-9172f85c3880","resolution":{"observed_at":"2026-08-14T11:59:45.470887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.455083Z","title":"V olos, A","venue":null,"work_id":"29348f80-0225-4c16-9e51-c8aa468723d7","year":2011},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.396193Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:b3dc5a3f8717c079b53a5b31df73ba254102c502a14168c4e30801ff022d576e","observation_id":"31e26b8c-2f36-4852-afca-f2a2926b99ba","resolution":{"observed_at":"2026-08-14T11:59:45.458714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.442778Z","title":"Dax: Page cache bypass for filesystems on memory storage","venue":null,"work_id":"b8157267-32d0-435a-915c-879a7d2a860d","year":2014},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.400263Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:6c642ec6b349081c6340fd1e6c4cd173192880008334b0b8e0e84b8b722e9281","observation_id":"eed5c462-34fc-467a-8fe8-2fc408f18626","resolution":{"observed_at":"2026-08-14T11:59:45.446811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T11:59:45.426708Z","title":"Nv-tree: Reducing consistency cost for nvm-based single level systems","venue":null,"work_id":"7cfb6cf6-a850-4a64-976a-b002a7b623d8","year":2015},"citing_paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T11:59:45.403518Z"},"links":{"citing_paper":"/paper/1908.11850"},"observation_digest":"sha256:dcdc64a24659b690eeaeb506cbe597c36e19fb088617fae8cb9d779b3fe43e26","observation_id":"fef824f4-9f66-4e89-b538-e1d1fde60c0a","resolution":{"observed_at":"2026-08-14T11:59:45.433440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.11850","last_updated":"2019-08-21T15:11:31Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-19T20:36:19.592335Z","submitted_at":"2019-08-21T15:11:31Z","title":"MOD: Minimally Ordered Durable Datastructures for Persistent Memory"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":49},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:1908.11850."}