{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TB2TKLHJXPQHT7XBRVV3WJBXF7","short_pith_number":"pith:TB2TKLHJ","canonical_record":{"source":{"id":"1511.04036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-11-12T19:59:53Z","cross_cats_sorted":[],"title_canon_sha256":"c2242fb72a4ddeebb422de21d70b1a906114d7d8d995ace949647a53d1251695","abstract_canon_sha256":"b48f419b69a3c0307c075adf0fdfdc3da6517df21d910fa28f46ecba954f804a"},"schema_version":"1.0"},"canonical_sha256":"9875352ce9bbe079fee18d6bbb24372fc9e907e37513ab8eb74a44dde3cd2745","source":{"kind":"arxiv","id":"1511.04036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04036","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04036v1","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04036","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"TB2TKLHJXPQH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TB2TKLHJXPQHT7XB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TB2TKLHJ","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TB2TKLHJXPQHT7XBRVV3WJBXF7","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-11-12T19:59:53Z","cross_cats_sorted":[],"title_canon_sha256":"c2242fb72a4ddeebb422de21d70b1a906114d7d8d995ace949647a53d1251695","abstract_canon_sha256":"b48f419b69a3c0307c075adf0fdfdc3da6517df21d910fa28f46ecba954f804a"},"schema_version":"1.0"},"canonical_sha256":"9875352ce9bbe079fee18d6bbb24372fc9e907e37513ab8eb74a44dde3cd2745","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:06.193409Z","signature_b64":"tjq64TA5OR0yQYWRK+LM+Y7gWw3Xh6YO4r27rmD7Vfozt2GGGHmaKHBsjpC831GBMtHYXXNm810AdYhqnOe4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9875352ce9bbe079fee18d6bbb24372fc9e907e37513ab8eb74a44dde3cd2745","last_reissued_at":"2026-05-18T01:27:06.192444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:06.192444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04036","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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7schmuagg2LauLxbFIvPyr6P3VNBMBjU+3xT9OKYR1jSX3wa/iDOQbX0gkdP9Uu14XtgdzWwhoNCSZdQjRaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:39:39.095450Z"},"content_sha256":"65d24f1e493ea9eec664ebcc1afe1b3e841913491be4358a486d57dc3b6592ee","schema_version":"1.0","event_id":"sha256:65d24f1e493ea9eec664ebcc1afe1b3e841913491be4358a486d57dc3b6592ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TB2TKLHJXPQHT7XBRVV3WJBXF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Algorithm for the Separating Common Tangents of two Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mikkel Abrahamsen","submitted_at":"2015-11-12T19:59:53Z","abstract_excerpt":"We describe an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies to the same side of the line. A separating common tangent of two polygons is a tangent of both polygons where the polygons are lying on different sides of the tangent. Each polygon is given as a read-only array of its corners. If a separating common tangent does not exist, the algorithm reports that. Otherwise, two corners defining a separating common tangent are return"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04036","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:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOoch9oIudWsrlsKx+3M0hndHB8XTQSBbXO5N3FqnCZHVjygOOALKyvzM0qL+ZoLz08FATWBIsXS2vFIaaT2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:39:39.096115Z"},"content_sha256":"53826b01a40fd2a69f87e45be39b0176d2b434b107bb8288e6cf1767ec4cb5a0","schema_version":"1.0","event_id":"sha256:53826b01a40fd2a69f87e45be39b0176d2b434b107bb8288e6cf1767ec4cb5a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TB2TKLHJXPQHT7XBRVV3WJBXF7/bundle.json","state_url":"https://pith.science/pith/TB2TKLHJXPQHT7XBRVV3WJBXF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TB2TKLHJXPQHT7XBRVV3WJBXF7/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-27T21:39:39Z","links":{"resolver":"https://pith.science/pith/TB2TKLHJXPQHT7XBRVV3WJBXF7","bundle":"https://pith.science/pith/TB2TKLHJXPQHT7XBRVV3WJBXF7/bundle.json","state":"https://pith.science/pith/TB2TKLHJXPQHT7XBRVV3WJBXF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TB2TKLHJXPQHT7XBRVV3WJBXF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TB2TKLHJXPQHT7XBRVV3WJBXF7","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":"b48f419b69a3c0307c075adf0fdfdc3da6517df21d910fa28f46ecba954f804a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-11-12T19:59:53Z","title_canon_sha256":"c2242fb72a4ddeebb422de21d70b1a906114d7d8d995ace949647a53d1251695"},"schema_version":"1.0","source":{"id":"1511.04036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04036","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04036v1","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04036","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"TB2TKLHJXPQH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TB2TKLHJXPQHT7XB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TB2TKLHJ","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:53826b01a40fd2a69f87e45be39b0176d2b434b107bb8288e6cf1767ec4cb5a0","target":"graph","created_at":"2026-05-18T01:27:06Z","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 an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies to the same side of the line. A separating common tangent of two polygons is a tangent of both polygons where the polygons are lying on different sides of the tangent. Each polygon is given as a read-only array of its corners. If a separating common tangent does not exist, the algorithm reports that. Otherwise, two corners defining a separating common tangent are return","authors_text":"Mikkel Abrahamsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-11-12T19:59:53Z","title":"An Optimal Algorithm for the Separating Common Tangents of two Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04036","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:65d24f1e493ea9eec664ebcc1afe1b3e841913491be4358a486d57dc3b6592ee","target":"record","created_at":"2026-05-18T01:27:06Z","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":"b48f419b69a3c0307c075adf0fdfdc3da6517df21d910fa28f46ecba954f804a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-11-12T19:59:53Z","title_canon_sha256":"c2242fb72a4ddeebb422de21d70b1a906114d7d8d995ace949647a53d1251695"},"schema_version":"1.0","source":{"id":"1511.04036","kind":"arxiv","version":1}},"canonical_sha256":"9875352ce9bbe079fee18d6bbb24372fc9e907e37513ab8eb74a44dde3cd2745","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9875352ce9bbe079fee18d6bbb24372fc9e907e37513ab8eb74a44dde3cd2745","first_computed_at":"2026-05-18T01:27:06.192444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:06.192444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tjq64TA5OR0yQYWRK+LM+Y7gWw3Xh6YO4r27rmD7Vfozt2GGGHmaKHBsjpC831GBMtHYXXNm810AdYhqnOe4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:06.193409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65d24f1e493ea9eec664ebcc1afe1b3e841913491be4358a486d57dc3b6592ee","sha256:53826b01a40fd2a69f87e45be39b0176d2b434b107bb8288e6cf1767ec4cb5a0"],"state_sha256":"ece8caf84210d7dfd9277af3d51456012d38c2efd153346ea38477777cc92285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iC7yqxt1JqfSuaIwlooQsuEluq0KOxlHOV+zdRfT79OiGewK1KaQAyXhZHaUAXElUnPAo3w9EcsOXlvzyT5wAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:39:39.099948Z","bundle_sha256":"6737bd1f4e56cbaba6d3bc5d6abb01959ae52945c6565dc39a86a580ea50fb96"}}