{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4F327DAR54LRH3IAPU47THTYHO","short_pith_number":"pith:4F327DAR","canonical_record":{"source":{"id":"1906.11319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-06-26T19:55:30Z","cross_cats_sorted":[],"title_canon_sha256":"1dd78d85e086668d5607ada1ebea869c7ccbbc20e7fa0c4332faf35bf25ce181","abstract_canon_sha256":"c79250ea645131d1c0497a226d29c1097e2ff849bf52ecd212ba742af2b02b3c"},"schema_version":"1.0"},"canonical_sha256":"e177af8c11ef1713ed007d39f99e783ba5a05ab5d8d75c5c47140035a2912a91","source":{"kind":"arxiv","id":"1906.11319","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11319","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11319v1","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11319","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"4F327DAR54LR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4F327DAR54LRH3IA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4F327DAR","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4F327DAR54LRH3IAPU47THTYHO","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-06-26T19:55:30Z","cross_cats_sorted":[],"title_canon_sha256":"1dd78d85e086668d5607ada1ebea869c7ccbbc20e7fa0c4332faf35bf25ce181","abstract_canon_sha256":"c79250ea645131d1c0497a226d29c1097e2ff849bf52ecd212ba742af2b02b3c"},"schema_version":"1.0"},"canonical_sha256":"e177af8c11ef1713ed007d39f99e783ba5a05ab5d8d75c5c47140035a2912a91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:07.540703Z","signature_b64":"CiS4DUa9dO2TfqSSNG1/pvO+eSVipQqO0b8CC7PZEFbP1ZjTdm4G5xKpw1XZCxWazrzT1vCzdSlsIFux+066DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e177af8c11ef1713ed007d39f99e783ba5a05ab5d8d75c5c47140035a2912a91","last_reissued_at":"2026-05-17T23:42:07.540196Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:07.540196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11319","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:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogNxPjbrpWA+LEyuc/44RZ088rnKFP3ySBYvQEc0oNXpllHJdtlDZfNeeWdFE4pJr/gbncjpOYMyHxJ/8IQpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:28:58.443055Z"},"content_sha256":"6d2df9177f124bebfe272ec5637f59c07abb58d25e6075ff52cb8d9f7f4dfb5a","schema_version":"1.0","event_id":"sha256:6d2df9177f124bebfe272ec5637f59c07abb58d25e6075ff52cb8d9f7f4dfb5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4F327DAR54LRH3IAPU47THTYHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stricter Heap Separating Points-To Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Kirill Krinkin, Ren\\'e Haberland","submitted_at":"2019-06-26T19:55:30Z","abstract_excerpt":"Dynamic memory issues are hard to locate and may cost much of a development project's efforts and was repeatedly reported similarly afterwards independently by different persons. Verification as one formal method may proof a given program's heap matches a specified dynamic behaviour. Dynamic (or heap) memory, is the region within main memory that is manipulated by program statements like alloc, free and pointer manipulation during program execution. Usually, heap memory is allocated for problems where the amount of used memory is unknown prior to execution. Regions within the heap may be relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11319","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:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUahwF4DD72OM747sy3NCrX9vzb0/hncYj9DavnmS1TS82mjXpAMmBH52rLZcOe5Ei0CnE53q5NrUK792f97Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:28:58.443784Z"},"content_sha256":"c35786c0ddaff4db6e2a5a1078292cec014a0b73cada00aed948e456ef759a87","schema_version":"1.0","event_id":"sha256:c35786c0ddaff4db6e2a5a1078292cec014a0b73cada00aed948e456ef759a87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4F327DAR54LRH3IAPU47THTYHO/bundle.json","state_url":"https://pith.science/pith/4F327DAR54LRH3IAPU47THTYHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4F327DAR54LRH3IAPU47THTYHO/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-27T17:28:58Z","links":{"resolver":"https://pith.science/pith/4F327DAR54LRH3IAPU47THTYHO","bundle":"https://pith.science/pith/4F327DAR54LRH3IAPU47THTYHO/bundle.json","state":"https://pith.science/pith/4F327DAR54LRH3IAPU47THTYHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4F327DAR54LRH3IAPU47THTYHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4F327DAR54LRH3IAPU47THTYHO","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":"c79250ea645131d1c0497a226d29c1097e2ff849bf52ecd212ba742af2b02b3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-06-26T19:55:30Z","title_canon_sha256":"1dd78d85e086668d5607ada1ebea869c7ccbbc20e7fa0c4332faf35bf25ce181"},"schema_version":"1.0","source":{"id":"1906.11319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11319","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11319v1","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11319","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"4F327DAR54LR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4F327DAR54LRH3IA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4F327DAR","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c35786c0ddaff4db6e2a5a1078292cec014a0b73cada00aed948e456ef759a87","target":"graph","created_at":"2026-05-17T23:42:07Z","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":"Dynamic memory issues are hard to locate and may cost much of a development project's efforts and was repeatedly reported similarly afterwards independently by different persons. Verification as one formal method may proof a given program's heap matches a specified dynamic behaviour. Dynamic (or heap) memory, is the region within main memory that is manipulated by program statements like alloc, free and pointer manipulation during program execution. Usually, heap memory is allocated for problems where the amount of used memory is unknown prior to execution. Regions within the heap may be relat","authors_text":"Kirill Krinkin, Ren\\'e Haberland","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-06-26T19:55:30Z","title":"A Stricter Heap Separating Points-To Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11319","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:6d2df9177f124bebfe272ec5637f59c07abb58d25e6075ff52cb8d9f7f4dfb5a","target":"record","created_at":"2026-05-17T23:42:07Z","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":"c79250ea645131d1c0497a226d29c1097e2ff849bf52ecd212ba742af2b02b3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-06-26T19:55:30Z","title_canon_sha256":"1dd78d85e086668d5607ada1ebea869c7ccbbc20e7fa0c4332faf35bf25ce181"},"schema_version":"1.0","source":{"id":"1906.11319","kind":"arxiv","version":1}},"canonical_sha256":"e177af8c11ef1713ed007d39f99e783ba5a05ab5d8d75c5c47140035a2912a91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e177af8c11ef1713ed007d39f99e783ba5a05ab5d8d75c5c47140035a2912a91","first_computed_at":"2026-05-17T23:42:07.540196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:07.540196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CiS4DUa9dO2TfqSSNG1/pvO+eSVipQqO0b8CC7PZEFbP1ZjTdm4G5xKpw1XZCxWazrzT1vCzdSlsIFux+066DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:07.540703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d2df9177f124bebfe272ec5637f59c07abb58d25e6075ff52cb8d9f7f4dfb5a","sha256:c35786c0ddaff4db6e2a5a1078292cec014a0b73cada00aed948e456ef759a87"],"state_sha256":"ab2401f6984d4e319feabc7f390d9568b1ce7a6dcc1c9fec92ed69e679fec22d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pUPj7pW8ZK5wBNmoq/3zcIxxnvbj1CMPfZMH6AWEVbgK12nepASzOUAYo8waTQZF3kpjBrCxj14d4HQRzyWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:28:58.447580Z","bundle_sha256":"95981bef2135cd1eb0e8c6c51a873bc3832def00f793dcac7619fd6d05f6a966"}}