Paper Citation Record · LEDGER

TriSearch: Learning to Optimize Triangulations via Bistellar Flips

As of 5 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2605.30220.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2605.30220 v1

Coverage vector

measured 48 of 48 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-29T08:52:41.695397Z

measured 48 of 48 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-05T06:32:48.257954+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

48 of 48 outbound references displayed

verified exact14
verified fuzzy0
unresolved33
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 444f3299-7af4-40df-9572-5a6d87dc6a35 · outbound

This paper cites Iste, 2007.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Iste, 2007

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a18a71d4-13b5-498e-af1b-e24b9cc2f451 · outbound

This paper cites Mesh generation and optimal triangulation.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Mesh generation and optimal triangulation

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ffeeb800-844f-42a7-81f7-b991df7eb16d · outbound

This paper cites Delaunay refinement algorithms for triangular mesh generation.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Delaunay refinement algorithms for triangular mesh generation

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c3b3a0ea-1ac1-419f-a5fb-375eda0324e5 · outbound

This paper cites Dual Polyhedra and Mirror Symmetry for Calabi-Yau Hypersurfaces in Toric Varieties.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Dual Polyhedra and Mirror Symmetry for Calabi-Yau Hypersurfaces in Toric Varieties

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.588687Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b6eca0ea-8308-4ad7-9254-8de29edc0b7b · outbound

This paper cites Complete classification of reflexive polyhedra in four dimensions.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Complete classification of reflexive polyhedra in four dimensions

Reference 5

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.586209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2e5da9f1-177c-4d79-b9a0-6b581055fc0b · outbound

This paper cites Tetrahedrizing point sets in three dimensions.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Tetrahedrizing point sets in three dimensions

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e56493fb-3c69-43ed-8b3d-41bb04b5a119 · outbound

This paper cites De Loera, and Jürgen Richter-Gebert.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips De Loera, and Jürgen Richter-Gebert

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8221508-a67d-4c9f-ac18-e07c2db43cd0 · outbound

This paper cites Minimum-weight triangulation is NP-hard.Journal of the ACM (JACM), 55(2):1–29, 2008.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Minimum-weight triangulation is NP-hard.Journal of the ACM (JACM), 55(2):1–29, 2008

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c578a5f4-b9c5-4830-b3b8-6262435e2a18 · outbound

This paper cites CYTools: A Software Package for Analyzing Calabi-Yau Manifolds.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips CYTools: A Software Package for Analyzing Calabi-Yau Manifolds

Reference 9

Resolution: verified exact; arxiv_id, observed 2026-06-29T08:53:15.583399Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 5af12122-45c8-476d-96be-24ac25472644 · outbound

This paper cites On counting triangulations in d dimensions.Computational Geometry, 3(6):315–325, 1993.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips On counting triangulations in d dimensions.Computational Geometry, 3(6):315–325, 1993

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7d0ddb6-47c8-4c2d-b8f0-3293eb8af3a4 · outbound

This paper cites Optimality of the delaunay triangulation in rd.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Optimality of the delaunay triangulation in rd

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06acf38c-cc75-40b0-8c5f-9934ed54c6fc · outbound

This paper cites Topcom: Triangulations of point configurations and oriented matroids.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Topcom: Triangulations of point configurations and oriented matroids

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e5de71e-08f7-4c37-afce-334f78b4efcd · outbound

This paper cites Machine learning for combinatorial optimization: a methodological tour d’horizon.European Journal of Operational Research, 290(2):405–421, 2021.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Machine learning for combinatorial optimization: a methodological tour d’horizon.European Journal of Operational Research, 290(2):405–421, 2021

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49feef0d-3864-4392-8c75-c4a3c2d855bb · outbound

This paper cites Reinforcement learning for combinatorial optimization: A survey.Computers & Operations Research, 134:105400, 2021.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Reinforcement learning for combinatorial optimization: A survey.Computers & Operations Research, 134:105400, 2021

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fb3a7e0-ae27-49a5-abc9-b6143bd2ef44 · outbound

This paper cites Combinatorial optimization and reasoning with graph neural networks.Journal of Machine Learning Research, 24(130):1–61, 2023.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Combinatorial optimization and reasoning with graph neural networks.Journal of Machine Learning Research, 24(130):1–61, 2023

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df3536ff-7aa1-44cc-bacc-437d74d944de · outbound

