{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J3JFUS3NNZWRKCX5TSRFTYZJKP","short_pith_number":"pith:J3JFUS3N","canonical_record":{"source":{"id":"1602.09061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-29T17:35:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"bffce8fb617bcfacc73a87d34a511a7b4a33517a7b8811b2ac6b9765bcd2c157","abstract_canon_sha256":"63eb536a37aa76dff014b2441d4cf9587a3e3f8062b4b2b2289ba7913f4f0c11"},"schema_version":"1.0"},"canonical_sha256":"4ed25a4b6d6e6d150afd9ca259e32953e75af57daf6e47aa7ba60ccebafbad31","source":{"kind":"arxiv","id":"1602.09061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.09061","created_at":"2026-05-18T01:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"1602.09061v1","created_at":"2026-05-18T01:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.09061","created_at":"2026-05-18T01:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"J3JFUS3NNZWR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J3JFUS3NNZWRKCX5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J3JFUS3N","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J3JFUS3NNZWRKCX5TSRFTYZJKP","target":"record","payload":{"canonical_record":{"source":{"id":"1602.09061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-29T17:35:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"bffce8fb617bcfacc73a87d34a511a7b4a33517a7b8811b2ac6b9765bcd2c157","abstract_canon_sha256":"63eb536a37aa76dff014b2441d4cf9587a3e3f8062b4b2b2289ba7913f4f0c11"},"schema_version":"1.0"},"canonical_sha256":"4ed25a4b6d6e6d150afd9ca259e32953e75af57daf6e47aa7ba60ccebafbad31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:47.055707Z","signature_b64":"yhwrDUUDkh2OaCKqQJKJ37k8ypS8EPnCIOQ+HvJSAFMCvNoV7NmgwlZUWcDGoTfAzEMS+/a4qry6L5cMfvvrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ed25a4b6d6e6d150afd9ca259e32953e75af57daf6e47aa7ba60ccebafbad31","last_reissued_at":"2026-05-18T01:19:47.055344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:47.055344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.09061","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:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgZ6HChJ9Kq7XfssFS4AIGMwbnn6Eo4Aej+j64LIhLfk4W9CTnlSXF0KbrtVebodaNwku5aZSAqZeIdHKcFGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:09.192918Z"},"content_sha256":"f615b67b5153d4fd2a8ae4327b6ebea8dfdd4b3e29b50186a642d272544034c1","schema_version":"1.0","event_id":"sha256:f615b67b5153d4fd2a8ae4327b6ebea8dfdd4b3e29b50186a642d272544034c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J3JFUS3NNZWRKCX5TSRFTYZJKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Model Checking of Pointer Programs Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Piotr Witkowski, Witold Charatonik","submitted_at":"2016-02-29T17:35:28Z","abstract_excerpt":"Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following four observations. First, error conditions like dereference of a dangling pointer, are expressible in a~fragment of first-order logic with two-variables. Second, the fragment is closed under weakest preconditions wrt. finite paths. Third, data structures like trees, lists etc. are expressible by inductive predicates defined in a fragment of Datalog. Finally, the combination of the two fragments of the two-variable lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.09061","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:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koQYZ8FhnI7bKPs28tBgRSg64yqxnthnj5FkgWZtlcZBogS4Terefn0veLI1z+XYAosrZ7su8nKhg67lEljsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:09.193729Z"},"content_sha256":"c0a73b97e665532a9e54b768e5128d3900ddcfc67fcb30b2fb01accd97d8b6ea","schema_version":"1.0","event_id":"sha256:c0a73b97e665532a9e54b768e5128d3900ddcfc67fcb30b2fb01accd97d8b6ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/bundle.json","state_url":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/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-27T13:49:09Z","links":{"resolver":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP","bundle":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/bundle.json","state":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J3JFUS3NNZWRKCX5TSRFTYZJKP","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":"63eb536a37aa76dff014b2441d4cf9587a3e3f8062b4b2b2289ba7913f4f0c11","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-29T17:35:28Z","title_canon_sha256":"bffce8fb617bcfacc73a87d34a511a7b4a33517a7b8811b2ac6b9765bcd2c157"},"schema_version":"1.0","source":{"id":"1602.09061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.09061","created_at":"2026-05-18T01:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"1602.09061v1","created_at":"2026-05-18T01:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.09061","created_at":"2026-05-18T01:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"J3JFUS3NNZWR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J3JFUS3NNZWRKCX5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J3JFUS3N","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:c0a73b97e665532a9e54b768e5128d3900ddcfc67fcb30b2fb01accd97d8b6ea","target":"graph","created_at":"2026-05-18T01:19:47Z","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":"Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following four observations. First, error conditions like dereference of a dangling pointer, are expressible in a~fragment of first-order logic with two-variables. Second, the fragment is closed under weakest preconditions wrt. finite paths. Third, data structures like trees, lists etc. are expressible by inductive predicates defined in a fragment of Datalog. Finally, the combination of the two fragments of the two-variable lo","authors_text":"Piotr Witkowski, Witold Charatonik","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-29T17:35:28Z","title":"Bounded Model Checking of Pointer Programs Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.09061","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:f615b67b5153d4fd2a8ae4327b6ebea8dfdd4b3e29b50186a642d272544034c1","target":"record","created_at":"2026-05-18T01:19:47Z","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":"63eb536a37aa76dff014b2441d4cf9587a3e3f8062b4b2b2289ba7913f4f0c11","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-29T17:35:28Z","title_canon_sha256":"bffce8fb617bcfacc73a87d34a511a7b4a33517a7b8811b2ac6b9765bcd2c157"},"schema_version":"1.0","source":{"id":"1602.09061","kind":"arxiv","version":1}},"canonical_sha256":"4ed25a4b6d6e6d150afd9ca259e32953e75af57daf6e47aa7ba60ccebafbad31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ed25a4b6d6e6d150afd9ca259e32953e75af57daf6e47aa7ba60ccebafbad31","first_computed_at":"2026-05-18T01:19:47.055344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:47.055344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yhwrDUUDkh2OaCKqQJKJ37k8ypS8EPnCIOQ+HvJSAFMCvNoV7NmgwlZUWcDGoTfAzEMS+/a4qry6L5cMfvvrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:47.055707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.09061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f615b67b5153d4fd2a8ae4327b6ebea8dfdd4b3e29b50186a642d272544034c1","sha256:c0a73b97e665532a9e54b768e5128d3900ddcfc67fcb30b2fb01accd97d8b6ea"],"state_sha256":"47d845b38360dc7240fc74520ca96e9a45baaf35260241ff66add79ddd1b48a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tS1xg1GnvMm8foVWW7L0n/hLkRMOb4QL8q9M4ZwIODdogNiE4UR9U+5T0ae7HeVKXxT3BO7cesIR/KEUjdueCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:49:09.197694Z","bundle_sha256":"dfa7051a24fc4d228657f9799a2842dfda55855675e75c63d1a8f84b3f8f5527"}}