{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NI5UW4K4R4KBETJ4BBYQTPSSDG","short_pith_number":"pith:NI5UW4K4","canonical_record":{"source":{"id":"1709.04809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-14T14:23:20Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"3e7809e9af0599f6a38352d00394de30a2cd63c61875b68170d8b341eb4a1f19","abstract_canon_sha256":"96e3be2ff77b7b19ab5f86fea6106a6d8df8691cfa76efa17e199bca2d27bfb9"},"schema_version":"1.0"},"canonical_sha256":"6a3b4b715c8f14124d3c087109be5219819fab943a2f16aa37cf230ca18b178b","source":{"kind":"arxiv","id":"1709.04809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04809","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04809v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04809","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"NI5UW4K4R4KB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NI5UW4K4R4KBETJ4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NI5UW4K4","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NI5UW4K4R4KBETJ4BBYQTPSSDG","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-14T14:23:20Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"3e7809e9af0599f6a38352d00394de30a2cd63c61875b68170d8b341eb4a1f19","abstract_canon_sha256":"96e3be2ff77b7b19ab5f86fea6106a6d8df8691cfa76efa17e199bca2d27bfb9"},"schema_version":"1.0"},"canonical_sha256":"6a3b4b715c8f14124d3c087109be5219819fab943a2f16aa37cf230ca18b178b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:10.095744Z","signature_b64":"kOg/PYMXP7qSvoFZRFaIIVoFuuaaPIcKkh9QUbAY8V+okKMgan/d0gkZeIfGbfUytL5XLtpONvNGGqNE8PgABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3b4b715c8f14124d3c087109be5219819fab943a2f16aa37cf230ca18b178b","last_reissued_at":"2026-05-18T00:35:10.095111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:10.095111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04809","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-18T00:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gui2WlUdpdw4xirZzLxqaEIV0vhyIzciitdTVR/pLfUZzes4C8Gb2BCi8GoPQo1wa6nOa+o3k19z9+1fWcSEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:57:03.576993Z"},"content_sha256":"b482169a43a2c9e504090f8b6d33b5f274a1cd0f7f2512d3530429f5ee1e18f1","schema_version":"1.0","event_id":"sha256:b482169a43a2c9e504090f8b6d33b5f274a1cd0f7f2512d3530429f5ee1e18f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NI5UW4K4R4KBETJ4BBYQTPSSDG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Predicate Pairing with Abstraction for Relational Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"(2) DICII, (3) IASI-CNR, Alberto Pettorossi (2), Chieti-Pescara, Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Roma, University G. d'Annunzio, University of Rome Tor Vergata","submitted_at":"2017-09-14T14:23:20Z","abstract_excerpt":"Relational verification is a technique that aims at proving properties that relate two different program fragments, or two different program runs. It has been shown that constrained Horn clauses (CHCs) can effectively be used for relational verification by applying a CHC transformation, called predicate pairing, which allows the CHC solver to infer relations among arguments of different predicates. In this paper we study how the effects of the predicate pairing transformation can be enhanced by using various abstract domains based on linear arithmetic (i.e., the domain of convex polyhedra and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04809","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-18T00:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RkhBXaQdA8c3YUs/8iLUIkYK4bbdoQvj6sHG+3KCCEfpnGAQSmOv/LBEQJ6XYmvYMkbPnBjNrlChWLibp6fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:57:03.577724Z"},"content_sha256":"e3d857cff6b8eadf966db1edb907e1ce2e3556db9f545f03f50877414a4f2adb","schema_version":"1.0","event_id":"sha256:e3d857cff6b8eadf966db1edb907e1ce2e3556db9f545f03f50877414a4f2adb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NI5UW4K4R4KBETJ4BBYQTPSSDG/bundle.json","state_url":"https://pith.science/pith/NI5UW4K4R4KBETJ4BBYQTPSSDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NI5UW4K4R4KBETJ4BBYQTPSSDG/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-26T21:57:03Z","links":{"resolver":"https://pith.science/pith/NI5UW4K4R4KBETJ4BBYQTPSSDG","bundle":"https://pith.science/pith/NI5UW4K4R4KBETJ4BBYQTPSSDG/bundle.json","state":"https://pith.science/pith/NI5UW4K4R4KBETJ4BBYQTPSSDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NI5UW4K4R4KBETJ4BBYQTPSSDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NI5UW4K4R4KBETJ4BBYQTPSSDG","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":"96e3be2ff77b7b19ab5f86fea6106a6d8df8691cfa76efa17e199bca2d27bfb9","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-14T14:23:20Z","title_canon_sha256":"3e7809e9af0599f6a38352d00394de30a2cd63c61875b68170d8b341eb4a1f19"},"schema_version":"1.0","source":{"id":"1709.04809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04809","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04809v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04809","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"NI5UW4K4R4KB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NI5UW4K4R4KBETJ4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NI5UW4K4","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:e3d857cff6b8eadf966db1edb907e1ce2e3556db9f545f03f50877414a4f2adb","target":"graph","created_at":"2026-05-18T00:35:10Z","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":"Relational verification is a technique that aims at proving properties that relate two different program fragments, or two different program runs. It has been shown that constrained Horn clauses (CHCs) can effectively be used for relational verification by applying a CHC transformation, called predicate pairing, which allows the CHC solver to infer relations among arguments of different predicates. In this paper we study how the effects of the predicate pairing transformation can be enhanced by using various abstract domains based on linear arithmetic (i.e., the domain of convex polyhedra and ","authors_text":"(2) DICII, (3) IASI-CNR, Alberto Pettorossi (2), Chieti-Pescara, Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Roma, University G. d'Annunzio, University of Rome Tor Vergata","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-14T14:23:20Z","title":"Enhancing Predicate Pairing with Abstraction for Relational Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04809","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:b482169a43a2c9e504090f8b6d33b5f274a1cd0f7f2512d3530429f5ee1e18f1","target":"record","created_at":"2026-05-18T00:35:10Z","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":"96e3be2ff77b7b19ab5f86fea6106a6d8df8691cfa76efa17e199bca2d27bfb9","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-14T14:23:20Z","title_canon_sha256":"3e7809e9af0599f6a38352d00394de30a2cd63c61875b68170d8b341eb4a1f19"},"schema_version":"1.0","source":{"id":"1709.04809","kind":"arxiv","version":1}},"canonical_sha256":"6a3b4b715c8f14124d3c087109be5219819fab943a2f16aa37cf230ca18b178b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a3b4b715c8f14124d3c087109be5219819fab943a2f16aa37cf230ca18b178b","first_computed_at":"2026-05-18T00:35:10.095111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:10.095111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kOg/PYMXP7qSvoFZRFaIIVoFuuaaPIcKkh9QUbAY8V+okKMgan/d0gkZeIfGbfUytL5XLtpONvNGGqNE8PgABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:10.095744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b482169a43a2c9e504090f8b6d33b5f274a1cd0f7f2512d3530429f5ee1e18f1","sha256:e3d857cff6b8eadf966db1edb907e1ce2e3556db9f545f03f50877414a4f2adb"],"state_sha256":"69d46989b5e3c1597f49ab28ada5630d079e07d18ca9a93fed4370e677645706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ss3H+ud1iCbSxIUeQ+riix5NLGVYB7a2IIMQYB3aLsgd0E5O1R/GT1W5EVmlAuxig01YEoWYphWJIHoQhBL9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:57:03.581543Z","bundle_sha256":"cf6574452dd74f502a2174a665bdc329b72fddf811c96de9984f3f8b7fe737b3"}}