{"as_of":"2026-08-19T15:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ecdf69a7365f509622ea11abd2c3bb2c1cb7966608ca44635780c7f944840f8","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:22:02.075988Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/1909.01531/citation-record","integrity":"/paper/1909.01531/integrity","json":"/paper/1909.01531/citation-record.json","paper":"/paper/1909.01531"},"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-14T05:22:02.902970Z","title":"https://bitcoin.org/en/bitcoin-core/","venue":null,"work_id":"e79a27e3-5ef5-4cec-a686-268a8ba816df","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.840876Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:e83953b00f6055dd89a16e2a18fb8e77ccd5816dee049a63a4dd8cf28f2c58f2","observation_id":"59dd601d-641c-429e-9817-24bfdf4d5854","resolution":{"observed_at":"2026-08-14T05:22:02.907544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.888569Z","title":"https://bitcoin.org/en/ \\developer-reference","venue":null,"work_id":"dee43256-59c4-4173-b8cb-226718aa87fe","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.846480Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:d89c58139fa5ae477c858bca3c136069d79e7ce6f9fce27431b810fb506004bd","observation_id":"f021262d-6b8f-49ba-9410-5eda7619bf8d","resolution":{"observed_at":"2026-08-14T05:22:02.893240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.874582Z","title":"https://bitcoinwisdom.com/ bitcoin/difficulty","venue":null,"work_id":"db600ab4-20f9-4561-bda3-3030a284c5a4","year":null},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.851033Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:de0426039c62a5b8af851fb23ebe60984d200928c10d32f49a3e5ec3b33419ec","observation_id":"5069f055-36d1-4eb3-9b91-5e3e05a60448","resolution":{"observed_at":"2026-08-14T05:22:02.879265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.861078Z","title":"https://bitcoinj.github.io/","venue":null,"work_id":"b5e3024e-8117-441a-89ed-67afd32e935e","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.855778Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:a9ccaa7e8d70699006edf68ca2ed343d4606f14ad4fcb4367d719ebc951326d4","observation_id":"03ea4dc0-14c0-4e30-8100-ba63adeb06e5","resolution":{"observed_at":"2026-08-14T05:22:02.865487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.846906Z","title":"https://electrum.org/","venue":null,"work_id":"0722599c-7882-4550-a48f-9f1bbd8447e0","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.860374Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:d569d4abc986a0019ff411bddabc4de21e23c86078078e6b940f16503257ee17","observation_id":"b6075e96-f069-4ddf-b494-0003bc1ef92a","resolution":{"observed_at":"2026-08-14T05:22:02.851885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.833025Z","title":"https://github.com/cinemast/libjson-rpc-cpp","venue":null,"work_id":"7b85d37d-53aa-47bd-9c5f-7012b16b3d8f","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.866086Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:8e61cf28dc06584e51d3565d3e36bf29f02f4e12eb60a29617b4121559332775","observation_id":"521ab940-fec2-4315-9c6d-df877b7dd8c0","resolution":{"observed_at":"2026-08-14T05:22:02.837621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.818841Z","title":"https://keystone-enclave.org/","venue":null,"work_id":"b0493d10-dab8-4f15-9606-282c0da0c799","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.870423Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:2a93bf93231560faa13b3ab6175796fe288debb1b382c06ed6669d6117f4a8ba","observation_id":"507df295-c3d2-466a-8c46-539d7c73aeb0","resolution":{"observed_at":"2026-08-14T05:22:02.823043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.804938Z","title":"https://github.com/petertodd/python-bitcoinlib","venue":null,"work_id":"6c25efbc-571f-45bb-a1b2-ba86422ce1b5","year":2019},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.875411Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:1efc79d263136735a8e91a01f9aea60867e247604425f04e8f07239b6e8593f5","observation_id":"64a4d2b0-13fa-447a-b257-41233473c331","resolution":{"observed_at":"2026-08-14T05:22:02.809417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.791002Z","title":"In 28th USENIX Security Symposium (USENIX Security 19) , Santa Clara, CA, 2019","venue":null,"work_id":"e48a79f1-530b-4644-834a-1f2abaa417e1","year":2019},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.879926Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:714281e916de82384986b6d93f91e8f98ec1fb872e916647532601ab5c989793","observation_id":"ebf8ccf3-7b3e-49a8-9c52-2355b3a6942c","resolution":{"observed_at":"2026-08-14T05:22:02.795772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.776845Z","title":"OBLIVIATE: A data oblivious filesystem for intel SGX","venue":null,"work_id":"72e760f2-d470-4462-b82b-bd4b66d3644e","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.884438Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:4ca558f2397988c18f503707874b5a3bdc5112eb5dd1d7280edaf11993f7c76a","observation_id":"70236cf0-e9e7-4aee-b217-e6c4f77cf172","resolution":{"observed_at":"2026-08-14T05:22:02.781386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.761459Z","title":"Stillwell, David Goltzsche, Dave Eyers, R ¨udiger Kapitza, Peter Pietzuch, and Christof Fetzer","venue":null,"work_id":"62ab0798-ccd8-4c8f-8374-606574cfaca9","year":2016},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.889633Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:b8cb67d683a6d5df7efea0c99fd48b9995a311b370a3e457649295f446357749","observation_id":"19de7322-feb9-47f5-b7b7-2c2c309d5c47","resolution":{"observed_at":"2026-08-14T05:22:02.766481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.745960Z","title":"Shielding applica- tions from an untrusted cloud with haven","venue":null,"work_id":"1248c74c-18b8-40f3-b057-b42542d573eb","year":2014},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.894289Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:ef7871544dc4e6752ced0fd1067f95c3f1dfad274f3361d387e4c015914b1de4","observation_id":"bcc5bbe5-7a6a-4c81-898e-b57c21acd73d","resolution":{"observed_at":"2026-08-14T05:22:02.751172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.731513Z","title":"Software grand exposure: SGX cache attacks are practical","venue":null,"work_id":"4db876e3-6de4-4319-8b24-2f88f5641e29","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.898955Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:7b19cac21223c8feb6d2ae80c31d578f1e51e9dbd79a18dbd0915c8a2b690835","observation_id":"1a8b1563-e60b-476a-9a64-6782f1dcb77c","resolution":{"observed_at":"2026-08-14T05:22:02.736398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.717047Z","title":"Concuroram: High-throughput stateless parallel multi-client ORAM","venue":null,"work_id":"bc672812-83ab-464e-bbff-2f13802002d4","year":2019},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.903452Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:1558359673edac6d78532607856ca3e73560b72dd38347462e1f5792e45b27b3","observation_id":"d1afc77e-259f-4d8e-bc4b-e1544e490143","resolution":{"observed_at":"2026-08-14T05:22:02.721785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.702081Z","title":"Porter, and Mona Vij","venue":null,"work_id":"ebac9cd3-4b0e-4349-b084-99a6542d82ba","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.907898Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:76c0f242b267d57027db770ef1d5afdc06b4b2156aa56f3b3bee84105299bbe0","observation_id":"00dd63a9-1ddf-45e1-8748-c0535c989873","resolution":{"observed_at":"2026-08-14T05:22:02.706791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.687193Z","title":"Iago attacks: Why the system call api is a bad untrusted rpc interface","venue":null,"work_id":"073d6825-4377-4291-9223-1400f980b648","year":2013},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.912078Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:50ab8e2f82b8585cd365945761898deaba31c90c4b6e9d990b17d4269f8b727b","observation_id":"a78b700f-83e4-4be1-934f-2cf535625c7f","resolution":{"observed_at":"2026-08-14T05:22:02.692056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.05141","last_updated":"2019-08-27T03:00:29Z","snapshot_observed_at":"2026-08-17T00:18:54.241904Z","submitted_at":"2018-04-14T01:05:56Z","title":"Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contract Execution","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.05141","snapshot_observed_at":"2026-08-14T05:22:01.916665Z","title":"Johnson, Ari Juels, Andrew Miller, and Dawn Song","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.916665Z"},"links":{"cited_paper":"/paper/1804.05141","citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:94c6499e3794786b1060cfe05f7122ea789b78f3a65e26aba5ff45923fc9284e","observation_id":"5bd03493-6c60-4397-9bc0-c0734004b759","resolution":{"observed_at":"2026-08-14T05:22:01.916665Z","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-14T05:22:01.921591Z","title":"Intel sgx explained","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.921591Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:15940f892b0b923c8464da56c2def7ceaf8509913bba9eaadd418ba4e575c4f2","observation_id":"6cd6e3e0-0edb-42db-a724-0f4de2f6584f","resolution":{"observed_at":"2026-08-14T05:22:01.921591Z","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-14T05:22:02.663061Z","title":"Sanctum: Minimal hardware extensions for strong software isolation","venue":null,"work_id":"35530bbf-1e03-429f-806b-ba035a884fa4","year":null},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.926093Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:d2a011b70e2496d0fa58475359ce3df921c127fa51def6758cc8bbbe17d42d4f","observation_id":"ddd69fe0-d8b5-4945-9589-e42758821528","resolution":{"observed_at":"2026-08-14T05:22:02.668534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.648590Z","title":"Lecture notes on approximation and random- ized algorithms","venue":null,"work_id":"4e68ede2-4d5f-4f0f-b4ad-0a0b273e31c4","year":null},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.930973Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:9fe2d2f0e4a9554ee0fcb3e0eacaae19ffaa98ee339fedc36598397f4a755f7e","observation_id":"e7c44fa5-2690-47b0-9518-d16d89bc4e84","resolution":{"observed_at":"2026-08-14T05:22:02.653229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.634841Z","title":"Analysis of the bitcoin utxo set","venue":null,"work_id":"bb01102e-f6ed-4926-ae1b-4e20004c0e22","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.935350Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:79abaee6a19097a278cd5a2055bb34575804e20fc7fce78e34533f4b4af43944","observation_id":"ada24a7c-906e-4a8d-bef0-1fe2da0d2d7c","resolution":{"observed_at":"2026-08-14T05:22:02.639364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.621159Z","title":"Diffie and M","venue":null,"work_id":"827f689a-57ac-4b43-83d9-d5180224c062","year":2006},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.939999Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:c27cbf49b06ac2cf51a51b7a1b097872798c89219a19a971fe767b44eefc36d0","observation_id":"c2a65725-13e3-426b-a659-ccb1d5d902e8","resolution":{"observed_at":"2026-08-14T05:22:02.625581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.00458","last_updated":"2019-09-19T03:31:17Z","snapshot_observed_at":"2026-08-18T16:31:07.544168Z","submitted_at":"2017-10-02T02:11:44Z","title":"ObliDB: Oblivious Query Processing for Secure Databases","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.00458","snapshot_observed_at":"2026-08-14T05:22:01.944544Z","title":"An oblivious general-purpose SQL database for the cloud","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.944544Z"},"links":{"cited_paper":"/paper/1710.00458","citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:b2002689f1416043c0bf725d4f1a475ea575992fac53a493a4a4c2dfc23d2a63","observation_id":"05b36801-d14d-4e64-9905-cb26404ede51","resolution":{"observed_at":"2026-08-14T05:22:01.944544Z","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-14T05:22:02.607261Z","title":"Andersen, Michael Kaminsky, and Michael D","venue":null,"work_id":"f8c3fa6e-6ac0-470b-9fc2-aa949ad19979","year":2014},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.949415Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:115a003a856066aa516be96b5a93577902405ec141487984efc78f291a8c7537","observation_id":"ae7bec37-8e93-4754-921e-0ffdc0845f37","resolution":{"observed_at":"2026-08-14T05:22:02.611873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.593432Z","title":"Karame, and Damian Gruber","venue":null,"work_id":"ecc67b20-f875-45a8-9434-a9af12087efc","year":2014},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.953826Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:0b39b19105b75adfc18bac792f89ba3ace762d7e9bc3b99673d0448afc5a761f","observation_id":"5d13c03a-19c1-4d22-ad3f-8c4689e79480","resolution":{"observed_at":"2026-08-14T05:22:02.598227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.579906Z","title":"Goldreich","venue":null,"work_id":"9fe2da73-e1ed-47a1-a3fa-83d140d91081","year":1987},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.958292Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:e6b3bea4ed8589ad55679987c7207b0818d93897f41aa09753dbf515e21e3dc8","observation_id":"94e408c8-8364-46b1-99e2-c05c3ccea110","resolution":{"observed_at":"2026-08-14T05:22:02.584224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.10883","last_updated":"2018-06-28T11:19:09Z","snapshot_observed_at":"2026-08-14T18:58:07.001478Z","submitted_at":"2018-06-28T11:19:09Z","title":"Securing the Storage Data Path with SGX Enclaves","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.10883","snapshot_observed_at":"2026-08-14T05:22:01.962701Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.962701Z"},"links":{"cited_paper":"/paper/1806.10883","citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:14365a4e67d21507d9234f8c93b5dd44c980683c258805eb13e345016fae65bd","observation_id":"1fae0ce7-dc4a-4afe-b51e-afd21dea8ebb","resolution":{"observed_at":"2026-08-14T05:22:01.962701Z","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-14T05:22:02.566080Z","title":null,"venue":null,"work_id":"4de00b64-cd68-40ac-80a8-a789f2d73b69","year":2019},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.967906Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:a29f99bc7f510244a124053be37212dadae0632aeecc63562faaeb2483ef1e6d","observation_id":"76a6ce83-837f-4054-8e33-746335754373","resolution":{"observed_at":"2026-08-14T05:22:02.570382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.552009Z","title":"Ryoan: A distributed sandbox for untrusted computation on secret data","venue":null,"work_id":"e0b93bcf-b86d-4f07-97b6-0e911b823436","year":2016},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.972417Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:aadde87781e47bc7ff636038c4fbabf5312f02e09dcda18f611e422696a86653","observation_id":"bb802b64-96be-4ee0-83a0-2dd2ca0b5f32","resolution":{"observed_at":"2026-08-14T05:22:02.556504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.537412Z","title":"Short paper: Industrial feasibility of private information retrieval","venue":null,"work_id":"65038a5d-5c0a-4396-aa85-dd5b08d7bdbc","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.977427Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:e76dfe160acad1589895342489558781c2e07640b07381ee08734565c283b96b","observation_id":"7aa9d74c-6b01-43a2-aca1-dba55c1243fc","resolution":{"observed_at":"2026-08-14T05:22:02.541921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.522179Z","title":"Hacking in darkness: Return-oriented programming against se- cure enclaves","venue":null,"work_id":"48de7be9-6f89-4c6f-bd5e-609c2327b5da","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.981566Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:e47d28689595475e7018a760c9c775df0f75937884ab8eb049fb9926df94d138","observation_id":"7e4f1c54-7ff6-4a12-b859-8b5d784dcd1d","resolution":{"observed_at":"2026-08-14T05:22:02.527190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.507960Z","title":"Inferring fine-grained control flow inside SGX enclaves with branch shadowing","venue":null,"work_id":"594680e3-55f7-473b-afa5-3e2760532d0a","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.985793Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:ada2608b94eab5e715bebd6d79035b63c984c79636ca21b5546d57026373ae60","observation_id":"c4550b36-cc10-49a0-a9cd-c86a12b09b71","resolution":{"observed_at":"2026-08-14T05:22:02.512850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.07766","last_updated":"2017-03-07T23:51:06Z","snapshot_observed_at":"2026-08-14T21:24:01.075681Z","submitted_at":"2016-12-22T19:38:29Z","title":"Teechan: Payment Channels Using Trusted Execution Environments","version":2},"cited_work":{"arxiv_id":"1612.07766","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.07766","snapshot_observed_at":"2026-08-14T05:22:02.184995Z","title":"Teechan: Payment Channels Using Trusted Execution Environments","venue":"cs.CR","work_id":"23d4edf2-e2a7-419e-94ff-94e7913b92f2","year":2016},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.989832Z"},"links":{"cited_paper":"/paper/1612.07766","citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:225bd7c59289b3a3c20dd5fffa8edadb59e83bd3276bbd7837a65824dab3272d","observation_id":"ca0e456f-76e9-4229-b7d3-82b9c297d0bb","resolution":{"observed_at":"2026-08-14T05:22:02.190639Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.493331Z","title":"Connection bloom filtering, 2012","venue":null,"work_id":"eae05d3e-defc-49ee-b045-1f9a31f37c38","year":2012},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.994338Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:1fa4fc9d99a91c5b3f8692d256b25fb5fff69cc016fadce28f1c2a602b98c93e","observation_id":"7cd8ae82-2e8b-4d30-aa2f-453e5a247a86","resolution":{"observed_at":"2026-08-14T05:22:02.497708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.477665Z","title":"R3c3: Cryptographically secure censorship resistant rendezvous using cryp- tocurrencies","venue":null,"work_id":"cb4f4b71-ccec-464d-a56b-ed92a5bc3146","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:01.998768Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:bbf10092b40337f89a73293755e0fe0daaaade167b3effded4c3529a97172def","observation_id":"ad049dce-7b87-4d2b-b49f-417a78fb2f56","resolution":{"observed_at":"2026-08-14T05:22:02.482543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.462633Z","title":"Bitcoin: A peer-to-peer electronic cash system,” http://bitcoin.org/bitcoin.pdf","venue":null,"work_id":"565003ac-45c2-4d0b-94bd-63735dd0a7e8","year":null},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.003365Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:d0856cbde4f9453eadcc314e35b117897045089074dd266ca89bda97f25a6d83","observation_id":"5b226e78-1e8e-4f5e-bfc4-3928d19fab3a","resolution":{"observed_at":"2026-08-14T05:22:02.467528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.447859Z","title":"Oblivious multi- party machine learning on trusted processors","venue":null,"work_id":"1025750e-48e7-42b8-a134-da1c6fcea2b0","year":2016},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.007835Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:67c071700a3d8896097e45357bd4bdaa3ceb5ba08dcd854f4d0c6b4cbb299cf8","observation_id":"b27766bb-7521-4c25-bfcd-ffb69a7e9265","resolution":{"observed_at":"2026-08-14T05:22:02.452486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.432970Z","title":"Eleos: Exitless os services for sgx enclaves","venue":null,"work_id":"6d9d40b6-d6e7-41a9-9d25-8983c148c3d1","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.012384Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:72e10f38844f23cc31d6e79590f2455e21754ae490cf079b051623dd26f8e03e","observation_id":"667ba19b-8440-4468-bb09-cb80b6077aae","resolution":{"observed_at":"2026-08-14T05:22:02.437748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.418880Z","title":"Client side block filtering","venue":null,"work_id":"ea360e55-b77e-495a-a00e-fb36d3e8dfe9","year":null},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.016577Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:0afc7aeb750b0f1034df7b67c97dcad25b1e8e2d530237070d1329dec634da78","observation_id":"34399814-507e-4f74-88df-28a01e011400","resolution":{"observed_at":"2026-08-14T05:22:02.423272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.021189Z","title":"Raccoon: Closing digital side-channels through obfuscated execution","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.021189Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:748ac78bb68234fd1b50a36ccaf87b0157f31afc6e41595b8ab65950fa88e8d8","observation_id":"4aaab966-d367-45d6-8b77-33a4da6196ce","resolution":{"observed_at":"2026-08-14T05:22:02.021189Z","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-14T05:22:02.395477Z","title":"Taostore: Overcoming asynchronicity in oblivious data storage","venue":null,"work_id":"2afea2f6-e0c2-49a9-a4c0-acfce24ba520","year":2016},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.026102Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:1fe7a8bfbc03fe5c48dea90d6ece24abb94b0fb162d1d23e39acdc403426d58b","observation_id":"e7877995-bfaa-448c-b56c-3e9d826fee98","resolution":{"observed_at":"2026-08-14T05:22:02.400263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.381720Z","title":"Fletcher","venue":null,"work_id":"617da55e-88e5-4afc-82ef-a5390a5d4c4f","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.030622Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:6cbd300b30bd61ebb85f6723039be80e10c69b26d1c8d827cef2acfe2509328d","observation_id":"d6375750-9881-4859-b4b8-90625c4efcc4","resolution":{"observed_at":"2026-08-14T05:22:02.385980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.368272Z","title":null,"venue":null,"work_id":"dcab04f1-2993-4b30-be4b-5628c793f266","year":2011},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.034862Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:778150343d2542486470eecc30cf28834a45ba971fe70f14bf5f052bb15f866b","observation_id":"be59eec3-e3af-46a1-ae91-f868f8bb1b8e","resolution":{"observed_at":"2026-08-14T05:22:02.372715Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.353081Z","title":"Path oram: An extremely simple oblivious ram protocol","venue":null,"work_id":"16a111b5-24fc-49db-b1e1-68cf68e51474","year":2013},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.039361Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:8f87db1137245583f3837d0f80f4f2bd2a4393edea675100014e5c90914145f3","observation_id":"b0cbc899-babc-4990-974a-01d9dfadbe41","resolution":{"observed_at":"2026-08-14T05:22:02.357866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.338805Z","title":"Slalom: Fast, verifiable and private execution of neural networks in trusted hardware","venue":null,"work_id":"061cf05b-c965-4080-8e33-57bee6cb6f95","year":2019},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.043833Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:920eaa850b57e56dc4a01de05285cc86df52298664e270683a808f75e4312e20","observation_id":"ba436bf3-5c1d-443c-b248-e2e22d9d78c6","resolution":{"observed_at":"2026-08-14T05:22:02.343234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.321958Z","title":"Obscuro: A bitcoin mixer using trusted execution environments","venue":null,"work_id":"b1fd9500-1773-4af0-a51f-ab367e79703c","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.048218Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:cff2d62d17d1f291da36656c391241ee8ad0551e2297d37f39387b8d61d97e7b","observation_id":"7967030e-fd57-4646-9e37-7475413a7956","resolution":{"observed_at":"2026-08-14T05:22:02.327377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.306319Z","title":"Kalodner, Vrushali Kulkarni, Daniela Oliveira, and Donald E","venue":null,"work_id":"90e1b478-8a9a-4196-9641-b2095ad63f4f","year":2014},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.053536Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:65707654470c648722d19426e901f9672f2c485ce537b8f375bc0145393ebd1e","observation_id":"0b7c82dc-5c2b-4792-9f3f-56625c6ddd93","resolution":{"observed_at":"2026-08-14T05:22:02.311077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1705.07289","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:22:02.160344Z","title":null,"venue":null,"work_id":"3879a078-de98-454b-82e2-a54a1814dfd5","year":2017},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.057919Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:aecc96f6148d3d508ce482565d9d7bc3d13004e224b7fc8a4c2f2601a224f6e1","observation_id":"395f94d4-7799-4cb3-8880-912a88b78227","resolution":{"observed_at":"2026-08-14T05:22:02.170171Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.291645Z","title":"Circuit oram: On tightness of the goldreich-ostrovsky lower bound","venue":null,"work_id":"e18e5094-422a-43ce-b848-8a975c3527ea","year":2015},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.061986Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:b9638e64c68bf47479bb04599cfb83d32dd9643061fdb0090c5a8dc9b0552c9d","observation_id":"2d9286a6-4b1b-4b5b-9b33-80f1f3213548","resolution":{"observed_at":"2026-08-14T05:22:02.296440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.276758Z","title":"Zlite: Lightweight clients for shielded zcash 14 transactions using trusted execution","venue":null,"work_id":"b01a921d-c648-4128-8377-3a1c1e56766b","year":2018},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.066249Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:daacedb7a6799d03cee64c085c84abcb52272d607d1c0ee76e5921d1d7c98a1a","observation_id":"ea14c6ef-9d6c-4b9c-85c5-9f4ead2f946e","resolution":{"observed_at":"2026-08-14T05:22:02.281835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.261726Z","title":"Controlled-Channel attacks: Deterministic side channels for untrusted operating systems","venue":null,"work_id":"ef44d0dd-c23c-4bb3-bddb-dc9e0fbc7545","year":2015},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.071267Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:53383a7e28862b79d4e6f83a97b709680dd21540b23b7b2fe1fb14f5ececd503","observation_id":"d52d9caf-f247-4df8-b41e-201a0cb0bf02","resolution":{"observed_at":"2026-08-14T05:22:02.266742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-14T05:22:02.246773Z","title":"Town crier: An authenticated data feed for smart contracts","venue":null,"work_id":"3f1c1d31-5c6d-4a8d-8d52-8e87a9a635ce","year":2016},"citing_paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T05:22:02.075988Z"},"links":{"citing_paper":"/paper/1909.01531"},"observation_digest":"sha256:7ece114564db8cec53d8d6200a14640cf45d6d64ef00ec38ea390222a9ed87a5","observation_id":"d011b0a8-ad6c-418c-82b1-6ea355823164","resolution":{"observed_at":"2026-08-14T05:22:02.251635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.01531","last_updated":"2019-09-16T18:05:04Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-18T19:23:39.288204Z","submitted_at":"2019-09-04T03:00:22Z","title":"A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":43},"total_outbound_references":52},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:1909.01531."}