{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YJCECHJQXIBJKHVRJXTEUVOCOP","short_pith_number":"pith:YJCECHJQ","schema_version":"1.0","canonical_sha256":"c244411d30ba02951eb14de64a55c273ee0f9c937e02814e5e4713d374cae6dd","source":{"kind":"arxiv","id":"2305.03037","version":2},"attestation_state":"computed","paper":{"title":"The complexity of Presburger arithmetic with power or powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alessio Mansutti, Dmitry Chistikov, Michael Benedikt","submitted_at":"2023-05-04T17:57:16Z","abstract_excerpt":"We investigate expansions of Presburger arithmetic, i.e., the theory of the integers with addition and order, with additional structure related to exponentiation: either a function that takes a number to the power of $2$, or a predicate for the powers of $2$. The latter theory, denoted $\\mathrm{PresPower}$, was introduced by B\\\"uchi as a first attempt at characterizing the sets of tuples of numbers that can be expressed using finite automata; B\\\"uchi's method does not give an elementary upper bound, and the complexity of this theory has been open. The former theory, denoted as $\\mathrm{PresExp"},"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":"2305.03037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-05-04T17:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"725b7032348a5f0c8df7ebf1cb94e4835800400c50891d244056896d15750fd1","abstract_canon_sha256":"6016ac11f4813ee542d60a790ef7ba1dfca5a77529407fb1567825444b425ed3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:00.114553Z","signature_b64":"QddigUEH8IuQcjudhw95qOGTumNtsnrTXxYkM6oVaIkIuaKB2zOycFUlacJWGIU6jI6WN2CgGRSccr6R1h9fCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c244411d30ba02951eb14de64a55c273ee0f9c937e02814e5e4713d374cae6dd","last_reissued_at":"2026-05-25T02:01:00.113965Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:00.113965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of Presburger arithmetic with power or powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alessio Mansutti, Dmitry Chistikov, Michael Benedikt","submitted_at":"2023-05-04T17:57:16Z","abstract_excerpt":"We investigate expansions of Presburger arithmetic, i.e., the theory of the integers with addition and order, with additional structure related to exponentiation: either a function that takes a number to the power of $2$, or a predicate for the powers of $2$. The latter theory, denoted $\\mathrm{PresPower}$, was introduced by B\\\"uchi as a first attempt at characterizing the sets of tuples of numbers that can be expressed using finite automata; B\\\"uchi's method does not give an elementary upper bound, and the complexity of this theory has been open. The former theory, denoted as $\\mathrm{PresExp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03037","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.03037/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.03037","created_at":"2026-05-25T02:01:00.114036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.03037v2","created_at":"2026-05-25T02:01:00.114036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03037","created_at":"2026-05-25T02:01:00.114036+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJCECHJQXIBJ","created_at":"2026-05-25T02:01:00.114036+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJCECHJQXIBJKHVR","created_at":"2026-05-25T02:01:00.114036+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJCECHJQ","created_at":"2026-05-25T02:01:00.114036+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/YJCECHJQXIBJKHVRJXTEUVOCOP","json":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP.json","graph_json":"https://pith.science/api/pith-number/YJCECHJQXIBJKHVRJXTEUVOCOP/graph.json","events_json":"https://pith.science/api/pith-number/YJCECHJQXIBJKHVRJXTEUVOCOP/events.json","paper":"https://pith.science/paper/YJCECHJQ"},"agent_actions":{"view_html":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP","download_json":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP.json","view_paper":"https://pith.science/paper/YJCECHJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.03037&json=true","fetch_graph":"https://pith.science/api/pith-number/YJCECHJQXIBJKHVRJXTEUVOCOP/graph.json","fetch_events":"https://pith.science/api/pith-number/YJCECHJQXIBJKHVRJXTEUVOCOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP/action/storage_attestation","attest_author":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP/action/author_attestation","sign_citation":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP/action/citation_signature","submit_replication":"https://pith.science/pith/YJCECHJQXIBJKHVRJXTEUVOCOP/action/replication_record"}},"created_at":"2026-05-25T02:01:00.114036+00:00","updated_at":"2026-05-25T02:01:00.114036+00:00"}