{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VYIUT7DJU5XTGIQ6RLKPNJIDV4","short_pith_number":"pith:VYIUT7DJ","canonical_record":{"source":{"id":"1507.05581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-20T18:29:39Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"1943248fab8cff607229ff9ade3976adcd5c6f6c2d12dde11863dc8b50afd687","abstract_canon_sha256":"e665c6cf284c0255b28112a9f6d5f58fd4cf516a21a966e1068c0097d0f88b62"},"schema_version":"1.0"},"canonical_sha256":"ae1149fc69a76f33221e8ad4f6a503af11dfa821365c4b675d881a6274e3d32f","source":{"kind":"arxiv","id":"1507.05581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05581","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05581v1","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05581","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"VYIUT7DJU5XT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VYIUT7DJU5XTGIQ6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VYIUT7DJ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VYIUT7DJU5XTGIQ6RLKPNJIDV4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-20T18:29:39Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"1943248fab8cff607229ff9ade3976adcd5c6f6c2d12dde11863dc8b50afd687","abstract_canon_sha256":"e665c6cf284c0255b28112a9f6d5f58fd4cf516a21a966e1068c0097d0f88b62"},"schema_version":"1.0"},"canonical_sha256":"ae1149fc69a76f33221e8ad4f6a503af11dfa821365c4b675d881a6274e3d32f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:36.460600Z","signature_b64":"Pv44wsNrMfEPWylftOKJ7RPYbo/qIwnUQRCTC/BGVGbQn8NzW4ld96C3A0WDRjq876avxd27UtzbhwV1fgyqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae1149fc69a76f33221e8ad4f6a503af11dfa821365c4b675d881a6274e3d32f","last_reissued_at":"2026-05-18T01:36:36.460115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:36.460115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05581","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-05-18T01:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sORYVJQnt/PkKUQJjlJXyfx4AwwtIg1SymozikV2nxmQ48XUaNK4+yI+1W+QbP8kxq6+M3D6wPMzCaqznJq9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:27:33.946081Z"},"content_sha256":"4ee1d14b2bbfbfcd131afab6802890fe5420baa80a7a6d2345f33d1afa09cc24","schema_version":"1.0","event_id":"sha256:4ee1d14b2bbfbfcd131afab6802890fe5420baa80a7a6d2345f33d1afa09cc24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VYIUT7DJU5XTGIQ6RLKPNJIDV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Automated Lemma Generation for Separation Logic with Inductive Definitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Constantin Enea (LIAFA), Mihaela Sighireanu (LIAFA), Zhilin Wu","submitted_at":"2015-07-20T18:29:39Z","abstract_excerpt":"Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the inductive definitions. We propose a novel approach for generating these lemmas automatically which is based on simple syntactic criteria and deterministic strategies for applying them. Our approach focuses on iterative programs, although it can be applied to recursive programs as well, and specifications that describe not only the shape of the da"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05581","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":""},"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-18T01:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqO6MR8rJw338VztHvd+SvGOFzg6wOxEeb2KrF3P+GNCiMOnKH34H59JjTs/ObBbCSpYgZJVeSMRmSrYWk4xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:27:33.946844Z"},"content_sha256":"ace402d56d0fe78b06ce664ac1882130937c693d2283ce6cd11741b3c7e4f8ce","schema_version":"1.0","event_id":"sha256:ace402d56d0fe78b06ce664ac1882130937c693d2283ce6cd11741b3c7e4f8ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYIUT7DJU5XTGIQ6RLKPNJIDV4/bundle.json","state_url":"https://pith.science/pith/VYIUT7DJU5XTGIQ6RLKPNJIDV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYIUT7DJU5XTGIQ6RLKPNJIDV4/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-25T15:27:33Z","links":{"resolver":"https://pith.science/pith/VYIUT7DJU5XTGIQ6RLKPNJIDV4","bundle":"https://pith.science/pith/VYIUT7DJU5XTGIQ6RLKPNJIDV4/bundle.json","state":"https://pith.science/pith/VYIUT7DJU5XTGIQ6RLKPNJIDV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYIUT7DJU5XTGIQ6RLKPNJIDV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VYIUT7DJU5XTGIQ6RLKPNJIDV4","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":"e665c6cf284c0255b28112a9f6d5f58fd4cf516a21a966e1068c0097d0f88b62","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-20T18:29:39Z","title_canon_sha256":"1943248fab8cff607229ff9ade3976adcd5c6f6c2d12dde11863dc8b50afd687"},"schema_version":"1.0","source":{"id":"1507.05581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05581","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05581v1","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05581","created_at":"2026-05-18T01:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"VYIUT7DJU5XT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VYIUT7DJU5XTGIQ6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VYIUT7DJ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:ace402d56d0fe78b06ce664ac1882130937c693d2283ce6cd11741b3c7e4f8ce","target":"graph","created_at":"2026-05-18T01:36:36Z","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 with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the inductive definitions. We propose a novel approach for generating these lemmas automatically which is based on simple syntactic criteria and deterministic strategies for applying them. Our approach focuses on iterative programs, although it can be applied to recursive programs as well, and specifications that describe not only the shape of the da","authors_text":"Constantin Enea (LIAFA), Mihaela Sighireanu (LIAFA), Zhilin Wu","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-20T18:29:39Z","title":"On Automated Lemma Generation for Separation Logic with Inductive Definitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05581","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:4ee1d14b2bbfbfcd131afab6802890fe5420baa80a7a6d2345f33d1afa09cc24","target":"record","created_at":"2026-05-18T01:36:36Z","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":"e665c6cf284c0255b28112a9f6d5f58fd4cf516a21a966e1068c0097d0f88b62","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-20T18:29:39Z","title_canon_sha256":"1943248fab8cff607229ff9ade3976adcd5c6f6c2d12dde11863dc8b50afd687"},"schema_version":"1.0","source":{"id":"1507.05581","kind":"arxiv","version":1}},"canonical_sha256":"ae1149fc69a76f33221e8ad4f6a503af11dfa821365c4b675d881a6274e3d32f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae1149fc69a76f33221e8ad4f6a503af11dfa821365c4b675d881a6274e3d32f","first_computed_at":"2026-05-18T01:36:36.460115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:36.460115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pv44wsNrMfEPWylftOKJ7RPYbo/qIwnUQRCTC/BGVGbQn8NzW4ld96C3A0WDRjq876avxd27UtzbhwV1fgyqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:36.460600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ee1d14b2bbfbfcd131afab6802890fe5420baa80a7a6d2345f33d1afa09cc24","sha256:ace402d56d0fe78b06ce664ac1882130937c693d2283ce6cd11741b3c7e4f8ce"],"state_sha256":"e6370dc15f6cbd5f7dc9e7e5007f5d4aeac8b6a08352360c103b62ce7df54dda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9AMjKPL8MUYh00Qtjoctx1ZNOvEc1NFkBhFXZAuGKMkAVQDlyXWmzLqLewdK7E+Jyw1j36qcEd7nqMkIOSDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:27:33.951278Z","bundle_sha256":"c5f5688c094916bf60b5db01beb76ad75fae46a2ca1f3bf8e85bb60433edd116"}}