{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P43NM4VOFDZI2LGNHU642Z4TVD","short_pith_number":"pith:P43NM4VO","schema_version":"1.0","canonical_sha256":"7f36d672ae28f28d2ccd3d3dcd6793a8da0a692d5b96e1d5d1ce3215e9ca1393","source":{"kind":"arxiv","id":"2402.05715","version":1},"attestation_state":"computed","paper":{"title":"Collaborative non-parametric two-sample testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alejandro de la Concha, Argyris Kalogeratos, Nicolas Vayatis","submitted_at":"2024-02-08T14:43:56Z","abstract_excerpt":"This paper addresses the multiple two-sample test problem in a graph-structured setting, which is a common scenario in fields such as Spatial Statistics and Neuroscience. Each node $v$ in fixed graph deals with a two-sample testing problem between two node-specific probability density functions (pdfs), $p_v$ and $q_v$. The goal is to identify nodes where the null hypothesis $p_v = q_v$ should be rejected, under the assumption that connected nodes would yield similar test outcomes. We propose the non-parametric collaborative two-sample testing (CTST) framework that efficiently leverages the gra"},"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":"2402.05715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-02-08T14:43:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7e5ce280bcba8837283f7ae8635cbf2f11eafa5ca94202449511395f9bd09a0b","abstract_canon_sha256":"cb684fb988293a1f78134fcd009329c014985bf702c745df3ebd71d20e528493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:02.399910Z","signature_b64":"ZZ6ImEaqSGLocncxei3s7ruUe22eQR6JJe3Nkhsjlcs3fvlqaoPEvsTuZBG13bJGXy1V6kWTkwo4dD0I/hpyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f36d672ae28f28d2ccd3d3dcd6793a8da0a692d5b96e1d5d1ce3215e9ca1393","last_reissued_at":"2026-07-05T07:43:02.399557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:02.399557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collaborative non-parametric two-sample testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alejandro de la Concha, Argyris Kalogeratos, Nicolas Vayatis","submitted_at":"2024-02-08T14:43:56Z","abstract_excerpt":"This paper addresses the multiple two-sample test problem in a graph-structured setting, which is a common scenario in fields such as Spatial Statistics and Neuroscience. Each node $v$ in fixed graph deals with a two-sample testing problem between two node-specific probability density functions (pdfs), $p_v$ and $q_v$. The goal is to identify nodes where the null hypothesis $p_v = q_v$ should be rejected, under the assumption that connected nodes would yield similar test outcomes. We propose the non-parametric collaborative two-sample testing (CTST) framework that efficiently leverages the gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.05715/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":"2402.05715","created_at":"2026-07-05T07:43:02.399612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05715v1","created_at":"2026-07-05T07:43:02.399612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05715","created_at":"2026-07-05T07:43:02.399612+00:00"},{"alias_kind":"pith_short_12","alias_value":"P43NM4VOFDZI","created_at":"2026-07-05T07:43:02.399612+00:00"},{"alias_kind":"pith_short_16","alias_value":"P43NM4VOFDZI2LGN","created_at":"2026-07-05T07:43:02.399612+00:00"},{"alias_kind":"pith_short_8","alias_value":"P43NM4VO","created_at":"2026-07-05T07:43:02.399612+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/P43NM4VOFDZI2LGNHU642Z4TVD","json":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD.json","graph_json":"https://pith.science/api/pith-number/P43NM4VOFDZI2LGNHU642Z4TVD/graph.json","events_json":"https://pith.science/api/pith-number/P43NM4VOFDZI2LGNHU642Z4TVD/events.json","paper":"https://pith.science/paper/P43NM4VO"},"agent_actions":{"view_html":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD","download_json":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD.json","view_paper":"https://pith.science/paper/P43NM4VO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05715&json=true","fetch_graph":"https://pith.science/api/pith-number/P43NM4VOFDZI2LGNHU642Z4TVD/graph.json","fetch_events":"https://pith.science/api/pith-number/P43NM4VOFDZI2LGNHU642Z4TVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD/action/storage_attestation","attest_author":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD/action/author_attestation","sign_citation":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD/action/citation_signature","submit_replication":"https://pith.science/pith/P43NM4VOFDZI2LGNHU642Z4TVD/action/replication_record"}},"created_at":"2026-07-05T07:43:02.399612+00:00","updated_at":"2026-07-05T07:43:02.399612+00:00"}