{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DF7V67AMLTR5OSYPAGHQLMPZPY","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":"e08e12d9113e41fcd9aad30bf8563f5fae98ff23a17e8c584c7448b83376d9b6","cross_cats_sorted":["cs.SI","math.PR","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T18:36:45Z","title_canon_sha256":"6cbd1a618b3fcee742ed1df268f9ac886e573065358f2a97abdab8b25740adf1"},"schema_version":"1.0","source":{"id":"2412.02661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02661","created_at":"2026-07-05T09:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02661v1","created_at":"2026-07-05T09:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02661","created_at":"2026-07-05T09:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"DF7V67AMLTR5","created_at":"2026-07-05T09:43:53Z"},{"alias_kind":"pith_short_16","alias_value":"DF7V67AMLTR5OSYP","created_at":"2026-07-05T09:43:53Z"},{"alias_kind":"pith_short_8","alias_value":"DF7V67AM","created_at":"2026-07-05T09:43:53Z"}],"graph_snapshots":[{"event_id":"sha256:ad2bc2e41eac7a33684bd39ca0a4393294f949118af2b0ef958be2ba6f3d0b9d","target":"graph","created_at":"2026-07-05T09:43:53Z","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/2412.02661/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study learning problems on correlated stochastic block models with two balanced communities. Our main result gives the first efficient algorithm for graph matching in this setting. In the most interesting regime where the average degree is logarithmic in the number of vertices, this algorithm correctly matches all but a vanishing fraction of vertices with high probability, whenever the edge correlation parameter $s$ satisfies $s^2 > \\alpha \\approx 0.338$, where $\\alpha$ is Otter's tree-counting constant. Moreover, we extend this to an efficient algorithm for exact graph matching whenever th","authors_text":"Mikl\\'os Z. R\\'acz, Shuwen Chai","cross_cats":["cs.SI","math.PR","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T18:36:45Z","title":"Efficient Graph Matching for Correlated Stochastic Block Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02661","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:981d46e8b558c0977bafb78c423fe1d314d461d57bfa6b5b5d56d30601750bf4","target":"record","created_at":"2026-07-05T09:43:53Z","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":"e08e12d9113e41fcd9aad30bf8563f5fae98ff23a17e8c584c7448b83376d9b6","cross_cats_sorted":["cs.SI","math.PR","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T18:36:45Z","title_canon_sha256":"6cbd1a618b3fcee742ed1df268f9ac886e573065358f2a97abdab8b25740adf1"},"schema_version":"1.0","source":{"id":"2412.02661","kind":"arxiv","version":1}},"canonical_sha256":"197f5f7c0c5ce3d74b0f018f05b1f97e1de89e7f4eee7567762068941b1f4824","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"197f5f7c0c5ce3d74b0f018f05b1f97e1de89e7f4eee7567762068941b1f4824","first_computed_at":"2026-07-05T09:43:53.342611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:43:53.342611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54MpGY2snfmJbq/lGE2uvStJNhR+gvAe1DtxlDa4YWsb3tGlt9I0jXXGW8Awcn7ltMyy6Cg2o4ZdWlNnrmawCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:43:53.343102Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.02661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:981d46e8b558c0977bafb78c423fe1d314d461d57bfa6b5b5d56d30601750bf4","sha256:ad2bc2e41eac7a33684bd39ca0a4393294f949118af2b0ef958be2ba6f3d0b9d"],"state_sha256":"a5b1f0c6e0e53aff0c03e82f6c9bce163796de9feffdb318d00bd0716a810bd8"}