{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W367UVK3GJY2LWPRKWWMP6XPT7","short_pith_number":"pith:W367UVK3","canonical_record":{"source":{"id":"1511.06668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-20T16:22:02Z","cross_cats_sorted":[],"title_canon_sha256":"e04d91ffc247d7a14b2b7785bf9d0723763610d7182c847c7a6f6919c5762828","abstract_canon_sha256":"6d3281cc9ebdb80090e8ace6ddad51444bdbc905717563c9e4e7315881b642cf"},"schema_version":"1.0"},"canonical_sha256":"b6fdfa555b3271a5d9f155acc7faef9fd0ee7f2353dac180a347349c151ddb4a","source":{"kind":"arxiv","id":"1511.06668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06668","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06668v1","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06668","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"W367UVK3GJY2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W367UVK3GJY2LWPR","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W367UVK3","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W367UVK3GJY2LWPRKWWMP6XPT7","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-20T16:22:02Z","cross_cats_sorted":[],"title_canon_sha256":"e04d91ffc247d7a14b2b7785bf9d0723763610d7182c847c7a6f6919c5762828","abstract_canon_sha256":"6d3281cc9ebdb80090e8ace6ddad51444bdbc905717563c9e4e7315881b642cf"},"schema_version":"1.0"},"canonical_sha256":"b6fdfa555b3271a5d9f155acc7faef9fd0ee7f2353dac180a347349c151ddb4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.102069Z","signature_b64":"E3htWXHGp8O8gtDq2mf42tNJga8DeDQ2iui2TUlAOzOICoPImhmnAP0/WzdIFGvZsML7zH9W2KHyFJQcmSDlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6fdfa555b3271a5d9f155acc7faef9fd0ee7f2353dac180a347349c151ddb4a","last_reissued_at":"2026-05-18T01:26:24.101619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.101619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06668","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:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsxv4KSNGOMxhKVWxVL7wUe0s+vo72AKCkxpIHGlqcrbJy6HI3QqSAAER9ppxsgd522ti+mbEA719xXQKMtyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:09:20.801670Z"},"content_sha256":"92db7f393d175c09e02cf75b106a416cc589613e9ce3c9dda25f4a08c06153f8","schema_version":"1.0","event_id":"sha256:92db7f393d175c09e02cf75b106a416cc589613e9ce3c9dda25f4a08c06153f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W367UVK3GJY2LWPRKWWMP6XPT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving non-linear Horn clauses using a linear solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bishoksan Kafle","submitted_at":"2015-11-20T16:22:02Z","abstract_excerpt":"Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The program transformation is based on the notion of tree dimension, which we apply to trees corresponding to Horn clause derivations. The dimension of a tree is a measure of its non-linearity -- for example a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06668","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:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aj/FAcuVNq9WNmYdRF2v4/NznjfnuoQRLGHs4vUQRseHDLBZwWkvQtWb6+ombtczlt5BaDtKBUhCYc1Q6BiYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:09:20.802024Z"},"content_sha256":"54d9658353933cb5b84f869b03be9b5f6d160fb7fdeaac8f871b774dcb288c85","schema_version":"1.0","event_id":"sha256:54d9658353933cb5b84f869b03be9b5f6d160fb7fdeaac8f871b774dcb288c85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/bundle.json","state_url":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W367UVK3GJY2LWPRKWWMP6XPT7/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-26T11:09:20Z","links":{"resolver":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7","bundle":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/bundle.json","state":"https://pith.science/pith/W367UVK3GJY2LWPRKWWMP6XPT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W367UVK3GJY2LWPRKWWMP6XPT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W367UVK3GJY2LWPRKWWMP6XPT7","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":"6d3281cc9ebdb80090e8ace6ddad51444bdbc905717563c9e4e7315881b642cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-20T16:22:02Z","title_canon_sha256":"e04d91ffc247d7a14b2b7785bf9d0723763610d7182c847c7a6f6919c5762828"},"schema_version":"1.0","source":{"id":"1511.06668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06668","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06668v1","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06668","created_at":"2026-05-18T01:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"W367UVK3GJY2","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W367UVK3GJY2LWPR","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W367UVK3","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:54d9658353933cb5b84f869b03be9b5f6d160fb7fdeaac8f871b774dcb288c85","target":"graph","created_at":"2026-05-18T01:26:24Z","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":"Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The program transformation is based on the notion of tree dimension, which we apply to trees corresponding to Horn clause derivations. The dimension of a tree is a measure of its non-linearity -- for example a ","authors_text":"Bishoksan Kafle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-20T16:22:02Z","title":"Solving non-linear Horn clauses using a linear solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06668","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:92db7f393d175c09e02cf75b106a416cc589613e9ce3c9dda25f4a08c06153f8","target":"record","created_at":"2026-05-18T01:26:24Z","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":"6d3281cc9ebdb80090e8ace6ddad51444bdbc905717563c9e4e7315881b642cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-20T16:22:02Z","title_canon_sha256":"e04d91ffc247d7a14b2b7785bf9d0723763610d7182c847c7a6f6919c5762828"},"schema_version":"1.0","source":{"id":"1511.06668","kind":"arxiv","version":1}},"canonical_sha256":"b6fdfa555b3271a5d9f155acc7faef9fd0ee7f2353dac180a347349c151ddb4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6fdfa555b3271a5d9f155acc7faef9fd0ee7f2353dac180a347349c151ddb4a","first_computed_at":"2026-05-18T01:26:24.101619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:24.101619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E3htWXHGp8O8gtDq2mf42tNJga8DeDQ2iui2TUlAOzOICoPImhmnAP0/WzdIFGvZsML7zH9W2KHyFJQcmSDlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:24.102069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92db7f393d175c09e02cf75b106a416cc589613e9ce3c9dda25f4a08c06153f8","sha256:54d9658353933cb5b84f869b03be9b5f6d160fb7fdeaac8f871b774dcb288c85"],"state_sha256":"696350f0c2f4803eee2eb79f265619b7c16f60c22cf25e57f43907d0fa6a70bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Uuvq/RZxSiAVYbmtDtaM/bcUoi1i9VAdQORcxcLEMkEIvPJEbaaETx23xZHHcGr6VEV3uGUMvRcG4lH4t9vBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:09:20.804068Z","bundle_sha256":"1cd699aa5eda15e0a6e8dd3f1373529b7de3c94d39623cf401b8fafedf1dba4c"}}