{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2MZBEESDWRT42EKGHZI7MPFNPU","short_pith_number":"pith:2MZBEESD","canonical_record":{"source":{"id":"1712.09418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T21:14:09Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"d699b170a36dbba65f8aaec6a7c45659a5ee2455c59c2d5fd7c7798084a14dff","abstract_canon_sha256":"324f2958118229ccf55d0cf70ddf7fbebab81174fc648ec095567bf8e3025ebf"},"schema_version":"1.0"},"canonical_sha256":"d332121243b467cd11463e51f63cad7d05f14d523883fc3b64ba40de9fe8f1a0","source":{"kind":"arxiv","id":"1712.09418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09418","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09418v1","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09418","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"2MZBEESDWRT4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2MZBEESDWRT42EKG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2MZBEESD","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2MZBEESDWRT42EKGHZI7MPFNPU","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T21:14:09Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"d699b170a36dbba65f8aaec6a7c45659a5ee2455c59c2d5fd7c7798084a14dff","abstract_canon_sha256":"324f2958118229ccf55d0cf70ddf7fbebab81174fc648ec095567bf8e3025ebf"},"schema_version":"1.0"},"canonical_sha256":"d332121243b467cd11463e51f63cad7d05f14d523883fc3b64ba40de9fe8f1a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:15.185944Z","signature_b64":"XfuGM1LFURtx3GUSoT6reabwRCdWVPXwsAYAkAgVcEBWcEp2GcuO21gs7VqVCgEMM7hJKpn18FDNVIteeY2OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d332121243b467cd11463e51f63cad7d05f14d523883fc3b64ba40de9fe8f1a0","last_reissued_at":"2026-05-18T00:01:15.185483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:15.185483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09418","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:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dr8szP8mU2hkE1d8JXkYQEhYk5kLsEmNpDTqxH/83XxM9bYWOn+GamsGv+J2XZC05JARRUun9CLZqZ2UIykpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:43.623658Z"},"content_sha256":"069dbdf6fdba0a1778b05226d9bc4424d85f994f4171607af9b5e12f22b3f461","schema_version":"1.0","event_id":"sha256:069dbdf6fdba0a1778b05226d9bc4424d85f994f4171607af9b5e12f22b3f461"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2MZBEESDWRT42EKGHZI7MPFNPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Horn-ICE Learning for Synthesizing Invariants and Contracts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.LO","authors_text":"Daniel Neider, Deepak D'Souza, P. Ezudheen, P. Madhusudan, Pranav Garg","submitted_at":"2017-12-26T21:14:09Z","abstract_excerpt":"We design learning algorithms for synthesizing invariants using Horn implication counterexamples (Horn-ICE), extending the ICE-learning model. In particular, we describe a decision-tree learning algorithm that learns from Horn-ICE samples, works in polynomial time, and uses statistical heuristics to learn small trees that satisfy the samples. Since most verification proofs can be modeled using Horn clauses, Horn-ICE learning is a more robust technique to learn inductive annotations that prove programs correct. Our experiments show that an implementation of our algorithm is able to learn adequa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09418","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:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4Qi64gTIeCyMToPIwiu9XAhGe59Zn7xWqClfOxOelw7uGzMsPKJCQTj4MXU+Yp0dIVEX2RSVNBuhOGLYsKeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:43.623999Z"},"content_sha256":"647d2771ba31d69d9e79e930f065d7592646687d953f1416f329bdd4c2f7d9a3","schema_version":"1.0","event_id":"sha256:647d2771ba31d69d9e79e930f065d7592646687d953f1416f329bdd4c2f7d9a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MZBEESDWRT42EKGHZI7MPFNPU/bundle.json","state_url":"https://pith.science/pith/2MZBEESDWRT42EKGHZI7MPFNPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MZBEESDWRT42EKGHZI7MPFNPU/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-28T12:46:43Z","links":{"resolver":"https://pith.science/pith/2MZBEESDWRT42EKGHZI7MPFNPU","bundle":"https://pith.science/pith/2MZBEESDWRT42EKGHZI7MPFNPU/bundle.json","state":"https://pith.science/pith/2MZBEESDWRT42EKGHZI7MPFNPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MZBEESDWRT42EKGHZI7MPFNPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2MZBEESDWRT42EKGHZI7MPFNPU","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":"324f2958118229ccf55d0cf70ddf7fbebab81174fc648ec095567bf8e3025ebf","cross_cats_sorted":["cs.LG","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T21:14:09Z","title_canon_sha256":"d699b170a36dbba65f8aaec6a7c45659a5ee2455c59c2d5fd7c7798084a14dff"},"schema_version":"1.0","source":{"id":"1712.09418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09418","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09418v1","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09418","created_at":"2026-05-18T00:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"2MZBEESDWRT4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2MZBEESDWRT42EKG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2MZBEESD","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:647d2771ba31d69d9e79e930f065d7592646687d953f1416f329bdd4c2f7d9a3","target":"graph","created_at":"2026-05-18T00:01:15Z","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 design learning algorithms for synthesizing invariants using Horn implication counterexamples (Horn-ICE), extending the ICE-learning model. In particular, we describe a decision-tree learning algorithm that learns from Horn-ICE samples, works in polynomial time, and uses statistical heuristics to learn small trees that satisfy the samples. Since most verification proofs can be modeled using Horn clauses, Horn-ICE learning is a more robust technique to learn inductive annotations that prove programs correct. Our experiments show that an implementation of our algorithm is able to learn adequa","authors_text":"Daniel Neider, Deepak D'Souza, P. Ezudheen, P. Madhusudan, Pranav Garg","cross_cats":["cs.LG","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T21:14:09Z","title":"Horn-ICE Learning for Synthesizing Invariants and Contracts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09418","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:069dbdf6fdba0a1778b05226d9bc4424d85f994f4171607af9b5e12f22b3f461","target":"record","created_at":"2026-05-18T00:01:15Z","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":"324f2958118229ccf55d0cf70ddf7fbebab81174fc648ec095567bf8e3025ebf","cross_cats_sorted":["cs.LG","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T21:14:09Z","title_canon_sha256":"d699b170a36dbba65f8aaec6a7c45659a5ee2455c59c2d5fd7c7798084a14dff"},"schema_version":"1.0","source":{"id":"1712.09418","kind":"arxiv","version":1}},"canonical_sha256":"d332121243b467cd11463e51f63cad7d05f14d523883fc3b64ba40de9fe8f1a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d332121243b467cd11463e51f63cad7d05f14d523883fc3b64ba40de9fe8f1a0","first_computed_at":"2026-05-18T00:01:15.185483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:15.185483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XfuGM1LFURtx3GUSoT6reabwRCdWVPXwsAYAkAgVcEBWcEp2GcuO21gs7VqVCgEMM7hJKpn18FDNVIteeY2OCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:15.185944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:069dbdf6fdba0a1778b05226d9bc4424d85f994f4171607af9b5e12f22b3f461","sha256:647d2771ba31d69d9e79e930f065d7592646687d953f1416f329bdd4c2f7d9a3"],"state_sha256":"36407e1935732f2dc11adc8943bda3e1f36e54b2aed23756017b7f2cd686a95b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Km1wVLP4EOPEhkTOjDbXCVL/60dXNj3z4qEx9hyvvn0/t/UNo9ZDYH1dY5WnoOfZmbIwOq2M3/z+tJKGfCpFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:46:43.626039Z","bundle_sha256":"f39557439e68905c8b3242ee12dd3999afe8b54cddc8c7d3de993979ff430867"}}