{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7R4OPEA7G3U7GH3YPAFV6WHH4W","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":"9084cf6eca0152bc237bd647bd51712ad00d31b7ad6de456a131f9b84be560dc","cross_cats_sorted":["cs.DS","cs.LG","math.IT","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-02T12:01:42Z","title_canon_sha256":"f6fc61b3d507b0480f817c0c636362227c5eb29d535faeaa5e517b7ca0168c09"},"schema_version":"1.0","source":{"id":"2211.01069","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.01069","created_at":"2026-07-05T06:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"2211.01069v2","created_at":"2026-07-05T06:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01069","created_at":"2026-07-05T06:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"7R4OPEA7G3U7","created_at":"2026-07-05T06:13:53Z"},{"alias_kind":"pith_short_16","alias_value":"7R4OPEA7G3U7GH3Y","created_at":"2026-07-05T06:13:53Z"},{"alias_kind":"pith_short_8","alias_value":"7R4OPEA7","created_at":"2026-07-05T06:13:53Z"}],"graph_snapshots":[{"event_id":"sha256:e7be9cb76cb341cc27ddff62a7e492d43834537555239709e3c9dd9203d730f5","target":"graph","created_at":"2026-07-05T06:13:53Z","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/2211.01069/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we propose an efficient two-stage algorithm solving a joint problem of correlation detection and partial alignment recovery between two Gaussian databases. Correlation detection is a hypothesis testing problem; under the null hypothesis, the databases are independent, and under the alternate hypothesis, they are correlated, under an unknown row permutation. We develop bounds on the type-I and type-II error probabilities, and show that the analyzed detector performs better than a recently proposed detector, at least for some specific parameter choices. Since the proposed detector ","authors_text":"Ran Tamir","cross_cats":["cs.DS","cs.LG","math.IT","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-02T12:01:42Z","title":"On Correlation Detection and Alignment Recovery of Gaussian Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01069","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:b55ee8dbfc251de36494f3e35a9b94bb00ea73232c131bc4f1e99e856a103c99","target":"record","created_at":"2026-07-05T06:13:53Z","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":"9084cf6eca0152bc237bd647bd51712ad00d31b7ad6de456a131f9b84be560dc","cross_cats_sorted":["cs.DS","cs.LG","math.IT","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-02T12:01:42Z","title_canon_sha256":"f6fc61b3d507b0480f817c0c636362227c5eb29d535faeaa5e517b7ca0168c09"},"schema_version":"1.0","source":{"id":"2211.01069","kind":"arxiv","version":2}},"canonical_sha256":"fc78e7901f36e9f31f78780b5f58e7e5a6192941934ca50c47caf33e863e860c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc78e7901f36e9f31f78780b5f58e7e5a6192941934ca50c47caf33e863e860c","first_computed_at":"2026-07-05T06:13:53.375406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:13:53.375406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"93ap6nm+/jOfVY3J7qjwKZ2XZiCW4UnIvhynQ1LZDOznGuMay1T/FDX+uV1CmzQyWzlzu42oDAxiCTYEcHGjAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:13:53.376027Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.01069","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b55ee8dbfc251de36494f3e35a9b94bb00ea73232c131bc4f1e99e856a103c99","sha256:e7be9cb76cb341cc27ddff62a7e492d43834537555239709e3c9dd9203d730f5"],"state_sha256":"7f56ad00cfddadbdf0acb495e5020464b4a694782ea17a95c8f4a1e156746ebf"}