{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:22JIFS3E5PUWRQBVXNTEIQKDHK","short_pith_number":"pith:22JIFS3E","canonical_record":{"source":{"id":"1907.03999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-09T06:02:42Z","cross_cats_sorted":["cs.PL","cs.SC"],"title_canon_sha256":"db1b3d8c5b06d56d23b56991065bc9eb3a6cc2b0be241490afd9e076eefcb52b","abstract_canon_sha256":"40ec09c225b18b4cb23d5de6752b304325fd8836b0229fcd0cbaa452de8928fb"},"schema_version":"1.0"},"canonical_sha256":"d69282cb64ebe968c035bb664441433a9e03728c8d91d486d5287a755e1176b6","source":{"kind":"arxiv","id":"1907.03999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03999","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03999v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03999","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"22JIFS3E5PUW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"22JIFS3E5PUWRQBV","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"22JIFS3E","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:22JIFS3E5PUWRQBVXNTEIQKDHK","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-09T06:02:42Z","cross_cats_sorted":["cs.PL","cs.SC"],"title_canon_sha256":"db1b3d8c5b06d56d23b56991065bc9eb3a6cc2b0be241490afd9e076eefcb52b","abstract_canon_sha256":"40ec09c225b18b4cb23d5de6752b304325fd8836b0229fcd0cbaa452de8928fb"},"schema_version":"1.0"},"canonical_sha256":"d69282cb64ebe968c035bb664441433a9e03728c8d91d486d5287a755e1176b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:06.055080Z","signature_b64":"ezNG6aE86/X/A+qGEOHkroOkIIS6RiVoiCbWTV1qJZheEtt0lGu88k8HPLZsqywJop0jeVuDVX3mArUaTMNNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d69282cb64ebe968c035bb664441433a9e03728c8d91d486d5287a755e1176b6","last_reissued_at":"2026-05-17T23:41:06.054426Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:06.054426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03999","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:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gcSR6QtV7CrwMCOeZmXBfVlwaqoHHixi6J9u2vnVFZHaYEEVCCbYXvliknQjVHHK0zWgpE8U+mc7hDd7Xk+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:52:46.894500Z"},"content_sha256":"2ce2dc0677f19040270c7ed4451c2662df940878fa2948f883aa6a9b9ea879bb","schema_version":"1.0","event_id":"sha256:2ce2dc0677f19040270c7ed4451c2662df940878fa2948f883aa6a9b9ea879bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:22JIFS3E5PUWRQBVXNTEIQKDHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SC"],"primary_cat":"cs.LO","authors_text":"Alberto Pettorossi (DICII, Emanuele De Angelis (DEC, Fabio Fioravanti (DEC, Italy), Maurizio Proietti (CNR-IASI, Rome, University \"G. d'Annunzio\" of Chieti-Pescara, University of Roma Tor Vergata","submitted_at":"2019-07-09T06:02:42Z","abstract_excerpt":"The proof of a program property can be reduced to the proof of satisfiability of a set of constrained Horn clauses (CHCs) which can be automatically generated from the program and the property. In this paper we have conducted a case study in Horn clause verification by  considering several sorting programs with the aim of exploring the effectiveness of a  transformation technique  which allows us to eliminate  inductive data structures such as lists or trees. If this technique is successful, we derive a set of CHCs  with constraints over the integers and booleans only, and  the satisfiability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03999","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:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHKqE0EZDf0gN5I6n1QficxfS7b5UL1f0CJFsDza3xVo+TYJEJekzWn6flMxTmv2jG5LTUOtX2W4Og0OM0wcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:52:46.894852Z"},"content_sha256":"85317d57646ef49033e390476f798036c24ff47a7641241ddc9d90ad0e1829de","schema_version":"1.0","event_id":"sha256:85317d57646ef49033e390476f798036c24ff47a7641241ddc9d90ad0e1829de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22JIFS3E5PUWRQBVXNTEIQKDHK/bundle.json","state_url":"https://pith.science/pith/22JIFS3E5PUWRQBVXNTEIQKDHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22JIFS3E5PUWRQBVXNTEIQKDHK/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-05T16:52:46Z","links":{"resolver":"https://pith.science/pith/22JIFS3E5PUWRQBVXNTEIQKDHK","bundle":"https://pith.science/pith/22JIFS3E5PUWRQBVXNTEIQKDHK/bundle.json","state":"https://pith.science/pith/22JIFS3E5PUWRQBVXNTEIQKDHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22JIFS3E5PUWRQBVXNTEIQKDHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:22JIFS3E5PUWRQBVXNTEIQKDHK","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":"40ec09c225b18b4cb23d5de6752b304325fd8836b0229fcd0cbaa452de8928fb","cross_cats_sorted":["cs.PL","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-09T06:02:42Z","title_canon_sha256":"db1b3d8c5b06d56d23b56991065bc9eb3a6cc2b0be241490afd9e076eefcb52b"},"schema_version":"1.0","source":{"id":"1907.03999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03999","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03999v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03999","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"22JIFS3E5PUW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"22JIFS3E5PUWRQBV","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"22JIFS3E","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:85317d57646ef49033e390476f798036c24ff47a7641241ddc9d90ad0e1829de","target":"graph","created_at":"2026-05-17T23:41:06Z","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":"The proof of a program property can be reduced to the proof of satisfiability of a set of constrained Horn clauses (CHCs) which can be automatically generated from the program and the property. In this paper we have conducted a case study in Horn clause verification by  considering several sorting programs with the aim of exploring the effectiveness of a  transformation technique  which allows us to eliminate  inductive data structures such as lists or trees. If this technique is successful, we derive a set of CHCs  with constraints over the integers and booleans only, and  the satisfiability ","authors_text":"Alberto Pettorossi (DICII, Emanuele De Angelis (DEC, Fabio Fioravanti (DEC, Italy), Maurizio Proietti (CNR-IASI, Rome, University \"G. d'Annunzio\" of Chieti-Pescara, University of Roma Tor Vergata","cross_cats":["cs.PL","cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-09T06:02:42Z","title":"Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03999","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:2ce2dc0677f19040270c7ed4451c2662df940878fa2948f883aa6a9b9ea879bb","target":"record","created_at":"2026-05-17T23:41:06Z","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":"40ec09c225b18b4cb23d5de6752b304325fd8836b0229fcd0cbaa452de8928fb","cross_cats_sorted":["cs.PL","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-09T06:02:42Z","title_canon_sha256":"db1b3d8c5b06d56d23b56991065bc9eb3a6cc2b0be241490afd9e076eefcb52b"},"schema_version":"1.0","source":{"id":"1907.03999","kind":"arxiv","version":1}},"canonical_sha256":"d69282cb64ebe968c035bb664441433a9e03728c8d91d486d5287a755e1176b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d69282cb64ebe968c035bb664441433a9e03728c8d91d486d5287a755e1176b6","first_computed_at":"2026-05-17T23:41:06.054426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:06.054426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ezNG6aE86/X/A+qGEOHkroOkIIS6RiVoiCbWTV1qJZheEtt0lGu88k8HPLZsqywJop0jeVuDVX3mArUaTMNNDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:06.055080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ce2dc0677f19040270c7ed4451c2662df940878fa2948f883aa6a9b9ea879bb","sha256:85317d57646ef49033e390476f798036c24ff47a7641241ddc9d90ad0e1829de"],"state_sha256":"793eebd772adcc20812564d095895bb6142c1643de62b0bef73420a7715fab69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COhZShgTAMik/qTg03bb4RplGwo8flHB4iK7Xrqcl8grpBgPjeUoh3dAKvdLha+9ZrVvu3bvm6V1ZbHA4FilBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:52:46.896864Z","bundle_sha256":"d8f2dbe20f65ffcedf883d032d5e67e07d18ae65469027e7d8c7953c87e0a213"}}