{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6FHDY343PVJUQSDLZPHTRR7OB6","short_pith_number":"pith:6FHDY343","canonical_record":{"source":{"id":"1908.05799","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-16T00:18:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3eb5690af5e9234cab361fd36d422f9e985bb42ba794ffcf9bb0244c97d9f7c7","abstract_canon_sha256":"e5a44bcd8bc36855114352daebc7aba0cf143f99d45281c911bca191fa3a0cf6"},"schema_version":"1.0"},"canonical_sha256":"f14e3c6f9b7d5348486bcbcf38c7ee0f8855709fbc2835ddf62f3e424abc4a34","source":{"kind":"arxiv","id":"1908.05799","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05799","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05799v1","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05799","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"pith_short_12","alias_value":"6FHDY343PVJU","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"pith_short_16","alias_value":"6FHDY343PVJUQSDL","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"pith_short_8","alias_value":"6FHDY343","created_at":"2026-07-04T23:57:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6FHDY343PVJUQSDLZPHTRR7OB6","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05799","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-16T00:18:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3eb5690af5e9234cab361fd36d422f9e985bb42ba794ffcf9bb0244c97d9f7c7","abstract_canon_sha256":"e5a44bcd8bc36855114352daebc7aba0cf143f99d45281c911bca191fa3a0cf6"},"schema_version":"1.0"},"canonical_sha256":"f14e3c6f9b7d5348486bcbcf38c7ee0f8855709fbc2835ddf62f3e424abc4a34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:53.299811Z","signature_b64":"1ce7OvLoleE8DWvaPqDLzOlE8VdavlbIULVsHTw2xntImOl/xJRStKTr3v+Oa0TqFSTm2fneXuTTOEIsvzaeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f14e3c6f9b7d5348486bcbcf38c7ee0f8855709fbc2835ddf62f3e424abc4a34","last_reissued_at":"2026-07-04T23:57:53.299383Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:53.299383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05799","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-04T23:57:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67PGipcTssSJW1WFbq+OXhoj4w29ivw5xysocfTdhGvvuofBVkc/fxGkb3O6Tuvbon29a/lirP7NgpKPQmZKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:08:10.811115Z"},"content_sha256":"c2975703a3972297c3c99b52cf8e31b3b4d84b6f2c05258aac9075356c38827a","schema_version":"1.0","event_id":"sha256:c2975703a3972297c3c99b52cf8e31b3b4d84b6f2c05258aac9075356c38827a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6FHDY343PVJUQSDLZPHTRR7OB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modular Verification of Heap Reachability Properties in Separation Logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Arshavir Ter-Gabrielyan, Peter M\\\"uller","submitted_at":"2019-08-16T00:18:43Z","abstract_excerpt":"The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning about reachability is difficult for two main reasons. First, any heap modification may affect an unbounded number of reference chains, which complicates modular verification, in particular, framing. Second, general graph reachability is not supported by SMT solvers, which impedes automatic verification. In this paper, we present a modular specification and verification technique for reachability properties in separat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05799","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/1908.05799/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-04T23:57:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jec6L+qShqeeqajGAmaEirWgllFzh1sjSxJUk1WT76NNMs2L44D6+TtPWEwlWTmFdrrXmhA9nPluQiUHja+ODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:08:10.811674Z"},"content_sha256":"7b2552c11dd4ec2551f7c8ee0e54822e080d141e3c51f6d1e29694d728a42c0d","schema_version":"1.0","event_id":"sha256:7b2552c11dd4ec2551f7c8ee0e54822e080d141e3c51f6d1e29694d728a42c0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/bundle.json","state_url":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FHDY343PVJUQSDLZPHTRR7OB6/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-08-16T07:08:10Z","links":{"resolver":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6","bundle":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/bundle.json","state":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FHDY343PVJUQSDLZPHTRR7OB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6FHDY343PVJUQSDLZPHTRR7OB6","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":"e5a44bcd8bc36855114352daebc7aba0cf143f99d45281c911bca191fa3a0cf6","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-16T00:18:43Z","title_canon_sha256":"3eb5690af5e9234cab361fd36d422f9e985bb42ba794ffcf9bb0244c97d9f7c7"},"schema_version":"1.0","source":{"id":"1908.05799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05799","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05799v1","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05799","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"pith_short_12","alias_value":"6FHDY343PVJU","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"pith_short_16","alias_value":"6FHDY343PVJUQSDL","created_at":"2026-07-04T23:57:53Z"},{"alias_kind":"pith_short_8","alias_value":"6FHDY343","created_at":"2026-07-04T23:57:53Z"}],"graph_snapshots":[{"event_id":"sha256:7b2552c11dd4ec2551f7c8ee0e54822e080d141e3c51f6d1e29694d728a42c0d","target":"graph","created_at":"2026-07-04T23:57:53Z","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/1908.05799/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning about reachability is difficult for two main reasons. First, any heap modification may affect an unbounded number of reference chains, which complicates modular verification, in particular, framing. Second, general graph reachability is not supported by SMT solvers, which impedes automatic verification. In this paper, we present a modular specification and verification technique for reachability properties in separat","authors_text":"Alexander J. Summers, Arshavir Ter-Gabrielyan, Peter M\\\"uller","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-16T00:18:43Z","title":"Modular Verification of Heap Reachability Properties in Separation Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05799","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:c2975703a3972297c3c99b52cf8e31b3b4d84b6f2c05258aac9075356c38827a","target":"record","created_at":"2026-07-04T23:57:53Z","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":"e5a44bcd8bc36855114352daebc7aba0cf143f99d45281c911bca191fa3a0cf6","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-16T00:18:43Z","title_canon_sha256":"3eb5690af5e9234cab361fd36d422f9e985bb42ba794ffcf9bb0244c97d9f7c7"},"schema_version":"1.0","source":{"id":"1908.05799","kind":"arxiv","version":1}},"canonical_sha256":"f14e3c6f9b7d5348486bcbcf38c7ee0f8855709fbc2835ddf62f3e424abc4a34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f14e3c6f9b7d5348486bcbcf38c7ee0f8855709fbc2835ddf62f3e424abc4a34","first_computed_at":"2026-07-04T23:57:53.299383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:57:53.299383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ce7OvLoleE8DWvaPqDLzOlE8VdavlbIULVsHTw2xntImOl/xJRStKTr3v+Oa0TqFSTm2fneXuTTOEIsvzaeBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:57:53.299811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2975703a3972297c3c99b52cf8e31b3b4d84b6f2c05258aac9075356c38827a","sha256:7b2552c11dd4ec2551f7c8ee0e54822e080d141e3c51f6d1e29694d728a42c0d"],"state_sha256":"d8ad0838e4f2b46d2266dc88ff8de7f4cef70e66ce8904264f88a84013ec3391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oc+OnZY2UVx8LPy51Jjis7gnmqLBGoKVONCm+4pbZkrSZeBM4UDzoH7TYQI+WuG/y4qlZhPnjH+moUKSKn9ODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T07:08:10.816214Z","bundle_sha256":"114742f4ab2704688d3d135a2dded99dc8d91b499a686aa86c07ca69b6593c2a"}}