{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QZPALHVIDEDACTOGEGMHKLZUXC","short_pith_number":"pith:QZPALHVI","schema_version":"1.0","canonical_sha256":"865e059ea81906014dc62198752f34b8aa892974182619bc857f3543f80ad83a","source":{"kind":"arxiv","id":"1804.03556","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Prenex Separation Logic with One Selector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mnacho Echenim, Nicolas Peltier, Radu Iosif","submitted_at":"2018-04-10T14:22:25Z","abstract_excerpt":"We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\\geq1$ selector fields ($\\seplogk{k}$). Second, we show that this entails the decidability of the finite and infinite satisfiability problem for the class of prenex formulas of $\\seplogk{1}$, by reduction to the first-order theory of one unary function symbol and unary predicate symbols. We also prove that the complexity is not elementary, by reduction from the first-order theory of one unary function symbol. Finally, we prove that the Bernays-Sch\\\"onfinkel-Rams"},"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":"1804.03556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T14:22:25Z","cross_cats_sorted":[],"title_canon_sha256":"c2aeb1349cc2f7af4967df591230e2287744d739fe9270d8551f9dbc8180bbd6","abstract_canon_sha256":"b5b89df01498b1f0e158ac243726b506fd3cf05248dcbb75fdf6d8c09bdc09ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:18.381114Z","signature_b64":"bBjTcSid0gqNWdC/hr4YESE5RWxg2wACJg25PYxVqh140emjRYZWwDGXj1r2w5deE/m2q+bTTo8mbInqS9HyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865e059ea81906014dc62198752f34b8aa892974182619bc857f3543f80ad83a","last_reissued_at":"2026-05-18T00:17:18.380670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:18.380670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Prenex Separation Logic with One Selector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mnacho Echenim, Nicolas Peltier, Radu Iosif","submitted_at":"2018-04-10T14:22:25Z","abstract_excerpt":"We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\\geq1$ selector fields ($\\seplogk{k}$). Second, we show that this entails the decidability of the finite and infinite satisfiability problem for the class of prenex formulas of $\\seplogk{1}$, by reduction to the first-order theory of one unary function symbol and unary predicate symbols. We also prove that the complexity is not elementary, by reduction from the first-order theory of one unary function symbol. Finally, we prove that the Bernays-Sch\\\"onfinkel-Rams"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03556","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":""},"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":"1804.03556","created_at":"2026-05-18T00:17:18.380727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03556v2","created_at":"2026-05-18T00:17:18.380727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03556","created_at":"2026-05-18T00:17:18.380727+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZPALHVIDEDA","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZPALHVIDEDACTOG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZPALHVI","created_at":"2026-05-18T12:32:50.500415+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/QZPALHVIDEDACTOGEGMHKLZUXC","json":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC.json","graph_json":"https://pith.science/api/pith-number/QZPALHVIDEDACTOGEGMHKLZUXC/graph.json","events_json":"https://pith.science/api/pith-number/QZPALHVIDEDACTOGEGMHKLZUXC/events.json","paper":"https://pith.science/paper/QZPALHVI"},"agent_actions":{"view_html":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC","download_json":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC.json","view_paper":"https://pith.science/paper/QZPALHVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03556&json=true","fetch_graph":"https://pith.science/api/pith-number/QZPALHVIDEDACTOGEGMHKLZUXC/graph.json","fetch_events":"https://pith.science/api/pith-number/QZPALHVIDEDACTOGEGMHKLZUXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/action/storage_attestation","attest_author":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/action/author_attestation","sign_citation":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/action/citation_signature","submit_replication":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/action/replication_record"}},"created_at":"2026-05-18T00:17:18.380727+00:00","updated_at":"2026-05-18T00:17:18.380727+00:00"}