{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TBF7ON7WSIM2W4MBRWNP4S3XOY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"65594708a024a60aa3047e11f422d96a96b36e1db975530cf3949b2d2c6fc903","cross_cats_sorted":["math.HO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-06T18:05:54Z","title_canon_sha256":"2ba080c880f51744cb185af2aa28052a7496f7a8ccc875b8a65f722b5ce0c6ed"},"schema_version":"1.0","source":{"id":"1908.02749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02749","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02749v2","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02749","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"TBF7ON7WSIM2","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_16","alias_value":"TBF7ON7WSIM2W4MB","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_8","alias_value":"TBF7ON7W","created_at":"2026-07-05T00:07:52Z"}],"graph_snapshots":[{"event_id":"sha256:6df90661a236270cd2c969c7a16a72fb6f783e84186afa867b8ef1f2f9e919ff","target":"graph","created_at":"2026-07-05T00:07:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The {\\it largest angle bisection} procedure is the operation which partitions a given triangle, $T$, into two smaller triangles by constructing the angle bisector of the largest angle of $T$. Applying the procedure to each of these two triangles produces a partition of $T$ into four smaller triangles. Continuing in this manner, after $n$ iterations, the initial triangle is divided into $2^n$ small triangles. We prove that as $n$ approaches infinity, the diameters of all these $2^n$ triangles tend to $0$, the smallest angle of all these triangles is bounded away from $0$, and that, with the exc","authors_text":"Dan Ismailescu, Jeewoo Lee, Joehyun Kim, Kelvin Kim","cross_cats":["math.HO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-06T18:05:54Z","title":"The largest angle bisection procedure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02749","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:869c15b75303b4585cdd839ba16546aed2655f0051d36660468c293a49dba599","target":"record","created_at":"2026-07-05T00:07:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"65594708a024a60aa3047e11f422d96a96b36e1db975530cf3949b2d2c6fc903","cross_cats_sorted":["math.HO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-08-06T18:05:54Z","title_canon_sha256":"2ba080c880f51744cb185af2aa28052a7496f7a8ccc875b8a65f722b5ce0c6ed"},"schema_version":"1.0","source":{"id":"1908.02749","kind":"arxiv","version":2}},"canonical_sha256":"984bf737f69219ab71818d9afe4b7776364ba2f22ea581ae93b1036c532c9441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"984bf737f69219ab71818d9afe4b7776364ba2f22ea581ae93b1036c532c9441","first_computed_at":"2026-07-05T00:07:52.710475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:07:52.710475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1w8FPkxj2I3JiwCd6+W/9IUUQBRgpaAM//q6xn6R/+fLb8QxCKkpZr+aeyqpbxKzJdusmSGRerDLeXDdzYPaBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:07:52.710943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:869c15b75303b4585cdd839ba16546aed2655f0051d36660468c293a49dba599","sha256:6df90661a236270cd2c969c7a16a72fb6f783e84186afa867b8ef1f2f9e919ff"],"state_sha256":"44fdebf73cae99a16398dc8f5d8898f892a2bdb180fa5d8b9c3e1591fcc09ce5"}