{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PYVDSWJ6DXEGACWOPZZFXMP5T4","short_pith_number":"pith:PYVDSWJ6","canonical_record":{"source":{"id":"2502.17142","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-02-24T13:34:21Z","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"title_canon_sha256":"b8916ac057f41d446b9f6158de9fee54cf4ecb00b802d8d9b265c3b0a7cea71d","abstract_canon_sha256":"62bb47192f097c5cb5b69635b20c721967c72e9c6dc30936cd4f17c21c525acc"},"schema_version":"1.0"},"canonical_sha256":"7e2a39593e1dc8600ace7e725bb1fd9f2363950bc12d4f76472d8a4980dff43a","source":{"kind":"arxiv","id":"2502.17142","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.17142","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2502.17142v4","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17142","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"PYVDSWJ6DXEG","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"PYVDSWJ6DXEGACWO","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"PYVDSWJ6","created_at":"2026-05-25T02:01:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PYVDSWJ6DXEGACWOPZZFXMP5T4","target":"record","payload":{"canonical_record":{"source":{"id":"2502.17142","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-02-24T13:34:21Z","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"title_canon_sha256":"b8916ac057f41d446b9f6158de9fee54cf4ecb00b802d8d9b265c3b0a7cea71d","abstract_canon_sha256":"62bb47192f097c5cb5b69635b20c721967c72e9c6dc30936cd4f17c21c525acc"},"schema_version":"1.0"},"canonical_sha256":"7e2a39593e1dc8600ace7e725bb1fd9f2363950bc12d4f76472d8a4980dff43a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:02.438540Z","signature_b64":"VhuhX6Psmr6EB82mZneWhhsngsIpQhxSWgpSQ24YL+sir9qR6rUJMUrrB/MaIhK7V0brKx3kVxx9j8qdAGO+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e2a39593e1dc8600ace7e725bb1fd9f2363950bc12d4f76472d8a4980dff43a","last_reissued_at":"2026-05-25T02:01:02.437895Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:02.437895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.17142","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-05-25T02:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fcp31fYkrMkY4pxXZhRKwxspkSdcqe1lQ04Syj1PCAW/0dVd2BxtWSP7QkxQBmLZknuEAcXbbEx7IV8VSl6+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:15.343206Z"},"content_sha256":"02cf859a122763e36c0bc461602df2e83b6ca6013736faf44e0a39d5ea383505","schema_version":"1.0","event_id":"sha256:02cf859a122763e36c0bc461602df2e83b6ca6013736faf44e0a39d5ea383505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PYVDSWJ6DXEGACWOPZZFXMP5T4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The feasibility of multi-graph alignment: a Bayesian approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Above a critical threshold exact multi-graph alignment is achievable with high probability in the Gaussian model","cross_cats":["math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Laurent Massouli\\'e, Louis Vassaux","submitted_at":"2025-02-24T13:34:21Z","abstract_excerpt":"We establish thresholds for the feasibility of random multi-graph alignment in two models. In the Gaussian model, we demonstrate an \"all-or-nothing\" phenomenon: above a critical threshold, exact alignment is achievable with high probability, while below it, even partial alignment is statistically impossible. In the sparse Erd\\H{o}s-R\\'enyi model, we rigorously identify a threshold below which no meaningful partial alignment is possible and conjecture that above this threshold, partial alignment can be achieved. To prove these results, we develop a general Bayesian estimation framework over met"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In the Gaussian model, above a critical threshold, exact alignment is achievable with high probability, while below it, even partial alignment is statistically impossible.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The random multi-graph generative models (Gaussian weights and sparse Erdős-Rényi edges) correctly capture the statistical setting, and the newly developed Bayesian estimation framework over metric spaces yields the precise information-theoretic feasibility thresholds without hidden modeling assumptions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Establishes an all-or-nothing threshold for exact multi-graph alignment in the Gaussian model and a partial-alignment threshold in the sparse Erdős-Rényi model using a general Bayesian estimation framework over metric spaces.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Above a critical threshold exact multi-graph alignment is achievable with high probability in the Gaussian model","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f897d2d319318f895a650808e71903da8d51be76c45735ccf2b8abf67a20c50f"},"source":{"id":"2502.17142","kind":"arxiv","version":4},"verdict":{"id":"8d07b913-4bf7-4f12-ae6a-ae2a2e82ef46","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T02:45:07.717673Z","strongest_claim":"In the Gaussian model, above a critical threshold, exact alignment is achievable with high probability, while below it, even partial alignment is statistically impossible.","one_line_summary":"Establishes an all-or-nothing threshold for exact multi-graph alignment in the Gaussian model and a partial-alignment threshold in the sparse Erdős-Rényi model using a general Bayesian estimation framework over metric spaces.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The random multi-graph generative models (Gaussian weights and sparse Erdős-Rényi edges) correctly capture the statistical setting, and the newly developed Bayesian estimation framework over metric spaces yields the precise information-theoretic feasibility thresholds without hidden modeling assumptions.","pith_extraction_headline":"Above a critical threshold exact multi-graph alignment is achievable with high probability in the Gaussian model"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.17142/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":"8d07b913-4bf7-4f12-ae6a-ae2a2e82ef46"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhxBVlrAWkKAsTGXAWBEia0d3PUElm+CgYMcUOEw3B2jIZA4qNAnzRiW6CC6X+TBNLjgiYoQcHs5eGuEyPqPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:15.344370Z"},"content_sha256":"eece320230d69c77fb55f95aea2fdc72f9572d1c950133159111fd97c1a67df8","schema_version":"1.0","event_id":"sha256:eece320230d69c77fb55f95aea2fdc72f9572d1c950133159111fd97c1a67df8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/bundle.json","state_url":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/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-05-25T11:10:15Z","links":{"resolver":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4","bundle":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/bundle.json","state":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PYVDSWJ6DXEGACWOPZZFXMP5T4","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":"62bb47192f097c5cb5b69635b20c721967c72e9c6dc30936cd4f17c21c525acc","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-02-24T13:34:21Z","title_canon_sha256":"b8916ac057f41d446b9f6158de9fee54cf4ecb00b802d8d9b265c3b0a7cea71d"},"schema_version":"1.0","source":{"id":"2502.17142","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.17142","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2502.17142v4","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17142","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"PYVDSWJ6DXEG","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"PYVDSWJ6DXEGACWO","created_at":"2026-05-25T02:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"PYVDSWJ6","created_at":"2026-05-25T02:01:02Z"}],"graph_snapshots":[{"event_id":"sha256:eece320230d69c77fb55f95aea2fdc72f9572d1c950133159111fd97c1a67df8","target":"graph","created_at":"2026-05-25T02:01:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"In the Gaussian model, above a critical threshold, exact alignment is achievable with high probability, while below it, even partial alignment is statistically impossible."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The random multi-graph generative models (Gaussian weights and sparse Erdős-Rényi edges) correctly capture the statistical setting, and the newly developed Bayesian estimation framework over metric spaces yields the precise information-theoretic feasibility thresholds without hidden modeling assumptions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Establishes an all-or-nothing threshold for exact multi-graph alignment in the Gaussian model and a partial-alignment threshold in the sparse Erdős-Rényi model using a general Bayesian estimation framework over metric spaces."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Above a critical threshold exact multi-graph alignment is achievable with high probability in the Gaussian model"}],"snapshot_sha256":"f897d2d319318f895a650808e71903da8d51be76c45735ccf2b8abf67a20c50f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.17142/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We establish thresholds for the feasibility of random multi-graph alignment in two models. In the Gaussian model, we demonstrate an \"all-or-nothing\" phenomenon: above a critical threshold, exact alignment is achievable with high probability, while below it, even partial alignment is statistically impossible. In the sparse Erd\\H{o}s-R\\'enyi model, we rigorously identify a threshold below which no meaningful partial alignment is possible and conjecture that above this threshold, partial alignment can be achieved. To prove these results, we develop a general Bayesian estimation framework over met","authors_text":"Laurent Massouli\\'e, Louis Vassaux","cross_cats":["math.PR","stat.ML","stat.TH"],"headline":"Above a critical threshold exact multi-graph alignment is achievable with high probability in the Gaussian model","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-02-24T13:34:21Z","title":"The feasibility of multi-graph alignment: a Bayesian approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17142","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-23T02:45:07.717673Z","id":"8d07b913-4bf7-4f12-ae6a-ae2a2e82ef46","model_set":{"reader":"grok-4.3"},"one_line_summary":"Establishes an all-or-nothing threshold for exact multi-graph alignment in the Gaussian model and a partial-alignment threshold in the sparse Erdős-Rényi model using a general Bayesian estimation framework over metric spaces.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Above a critical threshold exact multi-graph alignment is achievable with high probability in the Gaussian model","strongest_claim":"In the Gaussian model, above a critical threshold, exact alignment is achievable with high probability, while below it, even partial alignment is statistically impossible.","weakest_assumption":"The random multi-graph generative models (Gaussian weights and sparse Erdős-Rényi edges) correctly capture the statistical setting, and the newly developed Bayesian estimation framework over metric spaces yields the precise information-theoretic feasibility thresholds without hidden modeling assumptions."}},"verdict_id":"8d07b913-4bf7-4f12-ae6a-ae2a2e82ef46"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02cf859a122763e36c0bc461602df2e83b6ca6013736faf44e0a39d5ea383505","target":"record","created_at":"2026-05-25T02:01:02Z","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":"62bb47192f097c5cb5b69635b20c721967c72e9c6dc30936cd4f17c21c525acc","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-02-24T13:34:21Z","title_canon_sha256":"b8916ac057f41d446b9f6158de9fee54cf4ecb00b802d8d9b265c3b0a7cea71d"},"schema_version":"1.0","source":{"id":"2502.17142","kind":"arxiv","version":4}},"canonical_sha256":"7e2a39593e1dc8600ace7e725bb1fd9f2363950bc12d4f76472d8a4980dff43a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e2a39593e1dc8600ace7e725bb1fd9f2363950bc12d4f76472d8a4980dff43a","first_computed_at":"2026-05-25T02:01:02.437895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:02.437895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhuhX6Psmr6EB82mZneWhhsngsIpQhxSWgpSQ24YL+sir9qR6rUJMUrrB/MaIhK7V0brKx3kVxx9j8qdAGO+CA==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:02.438540Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.17142","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02cf859a122763e36c0bc461602df2e83b6ca6013736faf44e0a39d5ea383505","sha256:eece320230d69c77fb55f95aea2fdc72f9572d1c950133159111fd97c1a67df8"],"state_sha256":"6cbe056f74e85b7646772809428bc1a10cbcce15ed5f4641a1371cac2d4c3e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhufKqpKgS/iQN0Vlr0BM3jQk7qpuE1gNPB1TOo4IMB83KQNg64MP5jiJ/tNUKwYkoh/x9R5SHTZDLfCOeX/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:10:15.348819Z","bundle_sha256":"db6ea06d3d66d57bc786d74c1918bbb525e04eeaa64a804278d18506587b1e78"}}