{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:I55TNI2ZAXHSAOCZIFJFO3DDC4","short_pith_number":"pith:I55TNI2Z","canonical_record":{"source":{"id":"2307.12325","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-07-23T13:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"e939880c45fd72a7dc981d94c9a0846cc9b1efefccbb6521fe0daa8d38388233","abstract_canon_sha256":"338a558bd21f84e398998a10ad8b58673c690fe5eb23f2d19eb3b1c48543eff5"},"schema_version":"1.0"},"canonical_sha256":"477b36a35905cf2038594152576c6317395f6e8170a93bafe6118b152fd35738","source":{"kind":"arxiv","id":"2307.12325","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.12325","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"arxiv_version","alias_value":"2307.12325v4","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12325","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"pith_short_12","alias_value":"I55TNI2ZAXHS","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"pith_short_16","alias_value":"I55TNI2ZAXHSAOCZ","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"pith_short_8","alias_value":"I55TNI2Z","created_at":"2026-07-05T11:24:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:I55TNI2ZAXHSAOCZIFJFO3DDC4","target":"record","payload":{"canonical_record":{"source":{"id":"2307.12325","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-07-23T13:44:29Z","cross_cats_sorted":[],"title_canon_sha256":"e939880c45fd72a7dc981d94c9a0846cc9b1efefccbb6521fe0daa8d38388233","abstract_canon_sha256":"338a558bd21f84e398998a10ad8b58673c690fe5eb23f2d19eb3b1c48543eff5"},"schema_version":"1.0"},"canonical_sha256":"477b36a35905cf2038594152576c6317395f6e8170a93bafe6118b152fd35738","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:00.957689Z","signature_b64":"LUQgxc+ZtO5bT6HbefHWzBo8mwTgVJmzc0EigvS0Y8Qoci49tnMafCD/KR4q986ATL1cdolv7/XGClYH83t5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"477b36a35905cf2038594152576c6317395f6e8170a93bafe6118b152fd35738","last_reissued_at":"2026-07-05T11:24:00.957192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:00.957192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.12325","source_version":4,"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:24:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fn8FatTd9iOJ3NLpaBmi6ohxaDbGusdZHcC6jf0O/DWsO876SSeosgwGgL6c5GPQkzZsBLK3gr6ch8S52pUJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:22:18.985689Z"},"content_sha256":"b654806e11ed3fa315a90a5ae1ff96f9c3d742268a2148ad73db555675f3caca","schema_version":"1.0","event_id":"sha256:b654806e11ed3fa315a90a5ae1ff96f9c3d742268a2148ad73db555675f3caca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:I55TNI2ZAXHSAOCZIFJFO3DDC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Framework for Graph-based Two-Sample Tests Using Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Lynna Chu, Yichuan Bai","submitted_at":"2023-07-23T13:44:29Z","abstract_excerpt":"Graph-based tests are a class of non-parametric two-sample tests useful for analyzing high-dimensional data. The test statistics are constructed from similarity graphs (such as K-minimum spanning tree), and consequently, their performance is sensitive to the structure of the graph. When the graph has problematic structures (for example, hubs), as is common for high-dimensional data, this can result in low power and unstable performance among existing graph-based tests. We address this challenge by proposing new test statistics that are robust to problematic structures of the graph and can prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12325","kind":"arxiv","version":4},"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/2307.12325/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:24:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueXKAWeyp+GxYPX98hgc0AqPjuj2KgYjG1J3zG8/hbm1I9D7kgDjNoYo7n+5snA5kI38iwSOxDk1fi4LmeQhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:22:18.986059Z"},"content_sha256":"f0502fde71a144a3a7e182a306a26eb65a688471ea7f7ba2e936c9403fbe1d1c","schema_version":"1.0","event_id":"sha256:f0502fde71a144a3a7e182a306a26eb65a688471ea7f7ba2e936c9403fbe1d1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I55TNI2ZAXHSAOCZIFJFO3DDC4/bundle.json","state_url":"https://pith.science/pith/I55TNI2ZAXHSAOCZIFJFO3DDC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I55TNI2ZAXHSAOCZIFJFO3DDC4/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-17T17:22:18Z","links":{"resolver":"https://pith.science/pith/I55TNI2ZAXHSAOCZIFJFO3DDC4","bundle":"https://pith.science/pith/I55TNI2ZAXHSAOCZIFJFO3DDC4/bundle.json","state":"https://pith.science/pith/I55TNI2ZAXHSAOCZIFJFO3DDC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I55TNI2ZAXHSAOCZIFJFO3DDC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:I55TNI2ZAXHSAOCZIFJFO3DDC4","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":"338a558bd21f84e398998a10ad8b58673c690fe5eb23f2d19eb3b1c48543eff5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-07-23T13:44:29Z","title_canon_sha256":"e939880c45fd72a7dc981d94c9a0846cc9b1efefccbb6521fe0daa8d38388233"},"schema_version":"1.0","source":{"id":"2307.12325","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.12325","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"arxiv_version","alias_value":"2307.12325v4","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12325","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"pith_short_12","alias_value":"I55TNI2ZAXHS","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"pith_short_16","alias_value":"I55TNI2ZAXHSAOCZ","created_at":"2026-07-05T11:24:00Z"},{"alias_kind":"pith_short_8","alias_value":"I55TNI2Z","created_at":"2026-07-05T11:24:00Z"}],"graph_snapshots":[{"event_id":"sha256:f0502fde71a144a3a7e182a306a26eb65a688471ea7f7ba2e936c9403fbe1d1c","target":"graph","created_at":"2026-07-05T11:24:00Z","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/2307.12325/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph-based tests are a class of non-parametric two-sample tests useful for analyzing high-dimensional data. The test statistics are constructed from similarity graphs (such as K-minimum spanning tree), and consequently, their performance is sensitive to the structure of the graph. When the graph has problematic structures (for example, hubs), as is common for high-dimensional data, this can result in low power and unstable performance among existing graph-based tests. We address this challenge by proposing new test statistics that are robust to problematic structures of the graph and can prov","authors_text":"Lynna Chu, Yichuan Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-07-23T13:44:29Z","title":"A Robust Framework for Graph-based Two-Sample Tests Using Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12325","kind":"arxiv","version":4},"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:b654806e11ed3fa315a90a5ae1ff96f9c3d742268a2148ad73db555675f3caca","target":"record","created_at":"2026-07-05T11:24:00Z","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":"338a558bd21f84e398998a10ad8b58673c690fe5eb23f2d19eb3b1c48543eff5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-07-23T13:44:29Z","title_canon_sha256":"e939880c45fd72a7dc981d94c9a0846cc9b1efefccbb6521fe0daa8d38388233"},"schema_version":"1.0","source":{"id":"2307.12325","kind":"arxiv","version":4}},"canonical_sha256":"477b36a35905cf2038594152576c6317395f6e8170a93bafe6118b152fd35738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"477b36a35905cf2038594152576c6317395f6e8170a93bafe6118b152fd35738","first_computed_at":"2026-07-05T11:24:00.957192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:24:00.957192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LUQgxc+ZtO5bT6HbefHWzBo8mwTgVJmzc0EigvS0Y8Qoci49tnMafCD/KR4q986ATL1cdolv7/XGClYH83t5Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:24:00.957689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.12325","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b654806e11ed3fa315a90a5ae1ff96f9c3d742268a2148ad73db555675f3caca","sha256:f0502fde71a144a3a7e182a306a26eb65a688471ea7f7ba2e936c9403fbe1d1c"],"state_sha256":"7778655efe14e2f5009d3b6caf847eb89323fe6401750339e5c9ea3ffcd51722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2llaydBvRHJnxd7aTD+M1gmyumNvDm7jbYFlQXJ/9FPDd4ux7npaqt4B9z5kQCjck1IyzR//hKb9Kd4eEBjIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:22:18.988430Z","bundle_sha256":"57063c6673fcf5bdc826bc5f97bc65ddfdf49346d4f3471ba095dbd238274f29"}}