{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TIIMESLF7GMFN6NAXFFUCOWFZT","short_pith_number":"pith:TIIMESLF","canonical_record":{"source":{"id":"1009.2160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-11T12:03:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4e05e518711d1a6a5692c087f7aa93c1bac58de3e95e3e410cecc08c3505fa74","abstract_canon_sha256":"79811248670db20b73288d06183748307be4f712e573dfdc5e2ffb7ff8c36191"},"schema_version":"1.0"},"canonical_sha256":"9a10c24965f99856f9a0b94b413ac5cced70d64360626913aa8fc61078307f69","source":{"kind":"arxiv","id":"1009.2160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2160","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2160v1","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2160","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"TIIMESLF7GMF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TIIMESLF7GMFN6NA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TIIMESLF","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TIIMESLF7GMFN6NAXFFUCOWFZT","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-11T12:03:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4e05e518711d1a6a5692c087f7aa93c1bac58de3e95e3e410cecc08c3505fa74","abstract_canon_sha256":"79811248670db20b73288d06183748307be4f712e573dfdc5e2ffb7ff8c36191"},"schema_version":"1.0"},"canonical_sha256":"9a10c24965f99856f9a0b94b413ac5cced70d64360626913aa8fc61078307f69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:04.695968Z","signature_b64":"VTX7QH6i4r5u6N9LNzmYLJnHISjAA+lKePe60npkNVWhkvBTlQ/7Mn5T15J2gL0kjAIAw63spnYjG56MFkNhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a10c24965f99856f9a0b94b413ac5cced70d64360626913aa8fc61078307f69","last_reissued_at":"2026-05-18T04:41:04.695547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:04.695547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2160","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-18T04:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2qXXlhuUO+7mlaZLyUVI3ZGT2xNAy0wfgCuWWh7g+sT0frGm0q3V4t1ApjOLfSj8xvZjOuP8uj+e+ZKBhygBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:21:24.780469Z"},"content_sha256":"eef6579b368bb03820ff7d39892f55329f9926909e4eee2dd9b0fe2f4a674bf6","schema_version":"1.0","event_id":"sha256:eef6579b368bb03820ff7d39892f55329f9926909e4eee2dd9b0fe2f4a674bf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TIIMESLF7GMFN6NAXFFUCOWFZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Eliana-Dina Tirsa, Mugurel Ionut Andreica","submitted_at":"2010-09-11T12:03:26Z","abstract_excerpt":"In this paper we present novel algorithms for several multidimensional data processing problems. We consider problems related to the computation of restricted clusters and of the diameter of a set of points using a new distance function. We also consider two string (1D data) processing problems, regarding an optimal encoding method and the computation of the number of occurrences of a substring within a string generated by a grammar. The algorithms have been thoroughly analyzed from a theoretical point of view and some of them have also been evaluated experimentally."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2160","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-18T04:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WArh+OsFoZ17v3gOi0ZOurfAXAi9PEIGA2peY5+duigMsnObO9Ct9dPjWU2o52QIP8te79qQX+2v5h+pWsiVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:21:24.781083Z"},"content_sha256":"5824be440e79827c84b63dd7c1f454d67328a660a6cfbe6d91815c078ced68cf","schema_version":"1.0","event_id":"sha256:5824be440e79827c84b63dd7c1f454d67328a660a6cfbe6d91815c078ced68cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/bundle.json","state_url":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/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-07T14:21:24Z","links":{"resolver":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT","bundle":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/bundle.json","state":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TIIMESLF7GMFN6NAXFFUCOWFZT","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":"79811248670db20b73288d06183748307be4f712e573dfdc5e2ffb7ff8c36191","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-11T12:03:26Z","title_canon_sha256":"4e05e518711d1a6a5692c087f7aa93c1bac58de3e95e3e410cecc08c3505fa74"},"schema_version":"1.0","source":{"id":"1009.2160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2160","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2160v1","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2160","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"TIIMESLF7GMF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TIIMESLF7GMFN6NA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TIIMESLF","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:5824be440e79827c84b63dd7c1f454d67328a660a6cfbe6d91815c078ced68cf","target":"graph","created_at":"2026-05-18T04:41:04Z","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":"In this paper we present novel algorithms for several multidimensional data processing problems. We consider problems related to the computation of restricted clusters and of the diameter of a set of points using a new distance function. We also consider two string (1D data) processing problems, regarding an optimal encoding method and the computation of the number of occurrences of a substring within a string generated by a grammar. The algorithms have been thoroughly analyzed from a theoretical point of view and some of them have also been evaluated experimentally.","authors_text":"Eliana-Dina Tirsa, Mugurel Ionut Andreica","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-11T12:03:26Z","title":"Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2160","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:eef6579b368bb03820ff7d39892f55329f9926909e4eee2dd9b0fe2f4a674bf6","target":"record","created_at":"2026-05-18T04:41:04Z","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":"79811248670db20b73288d06183748307be4f712e573dfdc5e2ffb7ff8c36191","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-11T12:03:26Z","title_canon_sha256":"4e05e518711d1a6a5692c087f7aa93c1bac58de3e95e3e410cecc08c3505fa74"},"schema_version":"1.0","source":{"id":"1009.2160","kind":"arxiv","version":1}},"canonical_sha256":"9a10c24965f99856f9a0b94b413ac5cced70d64360626913aa8fc61078307f69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a10c24965f99856f9a0b94b413ac5cced70d64360626913aa8fc61078307f69","first_computed_at":"2026-05-18T04:41:04.695547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:04.695547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VTX7QH6i4r5u6N9LNzmYLJnHISjAA+lKePe60npkNVWhkvBTlQ/7Mn5T15J2gL0kjAIAw63spnYjG56MFkNhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:04.695968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eef6579b368bb03820ff7d39892f55329f9926909e4eee2dd9b0fe2f4a674bf6","sha256:5824be440e79827c84b63dd7c1f454d67328a660a6cfbe6d91815c078ced68cf"],"state_sha256":"5bc718eedfe4b1d8bb1dffd3815bd66d1668f2c5bda4cba538f84ba2a97087b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKBpvofvEcW9NNMt/wEfJS8oNrcF5qcpqWuKK7azKtLO+/DA7qbzjezjUiNa0PGENd4n93DbiclTdBiYgaUeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:21:24.784739Z","bundle_sha256":"685b1df1ea1c052fa50cd9816e1a13b6801e56cceabbfe842ba49dde933ee533"}}