{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ATCGIJZX7D6PGUCULZKWZDACS3","short_pith_number":"pith:ATCGIJZX","canonical_record":{"source":{"id":"1610.07041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-22T12:14:13Z","cross_cats_sorted":[],"title_canon_sha256":"c9d3c5d6f6652ddfa34f4db5093288fa0b264e0c8db4a9686685d877ee700663","abstract_canon_sha256":"217c32ff4b6c1afd69a31eadfc1674cbd7656116d39190a8c9e449074f7c7a1f"},"schema_version":"1.0"},"canonical_sha256":"04c4642737f8fcf350545e556c8c0296f50b6f3ac04a259370749d993704645d","source":{"kind":"arxiv","id":"1610.07041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07041","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07041v1","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07041","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"ATCGIJZX7D6P","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATCGIJZX7D6PGUCU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATCGIJZX","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ATCGIJZX7D6PGUCULZKWZDACS3","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-22T12:14:13Z","cross_cats_sorted":[],"title_canon_sha256":"c9d3c5d6f6652ddfa34f4db5093288fa0b264e0c8db4a9686685d877ee700663","abstract_canon_sha256":"217c32ff4b6c1afd69a31eadfc1674cbd7656116d39190a8c9e449074f7c7a1f"},"schema_version":"1.0"},"canonical_sha256":"04c4642737f8fcf350545e556c8c0296f50b6f3ac04a259370749d993704645d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.356998Z","signature_b64":"yCc0GwQ+Ok9Nx7CA40o1n6kMqrAVprQ5xdrZhPgCLaTnGCHmLiEe4b4VhRTPnB42d8MFHgHMhjONsaB4j3eJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c4642737f8fcf350545e556c8c0296f50b6f3ac04a259370749d993704645d","last_reissued_at":"2026-05-18T01:01:35.356542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.356542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07041","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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlMxSwIRCP7FSmEF9ovwQ5jQ4NepKF/DwSvBpFqNUXHcRkZqaYhiz8D8i2vQFgpbV7+xtCv9jOujyX2ZGQsNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:52:46.023192Z"},"content_sha256":"7d407e4b3794b1b66cb1d3b64669b9dcddbd6fd5f008ebb295c1ae7ddce80a16","schema_version":"1.0","event_id":"sha256:7d407e4b3794b1b66cb1d3b64669b9dcddbd6fd5f008ebb295c1ae7ddce80a16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ATCGIJZX7D6PGUCULZKWZDACS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christina Jansen, Christoph Matheja, Florian Zuleger, Jens Katelaan, Thomas Noll","submitted_at":"2016-10-22T12:14:13Z","abstract_excerpt":"We introduce heap automata, a formalism for automatic reasoning about robustness properties of the symbolic heap fragment of separation logic with user-defined inductive predicates. Robustness properties, such as satisfiability, reachability, and acyclicity, are important for a wide range of reasoning tasks in automated program analysis and verification based on separation logic. Previously, such properties have appeared in many places in the separation logic literature, but have not been studied in a systematic manner. In this paper, we develop an algorithmic framework based on heap automata "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07041","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:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cGS+qoOdVFQ+y17f/TzFHU3faNqKJUA48UFwy4SyTYk0u51PlNeMT7jAhR6OrPWP+tb2Vw+kOssIUJYrGWSyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:52:46.023570Z"},"content_sha256":"bd2156cab20b32399b2fac85865f6aeb404a749803aa751a8c9e258dd1fed16c","schema_version":"1.0","event_id":"sha256:bd2156cab20b32399b2fac85865f6aeb404a749803aa751a8c9e258dd1fed16c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATCGIJZX7D6PGUCULZKWZDACS3/bundle.json","state_url":"https://pith.science/pith/ATCGIJZX7D6PGUCULZKWZDACS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATCGIJZX7D6PGUCULZKWZDACS3/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-23T08:52:46Z","links":{"resolver":"https://pith.science/pith/ATCGIJZX7D6PGUCULZKWZDACS3","bundle":"https://pith.science/pith/ATCGIJZX7D6PGUCULZKWZDACS3/bundle.json","state":"https://pith.science/pith/ATCGIJZX7D6PGUCULZKWZDACS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATCGIJZX7D6PGUCULZKWZDACS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ATCGIJZX7D6PGUCULZKWZDACS3","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":"217c32ff4b6c1afd69a31eadfc1674cbd7656116d39190a8c9e449074f7c7a1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-22T12:14:13Z","title_canon_sha256":"c9d3c5d6f6652ddfa34f4db5093288fa0b264e0c8db4a9686685d877ee700663"},"schema_version":"1.0","source":{"id":"1610.07041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07041","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07041v1","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07041","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"ATCGIJZX7D6P","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATCGIJZX7D6PGUCU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATCGIJZX","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:bd2156cab20b32399b2fac85865f6aeb404a749803aa751a8c9e258dd1fed16c","target":"graph","created_at":"2026-05-18T01:01:35Z","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 introduce heap automata, a formalism for automatic reasoning about robustness properties of the symbolic heap fragment of separation logic with user-defined inductive predicates. Robustness properties, such as satisfiability, reachability, and acyclicity, are important for a wide range of reasoning tasks in automated program analysis and verification based on separation logic. Previously, such properties have appeared in many places in the separation logic literature, but have not been studied in a systematic manner. In this paper, we develop an algorithmic framework based on heap automata ","authors_text":"Christina Jansen, Christoph Matheja, Florian Zuleger, Jens Katelaan, Thomas Noll","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-22T12:14:13Z","title":"Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07041","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:7d407e4b3794b1b66cb1d3b64669b9dcddbd6fd5f008ebb295c1ae7ddce80a16","target":"record","created_at":"2026-05-18T01:01:35Z","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":"217c32ff4b6c1afd69a31eadfc1674cbd7656116d39190a8c9e449074f7c7a1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-22T12:14:13Z","title_canon_sha256":"c9d3c5d6f6652ddfa34f4db5093288fa0b264e0c8db4a9686685d877ee700663"},"schema_version":"1.0","source":{"id":"1610.07041","kind":"arxiv","version":1}},"canonical_sha256":"04c4642737f8fcf350545e556c8c0296f50b6f3ac04a259370749d993704645d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04c4642737f8fcf350545e556c8c0296f50b6f3ac04a259370749d993704645d","first_computed_at":"2026-05-18T01:01:35.356542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:35.356542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yCc0GwQ+Ok9Nx7CA40o1n6kMqrAVprQ5xdrZhPgCLaTnGCHmLiEe4b4VhRTPnB42d8MFHgHMhjONsaB4j3eJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:35.356998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d407e4b3794b1b66cb1d3b64669b9dcddbd6fd5f008ebb295c1ae7ddce80a16","sha256:bd2156cab20b32399b2fac85865f6aeb404a749803aa751a8c9e258dd1fed16c"],"state_sha256":"6e9f7a460c1fb2d645121c1897f675f95a0be39841c0a9732b95ffece3bfde6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XS4YS1laiMmtPvh9uxZrjRWH2mxFCkhu4RBGf01oNwMKRfV1YklHulTvnrYZLyujNRvI+RJPx/XxoXjyQ8/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:52:46.025564Z","bundle_sha256":"81d70de2e65cb283d7e0fc71e66f36ec68cd3cfe544b9670f16edc26788cb935"}}