{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7FEPOIRKHTN43SS4WINJ3NRW64","short_pith_number":"pith:7FEPOIRK","canonical_record":{"source":{"id":"1512.03862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-12-12T02:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"13b98202cb7d34692f8588d8fb4c3ed131a949d02fc7b5631f64659303593ab0","abstract_canon_sha256":"7c5df60668b90148211a5fe4563816eb0803e4e1dc2b0f1ab9be6a5de478095d"},"schema_version":"1.0"},"canonical_sha256":"f948f7222a3cdbcdca5cb21a9db636f713b82454a7f45899b9e99ba50d279169","source":{"kind":"arxiv","id":"1512.03862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03862","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03862v1","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03862","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"pith_short_12","alias_value":"7FEPOIRKHTN4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FEPOIRKHTN43SS4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FEPOIRK","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7FEPOIRKHTN43SS4WINJ3NRW64","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-12-12T02:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"13b98202cb7d34692f8588d8fb4c3ed131a949d02fc7b5631f64659303593ab0","abstract_canon_sha256":"7c5df60668b90148211a5fe4563816eb0803e4e1dc2b0f1ab9be6a5de478095d"},"schema_version":"1.0"},"canonical_sha256":"f948f7222a3cdbcdca5cb21a9db636f713b82454a7f45899b9e99ba50d279169","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:23.811272Z","signature_b64":"+381gOaBPyNo8U1CRGSsNafqCkDWb3AhE3Eqo5K0fcIx7SAqxRkfo3SoEA0vN3MdhToFQENVX1stsVxx5FAUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f948f7222a3cdbcdca5cb21a9db636f713b82454a7f45899b9e99ba50d279169","last_reissued_at":"2026-05-18T01:24:23.810788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:23.810788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03862","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:24:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOGta9q/eHl7jGXoFZu9cOuZPRISfGYqqx9S21QR5sXbuPSv5CO1k3nHc7/d9zG8QxRoHZVbYvi2steG4FowCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:00:31.463514Z"},"content_sha256":"fd847be8f88402630d6e27c73bcac0142239e63b69c310f29e45cc6e6d8ba51d","schema_version":"1.0","event_id":"sha256:fd847be8f88402630d6e27c73bcac0142239e63b69c310f29e45cc6e6d8ba51d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7FEPOIRKHTN43SS4WINJ3NRW64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition by tree dimension in Horn clause verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bishoksan Kafle (Roskilde University, Denmark, Denmark), IMDEA Software Institute, John P. Gallagher (Roskilde University, Pierre Ganty (IMDEA Software Institute, Spain)","submitted_at":"2015-12-12T02:02:27Z","abstract_excerpt":"In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete binary tree has dimension equal to its height. We apply this concept to trees corresponding to Horn clause derivations. A given set of Horn clauses P can be transformed into a new set of clauses P=<k, whose derivation trees are the subset of P's derivation trees with dimension at most k. Similarly, a set of clauses P>k can be obtained from P whose derivatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03862","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:24:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRYblp2oDc8FkbmAFXAiZynSP9R9fOQYlHbhW2bOTGhzqnSob71J0cBaY8IUoaPhmnxTVMIj3drtoB6/IQpxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:00:31.463875Z"},"content_sha256":"e65fad58c55cc9e9ace3e99ac4cd956121b6d32e002af07860ad960c855803c4","schema_version":"1.0","event_id":"sha256:e65fad58c55cc9e9ace3e99ac4cd956121b6d32e002af07860ad960c855803c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FEPOIRKHTN43SS4WINJ3NRW64/bundle.json","state_url":"https://pith.science/pith/7FEPOIRKHTN43SS4WINJ3NRW64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FEPOIRKHTN43SS4WINJ3NRW64/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-06-03T19:00:31Z","links":{"resolver":"https://pith.science/pith/7FEPOIRKHTN43SS4WINJ3NRW64","bundle":"https://pith.science/pith/7FEPOIRKHTN43SS4WINJ3NRW64/bundle.json","state":"https://pith.science/pith/7FEPOIRKHTN43SS4WINJ3NRW64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FEPOIRKHTN43SS4WINJ3NRW64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7FEPOIRKHTN43SS4WINJ3NRW64","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":"7c5df60668b90148211a5fe4563816eb0803e4e1dc2b0f1ab9be6a5de478095d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-12-12T02:02:27Z","title_canon_sha256":"13b98202cb7d34692f8588d8fb4c3ed131a949d02fc7b5631f64659303593ab0"},"schema_version":"1.0","source":{"id":"1512.03862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03862","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03862v1","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03862","created_at":"2026-05-18T01:24:23Z"},{"alias_kind":"pith_short_12","alias_value":"7FEPOIRKHTN4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FEPOIRKHTN43SS4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FEPOIRK","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:e65fad58c55cc9e9ace3e99ac4cd956121b6d32e002af07860ad960c855803c4","target":"graph","created_at":"2026-05-18T01:24:23Z","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 investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete binary tree has dimension equal to its height. We apply this concept to trees corresponding to Horn clause derivations. A given set of Horn clauses P can be transformed into a new set of clauses P=<k, whose derivation trees are the subset of P's derivation trees with dimension at most k. Similarly, a set of clauses P>k can be obtained from P whose derivatio","authors_text":"Bishoksan Kafle (Roskilde University, Denmark, Denmark), IMDEA Software Institute, John P. Gallagher (Roskilde University, Pierre Ganty (IMDEA Software Institute, Spain)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-12-12T02:02:27Z","title":"Decomposition by tree dimension in Horn clause verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03862","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:fd847be8f88402630d6e27c73bcac0142239e63b69c310f29e45cc6e6d8ba51d","target":"record","created_at":"2026-05-18T01:24:23Z","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":"7c5df60668b90148211a5fe4563816eb0803e4e1dc2b0f1ab9be6a5de478095d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-12-12T02:02:27Z","title_canon_sha256":"13b98202cb7d34692f8588d8fb4c3ed131a949d02fc7b5631f64659303593ab0"},"schema_version":"1.0","source":{"id":"1512.03862","kind":"arxiv","version":1}},"canonical_sha256":"f948f7222a3cdbcdca5cb21a9db636f713b82454a7f45899b9e99ba50d279169","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f948f7222a3cdbcdca5cb21a9db636f713b82454a7f45899b9e99ba50d279169","first_computed_at":"2026-05-18T01:24:23.810788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:23.810788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+381gOaBPyNo8U1CRGSsNafqCkDWb3AhE3Eqo5K0fcIx7SAqxRkfo3SoEA0vN3MdhToFQENVX1stsVxx5FAUAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:23.811272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd847be8f88402630d6e27c73bcac0142239e63b69c310f29e45cc6e6d8ba51d","sha256:e65fad58c55cc9e9ace3e99ac4cd956121b6d32e002af07860ad960c855803c4"],"state_sha256":"b9a8003a947b5c838895637dd7df4f41716428f3d36bc73d0114486b4706f681"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ps6bXCAJfYc+d2EMBTpfIBsqf84svNedk6r3Fc41+riWBp3LH7SUuFcU5HnZxAgKd69oeMVSZS5kfQlxCm3uBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:00:31.465859Z","bundle_sha256":"347678247460aad5bc41e84f4ba0283a40e06c28b97ea7fc035dc8a4674181a6"}}