This paper cites Pointer networks.Advances in neural information processing systems, 28, 2015.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Pointer networks.Advances in neural information processing systems, 28, 2015

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc857bed-45dc-48b3-bb7e-858a01b8e057 · outbound

This paper cites Neural Combinatorial Optimization with Reinforcement Learning.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Neural Combinatorial Optimization with Reinforcement Learning

Reference 17

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.552084Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation c546c09b-d3d9-4666-9fa7-d5dd6bf1bbd6 · outbound

This paper cites Attention, Learn to Solve Routing Problems!.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Attention, Learn to Solve Routing Problems!

Reference 18

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.554904Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 7d5cf3b0-2494-453b-9d2f-13a655fc565a · outbound

This paper cites Reinforcement learning for solving the vehicle routing problem.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Reinforcement learning for solving the vehicle routing problem

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 170c7098-704f-4378-99f6-95a5a1fe228d · outbound

This paper cites POMO: Policy optimization with multiple optima for reinforcement learning.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips POMO: Policy optimization with multiple optima for reinforcement learning

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4f5f712-e109-4df1-82c7-d933328ce5d2 · outbound

This paper cites On the difficulty of triangulating three-dimensional nonconvex polyhedra.Discrete & Computational Geometry, 7(3):227–253, 1992.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips On the difficulty of triangulating three-dimensional nonconvex polyhedra.Discrete & Computational Geometry, 7(3):227–253, 1992

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bdf93fcd-2ca3-44a4-9223-d1dc72483d88 · outbound

This paper cites Learning improvement heuristics for solving routing problems.IEEE Transactions on Neural Networks and Learning Systems, 33(9):5057–5069, 2021.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Learning improvement heuristics for solving routing problems.IEEE Transactions on Neural Networks and Learning Systems, 33(9):5057–5069, 2021

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78af0851-5f7f-4277-bc22-e213a3022bed · outbound

This paper cites Learning to perform local rewriting for combinatorial optimization.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Learning to perform local rewriting for combinatorial optimization

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d2a3c64-bc7b-4c5f-b9ee-f2ce3cdacad9 · outbound

This paper cites Barrett, William R.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Barrett, William R

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 063eaf96-f220-40c3-baac-2ca26ce524e3 · outbound

This paper cites Falkner, Daniela Thyssens, Ahmad Bdeir, and Lars Schmidt-Thieme.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Falkner, Daniela Thyssens, Ahmad Bdeir, and Lars Schmidt-Thieme

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08f03c34-852a-4927-a015-d77182fc2f99 · outbound

This paper cites Springer Science & Business Media, 2010.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Springer Science & Business Media, 2010

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae6c6ed8-ead1-431e-9231-2bb9e36df92e · outbound

This paper cites A-discriminants.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips A-discriminants

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d342f57-ec0c-42ed-9024-793d22b9e6c2 · outbound

This paper cites Transforming triangulations.Discrete mathematics, 3(4):365–372, 1972.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Transforming triangulations.Discrete mathematics, 3(4):365–372, 1972

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 22bdc839-2df3-47f8-8639-8eb7d7af360e · outbound

This paper cites an unresolved cited work.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23281fe2-d34e-4b34-acae-fcfcf5e4979d · outbound

This paper cites Transforming Calabi-Yau Constructions: Generating New Calabi-Yau Manifolds with Transformers.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Transforming Calabi-Yau Constructions: Generating New Calabi-Yau Manifolds with Transformers

Reference 30

Resolution: verified exact; arxiv_id, observed 2026-06-29T08:53:15.572663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation fb407116-1bfc-44d2-99a5-3d9666dd4ecc · outbound

This paper cites Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges

Reference 31

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.549353Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation bdb4cd0e-58cb-4fa6-b895-4c978e8102d3 · outbound

This paper cites E(n) equivariant graph neural networks.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips E(n) equivariant graph neural networks

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a86a0260-b9c5-46bf-b6f1-172b5f8ed567 · outbound

This paper cites Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs

Reference 33

Resolution: verified exact; arxiv_id, observed 2026-06-29T08:53:15.558081Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 09161d06-f1b7-47d2-abdc-3975a6ac0cad · outbound

