{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7D7YIKMWPLHEZQWMP2DGYEEPEE","short_pith_number":"pith:7D7YIKMW","schema_version":"1.0","canonical_sha256":"f8ff8429967ace4cc2cc7e866c108f210eca041ff1ec5a185a549ceb37dfc5cc","source":{"kind":"arxiv","id":"2504.16279","version":2},"attestation_state":"computed","paper":{"title":"Sharp Detection Threshold for Correlation among Multiple Unlabeled Gaussian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP","stat.TH"],"primary_cat":"math.ST","authors_text":"Bruce Hajek, Taha Ameen","submitted_at":"2025-04-22T21:30:25Z","abstract_excerpt":"This paper studies the hypothesis testing problem of deciding whether $m \\geq 2$ complete weighted graphs with Gaussian edge weights are mutually correlated after unknown relabelings of their vertices. Under the null model all edge weights are independent standard Gaussians, whereas under the planted model the graphs share a latent vertex alignment and each pair of corresponding edge weights has correlation $\\rho$. For fixed $m$, we identify the sharp information-theoretic threshold for detection. Above the threshold, a generalized likelihood-ratio test achieves strong detection, whereas even "},"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":"2504.16279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-04-22T21:30:25Z","cross_cats_sorted":["cs.IT","math.IT","stat.AP","stat.TH"],"title_canon_sha256":"578ce8ff1dee9a74a0f2e7093d0b79c7cfd24936497daa4517b460bfb27be11f","abstract_canon_sha256":"1d42f2c2757754230f20a8c375e2a000f0a9e00cce5ecec8b095ae0ec76e412f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:08.178924Z","signature_b64":"ukZwVCO91SQrYVQd09ORVsh+8S3M9YlMd8Sp5JbD6YkdAEHy+3iWs373582+aHSsPPyOB1E0EdvDa+IuT4OuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8ff8429967ace4cc2cc7e866c108f210eca041ff1ec5a185a549ceb37dfc5cc","last_reissued_at":"2026-06-12T01:09:08.177776Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:08.177776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Detection Threshold for Correlation among Multiple Unlabeled Gaussian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP","stat.TH"],"primary_cat":"math.ST","authors_text":"Bruce Hajek, Taha Ameen","submitted_at":"2025-04-22T21:30:25Z","abstract_excerpt":"This paper studies the hypothesis testing problem of deciding whether $m \\geq 2$ complete weighted graphs with Gaussian edge weights are mutually correlated after unknown relabelings of their vertices. Under the null model all edge weights are independent standard Gaussians, whereas under the planted model the graphs share a latent vertex alignment and each pair of corresponding edge weights has correlation $\\rho$. For fixed $m$, we identify the sharp information-theoretic threshold for detection. Above the threshold, a generalized likelihood-ratio test achieves strong detection, whereas even "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16279","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/2504.16279/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":"2504.16279","created_at":"2026-06-12T01:09:08.177950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16279v2","created_at":"2026-06-12T01:09:08.177950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16279","created_at":"2026-06-12T01:09:08.177950+00:00"},{"alias_kind":"pith_short_12","alias_value":"7D7YIKMWPLHE","created_at":"2026-06-12T01:09:08.177950+00:00"},{"alias_kind":"pith_short_16","alias_value":"7D7YIKMWPLHEZQWM","created_at":"2026-06-12T01:09:08.177950+00:00"},{"alias_kind":"pith_short_8","alias_value":"7D7YIKMW","created_at":"2026-06-12T01:09:08.177950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2502.17142","citing_title":"The feasibility of multi-graph alignment: a Bayesian approach","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2502.17142","citing_title":"The feasibility of multi-graph alignment: a Bayesian approach","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04365","citing_title":"Attributed Network Alignment: Statistical Limits and Efficient Algorithm","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE","json":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE.json","graph_json":"https://pith.science/api/pith-number/7D7YIKMWPLHEZQWMP2DGYEEPEE/graph.json","events_json":"https://pith.science/api/pith-number/7D7YIKMWPLHEZQWMP2DGYEEPEE/events.json","paper":"https://pith.science/paper/7D7YIKMW"},"agent_actions":{"view_html":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE","download_json":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE.json","view_paper":"https://pith.science/paper/7D7YIKMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16279&json=true","fetch_graph":"https://pith.science/api/pith-number/7D7YIKMWPLHEZQWMP2DGYEEPEE/graph.json","fetch_events":"https://pith.science/api/pith-number/7D7YIKMWPLHEZQWMP2DGYEEPEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE/action/storage_attestation","attest_author":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE/action/author_attestation","sign_citation":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE/action/citation_signature","submit_replication":"https://pith.science/pith/7D7YIKMWPLHEZQWMP2DGYEEPEE/action/replication_record"}},"created_at":"2026-06-12T01:09:08.177950+00:00","updated_at":"2026-06-12T01:09:08.177950+00:00"}