{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QZPALHVIDEDACTOGEGMHKLZUXC","short_pith_number":"pith:QZPALHVI","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"},"canonical_sha256":"865e059ea81906014dc62198752f34b8aa892974182619bc857f3543f80ad83a","source":{"kind":"arxiv","id":"1804.03556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03556","created_at":"2026-05-18T00:17:18Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03556v2","created_at":"2026-05-18T00:17:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03556","created_at":"2026-05-18T00:17:18Z"},{"alias_kind":"pith_short_12","alias_value":"QZPALHVIDEDA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QZPALHVIDEDACTOG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QZPALHVI","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QZPALHVIDEDACTOGEGMHKLZUXC","target":"record","payload":{"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"},"canonical_sha256":"865e059ea81906014dc62198752f34b8aa892974182619bc857f3543f80ad83a","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"},"source_kind":"arxiv","source_id":"1804.03556","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfBrxYnfmr8JfkvEdaGcY402G/mRCr3QMaJKoypWEtr7O0DHBfy4qdX9p4/XzwAThFY+mF9HkilUAVDmm0/MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:36:12.365911Z"},"content_sha256":"75ee1f57735561008b29fb4122f3e0496baa74648b0e49d9eadde50cbe30c7d0","schema_version":"1.0","event_id":"sha256:75ee1f57735561008b29fb4122f3e0496baa74648b0e49d9eadde50cbe30c7d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QZPALHVIDEDACTOGEGMHKLZUXC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:17:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gg3E5gcfjldKYPVSR/VjGwEyN/8AldeykIr/J3meHj1ApJZQ2lV9dWNwC7/FUrTUG25i+4ZODLSHNy0M4m0gCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:36:12.366542Z"},"content_sha256":"87869f9bb5b243c50c33e4b3f9f42d6e334a51f436a3e6c590b226264021690f","schema_version":"1.0","event_id":"sha256:87869f9bb5b243c50c33e4b3f9f42d6e334a51f436a3e6c590b226264021690f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/bundle.json","state_url":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZPALHVIDEDACTOGEGMHKLZUXC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T04:36:12Z","links":{"resolver":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC","bundle":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/bundle.json","state":"https://pith.science/pith/QZPALHVIDEDACTOGEGMHKLZUXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZPALHVIDEDACTOGEGMHKLZUXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QZPALHVIDEDACTOGEGMHKLZUXC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5b89df01498b1f0e158ac243726b506fd3cf05248dcbb75fdf6d8c09bdc09ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T14:22:25Z","title_canon_sha256":"c2aeb1349cc2f7af4967df591230e2287744d739fe9270d8551f9dbc8180bbd6"},"schema_version":"1.0","source":{"id":"1804.03556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03556","created_at":"2026-05-18T00:17:18Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03556v2","created_at":"2026-05-18T00:17:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03556","created_at":"2026-05-18T00:17:18Z"},{"alias_kind":"pith_short_12","alias_value":"QZPALHVIDEDA","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QZPALHVIDEDACTOG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QZPALHVI","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:87869f9bb5b243c50c33e4b3f9f42d6e334a51f436a3e6c590b226264021690f","target":"graph","created_at":"2026-05-18T00:17:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Mnacho Echenim, Nicolas Peltier, Radu Iosif","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T14:22:25Z","title":"The Complexity of Prenex Separation Logic with One Selector"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03556","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:75ee1f57735561008b29fb4122f3e0496baa74648b0e49d9eadde50cbe30c7d0","target":"record","created_at":"2026-05-18T00:17:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5b89df01498b1f0e158ac243726b506fd3cf05248dcbb75fdf6d8c09bdc09ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T14:22:25Z","title_canon_sha256":"c2aeb1349cc2f7af4967df591230e2287744d739fe9270d8551f9dbc8180bbd6"},"schema_version":"1.0","source":{"id":"1804.03556","kind":"arxiv","version":2}},"canonical_sha256":"865e059ea81906014dc62198752f34b8aa892974182619bc857f3543f80ad83a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"865e059ea81906014dc62198752f34b8aa892974182619bc857f3543f80ad83a","first_computed_at":"2026-05-18T00:17:18.380670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:18.380670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBjTcSid0gqNWdC/hr4YESE5RWxg2wACJg25PYxVqh140emjRYZWwDGXj1r2w5deE/m2q+bTTo8mbInqS9HyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:18.381114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75ee1f57735561008b29fb4122f3e0496baa74648b0e49d9eadde50cbe30c7d0","sha256:87869f9bb5b243c50c33e4b3f9f42d6e334a51f436a3e6c590b226264021690f"],"state_sha256":"bd2f27c2c2e793d193f7ed1cf2425376d97f4d7307941e1f940820cb2b32381d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NN0szEbQYzMsCYAtkXVOcA70FKsXLgI1VyAQFaVPApjHHZAzTpoteBLuF9AVI7JpjQtzUZ7XGQrtzB0CgbmfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:36:12.369792Z","bundle_sha256":"353bfa5b76a8e45ba193adaf08b3a5beca3a13c4a6eb7a92f53918a177cdba53"}}