{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:637SM5FH4B7NDVRIH75PD2LEHJ","short_pith_number":"pith:637SM5FH","schema_version":"1.0","canonical_sha256":"f6ff2674a7e07ed1d6283ffaf1e9643a60ce0ff1ed23c5957f503f312ac8cc4e","source":{"kind":"arxiv","id":"1807.10262","version":1},"attestation_state":"computed","paper":{"title":"Seeded Graph Matching via Large Neighborhood Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elchanan Mossel, Jiaming Xu","submitted_at":"2018-07-26T17:44:00Z","abstract_excerpt":"We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\\H{o}s-R\\'{e}nyi random graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. For seeded problems, our result provides a significant improvement over previously known results. We show that it is possible to achieve the information-theoretic limit of graph sparsity in time polynomial in the number of vertices $n$. Moreover, we show the number of seeds needed for exact recovery in po"},"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":"1807.10262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-26T17:44:00Z","cross_cats_sorted":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ab08ad7e8f2c106bfbaae7b43dd5e1564a54c46047e2ab64637097ee01276a43","abstract_canon_sha256":"671bce36f6a56fc071840465cc708ec243140efce90ac5c592843eedef4166ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.730788Z","signature_b64":"D3yJ4hjvFQMGjxaEeZax+Wvtp7SpfN0jyBE8P1N0x8AqNH60Yy4OJXaSwTpfvj7oA81XspQd3v81a+gx6Y4dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6ff2674a7e07ed1d6283ffaf1e9643a60ce0ff1ed23c5957f503f312ac8cc4e","last_reissued_at":"2026-05-18T00:09:42.729999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.729999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Seeded Graph Matching via Large Neighborhood Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elchanan Mossel, Jiaming Xu","submitted_at":"2018-07-26T17:44:00Z","abstract_excerpt":"We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\\H{o}s-R\\'{e}nyi random graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. For seeded problems, our result provides a significant improvement over previously known results. We show that it is possible to achieve the information-theoretic limit of graph sparsity in time polynomial in the number of vertices $n$. Moreover, we show the number of seeds needed for exact recovery in po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10262","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":""},"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":"1807.10262","created_at":"2026-05-18T00:09:42.730147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10262v1","created_at":"2026-05-18T00:09:42.730147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10262","created_at":"2026-05-18T00:09:42.730147+00:00"},{"alias_kind":"pith_short_12","alias_value":"637SM5FH4B7N","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"637SM5FH4B7NDVRI","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"637SM5FH","created_at":"2026-05-18T12:32:08.215937+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/637SM5FH4B7NDVRIH75PD2LEHJ","json":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ.json","graph_json":"https://pith.science/api/pith-number/637SM5FH4B7NDVRIH75PD2LEHJ/graph.json","events_json":"https://pith.science/api/pith-number/637SM5FH4B7NDVRIH75PD2LEHJ/events.json","paper":"https://pith.science/paper/637SM5FH"},"agent_actions":{"view_html":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ","download_json":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ.json","view_paper":"https://pith.science/paper/637SM5FH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10262&json=true","fetch_graph":"https://pith.science/api/pith-number/637SM5FH4B7NDVRIH75PD2LEHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/637SM5FH4B7NDVRIH75PD2LEHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/action/storage_attestation","attest_author":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/action/author_attestation","sign_citation":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/action/citation_signature","submit_replication":"https://pith.science/pith/637SM5FH4B7NDVRIH75PD2LEHJ/action/replication_record"}},"created_at":"2026-05-18T00:09:42.730147+00:00","updated_at":"2026-05-18T00:09:42.730147+00:00"}