{"as_of":"2026-08-05T14:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff2c0b76d850aace34ff819297d4627199febbba6e413636218e0cc1f5ade172","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T08:52:41.695397Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.30220/citation-record","integrity":"/paper/2605.30220/integrity","json":"/paper/2605.30220/citation-record.json","paper":"/paper/2605.30220"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T08:52:41.695397Z","title":"Iste, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:d509ea492785d1de96055e2426d33b3df57a7aeadff1b48bf4bb7d863813dbb1","observation_id":"444f3299-7af4-40df-9572-5a6d87dc6a35","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Mesh generation and optimal triangulation","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:28bc08105d539076b12745e75db75b15372d6ef27e6e8fc3c83f3af8bc6850f2","observation_id":"a18a71d4-13b5-498e-af1b-e24b9cc2f451","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Delaunay refinement algorithms for triangular mesh generation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:9f0e3bea46199a9450df73c6a567129812c660e8af2b81989f56acb64efe81b1","observation_id":"ffeeb800-844f-42a7-81f7-b991df7eb16d","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"alg-geom/9310003","last_updated":"1993-10-05T21:22:35Z","snapshot_observed_at":"2026-07-07T00:08:20.462996Z","submitted_at":"1993-10-05T21:22:35Z","title":"Dual Polyhedra and Mirror Symmetry for Calabi-Yau Hypersurfaces in Toric Varieties","version":1},"cited_work":{"arxiv_id":"alg-geom/9310003","doi":null,"metadata_source":"pith","pith_arxiv_id":"alg-geom/9310003","snapshot_observed_at":"2026-07-04T02:29:24.165470Z","title":"Dual Polyhedra and Mirror Symmetry for Calabi-Yau Hypersurfaces in Toric Varieties","venue":"alg-geom","work_id":"6da39747-5d6a-494d-a6fd-6de24bb15403","year":1993},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/alg-geom/9310003","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:8ce1f85658689b09fb74d3d081f1779633c461ae7cb2bf02514a598b90b2908e","observation_id":"c3b3a0ea-1ac1-419f-a5fb-375eda0324e5","resolution":{"observed_at":"2026-06-29T08:53:15.588687Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"hep-th/0002240","last_updated":"2000-02-28T16:25:24Z","snapshot_observed_at":"2026-07-07T04:35:58.689626Z","submitted_at":"2000-02-28T16:25:24Z","title":"Complete classification of reflexive polyhedra in four dimensions","version":1},"cited_work":{"arxiv_id":"hep-th/0002240","doi":null,"metadata_source":"pith","pith_arxiv_id":"hep-th/0002240","snapshot_observed_at":"2026-07-04T07:29:39.331209Z","title":"Complete classification of reflexive polyhedra in four dimensions","venue":"hep-th","work_id":"5034a6a1-1e2a-4067-8a04-5159bce295c0","year":2000},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/hep-th/0002240","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:4a6330778182059ff30a92aff6613a14b1d6c2f0f9c07a887a02c4f092940648","observation_id":"b6eca0ea-8308-4ad7-9254-8de29edc0b7b","resolution":{"observed_at":"2026-06-29T08:53:15.586209Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T08:52:41.695397Z","title":"Tetrahedrizing point sets in three dimensions","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:30bf65048d5866291430d2aefac6a3b557dd474892e23aaaf80419db57321af9","observation_id":"2e5da9f1-177c-4d79-b9a0-6b581055fc0b","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"De Loera, and Jürgen Richter-Gebert","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:67c23d68da11e494e599d4e86b2efd3791b70f145b6b10a4a1bdfa9bbc84c8be","observation_id":"e56493fb-3c69-43ed-8b3d-41bb04b5a119","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Minimum-weight triangulation is NP-hard.Journal of the ACM (JACM), 55(2):1–29, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:a32c74c608ce27765bd049cc3b6c7995efb7f7c8cb4dc32f32d5e388fb3b8d90","observation_id":"f8221508-a67d-4c9f-ac18-e07c2db43cd0","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.03823","last_updated":"2022-11-07T19:13:48Z","snapshot_observed_at":"2026-07-06T14:15:29.231976Z","submitted_at":"2022-11-07T19:13:48Z","title":"CYTools: A Software Package for Analyzing Calabi-Yau Manifolds","version":1},"cited_work":{"arxiv_id":"2211.03823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.03823","snapshot_observed_at":"2026-07-04T07:29:39.334800Z","title":"CYTools: A Software Package for Analyzing Calabi-Yau Manifolds","venue":null,"work_id":"0236732b-d19d-4934-9020-599ecbf9870c","year":2022},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/2211.03823","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:d3fffc1f92661449a9690129a767159b7144aa111ef2e6cec9bae5149c67a6e8","observation_id":"c578a5f4-b9c5-4830-b3b8-6262435e2a18","resolution":{"observed_at":"2026-06-29T08:53:15.583399Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T08:52:41.695397Z","title":"On counting triangulations in d dimensions.Computational Geometry, 3(6):315–325, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:49d563517cbe9cdf792226af9debd47a9e8b4c8ed580369bce098b05cb21e537","observation_id":"5af12122-45c8-476d-96be-24ac25472644","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Optimality of the delaunay triangulation in rd","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:2ff3b0473442b7448730730e6fda44b1243ffa9c6cb6b42f9688e468c614f947","observation_id":"e7d0ddb6-47c8-4c2d-b8f0-3293eb8af3a4","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Topcom: Triangulations of point configurations and oriented matroids","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:f290d17455bdb94ee8a7fff50247db41ec830f9f5e3436796fafed542aa9d0c5","observation_id":"06acf38c-cc75-40b0-8c5f-9934ed54c6fc","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon.European Journal of Operational Research, 290(2):405–421, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:cf60c6e2b418469a0dd68323271cc3c2a75786cab1525e2f652cba79dfbd20ca","observation_id":"9e5de71e-08f7-4c37-afce-334f78b4efcd","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Reinforcement learning for combinatorial optimization: A survey.Computers & Operations Research, 134:105400, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:0350d341853e575760ddf3b0fe63825742f1cb3b2beaec5c8531af43cf728b6a","observation_id":"49feef0d-3864-4392-8c75-c4a3c2d855bb","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Combinatorial optimization and reasoning with graph neural networks.Journal of Machine Learning Research, 24(130):1–61, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:b3d4f1a04350c869d8dc909c74bf100c479826a6668d12af85281668b67931e6","observation_id":"7fb3a7e0-ae27-49a5-abc9-b6143bd2ef44","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Pointer networks.Advances in neural information processing systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:2bc3df3cacebd7278908df5680a22a328ee77fd01a89e46215d900a20fa8e437","observation_id":"df3536ff-7aa1-44cc-bacc-437d74d944de","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09940","last_updated":"2017-01-12T23:55:36Z","snapshot_observed_at":"2026-07-06T05:20:39.825511Z","submitted_at":"2016-11-29T23:22:39Z","title":"Neural Combinatorial Optimization with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"1611.09940","doi":"10.48550/arxiv.1611.09940","metadata_source":"pith","pith_arxiv_id":"1611.09940","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Neural Combinatorial Optimization with Reinforcement Learning","venue":"cs.AI","work_id":"86c3352e-7964-488c-9a6a-22803e1cd602","year":2016},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1611.09940","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:5d8a27a16c2597a0f6746a1eed6152d1a410d03f3bddc3071d7bd2caf829e6de","observation_id":"cc857bed-45dc-48b3-bb7e-858a01b8e057","resolution":{"observed_at":"2026-06-29T08:53:15.552084Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08475","last_updated":"2019-02-07T09:10:08Z","snapshot_observed_at":"2026-07-06T06:29:42.428021Z","submitted_at":"2018-03-22T17:22:24Z","title":"Attention, Learn to Solve Routing Problems!","version":3},"cited_work":{"arxiv_id":"1803.08475","doi":"10.48550/arxiv.1803.08475","metadata_source":"pith","pith_arxiv_id":"1803.08475","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Attention, Learn to Solve Routing Problems!","venue":"stat.ML","work_id":"b61b79e9-c607-4f4d-992a-7e03a8657fbc","year":2018},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1803.08475","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:6f0b2bf9fc5022c4f2aee831fd51e495538e7e5fdeeab4c9008ba1728a2735e6","observation_id":"c546c09b-d3d9-4666-9fa7-d5dd6bf1bbd6","resolution":{"observed_at":"2026-06-29T08:53:15.554904Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T08:52:41.695397Z","title":"Reinforcement learning for solving the vehicle routing problem","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:7c55a781719629937d131bae239ba546375ba2f2cef0bf8f932ad89f8ddcaa51","observation_id":"7d5cf3b0-2494-453b-9d2f-13a655fc565a","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"POMO: Policy optimization with multiple optima for reinforcement learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:798bcb92fd4a7e4e88c3fbdd05507227267a4a5c0bd212862ad7b95b70dcb106","observation_id":"170c7098-704f-4378-99f6-95a5a1fe228d","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"On the difficulty of triangulating three-dimensional nonconvex polyhedra.Discrete & Computational Geometry, 7(3):227–253, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:81475168f972aadb6222bf5891d75cbc82ca32a35bd0eecf59a91bf8807163f1","observation_id":"f4f5f712-e109-4df1-82c7-d933328ce5d2","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Learning improvement heuristics for solving routing problems.IEEE Transactions on Neural Networks and Learning Systems, 33(9):5057–5069, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:946ebcd2ae1cdcdb0759bb7a5cec1c0efcd10b6f5d4784cf0ad174409c8b0ed6","observation_id":"bdf93fcd-2ca3-44a4-9223-d1dc72483d88","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Learning to perform local rewriting for combinatorial optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:3f3fbe2defef194c8aa5d0c4bce8f307c8277fbe8c679bb4aabebc6efa48191b","observation_id":"78af0851-5f7f-4277-bc22-e213a3022bed","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Barrett, William R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:083da4b5fb3d888194ef2f2593b14c644fe4669ad35d6d79e4b8cbc88402cb60","observation_id":"8d2a3c64-bc7b-4c5f-b9ee-f2ce3cdacad9","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Falkner, Daniela Thyssens, Ahmad Bdeir, and Lars Schmidt-Thieme","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:fad8997b3a37cb8bd229de1f4e7a99a5a2edb708f7ca8ce4bbc617274fdb67c1","observation_id":"063eaf96-f220-40c3-baac-2ca26ce524e3","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Springer Science & Business Media, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:6bb7b1e1e13b0a8e590aeffa743aca986439636fa33a438acfddd6c3e09cdb41","observation_id":"08f03c34-852a-4927-a015-d77182fc2f99","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"A-discriminants","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:f406bd6bebb7a14ceb51064b0b6b27e1fed683116615666cf671b5bc59c1ece8","observation_id":"ae6c6ed8-ead1-431e-9231-2bb9e36df92e","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Transforming triangulations.Discrete mathematics, 3(4):365–372, 1972","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:0d5ef9c3444e2c8a0b282e8de47dcae1e350e372b76f64fd700e8cbd860d54ac","observation_id":"7d342f57-ec0c-42ed-9024-793d22b9e6c2","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:caaaaab6a83d95512be1b1575f960525f29e089fd457360cf1c5742e8570d96c","observation_id":"22bdc839-2df3-47f8-8639-8eb7d7af360e","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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":"2507.03732","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T14:29:54.893551Z","title":"Transforming Calabi-Yau Constructions: Generating New Calabi-Yau Manifolds with Transformers","venue":null,"work_id":"4d9dd795-cc34-47de-9a90-231b38a893fc","year":2025},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:15cbe08645ed93173aa7870516d3857c9a63adc558ffb55c797302e921f5966d","observation_id":"23281fe2-d34e-4b34-acae-fcfcf5e4979d","resolution":{"observed_at":"2026-06-29T08:53:15.572663Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"cited_work":{"arxiv_id":"2104.13478","doi":"10.48550/arxiv.2104.13478","metadata_source":"pith","pith_arxiv_id":"2104.13478","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","venue":"cs.LG","work_id":"5e909969-dcfb-40f6-9099-241ea6f18350","year":2021},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/2104.13478","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:b8f6f08e0babbb7045f6e357db2f45204619290082ae262afc6057c9593e2d05","observation_id":"fb407116-1bfc-44d2-99a5-3d9666dd4ecc","resolution":{"observed_at":"2026-06-29T08:53:15.549353Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T08:52:41.695397Z","title":"E(n) equivariant graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:c6e390bf90aa3e5bdf8e5771557b44ad123158e03256a016e9b11add33bd13ee","observation_id":"bdb4cd0e-58cb-4fa6-b895-4c978e8102d3","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.11990","last_updated":"2023-02-28T02:07:30Z","snapshot_observed_at":"2026-08-04T16:29:41.851417Z","submitted_at":"2022-06-23T21:40:37Z","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","version":2},"cited_work":{"arxiv_id":"2206.11990","doi":"10.48550/arxiv.2206.11990","metadata_source":"pith","pith_arxiv_id":"2206.11990","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Equiformer: Equivariant graph attention transformer for 3d atomistic graphs","venue":"cs.LG","work_id":"d47d8ff7-3c9b-4ebb-a924-d230ebe62d2d","year":2022},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/2206.11990","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:c5518e88645ba9e165b07b5cb462c6bba41ce7ec5b88cdf2b262cd317e63dc13","observation_id":"a86a0260-b9c5-46bf-b6f1-172b5f8ed567","resolution":{"observed_at":"2026-06-29T08:53:15.558081Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12059","last_updated":"2024-03-06T21:45:16Z","snapshot_observed_at":"2026-07-06T15:44:58.275437Z","submitted_at":"2023-06-21T07:01:38Z","title":"EquiformerV2: Improved Equivariant Transformer for Scaling to Higher-Degree Representations","version":3},"cited_work":{"arxiv_id":"2306.12059","doi":"10.48550/arxiv.2306.12059","metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12059","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Equiformerv2: Improved equivariant transformer for scaling to higher-degree representations","venue":"arXiv (Cornell University)","work_id":"47d4b3c8-7130-4ff3-b204-589fe12fd897","year":2024},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/2306.12059","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:54ff6b809f018f1b9330510ef60de2e946bc708e39c0417964b835a465e6298c","observation_id":"09161d06-f1b7-47d2-abdc-3975a6ac0cad","resolution":{"observed_at":"2026-06-29T08:53:15.580601Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-13T16:19:40.628832+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T16:19:40.628832+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T08:52:41.695397Z","title":"Hypergraph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:0885ca007a4128667a3f986d8d1a59d340df1ec1ee671c756e0c835363b647c9","observation_id":"a4a8b9ec-2e90-48b9-801b-b8c39cb0ddf7","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Simplicial neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:3cf22f5c42a22d9efe78c0b3d06ae0b987f4335cb0ff047e73d0eb09104cb5d1","observation_id":"9a5c7bdb-448f-43e6-84e0-140afdc3d342","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Simplicial complex neural networks.IEEE Transactions on Pattern Analysis and Machine Intelligence, 46(1):561–575, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:7e7cefbdf4717079ae953a9bd6734d0b70add5363666e46fefb07f8863dad577","observation_id":"14ba8713-eeee-40ae-949b-355bed4a212f","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten.Mathematis- che Annalen, 83(1):113–115, 1921","venue":null,"work_id":null,"year":1921},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:28072bde5a3d1f976e36a3d0a6daa1555440512ff2dfe6972c6f18b65f554a73","observation_id":"b9546b03-12c3-4cdd-9ad7-5f5150a3f386","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Non-connected toric Hilbert schemes.Mathematische Annalen, 332(3):645– 665, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:ae12e575a2f22d4173d799d112839a2cc5ec6eb016f0eb86c11347d29f93b1a8","observation_id":"753b1b5c-e0a3-47b7-a09c-e0f7e7ba5fb4","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.10995","last_updated":"2021-02-26T21:21:11Z","snapshot_observed_at":"2026-07-06T07:30:05.397042Z","submitted_at":"2019-01-30T18:40:37Z","title":"Go-Explore: a New Approach for Hard-Exploration Problems","version":4},"cited_work":{"arxiv_id":"1901.10995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.10995","snapshot_observed_at":"2026-07-04T15:29:55.587215Z","title":"Go-explore: a new approach for hard-exploration problems","venue":null,"work_id":"811ed60c-dea3-46b6-b28f-bf76eb844c38","year":1901},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1901.10995","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:f1b453e950e0a3ce3f209de6a69cd4e7c21c2c0d733ab635fa12978bb5d78757","observation_id":"2759fabd-86b8-46a4-ae4b-5750368d85a7","resolution":{"observed_at":"2026-06-29T08:53:15.569692Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":"1707.06347","doi":"10.1016/j.artint.2010.12.005","metadata_source":"pith","pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proximal Policy Optimization Algorithms","venue":"cs.LG","work_id":"240c67fe-d14d-4520-91c1-38a4e272ca19","year":2017},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:73f84327bc3964e30329334652eb4add5fed8e7db21e93fc5a2362afa9f434cb","observation_id":"cd4630ae-5313-4297-8a97-ce1a1d25960f","resolution":{"observed_at":"2026-06-29T08:53:15.563709Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02438","last_updated":"2018-10-20T18:55:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2015-06-08T11:12:48Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","version":6},"cited_work":{"arxiv_id":"1506.02438","doi":"10.48550/arxiv.1506.02438","metadata_source":"pith","pith_arxiv_id":"1506.02438","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","venue":"cs.LG","work_id":"38e3ca94-96f0-4b19-a355-0754931af8be","year":2015},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1506.02438","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:7fd76e7386ce8789d232cea7eda6fc95aa01334f47d02006c2d55d1b342a2ebc","observation_id":"481a92c7-1cb6-4d60-a520-3e0ae99289ee","resolution":{"observed_at":"2026-06-29T08:53:15.575206Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.05941","last_updated":"2017-10-27T17:45:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-16T18:05:45Z","title":"Searching for Activation Functions","version":2},"cited_work":{"arxiv_id":"1710.05941","doi":"10.48550/arxiv.1710.05941","metadata_source":"pith","pith_arxiv_id":"1710.05941","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Searching for Activation Functions","venue":"cs.NE","work_id":"3a43a02d-e005-47ad-8373-c166e20c9ee9","year":2017},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1710.05941","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:e639a31503c126ee52fa8091f178f5d897edd0ed681cfdbf367c9c0c28b708e9","observation_id":"2e954313-dd51-460c-b39a-d7bab4e0faa1","resolution":{"observed_at":"2026-06-29T08:53:15.577754Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-13T22:50:52.328775+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T22:50:52.328775+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":"1412.6980","doi":"10.1002/mrm.28086","metadata_source":"pith","pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Adam: A Method for Stochastic Optimization","venue":"cs.LG","work_id":"1910796d-9b52-4683-bf5c-de9632c1028b","year":2014},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:7a4a8452aa2e69de84116d2d197c344fc6245ce2e4c25338c02908300a384c71","observation_id":"b383463b-784a-4ef0-847f-d2d3d7c893e7","resolution":{"observed_at":"2026-06-29T08:53:15.566581Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-29T08:52:41.695397Z","title":"Bounding the Kreuzer-Skarke landscape.Fortschritte der Physik, 68(11-12):2000086, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:5623167e710fb29bfef74ba02fe866d7e785d99c8f4301f7f9c888539907f86c","observation_id":"40530ed0-26d9-4701-8fe6-d22b8ce5067b","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Constructing unrooted phylogenetic trees with reinforcement learning.Studia Universitatis Babe¸ s-Bolyai Informatica, 66(1):37–53, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:e487209ce4fa6f711a356947c93caf31adc32f1360c0fb6fa274f48aa8224271","observation_id":"f92e1857-8be7-4c6f-8970-6be9bf3556f8","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","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-06-29T08:52:41.695397Z","title":"Rhombus tilings: decomposition and space structure","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:f668eef66a058c72538a0027c234bfc86b8ed9fb0962b07713d1d81a65c469c8","observation_id":"86ef36c6-177d-40a3-8804-9428c58ee2d4","resolution":{"observed_at":"2026-06-29T08:52:41.695397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15332","last_updated":"2025-02-11T18:01:40Z","snapshot_observed_at":"2026-07-06T19:06:45.969497Z","submitted_at":"2024-08-27T18:00:06Z","title":"What makes math problems hard for reinforcement learning: a case study","version":2},"cited_work":{"arxiv_id":"2408.15332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.15332","snapshot_observed_at":"2026-06-29T08:53:15.559455Z","title":"Medina-Mardones, Lucas Fagan, Bartłomiej Lewandowski, Angus Gruen, Yang Qiu, Piotr Kucharski, Zhenghan Wang, and Sergei Gukov","venue":null,"work_id":"cdc45787-b923-45c3-a5e6-a448dac1f675","year":2024},"citing_paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T08:52:41.695397Z"},"links":{"cited_paper":"/paper/2408.15332","citing_paper":"/paper/2605.30220"},"observation_digest":"sha256:0bfc9587d1066af22d85042d1eb8d98d1d6b5140367a8252f3ecbfb4ed4a6346","observation_id":"00368593-4464-477e-a40c-89883050d22d","resolution":{"observed_at":"2026-06-29T08:53:15.561070Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.30220","last_updated":"2026-05-28T16:54:06Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:39:34.232661Z","submitted_at":"2026-05-28T16:54:06Z","title":"TriSearch: Learning to Optimize Triangulations via Bistellar Flips"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":14,"verified_fuzzy":0},"total_outbound_references":48},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"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."}