{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7L55H3XYLM2NOMEOARWZICG344","short_pith_number":"pith:7L55H3XY","canonical_record":{"source":{"id":"1607.04459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-15T11:05:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"30e020c1a36996daa472077f9a2d18e3e141be42034b95a98c781376e9b1f102","abstract_canon_sha256":"438e35c3372aaaac99cb5a81595cef4e415607e335b1cc26884e4af30bf48653"},"schema_version":"1.0"},"canonical_sha256":"fafbd3eef85b34d7308e046d9408dbe7330384b21bb6fe9ab5a80ffda848e60c","source":{"kind":"arxiv","id":"1607.04459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04459","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04459v1","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04459","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"7L55H3XYLM2N","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7L55H3XYLM2NOMEO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7L55H3XY","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7L55H3XYLM2NOMEOARWZICG344","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-15T11:05:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"30e020c1a36996daa472077f9a2d18e3e141be42034b95a98c781376e9b1f102","abstract_canon_sha256":"438e35c3372aaaac99cb5a81595cef4e415607e335b1cc26884e4af30bf48653"},"schema_version":"1.0"},"canonical_sha256":"fafbd3eef85b34d7308e046d9408dbe7330384b21bb6fe9ab5a80ffda848e60c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.163309Z","signature_b64":"ylC17hAfk+gJQBA6GKvtDVS0QsOSbfB4PALpkdod/3d07t7bFpCllE3ARvl4ttWtbQVnTCGjvxteggfIz8cnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fafbd3eef85b34d7308e046d9408dbe7330384b21bb6fe9ab5a80ffda848e60c","last_reissued_at":"2026-05-18T01:11:01.162758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.162758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04459","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:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IPBYcUKCEQBlcW3aGHodX2kgAvGMDbOV17VHdVV2hZZPUAnzYZx2dE2N66PQvcrfHRTwyAcCO6gUOc9SkrFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:47.572247Z"},"content_sha256":"5abcb0809e860230d029a1d19f4928ae5c6583d6b172bf767a6140107feb98c6","schema_version":"1.0","event_id":"sha256:5abcb0809e860230d029a1d19f4928ae5c6583d6b172bf767a6140107feb98c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7L55H3XYLM2NOMEOARWZICG344","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving non-linear Horn clauses using a linear Horn clause solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Bishoksan Kafle (Roskilde University), IMDEA Software Institute), John P. Gallagher (Roskilde University, Pierre Ganty (IMDEA Software Institute, Spain)","submitted_at":"2016-07-15T11:05:08Z","abstract_excerpt":"In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn clauses (also called a solver for linear Horn clauses). The program transformation is based on the notion of tree dimension, which we apply to a set of non-linear clauses, yielding a set whose derivation trees have bounded dimension. Such a set of clauses can be linearised. The main algorithm then proceeds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04459","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:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MERQpw19kH3yjZR3eXZ/Ij1DvEG3UosW7Dj2ZmcT/g0gCGoAeCmNY29SflA04QaHXV7qH5HWX0l48RAmP/paCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:47.572933Z"},"content_sha256":"a6f35bcae5f372308f5f417cee38ad4ba5c55c9495a20fb990f23f34fe084184","schema_version":"1.0","event_id":"sha256:a6f35bcae5f372308f5f417cee38ad4ba5c55c9495a20fb990f23f34fe084184"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7L55H3XYLM2NOMEOARWZICG344/bundle.json","state_url":"https://pith.science/pith/7L55H3XYLM2NOMEOARWZICG344/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7L55H3XYLM2NOMEOARWZICG344/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-27T11:49:47Z","links":{"resolver":"https://pith.science/pith/7L55H3XYLM2NOMEOARWZICG344","bundle":"https://pith.science/pith/7L55H3XYLM2NOMEOARWZICG344/bundle.json","state":"https://pith.science/pith/7L55H3XYLM2NOMEOARWZICG344/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7L55H3XYLM2NOMEOARWZICG344/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7L55H3XYLM2NOMEOARWZICG344","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":"438e35c3372aaaac99cb5a81595cef4e415607e335b1cc26884e4af30bf48653","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-15T11:05:08Z","title_canon_sha256":"30e020c1a36996daa472077f9a2d18e3e141be42034b95a98c781376e9b1f102"},"schema_version":"1.0","source":{"id":"1607.04459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04459","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04459v1","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04459","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"7L55H3XYLM2N","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7L55H3XYLM2NOMEO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7L55H3XY","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:a6f35bcae5f372308f5f417cee38ad4ba5c55c9495a20fb990f23f34fe084184","target":"graph","created_at":"2026-05-18T01:11:01Z","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":"In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn clauses (also called a solver for linear Horn clauses). The program transformation is based on the notion of tree dimension, which we apply to a set of non-linear clauses, yielding a set whose derivation trees have bounded dimension. Such a set of clauses can be linearised. The main algorithm then proceeds","authors_text":"Bishoksan Kafle (Roskilde University), IMDEA Software Institute), John P. Gallagher (Roskilde University, Pierre Ganty (IMDEA Software Institute, Spain)","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-15T11:05:08Z","title":"Solving non-linear Horn clauses using a linear Horn clause solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04459","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:5abcb0809e860230d029a1d19f4928ae5c6583d6b172bf767a6140107feb98c6","target":"record","created_at":"2026-05-18T01:11:01Z","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":"438e35c3372aaaac99cb5a81595cef4e415607e335b1cc26884e4af30bf48653","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-15T11:05:08Z","title_canon_sha256":"30e020c1a36996daa472077f9a2d18e3e141be42034b95a98c781376e9b1f102"},"schema_version":"1.0","source":{"id":"1607.04459","kind":"arxiv","version":1}},"canonical_sha256":"fafbd3eef85b34d7308e046d9408dbe7330384b21bb6fe9ab5a80ffda848e60c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fafbd3eef85b34d7308e046d9408dbe7330384b21bb6fe9ab5a80ffda848e60c","first_computed_at":"2026-05-18T01:11:01.162758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:01.162758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ylC17hAfk+gJQBA6GKvtDVS0QsOSbfB4PALpkdod/3d07t7bFpCllE3ARvl4ttWtbQVnTCGjvxteggfIz8cnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:01.163309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5abcb0809e860230d029a1d19f4928ae5c6583d6b172bf767a6140107feb98c6","sha256:a6f35bcae5f372308f5f417cee38ad4ba5c55c9495a20fb990f23f34fe084184"],"state_sha256":"11b6f5ba20e77bdeba0b6f5d13798bf10f034778c6a1e7feca43d70e71fbb38c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDaMRooFVkzXvPptRAjnXXo4ZUmsrGgzTPqqdR685S6AZfmxp956V3WY0r5m0h2ujb/ayyLCawRr1vSYBqzZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:49:47.576424Z","bundle_sha256":"1bca7c14f212cec105e6d870ffed39e1bd3df7e3aed2403eb9deb74326dab7cf"}}