{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5K4ZHCDRNHVDHVPKA5ZSJ2WXTB","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":"4b7b5d08c16774a9776584716cdf53aee9945f229f2bd9f2a25762a72bc1dc16","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T00:58:50Z","title_canon_sha256":"1f109e02222b60dda65b3b684ecdf7fea76a48b101b3ef82ca7a567c0bcfed8a"},"schema_version":"1.0","source":{"id":"2306.00266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.00266","created_at":"2026-07-05T07:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2306.00266v2","created_at":"2026-07-05T07:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.00266","created_at":"2026-07-05T07:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"5K4ZHCDRNHVD","created_at":"2026-07-05T07:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"5K4ZHCDRNHVDHVPK","created_at":"2026-07-05T07:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"5K4ZHCDR","created_at":"2026-07-05T07:52:40Z"}],"graph_snapshots":[{"event_id":"sha256:7c8dc654c33e77359733e7d3b3aa865ddbf2c306c8f3944b7b785d2840f33a78","target":"graph","created_at":"2026-07-05T07:52:40Z","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/2306.00266/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an efficient algorithm for matching two correlated Erd\\H{o}s--R\\'enyi graphs with $n$ vertices whose edges are correlated through a latent vertex correspondence. When the edge density $q= n^{- \\alpha+o(1)}$ for a constant $\\alpha \\in [0,1)$, we show that our algorithm has polynomial running time and succeeds to recover the latent matching as long as the edge correlation is non-vanishing. This is closely related to our previous work on a polynomial-time algorithm that matches two Gaussian Wigner matrices with non-vanishing correlation, and provides the first polynomial-time random gr","authors_text":"Jian Ding, Zhangsong Li","cross_cats":["math.PR","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T00:58:50Z","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.00266","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:fb8fa0a0762ff90f5c6888c3ab54ed6d54b3ad281b653c15c3bd061c9f2c0768","target":"record","created_at":"2026-07-05T07:52:40Z","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":"4b7b5d08c16774a9776584716cdf53aee9945f229f2bd9f2a25762a72bc1dc16","cross_cats_sorted":["math.PR","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T00:58:50Z","title_canon_sha256":"1f109e02222b60dda65b3b684ecdf7fea76a48b101b3ef82ca7a567c0bcfed8a"},"schema_version":"1.0","source":{"id":"2306.00266","kind":"arxiv","version":2}},"canonical_sha256":"eab993887169ea33d5ea077324ead79877a9ac61009b23108526c9761f525cfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eab993887169ea33d5ea077324ead79877a9ac61009b23108526c9761f525cfc","first_computed_at":"2026-07-05T07:52:40.432737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:52:40.432737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hDlMGUVZnJPixkHYu24gExNzmim4HFmZ5ca7ignOehnvTn8jIHsxUqQfdY9cmt8pQHBdpjLsSBcixVlTuiliCw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:52:40.433168Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.00266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb8fa0a0762ff90f5c6888c3ab54ed6d54b3ad281b653c15c3bd061c9f2c0768","sha256:7c8dc654c33e77359733e7d3b3aa865ddbf2c306c8f3944b7b785d2840f33a78"],"state_sha256":"81ccc6ceb21f458150ded8cdad15113c6552c5511996a651488278810e00a52f"}