{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3T5FJYZM3DZU4HTPNZGLWRT4HA","short_pith_number":"pith:3T5FJYZM","canonical_record":{"source":{"id":"1804.09007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-24T13:20:25Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"18df9985659a9219b412cd4650da9d39f9702adc79357d67b83fac605785e416","abstract_canon_sha256":"8290c9183f3892a5ab42c84e919f00f9af6828160482d22011a4f3eebcd6076a"},"schema_version":"1.0"},"canonical_sha256":"dcfa54e32cd8f34e1e6f6e4cbb467c380542fc393709828fa06fc669693c03fc","source":{"kind":"arxiv","id":"1804.09007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09007","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09007v1","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09007","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"3T5FJYZM3DZU","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3T5FJYZM3DZU4HTP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3T5FJYZM","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3T5FJYZM3DZU4HTPNZGLWRT4HA","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-24T13:20:25Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"18df9985659a9219b412cd4650da9d39f9702adc79357d67b83fac605785e416","abstract_canon_sha256":"8290c9183f3892a5ab42c84e919f00f9af6828160482d22011a4f3eebcd6076a"},"schema_version":"1.0"},"canonical_sha256":"dcfa54e32cd8f34e1e6f6e4cbb467c380542fc393709828fa06fc669693c03fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:44.976345Z","signature_b64":"YRnMUmCcT4dcoCGNlONgDkWnruLlhTjtuOdWPVSHptRWFNXnXsSHbCO6u7S4tldasce55o0TCG15iOpoTx8HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcfa54e32cd8f34e1e6f6e4cbb467c380542fc393709828fa06fc669693c03fc","last_reissued_at":"2026-05-18T00:02:44.975829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:44.975829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09007","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:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFXAS0CdeP46fWifDQ0ZAn1ozygAe+0tuoN+7HSVIp7M4rrvdATVwWkIhel6WxRY1O+R7QLVtqMBgXXW7vvLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:18:33.202687Z"},"content_sha256":"2f59bdd08f295cf81d56ce3e5d0cf87db81f7203c0c39926285eac6c21e35c5f","schema_version":"1.0","event_id":"sha256:2f59bdd08f295cf81d56ce3e5d0cf87db81f7203c0c39926285eac6c21e35c5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3T5FJYZM3DZU4HTPNZGLWRT4HA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Horn Clauses on Inductive Data Types Without Induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"(2) DICII, (3) CNR-IASI, Alberto Pettorossi (2), Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Pescara, Roma, University G. D'Annunzio of Chieti-Pescara, University of Rome Tor Vergata","submitted_at":"2018-04-24T13:20:25Z","abstract_excerpt":"We address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs) based on theories of inductively defined data structures, such as lists and trees. We propose a transformation technique whose objective is the removal of these data structures from CHCs, hence reducing their satisfiability to a satisfiability problem for CHCs on integers and booleans. We propose a transformation algorithm and identify a class of clauses where it always succeeds. We also consider an extension of that algorithm, which combines clause transformation with reasoning on integer constraints. Vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09007","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:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXNfqy4RlJVF4PfUw5LHOJ3iCnx6l087TA87wUFzIDNNNmA7uJq0SZnpttAbvhTP08sMv8d9cUS8MPnV3eGXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:18:33.203307Z"},"content_sha256":"294804a534c4222e86f5018a9ffb7f299a934a3aa4ed2c3e15f7344a75f0b7cc","schema_version":"1.0","event_id":"sha256:294804a534c4222e86f5018a9ffb7f299a934a3aa4ed2c3e15f7344a75f0b7cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/bundle.json","state_url":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/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-23T00:18:33Z","links":{"resolver":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA","bundle":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/bundle.json","state":"https://pith.science/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3T5FJYZM3DZU4HTPNZGLWRT4HA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3T5FJYZM3DZU4HTPNZGLWRT4HA","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":"8290c9183f3892a5ab42c84e919f00f9af6828160482d22011a4f3eebcd6076a","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-24T13:20:25Z","title_canon_sha256":"18df9985659a9219b412cd4650da9d39f9702adc79357d67b83fac605785e416"},"schema_version":"1.0","source":{"id":"1804.09007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09007","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09007v1","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09007","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"3T5FJYZM3DZU","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3T5FJYZM3DZU4HTP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3T5FJYZM","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:294804a534c4222e86f5018a9ffb7f299a934a3aa4ed2c3e15f7344a75f0b7cc","target":"graph","created_at":"2026-05-18T00:02:44Z","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 address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs) based on theories of inductively defined data structures, such as lists and trees. We propose a transformation technique whose objective is the removal of these data structures from CHCs, hence reducing their satisfiability to a satisfiability problem for CHCs on integers and booleans. We propose a transformation algorithm and identify a class of clauses where it always succeeds. We also consider an extension of that algorithm, which combines clause transformation with reasoning on integer constraints. Vi","authors_text":"(2) DICII, (3) CNR-IASI, Alberto Pettorossi (2), Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Pescara, Roma, University G. D'Annunzio of Chieti-Pescara, University of Rome Tor Vergata","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-24T13:20:25Z","title":"Solving Horn Clauses on Inductive Data Types Without Induction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09007","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:2f59bdd08f295cf81d56ce3e5d0cf87db81f7203c0c39926285eac6c21e35c5f","target":"record","created_at":"2026-05-18T00:02:44Z","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":"8290c9183f3892a5ab42c84e919f00f9af6828160482d22011a4f3eebcd6076a","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-24T13:20:25Z","title_canon_sha256":"18df9985659a9219b412cd4650da9d39f9702adc79357d67b83fac605785e416"},"schema_version":"1.0","source":{"id":"1804.09007","kind":"arxiv","version":1}},"canonical_sha256":"dcfa54e32cd8f34e1e6f6e4cbb467c380542fc393709828fa06fc669693c03fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcfa54e32cd8f34e1e6f6e4cbb467c380542fc393709828fa06fc669693c03fc","first_computed_at":"2026-05-18T00:02:44.975829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:44.975829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YRnMUmCcT4dcoCGNlONgDkWnruLlhTjtuOdWPVSHptRWFNXnXsSHbCO6u7S4tldasce55o0TCG15iOpoTx8HCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:44.976345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f59bdd08f295cf81d56ce3e5d0cf87db81f7203c0c39926285eac6c21e35c5f","sha256:294804a534c4222e86f5018a9ffb7f299a934a3aa4ed2c3e15f7344a75f0b7cc"],"state_sha256":"1b903d03e2c701759cb2c6bcdfa4350b6fc8aa98c02bc9202bb7ac36190babea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLyTIu4O+qx4QSyJOrJrFi/Ypp9Uyc/yDcuV01gb35691Om9JLRvgllWqPqvu0oGja+D5Pqq+rcF73qwYESsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T00:18:33.207249Z","bundle_sha256":"69411783e833f4e2e6b91577806cbc8b5b10c67a092fa985a3d2969b263e5a8d"}}