{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3MLBDXFDEVZ2FE3RNAVLQE27A4","short_pith_number":"pith:3MLBDXFD","canonical_record":{"source":{"id":"1905.12944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-30T10:18:58Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"acb20279472c4c00b98784ba2413be05db57a4d6d0dbe31f909ffa3bd9975863","abstract_canon_sha256":"63e5532b58b6a1296d2b96db320047bf06fbeba0b4c1438f7833e70a0c296b58"},"schema_version":"1.0"},"canonical_sha256":"db1611dca32573a29371682ab8135f070f4a931f85669fdbf1ff7ccd840a5946","source":{"kind":"arxiv","id":"1905.12944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12944","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12944v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12944","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"3MLBDXFDEVZ2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3MLBDXFDEVZ2FE3R","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3MLBDXFD","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3MLBDXFDEVZ2FE3RNAVLQE27A4","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-30T10:18:58Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"acb20279472c4c00b98784ba2413be05db57a4d6d0dbe31f909ffa3bd9975863","abstract_canon_sha256":"63e5532b58b6a1296d2b96db320047bf06fbeba0b4c1438f7833e70a0c296b58"},"schema_version":"1.0"},"canonical_sha256":"db1611dca32573a29371682ab8135f070f4a931f85669fdbf1ff7ccd840a5946","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:39.284709Z","signature_b64":"08QNzIqNHEkvgmf75DnJI7k09/2jg0dowB+Y4xBDK2zov8ZDRi/dABz0orI5Z0QnXicLBK2YpP/RYoCLe1P0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db1611dca32573a29371682ab8135f070f4a931f85669fdbf1ff7ccd840a5946","last_reissued_at":"2026-05-17T23:44:39.284040Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:39.284040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12944","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-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioqnxj+qg2/UFmAR2bKdqRxIZuH2MjSkgXMLb54EwPYkilIWX6gYkf+EKw+bb52gMesUOQxR6eDgRWRY53lFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:46:14.060075Z"},"content_sha256":"531e9a73fef9d8e389503617d5d2c948387f3135ef9aaea278e46c2401acb9d0","schema_version":"1.0","event_id":"sha256:531e9a73fef9d8e389503617d5d2c948387f3135ef9aaea278e46c2401acb9d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3MLBDXFDEVZ2FE3RNAVLQE27A4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Non-repetitive Logic for Verification of Dynamic Memory with Explicit Heap Conjunction and Disjunction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Kirill Krinkin, Ren\\'e Haberland","submitted_at":"2019-05-30T10:18:58Z","abstract_excerpt":"In this paper, we review existing points-to Separation Logics for dynamic memory reasoning and we find that different usages of heap separation tend to be an obstacle. Hence, two total and strict spatial heap operations are proposed upon heap graphs, for conjunction and disjunction -- similar to logical conjuncts. Heap conjunction implies that there exists a free heap vertex to connect to or an explicit destination vertex is provided. Essentially, Burstall's properties do not change. By heap we refer to an arbitrary simple directed graph, which is finite and may contain composite vertices repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12944","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-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Du6Pm6Ri5v+a/oAwIfa2LW2Cowvqm2j0IXgol/YCDqfSoKXqAfvEWrRWlEFzFrMZv941WrzeovBbX5lH+a/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:46:14.060450Z"},"content_sha256":"8a8e1393ae2587302534736b21bd8d7a9984abafa66ba828165e0d6596f10b13","schema_version":"1.0","event_id":"sha256:8a8e1393ae2587302534736b21bd8d7a9984abafa66ba828165e0d6596f10b13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4/bundle.json","state_url":"https://pith.science/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4/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-05T07:46:14Z","links":{"resolver":"https://pith.science/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4","bundle":"https://pith.science/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4/bundle.json","state":"https://pith.science/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3MLBDXFDEVZ2FE3RNAVLQE27A4","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":"63e5532b58b6a1296d2b96db320047bf06fbeba0b4c1438f7833e70a0c296b58","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-30T10:18:58Z","title_canon_sha256":"acb20279472c4c00b98784ba2413be05db57a4d6d0dbe31f909ffa3bd9975863"},"schema_version":"1.0","source":{"id":"1905.12944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12944","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12944v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12944","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"3MLBDXFDEVZ2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3MLBDXFDEVZ2FE3R","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3MLBDXFD","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:8a8e1393ae2587302534736b21bd8d7a9984abafa66ba828165e0d6596f10b13","target":"graph","created_at":"2026-05-17T23:44:39Z","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":"In this paper, we review existing points-to Separation Logics for dynamic memory reasoning and we find that different usages of heap separation tend to be an obstacle. Hence, two total and strict spatial heap operations are proposed upon heap graphs, for conjunction and disjunction -- similar to logical conjuncts. Heap conjunction implies that there exists a free heap vertex to connect to or an explicit destination vertex is provided. Essentially, Burstall's properties do not change. By heap we refer to an arbitrary simple directed graph, which is finite and may contain composite vertices repr","authors_text":"Kirill Krinkin, Ren\\'e Haberland","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-30T10:18:58Z","title":"A Non-repetitive Logic for Verification of Dynamic Memory with Explicit Heap Conjunction and Disjunction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12944","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:531e9a73fef9d8e389503617d5d2c948387f3135ef9aaea278e46c2401acb9d0","target":"record","created_at":"2026-05-17T23:44:39Z","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":"63e5532b58b6a1296d2b96db320047bf06fbeba0b4c1438f7833e70a0c296b58","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-30T10:18:58Z","title_canon_sha256":"acb20279472c4c00b98784ba2413be05db57a4d6d0dbe31f909ffa3bd9975863"},"schema_version":"1.0","source":{"id":"1905.12944","kind":"arxiv","version":1}},"canonical_sha256":"db1611dca32573a29371682ab8135f070f4a931f85669fdbf1ff7ccd840a5946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db1611dca32573a29371682ab8135f070f4a931f85669fdbf1ff7ccd840a5946","first_computed_at":"2026-05-17T23:44:39.284040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:39.284040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"08QNzIqNHEkvgmf75DnJI7k09/2jg0dowB+Y4xBDK2zov8ZDRi/dABz0orI5Z0QnXicLBK2YpP/RYoCLe1P0BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:39.284709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:531e9a73fef9d8e389503617d5d2c948387f3135ef9aaea278e46c2401acb9d0","sha256:8a8e1393ae2587302534736b21bd8d7a9984abafa66ba828165e0d6596f10b13"],"state_sha256":"bd17d04305f8aabeee7da5d935a5af8376f7286f70b2655bddc0f826e71d084c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qkyi+jbjmhKf07lqSm78yAyudVcH1LCmfAdJovDd9PlQHFdp7dJMAHLyJYcMvyw1jXmV05stCA/lnT4VBlk1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:46:14.062349Z","bundle_sha256":"4ddef898f975ea1ec72c637cfda54b1685925614321877137e561d1affa56a80"}}