{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7CUSQTQKZE54DXYPTCEDYMTYY3","short_pith_number":"pith:7CUSQTQK","canonical_record":{"source":{"id":"1705.03167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-09T03:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"50ece3bc8293cc53685d338bf40657e50adc0826d8c53214bbb925f1741c39d5","abstract_canon_sha256":"60fc531419104670929573f007ab72c741bae5458529e8a93a3b4e216591f922"},"schema_version":"1.0"},"canonical_sha256":"f8a9284e0ac93bc1df0f98883c3278c6c8112d3a2ea0b02336c51ffa6690217e","source":{"kind":"arxiv","id":"1705.03167","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03167","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03167v2","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03167","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"7CUSQTQKZE54","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7CUSQTQKZE54DXYP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7CUSQTQK","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7CUSQTQKZE54DXYPTCEDYMTYY3","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-09T03:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"50ece3bc8293cc53685d338bf40657e50adc0826d8c53214bbb925f1741c39d5","abstract_canon_sha256":"60fc531419104670929573f007ab72c741bae5458529e8a93a3b4e216591f922"},"schema_version":"1.0"},"canonical_sha256":"f8a9284e0ac93bc1df0f98883c3278c6c8112d3a2ea0b02336c51ffa6690217e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.107947Z","signature_b64":"rAlmaTwCrLyhY506BUM9j+Xfbai4SfybcgxQjC/T3jZrrWEv1sbit2u5hx/XlG8o1bY62gBVy5DEIun2N4UqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8a9284e0ac93bc1df0f98883c3278c6c8112d3a2ea0b02336c51ffa6690217e","last_reissued_at":"2026-05-18T00:05:41.107532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.107532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03167","source_version":2,"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:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hggDN+thzABSCCOsonq8y3/6iCyvSqXzA0CxZBC/Da3IO0X+yw+todmR4JDQd0STZAPZ6wIshjkclcN+juckAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:35.277252Z"},"content_sha256":"895890adb93ad7d045cdccff57a74d7c37f9935ff156ed374871b27840e7995f","schema_version":"1.0","event_id":"sha256:895890adb93ad7d045cdccff57a74d7c37f9935ff156ed374871b27840e7995f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7CUSQTQKZE54DXYPTCEDYMTYY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Heath (Georgia Institute of Technology), Galois Inc), Qi Zhou (Georgia Institute of Technology), William Harris (Georgia Institute of Technology","submitted_at":"2017-05-09T03:42:57Z","abstract_excerpt":"Recursion-free Constrained Horn Clauses (CHCs) are logic-programming problems that can model safety properties of programs with bounded iteration and recursion. In addition, many CHC solvers reduce recursive systems to a series of recursion-free CHC systems that can each be solved efficiently.\n  In this paper, we define a novel class of recursion-free systems, named Clause-Dependence Disjoint (CDD), that generalizes classes defined in previous work. The advantage of this class is that many CDD systems are smaller than systems which express the same constraints but are part of a different class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03167","kind":"arxiv","version":2},"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:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKFMyKFcjpnRbECP9tlThIyfdoK6yr63fqxHkn5HHhIKXg3FOY5qJ9f0vDSs+SOULMOdGyti18RuXGA1lbb4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:35.277927Z"},"content_sha256":"c5ec6733fb2241ffa63ac21ad57b1e6dd35f2570b4a67059ad1d107b7b283c53","schema_version":"1.0","event_id":"sha256:c5ec6733fb2241ffa63ac21ad57b1e6dd35f2570b4a67059ad1d107b7b283c53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CUSQTQKZE54DXYPTCEDYMTYY3/bundle.json","state_url":"https://pith.science/pith/7CUSQTQKZE54DXYPTCEDYMTYY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CUSQTQKZE54DXYPTCEDYMTYY3/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-25T18:53:35Z","links":{"resolver":"https://pith.science/pith/7CUSQTQKZE54DXYPTCEDYMTYY3","bundle":"https://pith.science/pith/7CUSQTQKZE54DXYPTCEDYMTYY3/bundle.json","state":"https://pith.science/pith/7CUSQTQKZE54DXYPTCEDYMTYY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CUSQTQKZE54DXYPTCEDYMTYY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7CUSQTQKZE54DXYPTCEDYMTYY3","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":"60fc531419104670929573f007ab72c741bae5458529e8a93a3b4e216591f922","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-09T03:42:57Z","title_canon_sha256":"50ece3bc8293cc53685d338bf40657e50adc0826d8c53214bbb925f1741c39d5"},"schema_version":"1.0","source":{"id":"1705.03167","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03167","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03167v2","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03167","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"7CUSQTQKZE54","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7CUSQTQKZE54DXYP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7CUSQTQK","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c5ec6733fb2241ffa63ac21ad57b1e6dd35f2570b4a67059ad1d107b7b283c53","target":"graph","created_at":"2026-05-18T00:05:41Z","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":"Recursion-free Constrained Horn Clauses (CHCs) are logic-programming problems that can model safety properties of programs with bounded iteration and recursion. In addition, many CHC solvers reduce recursive systems to a series of recursion-free CHC systems that can each be solved efficiently.\n  In this paper, we define a novel class of recursion-free systems, named Clause-Dependence Disjoint (CDD), that generalizes classes defined in previous work. The advantage of this class is that many CDD systems are smaller than systems which express the same constraints but are part of a different class","authors_text":"David Heath (Georgia Institute of Technology), Galois Inc), Qi Zhou (Georgia Institute of Technology), William Harris (Georgia Institute of Technology","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-09T03:42:57Z","title":"Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03167","kind":"arxiv","version":2},"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:895890adb93ad7d045cdccff57a74d7c37f9935ff156ed374871b27840e7995f","target":"record","created_at":"2026-05-18T00:05:41Z","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":"60fc531419104670929573f007ab72c741bae5458529e8a93a3b4e216591f922","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-09T03:42:57Z","title_canon_sha256":"50ece3bc8293cc53685d338bf40657e50adc0826d8c53214bbb925f1741c39d5"},"schema_version":"1.0","source":{"id":"1705.03167","kind":"arxiv","version":2}},"canonical_sha256":"f8a9284e0ac93bc1df0f98883c3278c6c8112d3a2ea0b02336c51ffa6690217e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8a9284e0ac93bc1df0f98883c3278c6c8112d3a2ea0b02336c51ffa6690217e","first_computed_at":"2026-05-18T00:05:41.107532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:41.107532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rAlmaTwCrLyhY506BUM9j+Xfbai4SfybcgxQjC/T3jZrrWEv1sbit2u5hx/XlG8o1bY62gBVy5DEIun2N4UqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:41.107947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03167","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:895890adb93ad7d045cdccff57a74d7c37f9935ff156ed374871b27840e7995f","sha256:c5ec6733fb2241ffa63ac21ad57b1e6dd35f2570b4a67059ad1d107b7b283c53"],"state_sha256":"4737863c9422277581d1b6600d6c7c3d923424e31bab27c68cc96c046671fd69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+yrxAGyxIJYBq2e/uvGzhkFRe6JFIgV42dBRPzJXEO4K+k7q5dduh7jvPP5Go0u4UElk/tg5DsQkwUUBN3iBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:53:35.281395Z","bundle_sha256":"ef809bd0ce5dbb71f4dd19b200f65cb9fc494d97cb0eb947a733e4c088522fda"}}