{"doi":"10.1145/2512938.2512952","title":"On the performance of percolation graph matching","abstract":null,"journal":"Proceedings of the first ACM conference on Online social networks","year":2013,"id":18230,"datarank":9.22439897252446,"base_score":5.087596335232384,"endowment":5.087596335232384,"self_citation_contribution":0.7631394502848576,"citation_network_contribution":8.461259522239603,"self_endowment_contribution":0.7631394502848576,"citer_contribution":8.461259522239603,"corpus_percentile":null,"corpus_rank":null,"citation_count":161,"citer_count":154,"citers_with_citation_signal":135,"citers_with_endowment":135,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":127488,"name":"Matthias Grossglauser","orcid":null,"position":1,"is_corresponding":false},{"id":127487,"name":"Lyudmila Yartseva","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":5.087596335232384,"endowment":5.087596335232384,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W2129406249","authors":[],"funders":[],"total_grants":0,"fwci":12.3767,"citation_percentile":0.98757136,"influential_citations":29,"citation_trend":[{"year":2013,"count":2},{"year":2014,"count":3},{"year":2015,"count":10},{"year":2016,"count":14},{"year":2017,"count":12},{"year":2018,"count":26},{"year":2019,"count":24},{"year":2020,"count":15},{"year":2021,"count":18},{"year":2022,"count":11},{"year":2023,"count":7},{"year":2024,"count":8},{"year":2025,"count":9},{"year":2026,"count":2}],"oa_status":"green","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"http://infoscience.epfl.ch/record/189760","host_type":"repository"},{"url":"http://infoscience.epfl.ch/record/189760","host_type":"repository"},{"url":"https://dl.acm.org/doi/10.1145/2512938.2512952","host_type":"publisher"},{"url":"https://dl.acm.org/doi/pdf/10.1145/2512938.2512952","host_type":"publisher"},{"url":"https://doi.org/10.1145/2512938.2512952","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.5508","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.4791","host_type":""}],"fields_of_study":["Data Quality and Management","Graph Theory and Algorithms","Semantic Web and Ontologies","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Graph isomorphism","Matching (statistics)","Computer science","Graph property","Vertex (graph theory)","Graph","Theoretical computer science","Factor-critical graph","Combinatorics","Line graph","Mathematics","Algorithm","Voltage graph"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-03T19:41:30.491525Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}