{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XRDGHKEITDS77CGIIP5JQXBG63","short_pith_number":"pith:XRDGHKEI","canonical_record":{"source":{"id":"1607.01993","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-07T12:49:04Z","cross_cats_sorted":["cs.DS","cs.PL","math.LO"],"title_canon_sha256":"ea87d70f4f9dab051d4e252ec805be8e8c532086ef9d9d7db21e45af7ac4b051","abstract_canon_sha256":"044dd8311f3ff4e7f79462ddf5d743aad6d1c8c6f00d7be0e372972ca29c48e8"},"schema_version":"1.0"},"canonical_sha256":"bc4663a88898e5ff88c843fa985c26f6d19ce44968d521e2c8f5ec898b1de29d","source":{"kind":"arxiv","id":"1607.01993","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01993","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01993v3","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01993","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"XRDGHKEITDS7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XRDGHKEITDS77CGI","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XRDGHKEI","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XRDGHKEITDS77CGIIP5JQXBG63","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01993","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-07T12:49:04Z","cross_cats_sorted":["cs.DS","cs.PL","math.LO"],"title_canon_sha256":"ea87d70f4f9dab051d4e252ec805be8e8c532086ef9d9d7db21e45af7ac4b051","abstract_canon_sha256":"044dd8311f3ff4e7f79462ddf5d743aad6d1c8c6f00d7be0e372972ca29c48e8"},"schema_version":"1.0"},"canonical_sha256":"bc4663a88898e5ff88c843fa985c26f6d19ce44968d521e2c8f5ec898b1de29d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:43.906081Z","signature_b64":"ZGzHXIEb08eqcVLedXapTE+oXEZrFjjCGkbUnyw9aqU05guCrRP+PyD3/bgn7xhe1IqetG6Wcwo3+R9x+DdrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc4663a88898e5ff88c843fa985c26f6d19ce44968d521e2c8f5ec898b1de29d","last_reissued_at":"2026-05-18T00:57:43.905604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:43.905604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01993","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:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yWKgBLgxT5jVeLXC003Sk3LuXL5QY5nEA/fjrTL6PbN82mibZhRJ/zRDvwJnG858n9jZuaYPUia5bmleg2fDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:58:36.129662Z"},"content_sha256":"e4d4cc7f68238aafe6bc3e331a9deaf1a5f403bd4461525761254bd68bf8ab13","schema_version":"1.0","event_id":"sha256:e4d4cc7f68238aafe6bc3e331a9deaf1a5f403bd4461525761254bd68bf8ab13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XRDGHKEITDS77CGIIP5JQXBG63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Biabduction (and Related Problems) in Array Separation Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PL","math.LO"],"primary_cat":"cs.LO","authors_text":"James Brotherston, Max Kanovich, Nikos Gorogiannis","submitted_at":"2016-07-07T12:49:04Z","abstract_excerpt":"We investigate array separation logic (ASL), a variant of symbolic-heap separation logic in which the data structures are either pointers or arrays, i.e., contiguous blocks of allocated memory. This logic provides a language for compositional memory safety proofs of imperative array programs.\n  We focus on the biabduction problem for this logic, which has been established as the key to automatic specification inference at the industrial scale. We present an NP decision procedure for biabduction in ASL that produces solutions of reasonable quality, and we also show that the problem of finding a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01993","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:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bu/9kk2rL1jaua60u5aeyQJ395/EEsahRettGL2v90R+Kl/MQ/3vFiNmmdpAAsCu5YZByR5lTHwceHjA2XdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:58:36.130428Z"},"content_sha256":"1a2f80c5bacd88ed001524f4201124ba1ef493e6b0c0cd8080d232b63226c023","schema_version":"1.0","event_id":"sha256:1a2f80c5bacd88ed001524f4201124ba1ef493e6b0c0cd8080d232b63226c023"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRDGHKEITDS77CGIIP5JQXBG63/bundle.json","state_url":"https://pith.science/pith/XRDGHKEITDS77CGIIP5JQXBG63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRDGHKEITDS77CGIIP5JQXBG63/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-11T07:58:36Z","links":{"resolver":"https://pith.science/pith/XRDGHKEITDS77CGIIP5JQXBG63","bundle":"https://pith.science/pith/XRDGHKEITDS77CGIIP5JQXBG63/bundle.json","state":"https://pith.science/pith/XRDGHKEITDS77CGIIP5JQXBG63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRDGHKEITDS77CGIIP5JQXBG63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XRDGHKEITDS77CGIIP5JQXBG63","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":"044dd8311f3ff4e7f79462ddf5d743aad6d1c8c6f00d7be0e372972ca29c48e8","cross_cats_sorted":["cs.DS","cs.PL","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-07T12:49:04Z","title_canon_sha256":"ea87d70f4f9dab051d4e252ec805be8e8c532086ef9d9d7db21e45af7ac4b051"},"schema_version":"1.0","source":{"id":"1607.01993","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01993","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01993v3","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01993","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"XRDGHKEITDS7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XRDGHKEITDS77CGI","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XRDGHKEI","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:1a2f80c5bacd88ed001524f4201124ba1ef493e6b0c0cd8080d232b63226c023","target":"graph","created_at":"2026-05-18T00:57:43Z","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 investigate array separation logic (ASL), a variant of symbolic-heap separation logic in which the data structures are either pointers or arrays, i.e., contiguous blocks of allocated memory. This logic provides a language for compositional memory safety proofs of imperative array programs.\n  We focus on the biabduction problem for this logic, which has been established as the key to automatic specification inference at the industrial scale. We present an NP decision procedure for biabduction in ASL that produces solutions of reasonable quality, and we also show that the problem of finding a","authors_text":"James Brotherston, Max Kanovich, Nikos Gorogiannis","cross_cats":["cs.DS","cs.PL","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-07T12:49:04Z","title":"Biabduction (and Related Problems) in Array Separation Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01993","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:e4d4cc7f68238aafe6bc3e331a9deaf1a5f403bd4461525761254bd68bf8ab13","target":"record","created_at":"2026-05-18T00:57:43Z","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":"044dd8311f3ff4e7f79462ddf5d743aad6d1c8c6f00d7be0e372972ca29c48e8","cross_cats_sorted":["cs.DS","cs.PL","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-07T12:49:04Z","title_canon_sha256":"ea87d70f4f9dab051d4e252ec805be8e8c532086ef9d9d7db21e45af7ac4b051"},"schema_version":"1.0","source":{"id":"1607.01993","kind":"arxiv","version":3}},"canonical_sha256":"bc4663a88898e5ff88c843fa985c26f6d19ce44968d521e2c8f5ec898b1de29d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc4663a88898e5ff88c843fa985c26f6d19ce44968d521e2c8f5ec898b1de29d","first_computed_at":"2026-05-18T00:57:43.905604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:43.905604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZGzHXIEb08eqcVLedXapTE+oXEZrFjjCGkbUnyw9aqU05guCrRP+PyD3/bgn7xhe1IqetG6Wcwo3+R9x+DdrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:43.906081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01993","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4d4cc7f68238aafe6bc3e331a9deaf1a5f403bd4461525761254bd68bf8ab13","sha256:1a2f80c5bacd88ed001524f4201124ba1ef493e6b0c0cd8080d232b63226c023"],"state_sha256":"ee1214e7bfa6fc56f5326972f587b50c53604f46be22826fbc4e2dadf3d72413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+87yI5K21vyiO0tppwnB9g83MO33mVFjQK+XNlzHZWKmUepXqUwmoP2vp9at48rbRPQI3TKSfZ4d0DPvT0vaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:58:36.135099Z","bundle_sha256":"6a5947e0981920c3bda2a2820777614e16facf1a2f238971979ad0f6f024c1ef"}}