{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QPJIPF74IDTCJ3MIFVTKOPRIOE","short_pith_number":"pith:QPJIPF74","schema_version":"1.0","canonical_sha256":"83d28797fc40e624ed882d66a73e28712f5c5d6d2b31762147306b2288ff03cb","source":{"kind":"arxiv","id":"2104.15140","version":2},"attestation_state":"computed","paper":{"title":"Exact Detection Thresholds and Minimax Optimality of Chatterjee's Correlation Coefficient","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Arnab Auddy, Nabarun Deb, Sagnik Nandy","submitted_at":"2021-04-30T17:58:50Z","abstract_excerpt":"Recently, Chatterjee (2021) introduced a new rank-based correlation coefficient which can be used to measure the strength of dependence between two random variables. This coefficient has already attracted much attention as it converges to the Dette-Siburg-Stoimenov measure (see Dette et al. (2013)), which equals $0$ if and only if the variables are independent and $1$ if and only if one variable is a function of the other. Further, Chatterjee's coefficient is computable in (near) linear time, which makes it appropriate for large-scale applications. In this paper, we expand the theoretical unde"},"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":"2104.15140","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-04-30T17:58:50Z","cross_cats_sorted":["math.PR","stat.ME","stat.TH"],"title_canon_sha256":"2d87538e58a5d79aa108688c6f7bfceff06dee3a06ecfddac5e7bc170ab8f3ba","abstract_canon_sha256":"93f1595f977c36db2cf859b40324d29e201a505e440a6f11340de1bbc40bf52d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:46.586362Z","signature_b64":"l881MJBs15LnaJEcJjODN69XMsnLbfuJswMtZhBulBagWmDiukKfytPR9IkUfz9nBTQIydnHgDJK8r1nS2MODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d28797fc40e624ed882d66a73e28712f5c5d6d2b31762147306b2288ff03cb","last_reissued_at":"2026-07-05T06:55:46.585943Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:46.585943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Detection Thresholds and Minimax Optimality of Chatterjee's Correlation Coefficient","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Arnab Auddy, Nabarun Deb, Sagnik Nandy","submitted_at":"2021-04-30T17:58:50Z","abstract_excerpt":"Recently, Chatterjee (2021) introduced a new rank-based correlation coefficient which can be used to measure the strength of dependence between two random variables. This coefficient has already attracted much attention as it converges to the Dette-Siburg-Stoimenov measure (see Dette et al. (2013)), which equals $0$ if and only if the variables are independent and $1$ if and only if one variable is a function of the other. Further, Chatterjee's coefficient is computable in (near) linear time, which makes it appropriate for large-scale applications. In this paper, we expand the theoretical unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.15140","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/2104.15140/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":"2104.15140","created_at":"2026-07-05T06:55:46.585999+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.15140v2","created_at":"2026-07-05T06:55:46.585999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.15140","created_at":"2026-07-05T06:55:46.585999+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPJIPF74IDTC","created_at":"2026-07-05T06:55:46.585999+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPJIPF74IDTCJ3MI","created_at":"2026-07-05T06:55:46.585999+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPJIPF74","created_at":"2026-07-05T06:55:46.585999+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23760","citing_title":"Global Sensitivity Analysis: a novel generation of mighty estimators based on rank statistics","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE","json":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE.json","graph_json":"https://pith.science/api/pith-number/QPJIPF74IDTCJ3MIFVTKOPRIOE/graph.json","events_json":"https://pith.science/api/pith-number/QPJIPF74IDTCJ3MIFVTKOPRIOE/events.json","paper":"https://pith.science/paper/QPJIPF74"},"agent_actions":{"view_html":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE","download_json":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE.json","view_paper":"https://pith.science/paper/QPJIPF74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.15140&json=true","fetch_graph":"https://pith.science/api/pith-number/QPJIPF74IDTCJ3MIFVTKOPRIOE/graph.json","fetch_events":"https://pith.science/api/pith-number/QPJIPF74IDTCJ3MIFVTKOPRIOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE/action/storage_attestation","attest_author":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE/action/author_attestation","sign_citation":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE/action/citation_signature","submit_replication":"https://pith.science/pith/QPJIPF74IDTCJ3MIFVTKOPRIOE/action/replication_record"}},"created_at":"2026-07-05T06:55:46.585999+00:00","updated_at":"2026-07-05T06:55:46.585999+00:00"}