{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZOUA5Q5VQ3EB3REK6G6S5HMKG7","short_pith_number":"pith:ZOUA5Q5V","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"},"canonical_sha256":"cba80ec3b586c81dc48af1bd2e9d8a37f673864db82387b9cebe8a802ecb842b","source":{"kind":"arxiv","id":"1301.5139","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5139","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5139v2","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5139","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZOUA5Q5VQ3EB","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZOUA5Q5VQ3EB3REK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZOUA5Q5V","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZOUA5Q5VQ3EB3REK6G6S5HMKG7","target":"record","payload":{"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"},"canonical_sha256":"cba80ec3b586c81dc48af1bd2e9d8a37f673864db82387b9cebe8a802ecb842b","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"},"source_kind":"arxiv","source_id":"1301.5139","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-18T03:29:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2pBNKdqEcft815rXSiB5eVVf2G8FeqvruGLw+YKOLaOfirNVF2X+Ge9ObUhslo3f508Lj/Ey5eM4s4GmrKpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:02:29.374862Z"},"content_sha256":"54fb236d9f3d8a3ce4fc8650db1629e219293934ab8c662167b21f2ed98d6f35","schema_version":"1.0","event_id":"sha256:54fb236d9f3d8a3ce4fc8650db1629e219293934ab8c662167b21f2ed98d6f35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZOUA5Q5VQ3EB3REK6G6S5HMKG7","target":"graph","payload":{"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"},"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-18T03:29:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hP4vUw06CG2vzxPWi4yil2CgLQtZ6MrZ2lzJKLqTe0ipcc8mDCsq0BeTIbqEtbrKhC/wRdsASDduRtHqfwsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:02:29.375207Z"},"content_sha256":"5ab031f827e8f4ea7ed1b1cf733c20bff4e3fc1effd78f268c2a91af1f9efb15","schema_version":"1.0","event_id":"sha256:5ab031f827e8f4ea7ed1b1cf733c20bff4e3fc1effd78f268c2a91af1f9efb15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/bundle.json","state_url":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/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-06-01T14:02:29Z","links":{"resolver":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7","bundle":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/bundle.json","state":"https://pith.science/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOUA5Q5VQ3EB3REK6G6S5HMKG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZOUA5Q5VQ3EB3REK6G6S5HMKG7","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":"defd550d0de101a9652f21d3cefde46bf36b5fe10002fdc41b85e9f5d36758d0","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-22T11:05:35Z","title_canon_sha256":"57886846dabcc50c5aafb74e66b452d68192b50a11e752551c913891a3c053d7"},"schema_version":"1.0","source":{"id":"1301.5139","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5139","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5139v2","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5139","created_at":"2026-05-18T03:29:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZOUA5Q5VQ3EB","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZOUA5Q5VQ3EB3REK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZOUA5Q5V","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:5ab031f827e8f4ea7ed1b1cf733c20bff4e3fc1effd78f268c2a91af1f9efb15","target":"graph","created_at":"2026-05-18T03:29:26Z","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":"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","authors_text":"Adam Rogalewicz, Jiri Simacek, Radu Iosif","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-22T11:05:35Z","title":"The Tree Width of Separation Logic with Recursive Definitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5139","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:54fb236d9f3d8a3ce4fc8650db1629e219293934ab8c662167b21f2ed98d6f35","target":"record","created_at":"2026-05-18T03:29:26Z","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":"defd550d0de101a9652f21d3cefde46bf36b5fe10002fdc41b85e9f5d36758d0","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-22T11:05:35Z","title_canon_sha256":"57886846dabcc50c5aafb74e66b452d68192b50a11e752551c913891a3c053d7"},"schema_version":"1.0","source":{"id":"1301.5139","kind":"arxiv","version":2}},"canonical_sha256":"cba80ec3b586c81dc48af1bd2e9d8a37f673864db82387b9cebe8a802ecb842b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cba80ec3b586c81dc48af1bd2e9d8a37f673864db82387b9cebe8a802ecb842b","first_computed_at":"2026-05-18T03:29:26.745194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:26.745194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z5frJ8dKX+fBFR1kpmLVyj01K9ZPeIvgvLQaTg9bvaM1Al4hnlyCTpEPO3CrR4FqRO/j0hdhjHoazRLTy33MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:26.745919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5139","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54fb236d9f3d8a3ce4fc8650db1629e219293934ab8c662167b21f2ed98d6f35","sha256:5ab031f827e8f4ea7ed1b1cf733c20bff4e3fc1effd78f268c2a91af1f9efb15"],"state_sha256":"ba95bd0f62be2eb1444585a544994006b69163b6b22555b79023dba4b84587fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xB8J8M42Th+zEgnXfsbJ8Bj4tWWGX2D4fMEds2LGnuFWGNRa/IeqfL3S72PJ5HibsBrBihgC/q2pKm4abg6lCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:02:29.377671Z","bundle_sha256":"bc39a689fe14de2d5954d626c85cb36c4cb5d55162ec1eac2289e431d036c241"}}