{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MIUHJYB47E2IFE4HMX72NXCORB","short_pith_number":"pith:MIUHJYB4","canonical_record":{"source":{"id":"1309.5139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-09-20T01:44:29Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"e115bc18df3dcef5476137db6b276f6374673f63573b9dbc30a0aab0ff470a44","abstract_canon_sha256":"97818c59c95658bff5ba52f9be0a5cdae8cd2b50cfcef2b3fab982d4a0d8046e"},"schema_version":"1.0"},"canonical_sha256":"622874e03cf93482938765ffa6dc4e88572dc44f72b2f8551134682d93e5e085","source":{"kind":"arxiv","id":"1309.5139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5139","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5139v1","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5139","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"MIUHJYB47E2I","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MIUHJYB47E2IFE4H","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MIUHJYB4","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MIUHJYB47E2IFE4HMX72NXCORB","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-09-20T01:44:29Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"e115bc18df3dcef5476137db6b276f6374673f63573b9dbc30a0aab0ff470a44","abstract_canon_sha256":"97818c59c95658bff5ba52f9be0a5cdae8cd2b50cfcef2b3fab982d4a0d8046e"},"schema_version":"1.0"},"canonical_sha256":"622874e03cf93482938765ffa6dc4e88572dc44f72b2f8551134682d93e5e085","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:47.538899Z","signature_b64":"8IvGiIQqyIx5dD653Y4pSoCrQGYzmlXVQ49yQjLRPwfDelkik58TnBPqJUGoWrufXKD1hsK+c99Bd/eJCSi4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"622874e03cf93482938765ffa6dc4e88572dc44f72b2f8551134682d93e5e085","last_reissued_at":"2026-05-18T03:12:47.538136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:47.538136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5139","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-18T03:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTZ5aKmnVEc80rStVshER8HUQzUXSJKplCJAMSe0aHYh3vdBCpPDvxHRxqSuXNm5BFSZkRxOpSVPXpr5LX1qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:40:55.680771Z"},"content_sha256":"9d45fda93449b79ebef2b4a0cad18f4cea8d40e2a78cbbd060847dd391b953cd","schema_version":"1.0","event_id":"sha256:9d45fda93449b79ebef2b4a0cad18f4cea8d40e2a78cbbd060847dd391b953cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MIUHJYB47E2IFE4HMX72NXCORB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of Imperative Programs by Constraint Logic Program Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alberto Pettorossi (DICII, Emanuele De Angelis (DEC, Fabio Fioravanti (DEC, Italy), Maurizio Proietti (IASI-CNR, Pescara, Rome, University `G. D'Annunzio', University of Rome Tor Vergata","submitted_at":"2013-09-20T01:44:29Z","abstract_excerpt":"We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs (CLP). We use CLP as a metalanguage for representing imperative programs, their executions, and their properties. First, we encode the correctness of an imperative program, say prog, as the negation of a predicate 'incorrect' defined by a CLP program T. By construction, 'incorrect' holds in the least model of T if and only if the execution of prog from an initial configuration eventually halts in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5139","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-18T03:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3Y2OMDjZTmXk0bKKNW1YYaqOs41clH5NvPrD4aInnNXa3WkvCFNGv3xS/Lp7zfquJAJBuflKcJtI6bCSlp/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:40:55.681452Z"},"content_sha256":"32b122caae6128cadac3d62e34080ee494f56bd997a0cdb99619126ce99bae23","schema_version":"1.0","event_id":"sha256:32b122caae6128cadac3d62e34080ee494f56bd997a0cdb99619126ce99bae23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIUHJYB47E2IFE4HMX72NXCORB/bundle.json","state_url":"https://pith.science/pith/MIUHJYB47E2IFE4HMX72NXCORB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIUHJYB47E2IFE4HMX72NXCORB/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-26T20:40:55Z","links":{"resolver":"https://pith.science/pith/MIUHJYB47E2IFE4HMX72NXCORB","bundle":"https://pith.science/pith/MIUHJYB47E2IFE4HMX72NXCORB/bundle.json","state":"https://pith.science/pith/MIUHJYB47E2IFE4HMX72NXCORB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIUHJYB47E2IFE4HMX72NXCORB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MIUHJYB47E2IFE4HMX72NXCORB","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":"97818c59c95658bff5ba52f9be0a5cdae8cd2b50cfcef2b3fab982d4a0d8046e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-09-20T01:44:29Z","title_canon_sha256":"e115bc18df3dcef5476137db6b276f6374673f63573b9dbc30a0aab0ff470a44"},"schema_version":"1.0","source":{"id":"1309.5139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5139","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5139v1","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5139","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"MIUHJYB47E2I","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MIUHJYB47E2IFE4H","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MIUHJYB4","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:32b122caae6128cadac3d62e34080ee494f56bd997a0cdb99619126ce99bae23","target":"graph","created_at":"2026-05-18T03:12: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":"We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs (CLP). We use CLP as a metalanguage for representing imperative programs, their executions, and their properties. First, we encode the correctness of an imperative program, say prog, as the negation of a predicate 'incorrect' defined by a CLP program T. By construction, 'incorrect' holds in the least model of T if and only if the execution of prog from an initial configuration eventually halts in","authors_text":"Alberto Pettorossi (DICII, Emanuele De Angelis (DEC, Fabio Fioravanti (DEC, Italy), Maurizio Proietti (IASI-CNR, Pescara, Rome, University `G. D'Annunzio', University of Rome Tor Vergata","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-09-20T01:44:29Z","title":"Verification of Imperative Programs by Constraint Logic Program Transformation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5139","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:9d45fda93449b79ebef2b4a0cad18f4cea8d40e2a78cbbd060847dd391b953cd","target":"record","created_at":"2026-05-18T03:12: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":"97818c59c95658bff5ba52f9be0a5cdae8cd2b50cfcef2b3fab982d4a0d8046e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-09-20T01:44:29Z","title_canon_sha256":"e115bc18df3dcef5476137db6b276f6374673f63573b9dbc30a0aab0ff470a44"},"schema_version":"1.0","source":{"id":"1309.5139","kind":"arxiv","version":1}},"canonical_sha256":"622874e03cf93482938765ffa6dc4e88572dc44f72b2f8551134682d93e5e085","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"622874e03cf93482938765ffa6dc4e88572dc44f72b2f8551134682d93e5e085","first_computed_at":"2026-05-18T03:12:47.538136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:47.538136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8IvGiIQqyIx5dD653Y4pSoCrQGYzmlXVQ49yQjLRPwfDelkik58TnBPqJUGoWrufXKD1hsK+c99Bd/eJCSi4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:47.538899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d45fda93449b79ebef2b4a0cad18f4cea8d40e2a78cbbd060847dd391b953cd","sha256:32b122caae6128cadac3d62e34080ee494f56bd997a0cdb99619126ce99bae23"],"state_sha256":"c272ceec0f2ff8f5cc509bffe1b26d86a2ffd1674d42874c4852017797bd604a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NZQrgBp3i6GKj7hmp71NC5Kf5F4MimJjrW5MwIW5OntaUebDyxy+d8Fj5ola+lIrulQvSehpmPWf41/xQcXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:40:55.684927Z","bundle_sha256":"0c06b4a0f0243d60fb88fceafc68a650456a0996d3c8c8f05e3afe40ff038a42"}}