{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2AV4G3LPYDAQW5KL5NFERC4ISB","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":"a49f7059c5f5c002f9422a4da7ba1daf2ee59e6b120f3eef5859c91f79450b53","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-29T13:04:20Z","title_canon_sha256":"1a585547217bfae0a8557b6e98d11f43fde07480abc0508da48850693564f347"},"schema_version":"1.0","source":{"id":"2205.14650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14650","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14650v1","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14650","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"2AV4G3LPYDAQ","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"pith_short_16","alias_value":"2AV4G3LPYDAQW5KL","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"pith_short_8","alias_value":"2AV4G3LP","created_at":"2026-07-05T04:27:19Z"}],"graph_snapshots":[{"event_id":"sha256:edbed919fcc66d4991d45972655ad7935cff1f2dc1b8d7f89816980a7fbe2215","target":"graph","created_at":"2026-07-05T04:27:19Z","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/2205.14650/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For two correlated graphs which are independently sub-sampled from a common Erd\\H{o}s-R\\'enyi graph $\\mathbf{G}(n, p)$, we wish to recover their \\emph{latent} vertex matching from the observation of these two graphs \\emph{without labels}. When $p = n^{-\\alpha+o(1)}$ for $\\alpha\\in (0, 1]$, we establish a sharp information-theoretic threshold for whether it is possible to correctly match a positive fraction of vertices. Our result sharpens a constant factor in a recent work by Wu, Xu and Yu.","authors_text":"Hang Du, Jian Ding","cross_cats":["math.PR","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-29T13:04:20Z","title":"Matching recovery threshold for correlated random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14650","kind":"arxiv","version":1},"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:30257b1f80baca7a9e4ab62faa78c634ec5505dab1dc01c6c80c5bb502fff0b9","target":"record","created_at":"2026-07-05T04:27:19Z","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":"a49f7059c5f5c002f9422a4da7ba1daf2ee59e6b120f3eef5859c91f79450b53","cross_cats_sorted":["math.PR","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-05-29T13:04:20Z","title_canon_sha256":"1a585547217bfae0a8557b6e98d11f43fde07480abc0508da48850693564f347"},"schema_version":"1.0","source":{"id":"2205.14650","kind":"arxiv","version":1}},"canonical_sha256":"d02bc36d6fc0c10b754beb4a488b88907aa9a8020eed9083c4183434e962aded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d02bc36d6fc0c10b754beb4a488b88907aa9a8020eed9083c4183434e962aded","first_computed_at":"2026-07-05T04:27:19.554735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:19.554735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k0zuGFO9KgjBEM6hh6ueKKqg2JkvGbIKXF5EFj75zJLBF+Hk5K3Q+xwvvmpriKtwE27MxRtRwD3oxdw+GcyWBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:19.555229Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30257b1f80baca7a9e4ab62faa78c634ec5505dab1dc01c6c80c5bb502fff0b9","sha256:edbed919fcc66d4991d45972655ad7935cff1f2dc1b8d7f89816980a7fbe2215"],"state_sha256":"22cc2ee7d8c3b61a43cf376cfb9ce5a7eb084df661d79bc058024b241aecf5dc"}