{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YXRZHVDG7YUAFPIUTLNFOOZYGO","short_pith_number":"pith:YXRZHVDG","canonical_record":{"source":{"id":"2210.00616","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-10-02T20:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"041bf6264cb2ed4cac2ec704bec2b1257c0a1429fb4ce204e32ad9331958258e","abstract_canon_sha256":"2531d2a023496a2e35f737c14d5cbfa850b11c1d6655d190444c8c9c1bd42543"},"schema_version":"1.0"},"canonical_sha256":"c5e393d466fe2802bd149ada573b38339f94c6ab0a2515f7627846f9e1533370","source":{"kind":"arxiv","id":"2210.00616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00616","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00616v1","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00616","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"YXRZHVDG7YUA","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"pith_short_16","alias_value":"YXRZHVDG7YUAFPIU","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"pith_short_8","alias_value":"YXRZHVDG","created_at":"2026-07-05T05:02:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YXRZHVDG7YUAFPIUTLNFOOZYGO","target":"record","payload":{"canonical_record":{"source":{"id":"2210.00616","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-10-02T20:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"041bf6264cb2ed4cac2ec704bec2b1257c0a1429fb4ce204e32ad9331958258e","abstract_canon_sha256":"2531d2a023496a2e35f737c14d5cbfa850b11c1d6655d190444c8c9c1bd42543"},"schema_version":"1.0"},"canonical_sha256":"c5e393d466fe2802bd149ada573b38339f94c6ab0a2515f7627846f9e1533370","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:46.034188Z","signature_b64":"2Iu1TmGIm7JYDW4QzLnx2+QQRdYDScGlRUoFeEHVnf+UXx6Z0tG7cQ9D7GRuu7JuFo4KfGj/1hxwgv3YCbP8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5e393d466fe2802bd149ada573b38339f94c6ab0a2515f7627846f9e1533370","last_reissued_at":"2026-07-05T05:02:46.033722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:46.033722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.00616","source_version":1,"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-07-05T05:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7lYV/rohCDev+ybte5cIR6wE4Q2Iy+l7WHByC5xFzsVyERY4HS9iK/yWjjqhjJ0xBk+5NMkd+q6pQwE02PGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:29:12.216182Z"},"content_sha256":"3c6c67469f896200a94cf32f448e0d93bb7942ff3ec58105fface23bb067b71b","schema_version":"1.0","event_id":"sha256:3c6c67469f896200a94cf32f448e0d93bb7942ff3ec58105fface23bb067b71b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YXRZHVDG7YUAFPIUTLNFOOZYGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Quang Loc Le, Xuan-Bach D. Le","submitted_at":"2022-10-02T20:36:43Z","abstract_excerpt":"An efficient entailment proof system is essential to compositional verification using separation logic. Unfortunately, existing decision procedures are either inexpressive or inefficient. For example, Smallfoot is an efficient procedure but only works with hardwired lists and trees. Other procedures that can support general inductive predicates run exponentially in time as their proof search requires back-tracking to deal with a disjunction in the consequent.\n  This paper presents a decision procedure to derive cyclic entailment proofs for general inductive predicates in polynomial time. Our p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00616","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.00616/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4JHkagiA4Jk+PSdkupanIUxaghve4TtMRmy4mEQhcw7dxGAAz1lgqfJFJKaAvE7QKAoUZ9JuCCe473QdETpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:29:12.216626Z"},"content_sha256":"8d48b618b4beff7ddfa057021e92f4cf42f4ad646db813ef63618fe424ae5af2","schema_version":"1.0","event_id":"sha256:8d48b618b4beff7ddfa057021e92f4cf42f4ad646db813ef63618fe424ae5af2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXRZHVDG7YUAFPIUTLNFOOZYGO/bundle.json","state_url":"https://pith.science/pith/YXRZHVDG7YUAFPIUTLNFOOZYGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXRZHVDG7YUAFPIUTLNFOOZYGO/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-07-31T16:29:12Z","links":{"resolver":"https://pith.science/pith/YXRZHVDG7YUAFPIUTLNFOOZYGO","bundle":"https://pith.science/pith/YXRZHVDG7YUAFPIUTLNFOOZYGO/bundle.json","state":"https://pith.science/pith/YXRZHVDG7YUAFPIUTLNFOOZYGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXRZHVDG7YUAFPIUTLNFOOZYGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YXRZHVDG7YUAFPIUTLNFOOZYGO","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":"2531d2a023496a2e35f737c14d5cbfa850b11c1d6655d190444c8c9c1bd42543","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-10-02T20:36:43Z","title_canon_sha256":"041bf6264cb2ed4cac2ec704bec2b1257c0a1429fb4ce204e32ad9331958258e"},"schema_version":"1.0","source":{"id":"2210.00616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00616","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00616v1","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00616","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"YXRZHVDG7YUA","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"pith_short_16","alias_value":"YXRZHVDG7YUAFPIU","created_at":"2026-07-05T05:02:46Z"},{"alias_kind":"pith_short_8","alias_value":"YXRZHVDG","created_at":"2026-07-05T05:02:46Z"}],"graph_snapshots":[{"event_id":"sha256:8d48b618b4beff7ddfa057021e92f4cf42f4ad646db813ef63618fe424ae5af2","target":"graph","created_at":"2026-07-05T05:02:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.00616/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An efficient entailment proof system is essential to compositional verification using separation logic. Unfortunately, existing decision procedures are either inexpressive or inefficient. For example, Smallfoot is an efficient procedure but only works with hardwired lists and trees. Other procedures that can support general inductive predicates run exponentially in time as their proof search requires back-tracking to deal with a disjunction in the consequent.\n  This paper presents a decision procedure to derive cyclic entailment proofs for general inductive predicates in polynomial time. Our p","authors_text":"Quang Loc Le, Xuan-Bach D. Le","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-10-02T20:36:43Z","title":"An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00616","kind":"arxiv","version":1},"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:3c6c67469f896200a94cf32f448e0d93bb7942ff3ec58105fface23bb067b71b","target":"record","created_at":"2026-07-05T05:02:46Z","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":"2531d2a023496a2e35f737c14d5cbfa850b11c1d6655d190444c8c9c1bd42543","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-10-02T20:36:43Z","title_canon_sha256":"041bf6264cb2ed4cac2ec704bec2b1257c0a1429fb4ce204e32ad9331958258e"},"schema_version":"1.0","source":{"id":"2210.00616","kind":"arxiv","version":1}},"canonical_sha256":"c5e393d466fe2802bd149ada573b38339f94c6ab0a2515f7627846f9e1533370","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5e393d466fe2802bd149ada573b38339f94c6ab0a2515f7627846f9e1533370","first_computed_at":"2026-07-05T05:02:46.033722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:02:46.033722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Iu1TmGIm7JYDW4QzLnx2+QQRdYDScGlRUoFeEHVnf+UXx6Z0tG7cQ9D7GRuu7JuFo4KfGj/1hxwgv3YCbP8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:02:46.034188Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.00616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c6c67469f896200a94cf32f448e0d93bb7942ff3ec58105fface23bb067b71b","sha256:8d48b618b4beff7ddfa057021e92f4cf42f4ad646db813ef63618fe424ae5af2"],"state_sha256":"d2c91e17f365811dc2b5cb9bf918449b1d71a84877bcebc08c6d882ca594a75b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLk+bD/bFOeG0uxi/VnT/ktIBIvzjgZg/SiuSRQwKcXkAIbesXfgibzMOV+j/ecCLIj07NQ7uL05LlevLzJeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T16:29:12.221090Z","bundle_sha256":"3bf652f6a2e22a1aa196b0daaae764d66ee731aa7d38fcaf9356f251d5363735"}}