{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4PDODEVPHGXJPTXYTRD6GSIKNN","short_pith_number":"pith:4PDODEVP","canonical_record":{"source":{"id":"2102.07028","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-13T23:16:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4fa212f54e7cf086658cceabda540bd7b5e353c3a2de2a46eebbc940190092c7","abstract_canon_sha256":"aab8d0860eb5645b99ebbccc4ae4ce7fd3657ede47670dde9f9033087bb494f8"},"schema_version":"1.0"},"canonical_sha256":"e3c6e192af39ae97cef89c47e3490a6b7e54f08741f2cddee89ccd58fc61a72d","source":{"kind":"arxiv","id":"2102.07028","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.07028","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"2102.07028v2","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07028","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"4PDODEVPHGXJ","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"pith_short_16","alias_value":"4PDODEVPHGXJPTXY","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"pith_short_8","alias_value":"4PDODEVP","created_at":"2026-07-05T02:19:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4PDODEVPHGXJPTXYTRD6GSIKNN","target":"record","payload":{"canonical_record":{"source":{"id":"2102.07028","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-13T23:16:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4fa212f54e7cf086658cceabda540bd7b5e353c3a2de2a46eebbc940190092c7","abstract_canon_sha256":"aab8d0860eb5645b99ebbccc4ae4ce7fd3657ede47670dde9f9033087bb494f8"},"schema_version":"1.0"},"canonical_sha256":"e3c6e192af39ae97cef89c47e3490a6b7e54f08741f2cddee89ccd58fc61a72d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:16.174241Z","signature_b64":"iOOAR0ZBETIM5T/yfsb3MTyqxXz1gjw0f+0BL+2bg21Oa52qtAy8ItolDKW2Ro+Vj0ZoMLDSH+p71yZIhfAgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3c6e192af39ae97cef89c47e3490a6b7e54f08741f2cddee89ccd58fc61a72d","last_reissued_at":"2026-07-05T02:19:16.173830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:16.173830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.07028","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-05T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRoh8oIW3EDv31G9ikaUBAn0QY3Xm2mk48/U5s5di+847Pdq64x+Qv2f6nmKhtBM6ODgZ0JTQCpUDY/XNmJLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:14:54.221482Z"},"content_sha256":"48df8a65ac7e0c2e4c0aa6aae0bc27651d09e84b95663f0ae9d9e423766a2978","schema_version":"1.0","event_id":"sha256:48df8a65ac7e0c2e4c0aa6aae0bc27651d09e84b95663f0ae9d9e423766a2978"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4PDODEVPHGXJPTXYTRD6GSIKNN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ThetA -- fast and robust clustering via a distance parameter","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bramsh Qamar Chandio, Eleftherios Garyfallidis, Javier Guaje, Jong Sung Park, Nasim Anousheh, Serge Koudoro, Shreyas Fadnavis","submitted_at":"2021-02-13T23:16:33Z","abstract_excerpt":"Clustering is a fundamental problem in machine learning where distance-based approaches have dominated the field for many decades. This set of problems is often tackled by partitioning the data into K clusters where the number of clusters is chosen apriori. While significant progress has been made on these lines over the years, it is well established that as the number of clusters or dimensions increase, current approaches dwell in local minima resulting in suboptimal solutions. In this work, we propose a new set of distance threshold methods called Theta-based Algorithms (ThetA). Via experime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07028","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/2102.07028/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-05T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhwamI69MS6TiyUhoqqrmkdmh8orV8TMJERQUfahvH7UBkBqmpt+ZJq5vI4vCQ6jxL78GjTDd5AvDBhAh0OBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:14:54.221887Z"},"content_sha256":"064e3d77fa9eecbb36db45515a1347ece5e5ec169e8f7ec94bc79cd68c59f551","schema_version":"1.0","event_id":"sha256:064e3d77fa9eecbb36db45515a1347ece5e5ec169e8f7ec94bc79cd68c59f551"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PDODEVPHGXJPTXYTRD6GSIKNN/bundle.json","state_url":"https://pith.science/pith/4PDODEVPHGXJPTXYTRD6GSIKNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PDODEVPHGXJPTXYTRD6GSIKNN/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-07-07T04:14:54Z","links":{"resolver":"https://pith.science/pith/4PDODEVPHGXJPTXYTRD6GSIKNN","bundle":"https://pith.science/pith/4PDODEVPHGXJPTXYTRD6GSIKNN/bundle.json","state":"https://pith.science/pith/4PDODEVPHGXJPTXYTRD6GSIKNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PDODEVPHGXJPTXYTRD6GSIKNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4PDODEVPHGXJPTXYTRD6GSIKNN","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":"aab8d0860eb5645b99ebbccc4ae4ce7fd3657ede47670dde9f9033087bb494f8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-13T23:16:33Z","title_canon_sha256":"4fa212f54e7cf086658cceabda540bd7b5e353c3a2de2a46eebbc940190092c7"},"schema_version":"1.0","source":{"id":"2102.07028","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.07028","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"2102.07028v2","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07028","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"4PDODEVPHGXJ","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"pith_short_16","alias_value":"4PDODEVPHGXJPTXY","created_at":"2026-07-05T02:19:16Z"},{"alias_kind":"pith_short_8","alias_value":"4PDODEVP","created_at":"2026-07-05T02:19:16Z"}],"graph_snapshots":[{"event_id":"sha256:064e3d77fa9eecbb36db45515a1347ece5e5ec169e8f7ec94bc79cd68c59f551","target":"graph","created_at":"2026-07-05T02:19:16Z","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/2102.07028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering is a fundamental problem in machine learning where distance-based approaches have dominated the field for many decades. This set of problems is often tackled by partitioning the data into K clusters where the number of clusters is chosen apriori. While significant progress has been made on these lines over the years, it is well established that as the number of clusters or dimensions increase, current approaches dwell in local minima resulting in suboptimal solutions. In this work, we propose a new set of distance threshold methods called Theta-based Algorithms (ThetA). Via experime","authors_text":"Bramsh Qamar Chandio, Eleftherios Garyfallidis, Javier Guaje, Jong Sung Park, Nasim Anousheh, Serge Koudoro, Shreyas Fadnavis","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-13T23:16:33Z","title":"ThetA -- fast and robust clustering via a distance parameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07028","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:48df8a65ac7e0c2e4c0aa6aae0bc27651d09e84b95663f0ae9d9e423766a2978","target":"record","created_at":"2026-07-05T02:19:16Z","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":"aab8d0860eb5645b99ebbccc4ae4ce7fd3657ede47670dde9f9033087bb494f8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-13T23:16:33Z","title_canon_sha256":"4fa212f54e7cf086658cceabda540bd7b5e353c3a2de2a46eebbc940190092c7"},"schema_version":"1.0","source":{"id":"2102.07028","kind":"arxiv","version":2}},"canonical_sha256":"e3c6e192af39ae97cef89c47e3490a6b7e54f08741f2cddee89ccd58fc61a72d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3c6e192af39ae97cef89c47e3490a6b7e54f08741f2cddee89ccd58fc61a72d","first_computed_at":"2026-07-05T02:19:16.173830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:19:16.173830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iOOAR0ZBETIM5T/yfsb3MTyqxXz1gjw0f+0BL+2bg21Oa52qtAy8ItolDKW2Ro+Vj0ZoMLDSH+p71yZIhfAgAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:19:16.174241Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.07028","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48df8a65ac7e0c2e4c0aa6aae0bc27651d09e84b95663f0ae9d9e423766a2978","sha256:064e3d77fa9eecbb36db45515a1347ece5e5ec169e8f7ec94bc79cd68c59f551"],"state_sha256":"79a4c088e5a04a1e53606edce1b29f3008c1256277e8c4e8a47b82a9111be5b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFrqfFWn11dhx4RlmPg/WoFtZ9fb2/Ix/EvRy8RXnDi+YqDPqmAjkToJduydSaXKRNYQLMFROQOb5L/aMbWZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:14:54.223874Z","bundle_sha256":"dac56a26aa74bb4c0703e8ffe9fc93290a20336be0b2e5eea54ed37e53bfab85"}}