{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DF7V67AMLTR5OSYPAGHQLMPZPY","short_pith_number":"pith:DF7V67AM","schema_version":"1.0","canonical_sha256":"197f5f7c0c5ce3d74b0f018f05b1f97e1de89e7f4eee7567762068941b1f4824","source":{"kind":"arxiv","id":"2412.02661","version":1},"attestation_state":"computed","paper":{"title":"Efficient Graph Matching for Correlated Stochastic Block Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI","math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Mikl\\'os Z. R\\'acz, Shuwen Chai","submitted_at":"2024-12-03T18:36:45Z","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"},"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":"2412.02661","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-03T18:36:45Z","cross_cats_sorted":["cs.SI","math.PR","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"6cbd1a618b3fcee742ed1df268f9ac886e573065358f2a97abdab8b25740adf1","abstract_canon_sha256":"e08e12d9113e41fcd9aad30bf8563f5fae98ff23a17e8c584c7448b83376d9b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:53.343102Z","signature_b64":"54MpGY2snfmJbq/lGE2uvStJNhR+gvAe1DtxlDa4YWsb3tGlt9I0jXXGW8Awcn7ltMyy6Cg2o4ZdWlNnrmawCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"197f5f7c0c5ce3d74b0f018f05b1f97e1de89e7f4eee7567762068941b1f4824","last_reissued_at":"2026-07-05T09:43:53.342611Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:53.342611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Graph Matching for Correlated Stochastic Block Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI","math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Mikl\\'os Z. R\\'acz, Shuwen Chai","submitted_at":"2024-12-03T18:36:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02661","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.02661/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":"2412.02661","created_at":"2026-07-05T09:43:53.342673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.02661v1","created_at":"2026-07-05T09:43:53.342673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02661","created_at":"2026-07-05T09:43:53.342673+00:00"},{"alias_kind":"pith_short_12","alias_value":"DF7V67AMLTR5","created_at":"2026-07-05T09:43:53.342673+00:00"},{"alias_kind":"pith_short_16","alias_value":"DF7V67AMLTR5OSYP","created_at":"2026-07-05T09:43:53.342673+00:00"},{"alias_kind":"pith_short_8","alias_value":"DF7V67AM","created_at":"2026-07-05T09:43:53.342673+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/DF7V67AMLTR5OSYPAGHQLMPZPY","json":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY.json","graph_json":"https://pith.science/api/pith-number/DF7V67AMLTR5OSYPAGHQLMPZPY/graph.json","events_json":"https://pith.science/api/pith-number/DF7V67AMLTR5OSYPAGHQLMPZPY/events.json","paper":"https://pith.science/paper/DF7V67AM"},"agent_actions":{"view_html":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY","download_json":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY.json","view_paper":"https://pith.science/paper/DF7V67AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.02661&json=true","fetch_graph":"https://pith.science/api/pith-number/DF7V67AMLTR5OSYPAGHQLMPZPY/graph.json","fetch_events":"https://pith.science/api/pith-number/DF7V67AMLTR5OSYPAGHQLMPZPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY/action/storage_attestation","attest_author":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY/action/author_attestation","sign_citation":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY/action/citation_signature","submit_replication":"https://pith.science/pith/DF7V67AMLTR5OSYPAGHQLMPZPY/action/replication_record"}},"created_at":"2026-07-05T09:43:53.342673+00:00","updated_at":"2026-07-05T09:43:53.342673+00:00"}