{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G7EYDVS4G3DGOY23LBXNMEUTOK","short_pith_number":"pith:G7EYDVS4","canonical_record":{"source":{"id":"1605.03514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-05-11T16:59:03Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"9a71175b594a9ab746749d8e5366d028108a5f0cebfb800c1c58fc3ebefada76","abstract_canon_sha256":"e89928382f6157ca30f5341288b0a6f04eb58fe6abdcb4900d480de35032f52a"},"schema_version":"1.0"},"canonical_sha256":"37c981d65c36c667635b586ed6129372b7c7dd453e78003f58ebf2fd3b2ca698","source":{"kind":"arxiv","id":"1605.03514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03514","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03514v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03514","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"G7EYDVS4G3DG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G7EYDVS4G3DGOY23","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G7EYDVS4","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G7EYDVS4G3DGOY23LBXNMEUTOK","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-05-11T16:59:03Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"9a71175b594a9ab746749d8e5366d028108a5f0cebfb800c1c58fc3ebefada76","abstract_canon_sha256":"e89928382f6157ca30f5341288b0a6f04eb58fe6abdcb4900d480de35032f52a"},"schema_version":"1.0"},"canonical_sha256":"37c981d65c36c667635b586ed6129372b7c7dd453e78003f58ebf2fd3b2ca698","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:05.237402Z","signature_b64":"bbBiD/1PG0laeVaq0jXfwQBjOetd1HVUwkbqvklWhxkMb50Cjzq5q/kid6B79cRhHCpW0pUAmWjzf7Uatv3lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c981d65c36c667635b586ed6129372b7c7dd453e78003f58ebf2fd3b2ca698","last_reissued_at":"2026-05-18T01:15:05.236892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:05.236892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03514","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zd4p5vbdz2xDIKR3Ql+C2YycZBUWi6AMcaDUkdyUrXH6znsDZ5lXjLPq/Uqj8JusXJMZ/ywAO+cuErpV/nnKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:09:31.187253Z"},"content_sha256":"8c935b16e19d003335b2ca7035922d6a224d24d934ad41646e40e04604a053cf","schema_version":"1.0","event_id":"sha256:8c935b16e19d003335b2ca7035922d6a224d24d934ad41646e40e04604a053cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G7EYDVS4G3DGOY23LBXNMEUTOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Applications of fast triangulation simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.GT","authors_text":"Mark C. Bell, Richard C. H. Webb","submitted_at":"2016-05-11T16:59:03Z","abstract_excerpt":"We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.\n  In its simplest instances, this algorithm works by finding the minimal position of the two curves. We achieve this by phrasing the problem as a collection of linear programming problems. We describe how to reduce the more general case down to one of these simplest instances in polynomial time. This reduction relies on an algorithm by the first author to qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03514","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78yTd1X6s5pOW5WA4MJmoSp5fw9x0Qwer9NseQnM0TM9mYPnir7FXBeiTw3TU6vM+Qvb6RljRXMyGDqKMpmRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:09:31.187923Z"},"content_sha256":"c34915b4d461416b8c144ded9fb540f525fa9cc6565dc0fbf64c26cf533a09b8","schema_version":"1.0","event_id":"sha256:c34915b4d461416b8c144ded9fb540f525fa9cc6565dc0fbf64c26cf533a09b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7EYDVS4G3DGOY23LBXNMEUTOK/bundle.json","state_url":"https://pith.science/pith/G7EYDVS4G3DGOY23LBXNMEUTOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7EYDVS4G3DGOY23LBXNMEUTOK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:09:31Z","links":{"resolver":"https://pith.science/pith/G7EYDVS4G3DGOY23LBXNMEUTOK","bundle":"https://pith.science/pith/G7EYDVS4G3DGOY23LBXNMEUTOK/bundle.json","state":"https://pith.science/pith/G7EYDVS4G3DGOY23LBXNMEUTOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7EYDVS4G3DGOY23LBXNMEUTOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G7EYDVS4G3DGOY23LBXNMEUTOK","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":"e89928382f6157ca30f5341288b0a6f04eb58fe6abdcb4900d480de35032f52a","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-05-11T16:59:03Z","title_canon_sha256":"9a71175b594a9ab746749d8e5366d028108a5f0cebfb800c1c58fc3ebefada76"},"schema_version":"1.0","source":{"id":"1605.03514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03514","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03514v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03514","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"G7EYDVS4G3DG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G7EYDVS4G3DGOY23","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G7EYDVS4","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:c34915b4d461416b8c144ded9fb540f525fa9cc6565dc0fbf64c26cf533a09b8","target":"graph","created_at":"2026-05-18T01:15:05Z","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"},"paper":{"abstract_excerpt":"We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.\n  In its simplest instances, this algorithm works by finding the minimal position of the two curves. We achieve this by phrasing the problem as a collection of linear programming problems. We describe how to reduce the more general case down to one of these simplest instances in polynomial time. This reduction relies on an algorithm by the first author to qu","authors_text":"Mark C. Bell, Richard C. H. Webb","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-05-11T16:59:03Z","title":"Applications of fast triangulation simplification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03514","kind":"arxiv","version":1},"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:8c935b16e19d003335b2ca7035922d6a224d24d934ad41646e40e04604a053cf","target":"record","created_at":"2026-05-18T01:15:05Z","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":"e89928382f6157ca30f5341288b0a6f04eb58fe6abdcb4900d480de35032f52a","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2016-05-11T16:59:03Z","title_canon_sha256":"9a71175b594a9ab746749d8e5366d028108a5f0cebfb800c1c58fc3ebefada76"},"schema_version":"1.0","source":{"id":"1605.03514","kind":"arxiv","version":1}},"canonical_sha256":"37c981d65c36c667635b586ed6129372b7c7dd453e78003f58ebf2fd3b2ca698","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37c981d65c36c667635b586ed6129372b7c7dd453e78003f58ebf2fd3b2ca698","first_computed_at":"2026-05-18T01:15:05.236892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:05.236892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bbBiD/1PG0laeVaq0jXfwQBjOetd1HVUwkbqvklWhxkMb50Cjzq5q/kid6B79cRhHCpW0pUAmWjzf7Uatv3lCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:05.237402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c935b16e19d003335b2ca7035922d6a224d24d934ad41646e40e04604a053cf","sha256:c34915b4d461416b8c144ded9fb540f525fa9cc6565dc0fbf64c26cf533a09b8"],"state_sha256":"a45a0599b44cdfbf267435704e80bc1fd5b71c72eb9e1fb6d2d13f41b5dd7f34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkG0bawDTrEi6x2GeSjgGnyWVreFY1lZm3xSsjRZKpUXdlL8dfXuyyx/HSD1omnLkuJJvKLVD22Qm7d2frBmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:09:31.193430Z","bundle_sha256":"de4e9a3d8b6e958fd9789d92abbe0853ce0f37cec04d12108feac82f5cb31735"}}