{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UDP3NYOZZGSA4EOFF3UR7M24QC","short_pith_number":"pith:UDP3NYOZ","canonical_record":{"source":{"id":"1409.3446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-11T14:11:02Z","cross_cats_sorted":[],"title_canon_sha256":"6eef3c4714ee1f8ce85ccb8ef02b16823b116ea1e39ce967f84ded3644d6c152","abstract_canon_sha256":"abe1778fc782a293a8abc921d512e4e729b6f177ff9f3781d01e1889dd15aca6"},"schema_version":"1.0"},"canonical_sha256":"a0dfb6e1d9c9a40e11c52ee91fb35c80bb1254384f9b5e92d47a94971d23da00","source":{"kind":"arxiv","id":"1409.3446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3446","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3446v1","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3446","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"UDP3NYOZZGSA","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UDP3NYOZZGSA4EOF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UDP3NYOZ","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UDP3NYOZZGSA4EOFF3UR7M24QC","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-11T14:11:02Z","cross_cats_sorted":[],"title_canon_sha256":"6eef3c4714ee1f8ce85ccb8ef02b16823b116ea1e39ce967f84ded3644d6c152","abstract_canon_sha256":"abe1778fc782a293a8abc921d512e4e729b6f177ff9f3781d01e1889dd15aca6"},"schema_version":"1.0"},"canonical_sha256":"a0dfb6e1d9c9a40e11c52ee91fb35c80bb1254384f9b5e92d47a94971d23da00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:01.354724Z","signature_b64":"35Jm1H/zv0vAvUk1E9nEVQQas7S5UuCZypN70BD2QlaJqr0XL/gnbSbILzSWF49FJv0S7ZFwXweQy0zeRApfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0dfb6e1d9c9a40e11c52ee91fb35c80bb1254384f9b5e92d47a94971d23da00","last_reissued_at":"2026-05-18T02:43:01.354220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:01.354220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3446","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-18T02:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lItvDQMe3kOMqi4QsMPFqWjSOT7AbxNnqKcdaye+TgOEvW5LDLu+4oSsVxSKata9+xe0+XNi/SlQGOXLfL5vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:40:15.690181Z"},"content_sha256":"af0b1b9ae7945d4a2e95dbe7992c987955bf6f16f757568cc8f85eecc35165b4","schema_version":"1.0","event_id":"sha256:af0b1b9ae7945d4a2e95dbe7992c987955bf6f16f757568cc8f85eecc35165b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UDP3NYOZZGSA4EOFF3UR7M24QC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consensus-Based Modelling using Distributed Feature Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ashwin Srinivasan, Haimonti Dutta","submitted_at":"2014-09-11T14:11:02Z","abstract_excerpt":"A particularly successful role for Inductive Logic Programming (ILP) is as a tool for discovering useful relational features for subsequent use in a predictive model. Conceptually, the case for using ILP to construct relational features rests on treating these features as functions, the automated discovery of which necessarily requires some form of first-order learning. Practically, there are now several reports in the literature that suggest that augmenting any existing features with ILP-discovered relational features can substantially improve the predictive power of a model. While the approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3446","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-18T02:43:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqS6OEIBg5Lg4zBkKrsl20PGrLIBR1GJXd7BtXsylHXgkTAljK2utyRF4UkKb1V81wmqy9Nl/1S4sNKodFT5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:40:15.690549Z"},"content_sha256":"2ee8d36459bbe2c14d735fee5cf943da6644d6402a6328cfc3a95ecbe4d60c72","schema_version":"1.0","event_id":"sha256:2ee8d36459bbe2c14d735fee5cf943da6644d6402a6328cfc3a95ecbe4d60c72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDP3NYOZZGSA4EOFF3UR7M24QC/bundle.json","state_url":"https://pith.science/pith/UDP3NYOZZGSA4EOFF3UR7M24QC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDP3NYOZZGSA4EOFF3UR7M24QC/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-25T19:40:15Z","links":{"resolver":"https://pith.science/pith/UDP3NYOZZGSA4EOFF3UR7M24QC","bundle":"https://pith.science/pith/UDP3NYOZZGSA4EOFF3UR7M24QC/bundle.json","state":"https://pith.science/pith/UDP3NYOZZGSA4EOFF3UR7M24QC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDP3NYOZZGSA4EOFF3UR7M24QC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UDP3NYOZZGSA4EOFF3UR7M24QC","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":"abe1778fc782a293a8abc921d512e4e729b6f177ff9f3781d01e1889dd15aca6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-11T14:11:02Z","title_canon_sha256":"6eef3c4714ee1f8ce85ccb8ef02b16823b116ea1e39ce967f84ded3644d6c152"},"schema_version":"1.0","source":{"id":"1409.3446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3446","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3446v1","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3446","created_at":"2026-05-18T02:43:01Z"},{"alias_kind":"pith_short_12","alias_value":"UDP3NYOZZGSA","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UDP3NYOZZGSA4EOF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UDP3NYOZ","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:2ee8d36459bbe2c14d735fee5cf943da6644d6402a6328cfc3a95ecbe4d60c72","target":"graph","created_at":"2026-05-18T02:43: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":"A particularly successful role for Inductive Logic Programming (ILP) is as a tool for discovering useful relational features for subsequent use in a predictive model. Conceptually, the case for using ILP to construct relational features rests on treating these features as functions, the automated discovery of which necessarily requires some form of first-order learning. Practically, there are now several reports in the literature that suggest that augmenting any existing features with ILP-discovered relational features can substantially improve the predictive power of a model. While the approa","authors_text":"Ashwin Srinivasan, Haimonti Dutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-11T14:11:02Z","title":"Consensus-Based Modelling using Distributed Feature Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3446","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:af0b1b9ae7945d4a2e95dbe7992c987955bf6f16f757568cc8f85eecc35165b4","target":"record","created_at":"2026-05-18T02:43: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":"abe1778fc782a293a8abc921d512e4e729b6f177ff9f3781d01e1889dd15aca6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-11T14:11:02Z","title_canon_sha256":"6eef3c4714ee1f8ce85ccb8ef02b16823b116ea1e39ce967f84ded3644d6c152"},"schema_version":"1.0","source":{"id":"1409.3446","kind":"arxiv","version":1}},"canonical_sha256":"a0dfb6e1d9c9a40e11c52ee91fb35c80bb1254384f9b5e92d47a94971d23da00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0dfb6e1d9c9a40e11c52ee91fb35c80bb1254384f9b5e92d47a94971d23da00","first_computed_at":"2026-05-18T02:43:01.354220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:01.354220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"35Jm1H/zv0vAvUk1E9nEVQQas7S5UuCZypN70BD2QlaJqr0XL/gnbSbILzSWF49FJv0S7ZFwXweQy0zeRApfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:01.354724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af0b1b9ae7945d4a2e95dbe7992c987955bf6f16f757568cc8f85eecc35165b4","sha256:2ee8d36459bbe2c14d735fee5cf943da6644d6402a6328cfc3a95ecbe4d60c72"],"state_sha256":"f2f9a5532262ece5c7ee012d800b6eb8c6d162199e0a7f91f75f5ff5f48f82f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qARbCFOK/MA1QW1b04Z5ZweBhDRpdumQPDpK4ZY0dNn/6y5iXINFLO/dURfADsPFr26FPeajYc/Os2KNXGZOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:40:15.692471Z","bundle_sha256":"ca9e9ed68dbf99f2edeed6ee02244474bf86f37b1f9867b82bfc956a3e3a7b1c"}}