{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DSCXU3OP75OCOYOS7DWBA3F7K6","short_pith_number":"pith:DSCXU3OP","schema_version":"1.0","canonical_sha256":"1c857a6dcfff5c2761d2f8ec106cbf57b263f1f073462cc3d0d10c633ab7d1de","source":{"kind":"arxiv","id":"2112.03738","version":2},"attestation_state":"computed","paper":{"title":"A more efficient algorithm to compute the Rand Index for change-point problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DS","authors_text":"Lucas de Oliveira Prates","submitted_at":"2021-12-07T14:52:04Z","abstract_excerpt":"We provide a more efficient algorithm for computing the Rand Index when the data cluster comes from a change-point detection problem. Given $N$ data points and two clusterings of size $r$ and $s$, the algorithm runs on $O(r+s)$ time complexity and $O(1)$ memory complexity. The traditional algorithm, in contrast, runs on $O(rs+N)$ time complexity and $O(rs)$ memory complexity."},"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":"2112.03738","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-07T14:52:04Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"f5f774f5ee7fb305a8d6fe27dde85f914f2fe32b6514c0ef6e97c8eb8c4ccc51","abstract_canon_sha256":"a726a02531dd78ad989d8a0243ab6e2cdcf23b5b09da73c00f3bf36670ca2e56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:59.170106Z","signature_b64":"LZAqfqAvdYi5I66m82LIfm1L2mIbd7c4/2UKTKLXkZTcZdTPlwlFoTyXzNJx+P4EaoWsyqYKNXd/ufKxTH+HDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c857a6dcfff5c2761d2f8ec106cbf57b263f1f073462cc3d0d10c633ab7d1de","last_reissued_at":"2026-07-05T11:23:59.169576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:59.169576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A more efficient algorithm to compute the Rand Index for change-point problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.DS","authors_text":"Lucas de Oliveira Prates","submitted_at":"2021-12-07T14:52:04Z","abstract_excerpt":"We provide a more efficient algorithm for computing the Rand Index when the data cluster comes from a change-point detection problem. Given $N$ data points and two clusterings of size $r$ and $s$, the algorithm runs on $O(r+s)$ time complexity and $O(1)$ memory complexity. The traditional algorithm, in contrast, runs on $O(rs+N)$ time complexity and $O(rs)$ memory complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.03738","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.03738/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.03738","created_at":"2026-07-05T11:23:59.169638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.03738v2","created_at":"2026-07-05T11:23:59.169638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03738","created_at":"2026-07-05T11:23:59.169638+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSCXU3OP75OC","created_at":"2026-07-05T11:23:59.169638+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSCXU3OP75OCOYOS","created_at":"2026-07-05T11:23:59.169638+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSCXU3OP","created_at":"2026-07-05T11:23:59.169638+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.21160","citing_title":"Fast segmentation of watermarked texts from large language models through an epidemic change-point framework","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6","json":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6.json","graph_json":"https://pith.science/api/pith-number/DSCXU3OP75OCOYOS7DWBA3F7K6/graph.json","events_json":"https://pith.science/api/pith-number/DSCXU3OP75OCOYOS7DWBA3F7K6/events.json","paper":"https://pith.science/paper/DSCXU3OP"},"agent_actions":{"view_html":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6","download_json":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6.json","view_paper":"https://pith.science/paper/DSCXU3OP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.03738&json=true","fetch_graph":"https://pith.science/api/pith-number/DSCXU3OP75OCOYOS7DWBA3F7K6/graph.json","fetch_events":"https://pith.science/api/pith-number/DSCXU3OP75OCOYOS7DWBA3F7K6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/action/storage_attestation","attest_author":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/action/author_attestation","sign_citation":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/action/citation_signature","submit_replication":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/action/replication_record"}},"created_at":"2026-07-05T11:23:59.169638+00:00","updated_at":"2026-07-05T11:23:59.169638+00:00"}