{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RYVXICB6EVBXZUONRVHKIK7IRC","short_pith_number":"pith:RYVXICB6","canonical_record":{"source":{"id":"1311.0928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-04T23:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"6705230114c8765cdc692279aa985d1a000cd0232973d8ac4a640bc32bb6357c","abstract_canon_sha256":"fd570eaf491485db5d549d39319faa072223a622aa1b69ac899a2b4c3670d471"},"schema_version":"1.0"},"canonical_sha256":"8e2b74083e25437cd1cd8d4ea42be888978f54dbfa3cec55187665b0ee407d8c","source":{"kind":"arxiv","id":"1311.0928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0928","created_at":"2026-05-18T03:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0928v1","created_at":"2026-05-18T03:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0928","created_at":"2026-05-18T03:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"RYVXICB6EVBX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RYVXICB6EVBXZUON","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RYVXICB6","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RYVXICB6EVBXZUONRVHKIK7IRC","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-04T23:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"6705230114c8765cdc692279aa985d1a000cd0232973d8ac4a640bc32bb6357c","abstract_canon_sha256":"fd570eaf491485db5d549d39319faa072223a622aa1b69ac899a2b4c3670d471"},"schema_version":"1.0"},"canonical_sha256":"8e2b74083e25437cd1cd8d4ea42be888978f54dbfa3cec55187665b0ee407d8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:56.029402Z","signature_b64":"ked/yB0tCj5Q3HoG9ArJ/0AJYkbu4uNT1Jil9h4/6hWxrsgqccQJDTh0f5zO7bpd/MEMeJHFjwNURS9V/3O1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2b74083e25437cd1cd8d4ea42be888978f54dbfa3cec55187665b0ee407d8c","last_reissued_at":"2026-05-18T03:07:56.028890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:56.028890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0928","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-18T03:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhEn7VIq3rO12TJOcyO6baCOVb0SZZeaHq5VMedY9PE+KQ1MuRYC/OtfRvFmcBXREZTSZVEw+5o0t1vpVkaeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:17:43.405854Z"},"content_sha256":"76f8c364d4fb69ddd30306a08c9dc599851621d466c1d68cec71bba9f82d5d55","schema_version":"1.0","event_id":"sha256:76f8c364d4fb69ddd30306a08c9dc599851621d466c1d68cec71bba9f82d5d55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RYVXICB6EVBXZUONRVHKIK7IRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Order Type Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Greg Aloupis, John Iacono, \\\"Ozg\\\"ur \\\"Ozkan, Stefan Langerman","submitted_at":"2013-11-04T23:41:51Z","abstract_excerpt":"The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$ for which every $(d{+}1)$-tuple $(a_1,a_2,\\ldots,a_{d+1})$ of $X$ and the corresponding tuple $(f(a_1),f(a_2),\\ldots,f(a_{d+1}))$ in $Y$ have the same orientation. In this paper we investigate the complexity of determining whether two point sets have the same order type. We provide an $O(n^d)$ algorithm for this task, thereby improving upon the $O(n^{\\lfloor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0928","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-18T03:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcZqU4CD7MO2OGlBIFyV++RztJb1MJ2rv3g+r8jm4sFFWOrnRi2XuAdseTL+zJ8mKmkn8yH70X5GAOUkYUKEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:17:43.406190Z"},"content_sha256":"6d61304c90e8a57c6cfdb532a63a923278deb2e0d34490cfe5dae95926295ed8","schema_version":"1.0","event_id":"sha256:6d61304c90e8a57c6cfdb532a63a923278deb2e0d34490cfe5dae95926295ed8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYVXICB6EVBXZUONRVHKIK7IRC/bundle.json","state_url":"https://pith.science/pith/RYVXICB6EVBXZUONRVHKIK7IRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYVXICB6EVBXZUONRVHKIK7IRC/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-06-27T17:17:43Z","links":{"resolver":"https://pith.science/pith/RYVXICB6EVBXZUONRVHKIK7IRC","bundle":"https://pith.science/pith/RYVXICB6EVBXZUONRVHKIK7IRC/bundle.json","state":"https://pith.science/pith/RYVXICB6EVBXZUONRVHKIK7IRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYVXICB6EVBXZUONRVHKIK7IRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RYVXICB6EVBXZUONRVHKIK7IRC","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":"fd570eaf491485db5d549d39319faa072223a622aa1b69ac899a2b4c3670d471","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-04T23:41:51Z","title_canon_sha256":"6705230114c8765cdc692279aa985d1a000cd0232973d8ac4a640bc32bb6357c"},"schema_version":"1.0","source":{"id":"1311.0928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0928","created_at":"2026-05-18T03:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0928v1","created_at":"2026-05-18T03:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0928","created_at":"2026-05-18T03:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"RYVXICB6EVBX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RYVXICB6EVBXZUON","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RYVXICB6","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:6d61304c90e8a57c6cfdb532a63a923278deb2e0d34490cfe5dae95926295ed8","target":"graph","created_at":"2026-05-18T03:07:56Z","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":"The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$ for which every $(d{+}1)$-tuple $(a_1,a_2,\\ldots,a_{d+1})$ of $X$ and the corresponding tuple $(f(a_1),f(a_2),\\ldots,f(a_{d+1}))$ in $Y$ have the same orientation. In this paper we investigate the complexity of determining whether two point sets have the same order type. We provide an $O(n^d)$ algorithm for this task, thereby improving upon the $O(n^{\\lfloor","authors_text":"Greg Aloupis, John Iacono, \\\"Ozg\\\"ur \\\"Ozkan, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-04T23:41:51Z","title":"The Complexity of Order Type Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0928","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:76f8c364d4fb69ddd30306a08c9dc599851621d466c1d68cec71bba9f82d5d55","target":"record","created_at":"2026-05-18T03:07:56Z","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":"fd570eaf491485db5d549d39319faa072223a622aa1b69ac899a2b4c3670d471","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-04T23:41:51Z","title_canon_sha256":"6705230114c8765cdc692279aa985d1a000cd0232973d8ac4a640bc32bb6357c"},"schema_version":"1.0","source":{"id":"1311.0928","kind":"arxiv","version":1}},"canonical_sha256":"8e2b74083e25437cd1cd8d4ea42be888978f54dbfa3cec55187665b0ee407d8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2b74083e25437cd1cd8d4ea42be888978f54dbfa3cec55187665b0ee407d8c","first_computed_at":"2026-05-18T03:07:56.028890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:56.028890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ked/yB0tCj5Q3HoG9ArJ/0AJYkbu4uNT1Jil9h4/6hWxrsgqccQJDTh0f5zO7bpd/MEMeJHFjwNURS9V/3O1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:56.029402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76f8c364d4fb69ddd30306a08c9dc599851621d466c1d68cec71bba9f82d5d55","sha256:6d61304c90e8a57c6cfdb532a63a923278deb2e0d34490cfe5dae95926295ed8"],"state_sha256":"b6060d73c62f44a6a6c19287e43faa7b915dd8730511dee9a9297aabbee029ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pps9pSGxnOLyv6MxsmcwqM7zJLnTi0Ucp2j6IQI4cSg1QML40COQM0nPvP0ayaXsOkazM8bnhDTdwvDj6qemBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:17:43.408063Z","bundle_sha256":"5044f285fd911bd3f7ebed5e42341e5bb9c805d18a981a09285d6d08aa4c8215"}}