{"id":"https://openalex.org/W7128088689","doi":"https://doi.org/10.48550/arxiv.2602.03970","title":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","display_name":"Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits","publication_year":2026,"publication_date":"2026-02-03","ids":{"openalex":"https://openalex.org/W7128088689","doi":"https://doi.org/10.48550/arxiv.2602.03970"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.03970","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036113771","display_name":"Anastasis Kratsios","orcid":"https://orcid.org/0000-0001-6791-3371"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kratsios, Anastasis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071886724","display_name":"Giulia Livieri","orcid":"https://orcid.org/0000-0002-3777-7329"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Livieri, Giulia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024852903","display_name":"A. Martina Neuman","orcid":"https://orcid.org/0000-0001-8508-2196"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neuman, A. Martina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17061796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.41429999470710754,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.41429999470710754,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.08460000157356262,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.07240000367164612,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6394000053405762},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5623000264167786},{"id":"https://openalex.org/keywords/observability","display_name":"Observability","score":0.5565000176429749},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5375999808311462},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.53329998254776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49149999022483826},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4862000048160553},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4375999867916107},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.41200000047683716}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6394000053405762},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5692999958992004},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5623000264167786},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.5565000176429749},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5099999904632568},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49149999022483826},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4375999867916107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4235999882221222},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.41200000047683716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4090000092983246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39500001072883606},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.35659998655319214},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C61067352","wikidata":"https://www.wikidata.org/wiki/Q1897429","display_name":"Ultrametric space","level":3,"score":0.31529998779296875},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C87007009","wikidata":"https://www.wikidata.org/wiki/Q210832","display_name":"Statistical hypothesis testing","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2897999882698059},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.2881999909877777},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2736000120639801},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.03970","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.03970","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03970","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.03970","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,94],"study":[1],"the":[2,62,98,111,117,148,151,162],"statistical":[3,173],"behavior":[4],"of":[5,12,55,77,147,150,161],"reasoning":[6],"probes":[7],"in":[8,175],"a":[9,26,33,52,70,74,85,90,103,156,169],"stylized":[10],"model":[11],"iterative":[13,178],"computation":[14,22,47,92,152],"inspired":[15],"by":[16,25,102,155],"neural":[17],"algorithmic":[18],"reasoning.":[19],"The":[20],"underlying":[21,172],"is":[23,32,100,140,144],"given":[24],"looped":[27],"Boolean":[28,79],"circuit":[29],"whose":[30],"graph":[31,104,164],"perfect":[34],"$\u03bd$-ary":[35],"tree":[36],"($\u03bd\\ge":[37],"2$),":[38],"with":[39,121,132],"outputs":[40],"recursively":[41],"fed":[42],"back":[43],"as":[44,69],"inputs":[45],"across":[46],"rounds.":[48],"A":[49,137],"probe":[50,99],"observes":[51],"sampled":[53],"subset":[54],"internal":[56],"nodes":[57],"and":[58,107],"seeks":[59],"to":[60],"infer":[61],"latent":[63],"operation":[64],"at":[65,116,123],"each":[66],"node,":[67],"represented":[68],"probability":[71,122],"distribution":[72],"over":[73],"finite":[75],"set":[76],"admissible":[78],"gates.":[80],"This":[81],"partial":[82],"observability":[83],"induces":[84],"transductive":[86],"generalization":[87,113],"problem":[88],"on":[89],"structured":[91],"graph.":[93],"show":[95],"that":[96,141],"when":[97],"parameterized":[101],"convolutional":[105],"network":[106],"queries":[108],"$N$":[109],"nodes,":[110],"worst-case":[112],"error":[114],"decays":[115],"optimal":[118,135],"rate":[119,143],"$\\mathcal{O}(\\sqrt{\\log(2/\u03b4)}/\\sqrt{N})$":[120],"least":[124],"$1-\u03b4$.":[125],"Our":[126],"analysis":[127],"combines":[128],"metric":[129],"embedding":[130,160],"techniques":[131],"tools":[133],"from":[134],"transport.":[136],"key":[138],"insight":[139],"this":[142],"achievable":[145],"independently":[146],"size":[149],"graph,":[153],"enabled":[154],"low-distortion":[157],"one-dimensional":[158],"snowflake":[159],"induced":[163],"metric.":[165],"These":[166],"results":[167],"highlight":[168],"geometric":[170],"mechanism":[171],"efficiency":[174],"probing":[176],"structured,":[177],"computations.":[179]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-07T00:00:00"}