{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:DSCXU3OP75OCOYOS7DWBA3F7K6","short_pith_number":"pith:DSCXU3OP","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"},"canonical_sha256":"1c857a6dcfff5c2761d2f8ec106cbf57b263f1f073462cc3d0d10c633ab7d1de","source":{"kind":"arxiv","id":"2112.03738","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.03738","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2112.03738v2","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03738","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"DSCXU3OP75OC","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"DSCXU3OP75OCOYOS","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"DSCXU3OP","created_at":"2026-07-05T11:23:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:DSCXU3OP75OCOYOS7DWBA3F7K6","target":"record","payload":{"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"},"canonical_sha256":"1c857a6dcfff5c2761d2f8ec106cbf57b263f1f073462cc3d0d10c633ab7d1de","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"},"source_kind":"arxiv","source_id":"2112.03738","source_version":2,"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-07-05T11:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ab7UL8wuNWcJO/pXJoSWDgS3hfJXOXNNqV3xzh+nQjqKnG33b83Sb9oQ1kL1GjImJ8960HXyxOC2WdgTGs+ABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:37:30.323147Z"},"content_sha256":"707d3ff9f00a7ebd53d2102abae6aa445a48bb56b7fd6beddf36ec107e2e322a","schema_version":"1.0","event_id":"sha256:707d3ff9f00a7ebd53d2102abae6aa445a48bb56b7fd6beddf36ec107e2e322a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:DSCXU3OP75OCOYOS7DWBA3F7K6","target":"graph","payload":{"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"},"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-07-05T11:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9u8TCtaLhhE3ZuZZcRTrZZVIo4u7GSLtAvrwZg0o/41YajrR07rj68ad29xd+DaLu5/M7YpcJG5HgsQXG/67Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:37:30.323754Z"},"content_sha256":"2dee9d644409308e395a96239b530173b5d0d664d970e2d2e426acfa0bc92034","schema_version":"1.0","event_id":"sha256:2dee9d644409308e395a96239b530173b5d0d664d970e2d2e426acfa0bc92034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/bundle.json","state_url":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/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-08-18T17:37:30Z","links":{"resolver":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6","bundle":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/bundle.json","state":"https://pith.science/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSCXU3OP75OCOYOS7DWBA3F7K6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:DSCXU3OP75OCOYOS7DWBA3F7K6","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":"a726a02531dd78ad989d8a0243ab6e2cdcf23b5b09da73c00f3bf36670ca2e56","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-07T14:52:04Z","title_canon_sha256":"f5f774f5ee7fb305a8d6fe27dde85f914f2fe32b6514c0ef6e97c8eb8c4ccc51"},"schema_version":"1.0","source":{"id":"2112.03738","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.03738","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2112.03738v2","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03738","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"DSCXU3OP75OC","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"DSCXU3OP75OCOYOS","created_at":"2026-07-05T11:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"DSCXU3OP","created_at":"2026-07-05T11:23:59Z"}],"graph_snapshots":[{"event_id":"sha256:2dee9d644409308e395a96239b530173b5d0d664d970e2d2e426acfa0bc92034","target":"graph","created_at":"2026-07-05T11:23:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.03738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Lucas de Oliveira Prates","cross_cats":["stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-07T14:52:04Z","title":"A more efficient algorithm to compute the Rand Index for change-point problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.03738","kind":"arxiv","version":2},"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:707d3ff9f00a7ebd53d2102abae6aa445a48bb56b7fd6beddf36ec107e2e322a","target":"record","created_at":"2026-07-05T11:23:59Z","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":"a726a02531dd78ad989d8a0243ab6e2cdcf23b5b09da73c00f3bf36670ca2e56","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-07T14:52:04Z","title_canon_sha256":"f5f774f5ee7fb305a8d6fe27dde85f914f2fe32b6514c0ef6e97c8eb8c4ccc51"},"schema_version":"1.0","source":{"id":"2112.03738","kind":"arxiv","version":2}},"canonical_sha256":"1c857a6dcfff5c2761d2f8ec106cbf57b263f1f073462cc3d0d10c633ab7d1de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c857a6dcfff5c2761d2f8ec106cbf57b263f1f073462cc3d0d10c633ab7d1de","first_computed_at":"2026-07-05T11:23:59.169576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:59.169576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZAqfqAvdYi5I66m82LIfm1L2mIbd7c4/2UKTKLXkZTcZdTPlwlFoTyXzNJx+P4EaoWsyqYKNXd/ufKxTH+HDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:59.170106Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.03738","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:707d3ff9f00a7ebd53d2102abae6aa445a48bb56b7fd6beddf36ec107e2e322a","sha256:2dee9d644409308e395a96239b530173b5d0d664d970e2d2e426acfa0bc92034"],"state_sha256":"7f8365eec209aa2d1b4c7aa349bb2ab136e789a4f108c51886706f85048f00d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJWRA8nKJX+W1oEQoQLbUjyxPyPA4gVd5zdGH2X+s+yP4SKoUUm2Zlmn83P25y0OFJbTLEu40ntQ1v/V/AUABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:37:30.329289Z","bundle_sha256":"b702f5eda972b9dcec55ef0834689f640eca0a325acea98e65ebf474c326c1c8"}}