{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TIIMESLF7GMFN6NAXFFUCOWFZT","short_pith_number":"pith:TIIMESLF","schema_version":"1.0","canonical_sha256":"9a10c24965f99856f9a0b94b413ac5cced70d64360626913aa8fc61078307f69","source":{"kind":"arxiv","id":"1009.2160","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.2160","created_at":"2026-05-18T04:41:04.695614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2160v1","created_at":"2026-05-18T04:41:04.695614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2160","created_at":"2026-05-18T04:41:04.695614+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIIMESLF7GMF","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIIMESLF7GMFN6NA","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIIMESLF","created_at":"2026-05-18T12:26:13.927090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT","json":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT.json","graph_json":"https://pith.science/api/pith-number/TIIMESLF7GMFN6NAXFFUCOWFZT/graph.json","events_json":"https://pith.science/api/pith-number/TIIMESLF7GMFN6NAXFFUCOWFZT/events.json","paper":"https://pith.science/paper/TIIMESLF"},"agent_actions":{"view_html":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT","download_json":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT.json","view_paper":"https://pith.science/paper/TIIMESLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2160&json=true","fetch_graph":"https://pith.science/api/pith-number/TIIMESLF7GMFN6NAXFFUCOWFZT/graph.json","fetch_events":"https://pith.science/api/pith-number/TIIMESLF7GMFN6NAXFFUCOWFZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/action/storage_attestation","attest_author":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/action/author_attestation","sign_citation":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/action/citation_signature","submit_replication":"https://pith.science/pith/TIIMESLF7GMFN6NAXFFUCOWFZT/action/replication_record"}},"created_at":"2026-05-18T04:41:04.695614+00:00","updated_at":"2026-05-18T04:41:04.695614+00:00"}