{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZOUA5Q5VQ3EB3REK6G6S5HMKG7","short_pith_number":"pith:ZOUA5Q5V","schema_version":"1.0","canonical_sha256":"cba80ec3b586c81dc48af1bd2e9d8a37f673864db82387b9cebe8a802ecb842b","source":{"kind":"arxiv","id":"1301.5139","version":2},"attestation_state":"computed","paper":{"title":"The Tree Width of Separation Logic with Recursive Definitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Adam Rogalewicz, Jiri Simacek, Radu Iosif","submitted_at":"2013-01-22T11:05:35Z","abstract_excerpt":"Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current results report on techniques to decide satisfiability and validity of entailments for Separation Logic(s) over lists (possibly with data). In this paper we establish a more general decidability result. We prove that any Separation Logic formula using rather general recursively defined predicates is decidable for satisfiability, and moreover, entailments betw"},"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":"1301.5139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-22T11:05:35Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"57886846dabcc50c5aafb74e66b452d68192b50a11e752551c913891a3c053d7","abstract_canon_sha256":"defd550d0de101a9652f21d3cefde46bf36b5fe10002fdc41b85e9f5d36758d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:26.745919Z","signature_b64":"Z5frJ8dKX+fBFR1kpmLVyj01K9ZPeIvgvLQaTg9bvaM1Al4hnlyCTpEPO3CrR4FqRO/j0hdhjHoazRLTy33MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cba80ec3b586c81dc48af1bd2e9d8a37f673864db82387b9cebe8a802ecb842b","last_reissued_at":"2026-05-18T03:29:26.745194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:26.745194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Tree Width of Separation Logic with Recursive Definitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Adam Rogalewicz, Jiri Simacek, Radu Iosif","submitted_at":"2013-01-22T11:05:35Z","abstract_excerpt":"Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current results report on techniques to decide satisfiability and validity of entailments for Separation Logic(s) over lists (possibly with data). In this paper we establish a more general decidability result. We prove that any Separation Logic formula using rather general recursively defined predicates is decidable for satisfiability, and moreover, entailments betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5139","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":"1301.5139","created_at":"2026-05-18T03:29:26.745301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5139v2","created_at":"2026-05-18T03:29:26.745301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5139","created_at":"2026-05-18T03:29:26.745301+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOUA5Q5VQ3EB","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOUA5Q5VQ3EB3REK","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOUA5Q5V","created_at":"2026-05-18T12:28:09.283467+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/ZOUA5Q5VQ3EB3REK6G6S5HMKG7","json":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7.json","graph_json":"https://pith.science/api/pith-number/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/graph.json","events_json":"https://pith.science/api/pith-number/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/events.json","paper":"https://pith.science/paper/ZOUA5Q5V"},"agent_actions":{"view_html":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7","download_json":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7.json","view_paper":"https://pith.science/paper/ZOUA5Q5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5139&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/action/storage_attestation","attest_author":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/action/author_attestation","sign_citation":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/action/citation_signature","submit_replication":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/action/replication_record"}},"created_at":"2026-05-18T03:29:26.745301+00:00","updated_at":"2026-05-18T03:29:26.745301+00:00"}