{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PTIB5F4IAESGR3SX5MBILFYALI","short_pith_number":"pith:PTIB5F4I","canonical_record":{"source":{"id":"1402.2127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T12:31:58Z","cross_cats_sorted":[],"title_canon_sha256":"4e7cfebc61102d4cc6696bb0b2a3d2edfd90c91059be440485bbf71aa95e62b1","abstract_canon_sha256":"1b4053fe04d9374f80b073207e7359f1cc21fbd8c3a457c3246bacf1ec24f4a0"},"schema_version":"1.0"},"canonical_sha256":"7cd01e9788012468ee57eb028597005a037c908e2509acf604720723e2181173","source":{"kind":"arxiv","id":"1402.2127","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2127","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2127v2","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2127","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"pith_short_12","alias_value":"PTIB5F4IAESG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PTIB5F4IAESGR3SX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PTIB5F4I","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PTIB5F4IAESGR3SX5MBILFYALI","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T12:31:58Z","cross_cats_sorted":[],"title_canon_sha256":"4e7cfebc61102d4cc6696bb0b2a3d2edfd90c91059be440485bbf71aa95e62b1","abstract_canon_sha256":"1b4053fe04d9374f80b073207e7359f1cc21fbd8c3a457c3246bacf1ec24f4a0"},"schema_version":"1.0"},"canonical_sha256":"7cd01e9788012468ee57eb028597005a037c908e2509acf604720723e2181173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:20.102962Z","signature_b64":"jpd7uxw5t3NBE3AJmKY1QWYzvNpjdYqMFZ1g1GYsMkZyuc1OJk9UJkh2V6DTU2Aq6qgtJFurrTM5lDePivKeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cd01e9788012468ee57eb028597005a037c908e2509acf604720723e2181173","last_reissued_at":"2026-05-18T02:59:20.102181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:20.102181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2127","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-18T02:59:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vt6su+lUSQUELohff/q5ToAaJbGV3Yej/HCzN86FcbnqFgm6GdV74NohG7IAcc+nuQ+2wwgJmxmtb2KzIu5gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:25:55.927142Z"},"content_sha256":"b6c7f697507fe6e088401c54aae1b8be3be97ba6196a413a5a3f7cffb4504992","schema_version":"1.0","event_id":"sha256:b6c7f697507fe6e088401c54aae1b8be3be97ba6196a413a5a3f7cffb4504992"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PTIB5F4IAESGR3SX5MBILFYALI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deciding Entailments in Inductive Separation Logic with Tree Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Adam Rogalewicz, Radu Iosif, Tomas Vojnar","submitted_at":"2014-02-10T12:31:58Z","abstract_excerpt":"Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2127","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-18T02:59:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GbPEJ3dkZro83GTXVQ5OkeNizoWvj5wDh6/KQUdau8BO+biToMzI3f481eAgxqZyhmJGxv8IiZGPUYOTR7vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:25:55.927503Z"},"content_sha256":"151425bb3db605a0d3887eeee8a1cccc477f057464fa9a18d86fea87aed41411","schema_version":"1.0","event_id":"sha256:151425bb3db605a0d3887eeee8a1cccc477f057464fa9a18d86fea87aed41411"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTIB5F4IAESGR3SX5MBILFYALI/bundle.json","state_url":"https://pith.science/pith/PTIB5F4IAESGR3SX5MBILFYALI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTIB5F4IAESGR3SX5MBILFYALI/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-30T06:25:55Z","links":{"resolver":"https://pith.science/pith/PTIB5F4IAESGR3SX5MBILFYALI","bundle":"https://pith.science/pith/PTIB5F4IAESGR3SX5MBILFYALI/bundle.json","state":"https://pith.science/pith/PTIB5F4IAESGR3SX5MBILFYALI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTIB5F4IAESGR3SX5MBILFYALI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PTIB5F4IAESGR3SX5MBILFYALI","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":"1b4053fe04d9374f80b073207e7359f1cc21fbd8c3a457c3246bacf1ec24f4a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T12:31:58Z","title_canon_sha256":"4e7cfebc61102d4cc6696bb0b2a3d2edfd90c91059be440485bbf71aa95e62b1"},"schema_version":"1.0","source":{"id":"1402.2127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2127","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2127v2","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2127","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"pith_short_12","alias_value":"PTIB5F4IAESG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PTIB5F4IAESGR3SX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PTIB5F4I","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:151425bb3db605a0d3887eeee8a1cccc477f057464fa9a18d86fea87aed41411","target":"graph","created_at":"2026-05-18T02:59:20Z","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 (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. ","authors_text":"Adam Rogalewicz, Radu Iosif, Tomas Vojnar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T12:31:58Z","title":"Deciding Entailments in Inductive Separation Logic with Tree Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2127","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:b6c7f697507fe6e088401c54aae1b8be3be97ba6196a413a5a3f7cffb4504992","target":"record","created_at":"2026-05-18T02:59:20Z","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":"1b4053fe04d9374f80b073207e7359f1cc21fbd8c3a457c3246bacf1ec24f4a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T12:31:58Z","title_canon_sha256":"4e7cfebc61102d4cc6696bb0b2a3d2edfd90c91059be440485bbf71aa95e62b1"},"schema_version":"1.0","source":{"id":"1402.2127","kind":"arxiv","version":2}},"canonical_sha256":"7cd01e9788012468ee57eb028597005a037c908e2509acf604720723e2181173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cd01e9788012468ee57eb028597005a037c908e2509acf604720723e2181173","first_computed_at":"2026-05-18T02:59:20.102181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:20.102181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jpd7uxw5t3NBE3AJmKY1QWYzvNpjdYqMFZ1g1GYsMkZyuc1OJk9UJkh2V6DTU2Aq6qgtJFurrTM5lDePivKeCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:20.102962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6c7f697507fe6e088401c54aae1b8be3be97ba6196a413a5a3f7cffb4504992","sha256:151425bb3db605a0d3887eeee8a1cccc477f057464fa9a18d86fea87aed41411"],"state_sha256":"aa93404d4982440225a4c5b6475d6f30b701b00b9dfb0d53e93ccc0a1a87554a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWIX8N/p74HFrPN9Lm8i647kErVvzKKC/5tcdoPtXgnm0piz0cf9VII5FBCM9XEbfdIInpAeNXEErTMq2tnzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:25:55.931764Z","bundle_sha256":"3b4a769ab920b9c25f0cd8f1f8456d0a28e154228684550ed530992e4c7d7998"}}