{"as_of":"2026-08-20T10:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:659e1a62328b9086df1a70fac55d25d6b7c245d4cf6c3a3c0e70a626deff6cf6","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:59:15.881550Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T12:00:45.318084Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"cited_work":{"arxiv_id":"2508.06316","doi":"10.48550/arxiv.2508.06316","metadata_source":"pith","pith_arxiv_id":"2508.06316","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","venue":"cs.DS","work_id":"1df9a48b-0760-49c2-87be-be35d9414330","year":2025},"citing_paper":{"arxiv_id":"2607.04881","last_updated":"2026-07-06T10:01:26Z","snapshot_observed_at":"2026-08-14T13:36:13.227775Z","submitted_at":"2026-07-06T10:01:26Z","title":"Towards Fully Dynamic Omnitrees: Moment-Conserving Anisotropic Compression With Wavelets","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T12:00:45.318084Z"},"links":{"cited_paper":"/paper/2508.06316","citing_paper":"/paper/2607.04881"},"observation_digest":"sha256:4797d24a481b684e692bd1768f2c01fdc389a9fcbeb7939049a3357edd90f842","observation_id":"89cba56b-0e48-49c9-af1e-6b74ae1aaf37","resolution":{"observed_at":"2026-07-11T12:07:59.319763Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-12T00:49:10.512995+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T00:49:10.512995+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.06316/citation-record","integrity":"/paper/2508.06316/integrity","json":"/paper/2508.06316/citation-record.json","paper":"/paper/2508.06316"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:09.166702Z","title":"The Fast Multipole Method for Gridless Particle Simulation","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.166702Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:77f17886a68688d08081ae10a5ecbcb0b31b83eaf5411a64cddb809306958589","observation_id":"bdd213b0-ada7-400d-b4b9-def4d68a4160","resolution":{"observed_at":"2026-08-05T22:59:09.166702Z","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-05T22:59:09.256865Z","title":"Space-Filling Curves","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.256865Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:6636214d1a141e43ef31890d1dcdf3e9ad9ef8f1901ca5b2ce635ba5fcc1c3b3","observation_id":"6fb9731e-1034-4c8d-a588-866e4e2ef5c5","resolution":{"observed_at":"2026-08-05T22:59:09.256865Z","resolver_source":null,"status":"malformed_identifier"},"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-05T22:59:09.380742Z","title":"Fundamental Challenges of Micro-Vanes and Micro-Ramps for High-Speed Inlet Applications: A Computational Fluid Dynamics Investigation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.380742Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:0de4bd4ea76fde8e6a5bd99d49421b3856094bebff5a2b94d9ee899307b816e1","observation_id":"3d1f47ec-6ee9-4f7f-886b-6045ce0254a5","resolution":{"observed_at":"2026-08-05T22:59:09.380742Z","resolver_source":null,"status":"malformed_identifier"},"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-05T22:59:09.445880Z","title":"Multidimensional Binary Search Trees Used for As- sociative Searching","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.445880Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:18201ddd71789a24e2b24b82b37fa2263ce59496f2a11e3eae96876a22a633d0","observation_id":"5a8ec7c9-8a53-4e55-8255-4b99bbeb6a3f","resolution":{"observed_at":"2026-08-05T22:59:09.445880Z","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":"2022.31653","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:21.019781Z","title":"AMM: Adaptive Multilinear Meshes","venue":null,"work_id":"2ba9fcad-c3ab-4985-9d6b-f03393320a3e","year":2022},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.544094Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:42c4e75dea8fcb52d7cdb3458350b63b5853f06c6660545a75815eed2b76d85c","observation_id":"ce10d639-3551-42ae-b910-acf1d910c7e7","resolution":{"observed_at":"2026-08-05T22:59:21.167500Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:09.646887Z","title":"A New Uncertainty Importance Measure","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.646887Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:2e584f7fd88d6ee2be63d2b0b8dd32780cf9c12b67cdd29a1f83a824099c1364","observation_id":"5c83aec8-1d8a-4e6b-83e6-1f28acd70e37","resolution":{"observed_at":"2026-08-05T22:59:09.646887Z","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-05T22:59:09.699279Z","title":"Foundations of Nonlinear Gyrokinetic Theory","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.699279Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:9b8c637de47e326191c5323db69fdfeffe4c715e61bfebb47294f2f6e41b9501","observation_id":"7fd148db-1f11-4d90-8684-6fa81e5fdc08","resolution":{"observed_at":"2026-08-05T22:59:09.699279Z","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-05T22:59:25.658567Z","title":"P4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees","venue":null,"work_id":"27dbb3f6-5ca2-4ad6-92b3-de7b222169fb","year":2011},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.840730Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:9e2adcd6ffe53d09f61dfeafb61d5a58c8e249f844f0340f941881b3d235714c","observation_id":"b413f231-4e11-43c9-baec-1c5893ff5558","resolution":{"observed_at":"2026-08-05T22:59:25.716904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:10.060102Z","title":"ParallelNN: A Parallel Octree-based Nearest Neigh- bor Search Accelerator for 3D Point Clouds","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.060102Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:912fbce89252d05b963f8a1cf047119cc1593d0f4479124b101344ef696e9cda","observation_id":"b44aedaa-e387-4c79-ab74-9ce0c1a0c375","resolution":{"observed_at":"2026-08-05T22:59:10.060102Z","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-05T22:59:25.495680Z","title":"Fast Construction of K-Nearest Neighbor Graphs for Point Clouds","venue":null,"work_id":"b3d8ca71-0648-49e5-ae5e-a4c518b43958","year":2010},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.186393Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:5f33a6db0f35cd61fb7131ebc2770d9524a992d4e0862d491916b5bc02316438","observation_id":"ed645bd5-3070-4707-906d-059154cf2812","resolution":{"observed_at":"2026-08-05T22:59:25.583315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:10.445215Z","title":"From Piz Daint to the Stars: Simulation of Stellar Mergers Using High-Level Abstractions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.445215Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:a93e92e402e9ceb7af59b75273b3d17f1d19cb4513c7338f11af3edb8c3007b8","observation_id":"0388057e-5f1f-476d-996d-f9865b624c04","resolution":{"observed_at":"2026-08-05T22:59:10.445215Z","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-05T22:59:25.324551Z","title":null,"venue":null,"work_id":"9e3bf604-c81c-4593-8c1f-db3178e83fb8","year":2019},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.547305Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:bf9c9f0b1768c5e97492a431d6f97e41820328ff02b703e3b8f0a6118e50bf0a","observation_id":"f063a092-4789-43a6-b2b9-98501b603594","resolution":{"observed_at":"2026-08-05T22:59:25.405755Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.02817","last_updated":"2025-08-01T21:04:27Z","snapshot_observed_at":"2026-08-16T12:44:10.522334Z","submitted_at":"2025-04-03T17:57:52Z","title":"Efficient Autoregressive Shape Generation via Octree-Based Adaptive Tokenization","version":2},"cited_work":{"arxiv_id":"2504.02817","doi":"10.48550/arxiv.2504.02817","metadata_source":"pith","pith_arxiv_id":"2504.02817","snapshot_observed_at":"2026-08-06T00:16:16.768632Z","title":"Efficient Autoregressive Shape Generation via Octree-Based Adaptive Tokenization","venue":"cs.CV","work_id":"d6a6cd32-50cb-47fd-9a01-75dc5e9b5ae7","year":2025},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.688058Z"},"links":{"cited_paper":"/paper/2504.02817","citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:0ddf4165f5783d817541e0bdbfb4f7892de79b46e6a8c7661d010e9acc0875d9","observation_id":"f43ae53c-4a71-4d1d-aa72-021258b3e190","resolution":{"observed_at":"2026-08-05T22:59:18.254685Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:25.229485Z","title":null,"venue":null,"work_id":"5d279244-5ebb-4e39-8ebc-44b7ed441bff","year":null},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.829777Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:004a3604d04fc9b56323714c79b3492968a13e41a0aed6b3e1eb74c5f69d956e","observation_id":"91d8e1b3-524f-4bdd-bd61-d0c7a5b25b43","resolution":{"observed_at":"2026-08-05T22:59:25.284569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/6.2010-120","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Time-Tensor for Rapid Convergence of CFD Solutions","venue":"48th AIAA Aerospace Sciences Meeting Including the New Horizons Forum and Aerospace Exposition","work_id":"bcf1cc94-8e6d-4a8c-b7fb-a7a1c52376eb","year":2010},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.916137Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:8cd7997209a34bc7afb88d4d4f54144d43add066869ba69330484b88b6431529","observation_id":"c9ac22c1-4b01-4886-96f0-4d023d10e810","resolution":{"observed_at":"2026-08-05T22:59:18.006280Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:11.018131Z","title":"Splitflow - Progress in 3D CFD with Cartesian Omni-Tree Grids for Complex Geometries","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.018131Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:162cc1bfedf4bccf65f19148b1d35e59c14f831ae4b963ac28e7779e79feb8b1","observation_id":"9f2fd7a6-dc30-427a-b2b0-0b1b81c1af20","resolution":{"observed_at":"2026-08-05T22:59:11.018131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/6.2019-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:17.656740Z","title":"Propulsion Aerodynamics Workshop IV Results for the Special Topic","venue":null,"work_id":"816840fc-d05a-4b24-9dd2-4536bb07c52c","year":2019},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.108863Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:5e738752b8924c651b17293f973eb9df180ca6db63620883967151b2aecdea67","observation_id":"e27acfa1-0c7a-45fa-a367-a963f30d8784","resolution":{"observed_at":"2026-08-05T22:59:17.752630Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1063/5.0003698","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Low- and High-Frequency Nature of Oblique Filamentation Modes. II. Vlasov–Maxwell Simulations of Collisionless Heat- ing Process","venue":"Physics of Plasmas","work_id":"1fb5c21c-4ad7-45e6-b13f-3d902cfe4484","year":2020},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.439365Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:2113b036206a6b215d3cb1cbc2f5796f9e3e197ba45c1f588748dceb77446e9f","observation_id":"2ac96e43-83e5-4d6d-9ef2-6f50f0491c10","resolution":{"observed_at":"2026-08-05T22:59:17.274307Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:11.512392Z","title":"A Fast Algorithm for Particle Simulations","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.512392Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:b1bc317c5b0397b4c3bc46db497a6ee2ba57d5902c3a104afd4251f398952205","observation_id":"ac852684-a6b2-4c64-94c3-f44de4167a47","resolution":{"observed_at":"2026-08-05T22:59:11.512392Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.04473","last_updated":"2018-09-12T14:30:01Z","snapshot_observed_at":"2026-08-20T07:00:35.275272Z","submitted_at":"2017-11-13T09:07:41Z","title":"Sixteen space-filling curves and traversals for d-dimensional cubes and simplices","version":2},"cited_work":{"arxiv_id":"1711.04473","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.04473","snapshot_observed_at":"2026-08-05T22:59:20.232438Z","title":"Sixteen space-filling curves and traversals for d-dimensional cubes and simplices","venue":"cs.CG","work_id":"fe5bdbe3-8e1d-4612-9133-da40e6b7e724","year":2017},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.637855Z"},"links":{"cited_paper":"/paper/1711.04473","citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:e0c2e448e0afef58f1cdd52b776525c7258e929d675272d6c8eb4918eb219587","observation_id":"f2a1950a-3d0b-44c7-9fef-7934dee261ef","resolution":{"observed_at":"2026-08-05T22:59:20.356591Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:11.722446Z","title":"SALib: An open-source Python library for Sensitivity Analysis","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.722446Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:16c26879315f93ff89d08ce21f190494f6ba39eb6b3c32c530b5020cd4004b1a","observation_id":"94ce6be9-6e2e-4c58-904b-5bda246eb999","resolution":{"observed_at":"2026-08-05T22:59:11.722446Z","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-05T22:59:11.873220Z","title":"T8code - Modular Adaptive Mesh Refinement in the Exascale Era","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.873220Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:f956e5895d3e11b8dc4bf46c23a2c9d211bc78eacd1158fab724d7f832405a4b","observation_id":"3e106afa-e42b-48ed-aba7-296228fdfd2f","resolution":{"observed_at":"2026-08-05T22:59:11.873220Z","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-05T22:59:11.987383Z","title":"OctoMap: An Efficient Probabilistic 3D Map- ping Framework Based on Octrees","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.987383Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:fe2dc73293458b87782f9615613a269495a276ab9d89b3d0d618f29746ebd22f","observation_id":"a6824fe5-7485-44b3-83de-76c000b0594f","resolution":{"observed_at":"2026-08-05T22:59:11.987383Z","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-05T22:59:25.081591Z","title":"Toward SALib 2.0: Advancing the accessibility and interpretability of global sensitiv- ity analyses","venue":null,"work_id":"e69c99c5-1b03-486c-a4a6-83199482eb2f","year":2022},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.120377Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:8d89d89436ddc241c8166c47fe71710f58a7556026e2eec3d48eb66e967bcd65","observation_id":"792f0ac6-ff24-427a-90ad-fb1b0c97ec40","resolution":{"observed_at":"2026-08-05T22:59:25.143681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11227-022-04324-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"An Octree- Based, Cartesian Navier–Stokes Solver for Modern Cluster Architectures","venue":"The Journal of Supercomputing","work_id":"c6341c4d-4589-47a0-9f1e-7f1ac774e2af","year":2022},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.226321Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:d2f0941ca1030959f4e942f74d9633873acd0a2f6e2ba0d898d814f1aabc593a","observation_id":"48115af2-0e95-41d2-91a7-6c7442f28b52","resolution":{"observed_at":"2026-08-05T22:59:17.011192Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1980.47669","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:19.983539Z","title":"On a Method of Binary-Picture Rep- resentation and Its Application to Data Compression","venue":null,"work_id":"b984275a-9cfd-4f2c-bfb9-8202c1ee8ca3","year":1980},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.339188Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:81eea6f5bb3bd61424b280611dfc43d5255c76c6ae2e2b7448954eada29707e9","observation_id":"1804c16e-48a6-4612-9178-dfd1d8c8268c","resolution":{"observed_at":"2026-08-05T22:59:20.059930Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"document/1456023","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:19.697352Z","title":"Progressive Transmission of Grey-Scale and Binary Pic- tures by Simple, Efficient, and Lossless Encoding Schemes","venue":null,"work_id":"14e471c4-37c8-48ec-bd40-fdf3bf5ebba6","year":1980},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.459397Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:926a47c89695da549218d47c3d1de8eefe5f2afac7e034e6147800ba60a28098","observation_id":"ba21357d-5e39-4e20-bf3a-2845f631c644","resolution":{"observed_at":"2026-08-05T22:59:19.809739Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:24.894280Z","title":"Spatially Adaptive Techniques for Level Set Methods and Incompressible Flow","venue":null,"work_id":"72fdec44-6545-407c-9452-dd56ae79e313","year":2006},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.590076Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:f7165e283bac312c113793c7b76c775475983676c1ba213970b96793d66dd4ea","observation_id":"7fa30072-d50c-49d7-98c9-ca84f26c0114","resolution":{"observed_at":"2026-08-05T22:59:24.998044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6562.10157","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:19.308210Z","title":"Simulating Water and Smoke with an Octree Data Structure","venue":null,"work_id":"752f552e-0080-42fb-8265-ed504b6bd984","year":2004},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.688822Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:313fe4709572ed850c62adb7c766a2cbfb4679d0094c39a956197b1266d8d9bd","observation_id":"5487d0a4-6012-4428-be1e-6a0fe7f4c358","resolution":{"observed_at":"2026-08-05T22:59:19.423940Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:24.735313Z","title":"Sierpinski’s Curve: A (Beautiful) Paradigm of Recur- sion","venue":null,"work_id":"eb407985-502a-4c81-a48a-e25f0735fcbc","year":2020},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.766102Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:5c396d1f39c622262d4de903a60bce062711130c7e95b3542bc0b61e4fbece49","observation_id":"375f74a3-e2fb-41a6-a584-6a730680f70b","resolution":{"observed_at":"2026-08-05T22:59:24.794729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0146-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:18.985857Z","title":"Geometric Modeling Using Octree Encoding","venue":null,"work_id":"2ebcbba2-f2fc-422d-aea4-3a1ac77d6a42","year":1982},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.862878Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:1eaeb692ebaa26fd435d1058049a7a095cc266ffa5e41279b2bb1da981bfd492","observation_id":"525d67ea-b73b-4e5d-961b-451122fd699e","resolution":{"observed_at":"2026-08-05T22:59:19.077810Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/(sici)1097-0363(19980115)26:1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:16.655801Z","title":"Octree Partitioning of Hybrid Grids for Parallel Adaptive Viscous Flow Simulations","venue":null,"work_id":"ee30b529-a062-4ffb-9721-792b9cd59061","year":1998},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:12.966457Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:d14234aac91f485b9f713ec5884dc9ff3405733ee9fb7288ee8845844ee7f597","observation_id":"b9ecc7f1-f4db-4063-babf-99784edb3c99","resolution":{"observed_at":"2026-08-05T22:59:16.794928Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:24.491050Z","title":"Interface-Capturing Methods for Two-Phase Flows: An Overview and Recent Developments","venue":null,"work_id":"78131bf9-8e42-4e07-80fd-5eeba50e3a33","year":2017},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.059773Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:82f1114912c74be095a31068fa685bb1cf5a387658d16622987efc0c1d2b2d80","observation_id":"e255bd3b-ec26-4f59-9aac-0ee546f82d90","resolution":{"observed_at":"2026-08-05T22:59:24.620407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:24.352933Z","title":"Parallel Level-Set Methods on Adaptive Tree-Based Grids","venue":null,"work_id":"91d2a505-8e5e-46ee-b917-f51b34fe99ad","year":2016},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.192521Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:4ba56497351d8b63510a79529814894c80dbbae1324c67120420bf6636102f7c","observation_id":"aef6c5bb-8b55-41c3-b135-ddc19d64b118","resolution":{"observed_at":"2026-08-05T22:59:24.430266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.1206","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:16.499416Z","title":"Astrophysical Particle Simulations on Heteroge- neous CPU-GPU Systems","venue":null,"work_id":"7d00e1a3-8248-471c-98f7-7accf5a5e251","year":2012},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.433990Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:16c2dabc123ca2cb3527682f23049a86d60c143e7637acb028fd6a6bbae28b71","observation_id":"82fc1e0f-1704-439d-b567-79c4ebe944eb","resolution":{"observed_at":"2026-08-05T22:59:16.573126Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:23.796395Z","title":"A Numerical Algorithm Based on a Tree Data for an Anisotropically Adaptive Cartesian Mesh","venue":null,"work_id":"40ecb2d1-1a30-47df-b111-0f2464724441","year":2003},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.642803Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:d47710a21b5aa5fe36b1b0c44efde80321dba1e65ed5813081f408fd1a336c98","observation_id":"3b24cb98-36c4-4f15-99f4-4eb3434f3649","resolution":{"observed_at":"2026-08-05T22:59:23.914832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:13.758214Z","title":"An Adaptive Cartesian Mesh Flow Solver Based on the Tree-data with Anisotropic Mesh Refinement","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.758214Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:261b8c718c72cfbe925d0f38d0cdadc781169bbc4076971a1e804e607c750d08","observation_id":"87cea9ad-afbd-435a-b7e8-1213278d2504","resolution":{"observed_at":"2026-08-05T22:59:13.758214Z","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-05T22:59:24.056394Z","title":null,"venue":null,"work_id":"f7a48193-5548-4d56-b46a-94e98f63ff43","year":null},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.340990Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:0fd3889d350dc6d8edff919d560d79474e2863b9621bcbcebd172dd2c6e33254","observation_id":"020c62bb-a3f1-4e4b-8ccf-95d9ae35c8d1","resolution":{"observed_at":"2026-08-05T22:59:24.189760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:23.298935Z","title":"freifrauvonbleifrei/DyAda","venue":null,"work_id":"b7d5316d-185a-4b70-aebf-0d3da5eef3d1","year":2025},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.010296Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:f073fc58b52f264a1c5d17688f2d43991f140729768a8bf1107f136e40bd57a3","observation_id":"2b43414f-8ccf-4a20-ad0e-819788d105b5","resolution":{"observed_at":"2026-08-05T22:59:23.429756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:23.068466Z","title":"freifrauvonbleifrei/thingies with omnitrees","venue":null,"work_id":"74e1fb84-5cac-4b9d-9e0f-ba88ad23ed25","year":2025},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.091048Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:37b78e5959a23fe3adaf9bc88ed5ce358213b7176569138018168ec3cd913e37","observation_id":"aecd6c4e-7602-469b-9e1a-d036f1bbf92a","resolution":{"observed_at":"2026-08-05T22:59:23.171991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:22.847288Z","title":"Making Best Use of Model Evaluations to Compute Sen- sitivity Indices","venue":null,"work_id":"c42fb094-7d25-4fa1-9fae-3f066f307728","year":2002},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.163849Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:570613757b66eae2ceaaf35c4d463279edeabe9c82ba3f8088e78c2da377ce5e","observation_id":"549d0a19-bf07-4b5d-8012-1d6d7f65fe8b","resolution":{"observed_at":"2026-08-05T22:59:22.939423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:22.561483Z","title":"Global Sensitivity Analysis: The Primer","venue":null,"work_id":"61f8541c-97a5-4091-9ec2-9503a72b00f9","year":2008},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.292811Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:f6e72a3297e61031f63b67e02bfda0bd523992708b4efe692a24f943539ac11c","observation_id":"67d5e3c1-9543-4166-9440-2c70f164d49e","resolution":{"observed_at":"2026-08-05T22:59:22.701825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:23.547831Z","title":"Parallelization of an Adaptive Cartesian Mesh Flow Solver Based on the 2N -Tree Data Structure","venue":null,"work_id":"671f2414-6633-46f1-a8eb-07f9e9b02193","year":2002},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.884046Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:5d3220ced01f2c23da03a4e7151e3170f45a07910e4b49ee4ee9ced480481234","observation_id":"b4b468c4-f5e2-4d10-b053-6c3c7b59941b","resolution":{"observed_at":"2026-08-05T22:59:23.653750Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:22.363957Z","title":"Omni-Tree and Adaptive Cartesian Hybrid Grid Method in Steady and Unsteady Flows","venue":null,"work_id":"61ace43c-17ed-45e9-af29-ddda38766f6a","year":null},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.515573Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:c656d9bf277548f44cfd9673a09421e437eafc0b863d762718093b2ab270bf0f","observation_id":"5a27407b-0506-4807-b6d3-bc18fd2b443a","resolution":{"observed_at":"2026-08-05T22:59:22.432853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:14.800785Z","title":"Application of an Omni-tree Adaptive and Hybrid Cartesian Grid Method","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.800785Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:d576a98d7a6e6e712aa7cf3117318e56927a8c0b4427f05dce791ec0f4978270","observation_id":"a49b26a3-1ee0-4200-8b7a-515398ef8ec1","resolution":{"observed_at":"2026-08-05T22:59:14.800785Z","resolver_source":null,"status":"malformed_identifier"},"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-05T22:59:14.900689Z","title":"Comparison of Octree and Omni-Tree Carte- sian Grid for Civil-Plane High-Lift Model Simulations","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.900689Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:2ca0db6d691bef83e9ab773aea3d75a4b0fab76a2587131dd1d18ce7b2e81f76","observation_id":"aee8eb11-eaf7-48a6-92ce-7366cb8a6d4c","resolution":{"observed_at":"2026-08-05T22:59:14.900689Z","resolver_source":null,"status":"malformed_identifier"},"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-05T22:59:22.155008Z","title":"Numerically Analyzing More Efficiently High-Lift Aerodynamics of Wing/Body Model with Omni-Tree Cartesian Grids","venue":null,"work_id":"1b523c06-ab10-4c3a-a05e-c2464d4fbb7b","year":2011},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.065992Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:2751adf4582f5236d7a941d36f6a2949766f9abd778886c510850bbe6b1cce78","observation_id":"8b58c0b1-b18f-4c28-b207-51a2d7fb2889","resolution":{"observed_at":"2026-08-05T22:59:22.267788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6924.35693","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:18.537899Z","title":"The Quadtree and Related Hierarchical Data Structures","venue":null,"work_id":"cf6d4e92-9961-4988-b398-8fdbdfd24b37","year":1984},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:14.429933Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:037d6d7eb31b9354f5fcc7941e4b470f7769eb847c0b38379587175f4ed4a773","observation_id":"2d65e653-5af9-416c-bf2e-445e4331d7e8","resolution":{"observed_at":"2026-08-05T22:59:18.597413Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:15.384239Z","title":"Etree: A Database-Oriented Method for Generating Large Octree Meshes","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.384239Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:f83709e3d4333e829316901bf67f4daad9b8b01efaa311f57ab1b8cc05ddce21","observation_id":"ccfde9bb-0a3d-467e-a08b-7612c09b939e","resolution":{"observed_at":"2026-08-05T22:59:15.384239Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/2945","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:16.010976Z","title":"Octree-R: An Adaptive Octree for Efficient Ray Tracing","venue":null,"work_id":"9354243b-1358-4381-aec1-19eb68db1047","year":1995},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.522066Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:462ae528389fc8197be0e0161c4bd1b0ce4a265ce2ba77b8836d2a962e76ecda","observation_id":"343db169-473c-44e4-b612-9150f53a6dc4","resolution":{"observed_at":"2026-08-05T22:59:16.117347Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:21.675654Z","title":"Establishing the DLR-F25 as a Research Baseline Aircraft for the Short-Medium Range Market in 2035","venue":null,"work_id":"c21a8592-ffcd-4c83-9c6e-ee8b34ba7fa7","year":2035},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.626466Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:bd29bfe899fbdd9917887b56d5700ecfd9e20a67556ed95a50c6dd49191c3d40","observation_id":"a0ff9c8c-54ee-46f7-8ba6-67e7729fe203","resolution":{"observed_at":"2026-08-05T22:59:21.756547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:21.444967Z","title":"Adaptive Patching for High-resolution Image Segmen- tation with Transformers","venue":null,"work_id":"2f754be3-3dc3-4bb0-8db4-be818524687f","year":2024},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.769642Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:e7b93757781225d2d028b05de55943f10a042ae61bc3123acb692fb9f9693e65","observation_id":"6a8eaaab-c728-498e-b1f2-ba1d79118e74","resolution":{"observed_at":"2026-08-05T22:59:21.570166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.04797","last_updated":"2016-07-02T03:15:10Z","snapshot_observed_at":"2026-08-18T04:23:41.102973Z","submitted_at":"2016-05-16T15:09:19Z","title":"Thingi10K: A Dataset of 10,000 3D-Printing Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.04797","snapshot_observed_at":"2026-08-05T22:59:15.881550Z","title":"Thingi10K: A Dataset of 10,000 3D- Printing Models","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.881550Z"},"links":{"cited_paper":"/paper/1605.04797","citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:cc0c21ba70b9c9cab8a2b85a9d14a3d3286f7ad8be6a8f978a8b84f05ed34c5a","observation_id":"f041848f-9319-4ec9-acba-c0f81fa42420","resolution":{"observed_at":"2026-08-05T22:59:15.881550Z","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-05T22:59:21.861623Z","title":"Octree-Based Indexing for 3D Pointclouds within an Oracle Spatial DBMS","venue":null,"work_id":"0d12259a-a525-4a11-a539-bdf13c67067c","year":2013},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.283601Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:ef21e77ec884d3e4aacf81558e73bc22c2092f6b822e5882e6d3081fc7476172","observation_id":"0c879027-9423-4035-a954-e92a6ffd7295","resolution":{"observed_at":"2026-08-05T22:59:22.004830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ast.2010.09.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi: 10.1016/j.ast.2010.09.001","venue":"Aerospace Science and Technology","work_id":"da84707e-7292-4491-abe5-18e03c760c0d","year":2010},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":380,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:15.198888Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:3c78b7b60ce1438f2585ea6e1411d40560f3248aeb91be4de9dd5922f62d3c7d","observation_id":"b425dba0-c476-4793-b37f-77156a03b09f","resolution":{"observed_at":"2026-08-05T22:59:16.365103Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"document/5383353","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:59:20.680140Z","title":"url: https://ieeexplore.ieee","venue":null,"work_id":"2b4da9b6-01be-4f2c-ad63-bd10fec5d826","year":2010},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":506,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:10.328802Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:b87714e90379b7dce7efe4970bd79a3080c7b4f5fe50f7f855da58ea1a51876e","observation_id":"349da35d-eeb4-4d0a-b110-95d820395b62","resolution":{"observed_at":"2026-08-05T22:59:20.748743Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-05T22:59:09.937194Z","title":"doi: 10.1137/100791634","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":1133,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:09.937194Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:cc904947c6453fbbf5059a302c86b02363a3daf2c0911ec62ada9f73c299e6ca","observation_id":"8f602f22-4c47-46e7-9d99-6fc91040c5c7","resolution":{"observed_at":"2026-08-05T22:59:09.937194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1206.1199","last_updated":"2012-06-06T12:23:54Z","snapshot_observed_at":"2026-08-15T00:57:45.201671Z","submitted_at":"2012-06-06T12:23:54Z","title":"Astrophysical Particle Simulations on Heterogeneous CPU-GPU Systems","version":1},"cited_work":{"arxiv_id":"1206.1199","doi":null,"metadata_source":"pith","pith_arxiv_id":"1206.1199","snapshot_observed_at":"2026-08-05T22:59:18.700251Z","title":"Astrophysical Particle Simulations on Heterogeneous CPU-GPU Systems","venue":"astro-ph.IM","work_id":"2e5c3cb4-882a-4a05-986a-796d461df476","year":2012},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":1199,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:13.542919Z"},"links":{"cited_paper":"/paper/1206.1199","citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:d6564927e81b18dbe199f116ca0956b93812d4eef1113bc2580994635a9ee533","observation_id":"42feefbf-58bd-483d-9b24-b7020eb48a9c","resolution":{"observed_at":"2026-08-05T22:59:18.820477Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/6.2019-4020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"AIAA Propulsion and Energy 2019 Forum","work_id":"c28193ca-f18f-4b24-8feb-d94574dc0d7f","year":2019},"citing_paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations","version":2},"reference_index":4020,"source":"pdf_text","source_observed_at":"2026-08-05T22:59:11.269945Z"},"links":{"citing_paper":"/paper/2508.06316"},"observation_digest":"sha256:e7f7ee31a4bc2d19d4e7640ded0efbb762db8800c9df3cbc38b2c8f90f564c6b","observation_id":"25008e77-b05c-4662-b0be-66a9efe6d89a","resolution":{"observed_at":"2026-08-05T22:59:17.514392Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.06316","last_updated":"2026-02-27T06:27:22Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T20:01:33.494828Z","submitted_at":"2025-08-08T13:42:59Z","title":"The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":10,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":16,"verified_exact":12,"verified_fuzzy":17},"total_outbound_references":59},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 1 inbound Pith citation observation for arXiv:2508.06316."}