{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:53:38Z","timestamp":1775440418047,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821805770","type":"print"},{"value":"9780821870822","type":"print"},{"value":"9781470439972","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997,11,18]]},"DOI":"10.1090\/dimacs\/039\/06","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:33:05Z","timestamp":1493245985000},"page":"93-117","source":"Crossref","is-referenced-by-count":3,"title":["On \ud835\udc43\ud835\udc3b\ud835\udc43, \ud835\udc60\ud835\udc61-connectivity, and odd charged graphs"],"prefix":"10.1090","author":[{"given":"Peter","family":"Clote","sequence":"first","affiliation":[]},{"given":"Anton","family":"Setzer","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","Proof Complexity and Feasible Arithmetics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:55:49Z","timestamp":1775436949000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11,18]]},"ISBN":["9780821805770","9780821870822","9781470439972"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/039\/06","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,11,18]]}}}