{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PYVDSWJ6DXEGACWOPZZFXMP5T4","short_pith_number":"pith:PYVDSWJ6","schema_version":"1.0","canonical_sha256":"7e2a39593e1dc8600ace7e725bb1fd9f2363950bc12d4f76472d8a4980dff43a","source":{"kind":"arxiv","id":"2502.17142","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.17142","created_at":"2026-05-25T02:01:02.437967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.17142v4","created_at":"2026-05-25T02:01:02.437967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17142","created_at":"2026-05-25T02:01:02.437967+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYVDSWJ6DXEG","created_at":"2026-05-25T02:01:02.437967+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYVDSWJ6DXEGACWO","created_at":"2026-05-25T02:01:02.437967+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYVDSWJ6","created_at":"2026-05-25T02:01:02.437967+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/PYVDSWJ6DXEGACWOPZZFXMP5T4","json":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4.json","graph_json":"https://pith.science/api/pith-number/PYVDSWJ6DXEGACWOPZZFXMP5T4/graph.json","events_json":"https://pith.science/api/pith-number/PYVDSWJ6DXEGACWOPZZFXMP5T4/events.json","paper":"https://pith.science/paper/PYVDSWJ6"},"agent_actions":{"view_html":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4","download_json":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4.json","view_paper":"https://pith.science/paper/PYVDSWJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.17142&json=true","fetch_graph":"https://pith.science/api/pith-number/PYVDSWJ6DXEGACWOPZZFXMP5T4/graph.json","fetch_events":"https://pith.science/api/pith-number/PYVDSWJ6DXEGACWOPZZFXMP5T4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/action/storage_attestation","attest_author":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/action/author_attestation","sign_citation":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/action/citation_signature","submit_replication":"https://pith.science/pith/PYVDSWJ6DXEGACWOPZZFXMP5T4/action/replication_record"}},"created_at":"2026-05-25T02:01:02.437967+00:00","updated_at":"2026-05-25T02:01:02.437967+00:00"}