{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NQWW6OS3YM4E6AOPL3CJMPKN5O","short_pith_number":"pith:NQWW6OS3","canonical_record":{"source":{"id":"1511.07267","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-23T15:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"9903e8f9cb1c8681bc1fa03a07accbcd504d5fdf2e865623de19a3670bd6ca6f","abstract_canon_sha256":"7e6de21924d38be0f2cab878f21981e0341bd72ef3c42e39fe2d05c84ca8728d"},"schema_version":"1.0"},"canonical_sha256":"6c2d6f3a5bc3384f01cf5ec4963d4deb800328adcdebd2143e7d82dcae235308","source":{"kind":"arxiv","id":"1511.07267","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07267","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07267v3","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07267","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"NQWW6OS3YM4E","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQWW6OS3YM4E6AOP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQWW6OS3","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NQWW6OS3YM4E6AOPL3CJMPKN5O","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07267","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-23T15:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"9903e8f9cb1c8681bc1fa03a07accbcd504d5fdf2e865623de19a3670bd6ca6f","abstract_canon_sha256":"7e6de21924d38be0f2cab878f21981e0341bd72ef3c42e39fe2d05c84ca8728d"},"schema_version":"1.0"},"canonical_sha256":"6c2d6f3a5bc3384f01cf5ec4963d4deb800328adcdebd2143e7d82dcae235308","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:33.120150Z","signature_b64":"sRJux6ThJvFvk7S+eJqnBZS0TLLftXtJtLF/Pg4i7DVlQBERYEVJBcEsbEKFy2kUdsE/vy/Jk0bY0P8fq0IFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c2d6f3a5bc3384f01cf5ec4963d4deb800328adcdebd2143e7d82dcae235308","last_reissued_at":"2026-05-18T00:30:33.119543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:33.119543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07267","source_version":3,"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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9D1tvA6cnxB7aBLbcNslYCZrvYwSL7bFd0E5azILJWaGsOxy3Sr1iqM2bHWYfeucA2VIt0+J8BMh9Em79gKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:25:11.496073Z"},"content_sha256":"95362c4dc37701838573d29b84537cf3242b45a9d75a1e3ed820c11ef67613f1","schema_version":"1.0","event_id":"sha256:95362c4dc37701838573d29b84537cf3242b45a9d75a1e3ed820c11ef67613f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NQWW6OS3YM4E6AOPL3CJMPKN5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatic Reasoning on Recursive Data-Structures with Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Duc-Hiep Chu, Joxan Jaffar","submitted_at":"2015-11-23T15:18:19Z","abstract_excerpt":"We consider the problem of automatically verifying programs which manipulate arbitrary data structures. Our specification language is expressive, contains a notion of \\emph{separation}, and thus enables a precise specification of \\emph{frames}. The main contribution then is a program verification method which combines strongest postcondition reasoning in the form symbolic execution, unfolding recursive definitions of the data structure in question, and a new frame rule to achieve \\emph{local reasoning} so that proofs can be compositional. Finally, we present an implementation of our verifier, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07267","kind":"arxiv","version":3},"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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FyjpGQOIIv6vEY4H3JKAIj9dRYLAnsVsAULYIataZAzB4TdJf0jNeNN8m0uEMRz3yc7tw0+ojAVs6YheVNKwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:25:11.496469Z"},"content_sha256":"c2a58151f0445b7944b7b9c059134f792dc75c50491efaa65bdd8a0e69066cf0","schema_version":"1.0","event_id":"sha256:c2a58151f0445b7944b7b9c059134f792dc75c50491efaa65bdd8a0e69066cf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/bundle.json","state_url":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/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-04T06:25:11Z","links":{"resolver":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O","bundle":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/bundle.json","state":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NQWW6OS3YM4E6AOPL3CJMPKN5O","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":"7e6de21924d38be0f2cab878f21981e0341bd72ef3c42e39fe2d05c84ca8728d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-23T15:18:19Z","title_canon_sha256":"9903e8f9cb1c8681bc1fa03a07accbcd504d5fdf2e865623de19a3670bd6ca6f"},"schema_version":"1.0","source":{"id":"1511.07267","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07267","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07267v3","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07267","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"NQWW6OS3YM4E","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQWW6OS3YM4E6AOP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQWW6OS3","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:c2a58151f0445b7944b7b9c059134f792dc75c50491efaa65bdd8a0e69066cf0","target":"graph","created_at":"2026-05-18T00:30:33Z","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":"We consider the problem of automatically verifying programs which manipulate arbitrary data structures. Our specification language is expressive, contains a notion of \\emph{separation}, and thus enables a precise specification of \\emph{frames}. The main contribution then is a program verification method which combines strongest postcondition reasoning in the form symbolic execution, unfolding recursive definitions of the data structure in question, and a new frame rule to achieve \\emph{local reasoning} so that proofs can be compositional. Finally, we present an implementation of our verifier, ","authors_text":"Duc-Hiep Chu, Joxan Jaffar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-23T15:18:19Z","title":"Automatic Reasoning on Recursive Data-Structures with Sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07267","kind":"arxiv","version":3},"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:95362c4dc37701838573d29b84537cf3242b45a9d75a1e3ed820c11ef67613f1","target":"record","created_at":"2026-05-18T00:30:33Z","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":"7e6de21924d38be0f2cab878f21981e0341bd72ef3c42e39fe2d05c84ca8728d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-23T15:18:19Z","title_canon_sha256":"9903e8f9cb1c8681bc1fa03a07accbcd504d5fdf2e865623de19a3670bd6ca6f"},"schema_version":"1.0","source":{"id":"1511.07267","kind":"arxiv","version":3}},"canonical_sha256":"6c2d6f3a5bc3384f01cf5ec4963d4deb800328adcdebd2143e7d82dcae235308","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c2d6f3a5bc3384f01cf5ec4963d4deb800328adcdebd2143e7d82dcae235308","first_computed_at":"2026-05-18T00:30:33.119543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:33.119543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sRJux6ThJvFvk7S+eJqnBZS0TLLftXtJtLF/Pg4i7DVlQBERYEVJBcEsbEKFy2kUdsE/vy/Jk0bY0P8fq0IFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:33.120150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07267","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95362c4dc37701838573d29b84537cf3242b45a9d75a1e3ed820c11ef67613f1","sha256:c2a58151f0445b7944b7b9c059134f792dc75c50491efaa65bdd8a0e69066cf0"],"state_sha256":"9b1459d9ec22eb7e8a23b2c072f980f06ae787e59e5102d6b83007ac01e94072"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITtUYeYrupC3CiyLbCrhfmm+rDg9nJnEN2/gOCIklqQaCWTQI2nHCdjMUYSdBhDocAb2NduKg4B8I0X/slxYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:25:11.498362Z","bundle_sha256":"244a8d5b6abd8a84b012629dba233c45f803a7aa24132f1c16f4683b75580026"}}