Pith. sign in

Paper Citation Record · LEDGER

Computing Non-Obtuse Triangulations with Few Steiner Points

As of 8 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2505.23375.

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

pith.paper-citation-record.v1
2505.23375 v1

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:54:47.239135Z

measured 13 of 13 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+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

13 of 13 outbound references displayed

  • verified exact5
  • verified fuzzy5
  • unresolved2
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3018400e-38f3-427d-a645-a14146a2b672 · outbound

This paper cites Incremental algorithm and local search for minimum non-obtuse triangulations (CG challenge).

Computing Non-Obtuse Triangulations with Few Steiner Points Incremental algorithm and local search for minimum non-obtuse triangulations (CG challenge)

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:54:49.733453Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.319356Z digest=sha256:5bfd4ebb1ed43b86e86676cd932f912a070be40c7792e5b18aef344f8fe7d0c5

Observation 9e755f61-dce1-47d4-9ed3-56a5df33dbc4 · outbound

This paper cites Baker, Eric Grosse, and Conor S.

Computing Non-Obtuse Triangulations with Few Steiner Points Baker, Eric Grosse, and Conor S

Reference 2

Resolution
verified exact
doi, observed 2026-08-07T12:54:48.174391Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.365817Z digest=sha256:30453da57214f6b02e60186e2ecbb79dee96f72b093ad6fd9ddc82d6250ab392

Observation 92bea4bb-67ca-4582-9f2f-4cc0ea08ff5b · outbound

This paper cites Bern, Scott A.

Computing Non-Obtuse Triangulations with Few Steiner Points Bern, Scott A

Reference 3

Resolution
verified exact
doi, observed 2026-08-07T12:54:48.010909Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.417450Z digest=sha256:7cfccb2e58caa2c758947e9f97dbbac86c1af37d039c2a58f0a6f4ae9dd14dd9

Observation c135e127-31ef-4a2b-9d84-a95efe856937 · outbound

This paper cites On nonobtuse simplicial partitions.

Computing Non-Obtuse Triangulations with Few Steiner Points On nonobtuse simplicial partitions

Reference 4

Resolution
verified exact
doi, observed 2026-08-07T12:54:47.809291Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.485361Z digest=sha256:360869f2b74aad46fb1cffef3fd210d7d43f39cd12e1f59fd1bd278cb16446e7

Observation 087caabd-d274-41b5-bebe-0b973e9028b9 · outbound

This paper cites Burago and V.

Computing Non-Obtuse Triangulations with Few Steiner Points Burago and V

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:54:49.489499Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.554106Z digest=sha256:1a74f5925c682a83fd650755b7b79322f35802af47d5aabfe63ce7cf14f952fc

Observation b1a75726-bd6a-4d8b-917e-6dd01c637f39 · outbound

This paper cites Computing acute and non-obtuse triangulations.

Computing Non-Obtuse Triangulations with Few Steiner Points Computing acute and non-obtuse triangulations

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:54:49.271351Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.624083Z digest=sha256:dc7624f1f7a0ff7dc9744fcd34d980655fec8da6832033596ca268601b7ed0ca

Observation 9e8097c8-0239-42c6-ab8a-79a585fab681 · outbound

This paper cites Computing triangulations without small and large angles.

Computing Non-Obtuse Triangulations with Few Steiner Points Computing triangulations without small and large angles

Reference 7

Resolution
verified exact
doi, observed 2026-08-07T12:54:47.613043Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.727865Z digest=sha256:75cb8b378bb3864f83034b28e530093b82dcc544b4fe2b3095876d12a13a3d8b

Observation bddda94f-e06b-4896-ab57-7b1ec468e300 · outbound

This paper cites Quality triangulations with locally optimal steiner points.

Computing Non-Obtuse Triangulations with Few Steiner Points Quality triangulations with locally optimal steiner points

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-07T12:54:46.861068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:54:46.861068Z digest=sha256:19bb3a7ace23be80e40ca546d41460349c12ed839e71896990f5a9e81e829475

Observation f70b5a6f-6598-4bfd-a45d-6bf542c39710 · outbound

This paper cites Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025.

Computing Non-Obtuse Triangulations with Few Steiner Points Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025

Reference 9

Resolution
metadata mismatch
local_arxiv, observed 2026-08-07T12:54:48.363212Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:46.971795Z digest=sha256:9788ef4f3a3bdcaa06aae3f5594f1ce1ee9530ffe69036d44662d6640cec4c29

Observation ab4f32a7-9922-467a-9acb-44d65be8013c · outbound

This paper cites Acute triangulations of polygons.

Computing Non-Obtuse Triangulations with Few Steiner Points Acute triangulations of polygons

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:54:48.976964Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:47.049645Z digest=sha256:9c62f10b7be4789f87c984e5cbab66556449813fa77e633a0a587da047c28cee

Observation 556dbceb-8d93-499e-b396-0cbd277acd7f · outbound

This paper cites Maschler, S.

Computing Non-Obtuse Triangulations with Few Steiner Points Maschler, S

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:54:48.755981Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:47.091037Z digest=sha256:553125d2eb8fb48c1ae29410a07e69aaf366ee2a402761572b3b1ac373d9bff6

Observation b2fd29fa-5d40-4054-9fdc-dcc4eea4b1ff · outbound

This paper cites an unresolved cited work.

Computing Non-Obtuse Triangulations with Few Steiner Points Unresolved cited work

Reference 12

Resolution
unresolved
raw_fallback, observed 2026-08-07T12:54:48.551387Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:47.150584Z digest=sha256:df9ea120b64d552e7078482b5f6a9667d7f01f09ccdacd0dad397386c9e276fc

Observation 454d27ef-f75a-440e-a973-1b8ece9c83ac · outbound

This paper cites Interleaving delaunay refinement and optimization for 2d triangle mesh generation.

Computing Non-Obtuse Triangulations with Few Steiner Points Interleaving delaunay refinement and optimization for 2d triangle mesh generation

Reference 13

Resolution
verified exact
doi, observed 2026-08-07T12:54:47.455903Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T12:54:47.239135Z digest=sha256:89e34903d374af9c6152a114a69991f563139648184ae835009f75833e9aee36

Pith citing papers

No inbound Pith citation observations are available.