{"as_of":"2026-08-16T13:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd731050d165c21865e3b0f5f6efa64c87d408d3f1bcb2466c44fbb7612d4709","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T02:26:16.552805Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2607.25457/citation-record","integrity":"/paper/2607.25457/integrity","json":"/paper/2607.25457/citation-record.json","paper":"/paper/2607.25457"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T02:26:16.209532Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.25457","last_updated":"2026-07-28T08:47:20Z","snapshot_observed_at":"2026-08-06T16:05:08.736146Z","submitted_at":"2026-07-28T08:47:20Z","title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T02:26:16.209532Z"},"links":{"citing_paper":"/paper/2607.25457"},"observation_digest":"sha256:ff6d7b8ad1811f03fefeb7a479025079fd380a5bcc380c4fe0d3e83c14e6f46c","observation_id":"44b0475c-eb43-46af-9ca9-21ca1bc3e244","resolution":{"observed_at":"2026-08-01T02:26:16.209532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T02:26:16.246435Z","title":"Plaza, J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.25457","last_updated":"2026-07-28T08:47:20Z","snapshot_observed_at":"2026-08-06T16:05:08.736146Z","submitted_at":"2026-07-28T08:47:20Z","title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T02:26:16.246435Z"},"links":{"citing_paper":"/paper/2607.25457"},"observation_digest":"sha256:c7d53ca25a3a09c53467bcc945b3211c5c3aeb7091dc6a7bd28662a6f467037b","observation_id":"42714de8-bd81-4007-8515-548fe91ce54e","resolution":{"observed_at":"2026-08-01T02:26:16.246435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T02:26:16.318614Z","title":null,"venue":null,"work_id":null,"year":2037},"citing_paper":{"arxiv_id":"2607.25457","last_updated":"2026-07-28T08:47:20Z","snapshot_observed_at":"2026-08-06T16:05:08.736146Z","submitted_at":"2026-07-28T08:47:20Z","title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T02:26:16.318614Z"},"links":{"citing_paper":"/paper/2607.25457"},"observation_digest":"sha256:d7715a25617d21c9d50087623e4f1109b5f8409b002428679e3a78ff1caf6935","observation_id":"fa1c8078-268f-48b6-b04e-6d0c88a2dbc1","resolution":{"observed_at":"2026-08-01T02:26:16.318614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T02:26:16.434893Z","title":"Perdomo and A","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.25457","last_updated":"2026-07-28T08:47:20Z","snapshot_observed_at":"2026-08-06T16:05:08.736146Z","submitted_at":"2026-07-28T08:47:20Z","title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T02:26:16.434893Z"},"links":{"citing_paper":"/paper/2607.25457"},"observation_digest":"sha256:5b6ac2404e63a20a1aeb21f38f8ada41d6bc775779227381a8b77fd26fa96dc7","observation_id":"4d2f2e24-3004-4acf-bc6c-db0a0accefef","resolution":{"observed_at":"2026-08-01T02:26:16.434893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T02:26:16.496378Z","title":"Korotov, A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.25457","last_updated":"2026-07-28T08:47:20Z","snapshot_observed_at":"2026-08-06T16:05:08.736146Z","submitted_at":"2026-07-28T08:47:20Z","title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T02:26:16.496378Z"},"links":{"citing_paper":"/paper/2607.25457"},"observation_digest":"sha256:e8bee5ba4e0f3b379edbc36ddfd3e5544ecedc764523111c54878fd68c312974","observation_id":"13409ee0-6294-405c-96e5-9c5b7bd4cc73","resolution":{"observed_at":"2026-08-01T02:26:16.496378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.02749","last_updated":"2019-09-29T13:10:26Z","snapshot_observed_at":"2026-08-16T03:34:11.046036Z","submitted_at":"2019-08-06T18:05:54Z","title":"The largest angle bisection procedure","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.02749","snapshot_observed_at":"2026-08-01T02:26:16.552805Z","title":"Ismailescu, J","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2607.25457","last_updated":"2026-07-28T08:47:20Z","snapshot_observed_at":"2026-08-06T16:05:08.736146Z","submitted_at":"2026-07-28T08:47:20Z","title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T02:26:16.552805Z"},"links":{"cited_paper":"/paper/1908.02749","citing_paper":"/paper/2607.25457"},"observation_digest":"sha256:06be3bd7f2bf0c1f5dba37ca6807fdf6ee8897f347af08577ab60593abac1e24","observation_id":"bfdc8ed1-6e43-4651-afb7-50b04df48eaa","resolution":{"observed_at":"2026-08-01T02:26:16.552805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.25457","last_updated":"2026-07-28T08:47:20Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-06T16:05:08.736146Z","submitted_at":"2026-07-28T08:47:20Z","title":"On Triangulations Generated by the Largest-Angle $n$-Section Algorithm"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":6},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2607.25457."}