{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CQS27RPEEWHQDRBNF54IODUIK7","short_pith_number":"pith:CQS27RPE","canonical_record":{"source":{"id":"1207.3962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-17T11:58:08Z","cross_cats_sorted":["cs.CV","cs.DC"],"title_canon_sha256":"0282b8b8624d8ff498079368a0bc9ccdf5c85a6b63ad1b0ff092d0e1df927460","abstract_canon_sha256":"a7b5095fc5aba4d0323e1a43743aee05e76b206298149753639b79561a3f2f49"},"schema_version":"1.0"},"canonical_sha256":"1425afc5e4258f01c42d2f78870e8857e8a26d50a67982ab388c2685882aebe0","source":{"kind":"arxiv","id":"1207.3962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3962","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3962v1","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3962","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"CQS27RPEEWHQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CQS27RPEEWHQDRBN","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CQS27RPE","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CQS27RPEEWHQDRBNF54IODUIK7","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-17T11:58:08Z","cross_cats_sorted":["cs.CV","cs.DC"],"title_canon_sha256":"0282b8b8624d8ff498079368a0bc9ccdf5c85a6b63ad1b0ff092d0e1df927460","abstract_canon_sha256":"a7b5095fc5aba4d0323e1a43743aee05e76b206298149753639b79561a3f2f49"},"schema_version":"1.0"},"canonical_sha256":"1425afc5e4258f01c42d2f78870e8857e8a26d50a67982ab388c2685882aebe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:49.359480Z","signature_b64":"hcCNEIRRouRb0jjK5CQYOAda8vF5Mk+eJBcw/OgRGXltTbRGugia7iBa6Buvh8LieLV5s1Cbug5nCp+3eKM1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1425afc5e4258f01c42d2f78870e8857e8a26d50a67982ab388c2685882aebe0","last_reissued_at":"2026-05-18T03:50:49.358810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:49.358810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3962","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:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LVsa6gO7XWNuhKb20QTNBiDgdI4O8I1f56kAcLQ+RP73y98r/EAvWy6Ha6t4+3TsClMyjMYQdxuhaBkTa+QUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:32:01.922085Z"},"content_sha256":"d39565b5c53609474c49fe1204dc90f3b8fc9e0852319aeba240c19cb734397f","schema_version":"1.0","event_id":"sha256:d39565b5c53609474c49fe1204dc90f3b8fc9e0852319aeba240c19cb734397f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CQS27RPEEWHQDRBNF54IODUIK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation of the Hausdorff distance between sets of line segments in parallel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DC"],"primary_cat":"cs.CG","authors_text":"Helmut Alt, Ludmila Scharf","submitted_at":"2012-07-17T11:58:08Z","abstract_excerpt":"We show that the Hausdorff distance for two sets of non-intersecting line segments can be computed in parallel in $O(\\log^2 n)$ time using O(n) processors in a CREW-PRAM computation model. We discuss how some parts of the sequential algorithm can be performed in parallel using previously known parallel algorithms; and identify the so-far unsolved part of the problem for the parallel computation, which is the following: Given two sets of $x$-monotone curve segments, red and blue, for each red segment find its extremal intersection points with the blue set, i.e. points with the minimal and maxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3962","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:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K//WAc1IjIECzSxBV0iuXjD+NB2pz+lOWpbPtXSQTVskFOxpbH9Lc8Ejfzw29MmxviwxAk9zh6aYr29HwvfiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:32:01.922447Z"},"content_sha256":"375ade6adb447c639798e44de71ba067a6ae52e6b221fdee1d4d4ca2e6651365","schema_version":"1.0","event_id":"sha256:375ade6adb447c639798e44de71ba067a6ae52e6b221fdee1d4d4ca2e6651365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQS27RPEEWHQDRBNF54IODUIK7/bundle.json","state_url":"https://pith.science/pith/CQS27RPEEWHQDRBNF54IODUIK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQS27RPEEWHQDRBNF54IODUIK7/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-05T00:32:01Z","links":{"resolver":"https://pith.science/pith/CQS27RPEEWHQDRBNF54IODUIK7","bundle":"https://pith.science/pith/CQS27RPEEWHQDRBNF54IODUIK7/bundle.json","state":"https://pith.science/pith/CQS27RPEEWHQDRBNF54IODUIK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQS27RPEEWHQDRBNF54IODUIK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CQS27RPEEWHQDRBNF54IODUIK7","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":"a7b5095fc5aba4d0323e1a43743aee05e76b206298149753639b79561a3f2f49","cross_cats_sorted":["cs.CV","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-17T11:58:08Z","title_canon_sha256":"0282b8b8624d8ff498079368a0bc9ccdf5c85a6b63ad1b0ff092d0e1df927460"},"schema_version":"1.0","source":{"id":"1207.3962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3962","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3962v1","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3962","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"CQS27RPEEWHQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CQS27RPEEWHQDRBN","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CQS27RPE","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:375ade6adb447c639798e44de71ba067a6ae52e6b221fdee1d4d4ca2e6651365","target":"graph","created_at":"2026-05-18T03:50:49Z","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 show that the Hausdorff distance for two sets of non-intersecting line segments can be computed in parallel in $O(\\log^2 n)$ time using O(n) processors in a CREW-PRAM computation model. We discuss how some parts of the sequential algorithm can be performed in parallel using previously known parallel algorithms; and identify the so-far unsolved part of the problem for the parallel computation, which is the following: Given two sets of $x$-monotone curve segments, red and blue, for each red segment find its extremal intersection points with the blue set, i.e. points with the minimal and maxim","authors_text":"Helmut Alt, Ludmila Scharf","cross_cats":["cs.CV","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-17T11:58:08Z","title":"Computation of the Hausdorff distance between sets of line segments in parallel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3962","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:d39565b5c53609474c49fe1204dc90f3b8fc9e0852319aeba240c19cb734397f","target":"record","created_at":"2026-05-18T03:50:49Z","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":"a7b5095fc5aba4d0323e1a43743aee05e76b206298149753639b79561a3f2f49","cross_cats_sorted":["cs.CV","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-07-17T11:58:08Z","title_canon_sha256":"0282b8b8624d8ff498079368a0bc9ccdf5c85a6b63ad1b0ff092d0e1df927460"},"schema_version":"1.0","source":{"id":"1207.3962","kind":"arxiv","version":1}},"canonical_sha256":"1425afc5e4258f01c42d2f78870e8857e8a26d50a67982ab388c2685882aebe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1425afc5e4258f01c42d2f78870e8857e8a26d50a67982ab388c2685882aebe0","first_computed_at":"2026-05-18T03:50:49.358810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:49.358810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hcCNEIRRouRb0jjK5CQYOAda8vF5Mk+eJBcw/OgRGXltTbRGugia7iBa6Buvh8LieLV5s1Cbug5nCp+3eKM1BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:49.359480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d39565b5c53609474c49fe1204dc90f3b8fc9e0852319aeba240c19cb734397f","sha256:375ade6adb447c639798e44de71ba067a6ae52e6b221fdee1d4d4ca2e6651365"],"state_sha256":"ecd961c29826555821336be66a7a23ac9dd7a81988a0eed5db753e4aa2748130"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vMLDWmDRw/L3yZtizx0wteKH7wdpHz9WfS2y2VuJa+6mxIxcBh+tqNTAKt4JzA3MM+vxPJUYL8FKN2N0z0lBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:32:01.924415Z","bundle_sha256":"01a3e40c84f5ca0fd8521096d0866fc8db356058c33954c00e639533455a9506"}}