{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T08:10:18Z","timestamp":1778832618093,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"vor","delay-in-days":297,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["88887.950125\/2024-00"],"award-info":[{"award-number":["88887.950125\/2024-00"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016549","name":"Universal","doi-asserted-by":"publisher","award":["407296\/2021-2"],"award-info":[{"award-number":["407296\/2021-2"]}],"id":[{"id":"10.13039\/100016549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Fundacao Carlos Chagas Filho de Amparo a Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/204.143\/2024"],"award-info":[{"award-number":["E-26\/204.143\/2024"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.10.282","type":"journal-article","created":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T08:19:08Z","timestamp":1764058748000},"page":"70-77","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A Weight Function Lemma Heuristic for Graph Pebbling"],"prefix":"10.1016","volume":"273","author":[{"given":"Guilherme Adamatti","family":"Bridi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"de Lima Marquezino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celina Miraglia Herrera","family":"de Figueiredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.10.282_bib1","series-title":"Pebbling in Kneser graphs, in: Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science","first-page":"46","author":"Adauto","year":"2024"},{"key":"10.1016\/j.procs.2025.10.282_bib2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.dam.2024.10.020","article-title":"On the pebbling numbers of Flower, Blanu\u0161a and Watkins snarks","volume":"361","author":"Adauto","year":"2025","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.procs.2025.10.282_bib3","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1137\/130914607","article-title":"Pebbling in split graphs","volume":"28","author":"Alc\u00f3n","year":"2014","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.procs.2025.10.282_bib4","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1016\/j.disc.2011.02.013","article-title":"The total-chromatic number of some families of snarks","volume":"311","author":"Campos","year":"2011","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.procs.2025.10.282_bib5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1097-0118(199806)28:2<57::AID-JGT1>3.0.CO;2-D","article-title":"A survey on snarks and new results: Products, reducibility and a computer search","volume":"28","author":"Cavicchioli","year":"1998","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/j.procs.2025.10.282_bib6","doi-asserted-by":"crossref","first-page":"2301","DOI":"10.1016\/j.disc.2006.06.032","article-title":"Improved pebbling bounds","volume":"308","author":"Chan","year":"2008","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.procs.2025.10.282_bib7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.dam.2023.12.022","article-title":"Automating weight function generation in graph pebbling","volume":"347","author":"Flocco","year":"2024","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.procs.2025.10.282_bib8","first-page":"41","article-title":"A survey of graph pebbling","volume":"139","author":"Hurlbert","year":"1999","journal-title":"Congressus Numerantium"},{"key":"10.1016\/j.procs.2025.10.282_bib9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10878-016-9993-z","article-title":"The weight function lemma for graph pebbling","volume":"34","author":"Hurlbert","year":"2017","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.procs.2025.10.282_bib10","doi-asserted-by":"crossref","first-page":"1900","DOI":"10.1090\/noti2379","article-title":"Graph pebbling: A blend of graph theory, number theory, and optimization","volume":"68","author":"Hurlbert","year":"2021","journal-title":"Notices of the American Mathematical Society"},{"key":"10.1016\/j.procs.2025.10.282_bib11","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1137\/050636218","article-title":"The complexity of graph pebbling","volume":"20","author":"Milans","year":"2006","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.procs.2025.10.282_bib12","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1998"},{"key":"10.1016\/j.procs.2025.10.282_bib13","first-page":"225","article-title":"Sur le th\u00e9or\u00e8me de Tait","volume":"5","author":"Petersen","year":"1898","journal-title":"L\u2019Interm\u00e9diaire des Math\u00e9maticiens"},{"key":"10.1016\/j.procs.2025.10.282_bib14","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1017\/S0370164600044229","article-title":"Remarks on the colouring of maps","volume":"10","author":"Tait","year":"1880","journal-title":"Proceedings of the Royal Society of Edinburgh"},{"key":"10.1016\/j.procs.2025.10.282_bib15","unstructured":"Watson, N.G., 2005. The complexity of pebbling and cover pebbling. available as arXiv preprint math\/0503511 21 Apr 2005."}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925036294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925036294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T07:34:17Z","timestamp":1778830457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925036294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":15,"alternative-id":["S1877050925036294"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.282","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Weight Function Lemma Heuristic for Graph Pebbling","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.282","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}