{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WITEMEXI3HVTMZ42RJIGCTHBS3","short_pith_number":"pith:WITEMEXI","schema_version":"1.0","canonical_sha256":"b2264612e8d9eb36679a8a50614ce196ea58b4310c2e19f28016ceaa5575d77a","source":{"kind":"arxiv","id":"1912.02731","version":2},"attestation_state":"computed","paper":{"title":"The Expressiveness of Looping Terms in the Semantic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Denis Ponomaryov, Dmitri Sviridenko, Sergey Goncharov, Sergey Ospichev","submitted_at":"2019-12-05T17:10:30Z","abstract_excerpt":"We consider the language of $\\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\\Delta_0$-formulas with non-standard list terms, which represent bounded list search, bounded iteration, and bounded recursion. We prove a number of results on the complexity of model checking and satisfiability for these formulas. In particular, we show that the set of $\\Delta_0$-formulas with bounded recursive terms true in a given list superstructure $HW(\\mathcal{M})$ is non-elementary (it contains t"},"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":"1912.02731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-12-05T17:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"2a3e9c73b7c8f0a91cd7b92ecbaeccb945bb8bba10ff43dca28134f1d81ee7f2","abstract_canon_sha256":"beb2800349961fc62e4e051a89485382a4dda9a45c0e3df6d946930c20851f77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:34.490573Z","signature_b64":"mE4Cq800qjsnqyv8eWjVDIwz5ZgebpiKS9fYjrxR3yCIdoJtAWpRWQZQBFd08yAz/zUZ8pvWqqbAGL/y8h0PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2264612e8d9eb36679a8a50614ce196ea58b4310c2e19f28016ceaa5575d77a","last_reissued_at":"2026-07-05T00:35:34.490172Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:34.490172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Expressiveness of Looping Terms in the Semantic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Denis Ponomaryov, Dmitri Sviridenko, Sergey Goncharov, Sergey Ospichev","submitted_at":"2019-12-05T17:10:30Z","abstract_excerpt":"We consider the language of $\\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\\Delta_0$-formulas with non-standard list terms, which represent bounded list search, bounded iteration, and bounded recursion. We prove a number of results on the complexity of model checking and satisfiability for these formulas. In particular, we show that the set of $\\Delta_0$-formulas with bounded recursive terms true in a given list superstructure $HW(\\mathcal{M})$ is non-elementary (it contains t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.02731","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/1912.02731/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":"1912.02731","created_at":"2026-07-05T00:35:34.490221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.02731v2","created_at":"2026-07-05T00:35:34.490221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.02731","created_at":"2026-07-05T00:35:34.490221+00:00"},{"alias_kind":"pith_short_12","alias_value":"WITEMEXI3HVT","created_at":"2026-07-05T00:35:34.490221+00:00"},{"alias_kind":"pith_short_16","alias_value":"WITEMEXI3HVTMZ42","created_at":"2026-07-05T00:35:34.490221+00:00"},{"alias_kind":"pith_short_8","alias_value":"WITEMEXI","created_at":"2026-07-05T00:35:34.490221+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/WITEMEXI3HVTMZ42RJIGCTHBS3","json":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3.json","graph_json":"https://pith.science/api/pith-number/WITEMEXI3HVTMZ42RJIGCTHBS3/graph.json","events_json":"https://pith.science/api/pith-number/WITEMEXI3HVTMZ42RJIGCTHBS3/events.json","paper":"https://pith.science/paper/WITEMEXI"},"agent_actions":{"view_html":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3","download_json":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3.json","view_paper":"https://pith.science/paper/WITEMEXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.02731&json=true","fetch_graph":"https://pith.science/api/pith-number/WITEMEXI3HVTMZ42RJIGCTHBS3/graph.json","fetch_events":"https://pith.science/api/pith-number/WITEMEXI3HVTMZ42RJIGCTHBS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3/action/storage_attestation","attest_author":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3/action/author_attestation","sign_citation":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3/action/citation_signature","submit_replication":"https://pith.science/pith/WITEMEXI3HVTMZ42RJIGCTHBS3/action/replication_record"}},"created_at":"2026-07-05T00:35:34.490221+00:00","updated_at":"2026-07-05T00:35:34.490221+00:00"}