This paper cites EquiformerV2: Improved Equivariant Transformer for Scaling to Higher-Degree Representations.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips EquiformerV2: Improved Equivariant Transformer for Scaling to Higher-Degree Representations

Reference 34

Resolution: verified exact; arxiv_id, observed 2026-06-29T08:53:15.580601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a4a8b9ec-2e90-48b9-801b-b8c39cb0ddf7 · outbound

This paper cites Hypergraph neural networks.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Hypergraph neural networks

Reference 35

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a5c7bdb-448f-43e6-84e0-140afdc3d342 · outbound

This paper cites Simplicial neural networks.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Simplicial neural networks

Reference 36

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14ba8713-eeee-40ae-949b-355bed4a212f · outbound

This paper cites Simplicial complex neural networks.IEEE Transactions on Pattern Analysis and Machine Intelligence, 46(1):561–575, 2023.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Simplicial complex neural networks.IEEE Transactions on Pattern Analysis and Machine Intelligence, 46(1):561–575, 2023

Reference 37

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9546b03-12c3-4cdd-9ad7-5f5150a3f386 · outbound

This paper cites Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten.Mathematis- che Annalen, 83(1):113–115, 1921.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten.Mathematis- che Annalen, 83(1):113–115, 1921

Reference 38

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 753b1b5c-e0a3-47b7-a09c-e0f7e7ba5fb4 · outbound

This paper cites Non-connected toric Hilbert schemes.Mathematische Annalen, 332(3):645– 665, 2005.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Non-connected toric Hilbert schemes.Mathematische Annalen, 332(3):645– 665, 2005

Reference 39

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2759fabd-86b8-46a4-ae4b-5750368d85a7 · outbound

This paper cites Go-Explore: a New Approach for Hard-Exploration Problems.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Go-Explore: a New Approach for Hard-Exploration Problems

Reference 40

Resolution: verified exact; arxiv_id, observed 2026-06-29T08:53:15.569692Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation cd4630ae-5313-4297-8a97-ce1a1d25960f · outbound

This paper cites Proximal Policy Optimization Algorithms.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Proximal Policy Optimization Algorithms

Reference 41

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.563709Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 481a92c7-1cb6-4d60-a520-3e0ae99289ee · outbound

This paper cites High-Dimensional Continuous Control Using Generalized Advantage Estimation.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips High-Dimensional Continuous Control Using Generalized Advantage Estimation

Reference 42

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.575206Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2e954313-dd51-460c-b39a-d7bab4e0faa1 · outbound

This paper cites Searching for Activation Functions.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Searching for Activation Functions

Reference 43

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.577754Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b383463b-784a-4ef0-847f-d2d3d7c893e7 · outbound

This paper cites Adam: A Method for Stochastic Optimization.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Adam: A Method for Stochastic Optimization

Reference 44

Resolution: verified exact; local_arxiv, observed 2026-06-29T08:53:15.566581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 40530ed0-26d9-4701-8fe6-d22b8ce5067b · outbound

This paper cites Bounding the Kreuzer-Skarke landscape.Fortschritte der Physik, 68(11-12):2000086, 2020.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Bounding the Kreuzer-Skarke landscape.Fortschritte der Physik, 68(11-12):2000086, 2020

Reference 45

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f92e1857-8be7-4c6f-8970-6be9bf3556f8 · outbound

This paper cites Constructing unrooted phylogenetic trees with reinforcement learning.Studia Universitatis Babe¸ s-Bolyai Informatica, 66(1):37–53, 2021.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Constructing unrooted phylogenetic trees with reinforcement learning.Studia Universitatis Babe¸ s-Bolyai Informatica, 66(1):37–53, 2021

Reference 46

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86ef36c6-177d-40a3-8804-9428c58ee2d4 · outbound

This paper cites Rhombus tilings: decomposition and space structure.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips Rhombus tilings: decomposition and space structure

Reference 47

Resolution: unresolved; no resolver link, observed 2026-06-29T08:52:41.695397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00368593-4464-477e-a40c-89883050d22d · outbound

This paper cites What makes math problems hard for reinforcement learning: a case study.

TriSearch: Learning to Optimize Triangulations via Bistellar Flips What makes math problems hard for reinforcement learning: a case study

Reference 48

Resolution: malformed identifier; arxiv_id, observed 2026-06-29T08:53:15.561070Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Pith citing papers

No inbound Pith citation observations are available.