{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4BLODIHIJDOHLOYQX5LQ3BJ6VE","short_pith_number":"pith:4BLODIHI","canonical_record":{"source":{"id":"1710.02221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T21:15:45Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"2e24cfe76b4d7e7487b1dbc4616acc81f70b86994f5415ccd4a9e5b151d40245","abstract_canon_sha256":"4c1bfdc5fe65e150fa2741ed64a0f56ad932387fe5eb0b4fca16bc95cd4cd7a0"},"schema_version":"1.0"},"canonical_sha256":"e056e1a0e848dc75bb10bf570d853ea9311b24788fcb55dc1d3f215018d012be","source":{"kind":"arxiv","id":"1710.02221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02221","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02221v1","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02221","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"4BLODIHIJDOH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4BLODIHIJDOHLOYQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4BLODIHI","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4BLODIHIJDOHLOYQX5LQ3BJ6VE","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T21:15:45Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"2e24cfe76b4d7e7487b1dbc4616acc81f70b86994f5415ccd4a9e5b151d40245","abstract_canon_sha256":"4c1bfdc5fe65e150fa2741ed64a0f56ad932387fe5eb0b4fca16bc95cd4cd7a0"},"schema_version":"1.0"},"canonical_sha256":"e056e1a0e848dc75bb10bf570d853ea9311b24788fcb55dc1d3f215018d012be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:34.090884Z","signature_b64":"XcgN6RwjZJVfsujZyh6di+cK+wio8HlZtHgr6qwTd2xKMaGHmhMN6EBp+EtFPiwy1NE7ZUqqurFLJowaxgskAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e056e1a0e848dc75bb10bf570d853ea9311b24788fcb55dc1d3f215018d012be","last_reissued_at":"2026-05-18T00:33:34.090233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:34.090233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02221","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:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZXE2qoHyOHyZ+aW7WDS4DX6PlwB+9svMrALWcN1Qnoi8O1tcwuWZYClUAnQAA6F8wN+jXCtk11laJhKBuWqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:26:50.188930Z"},"content_sha256":"58923eb889a12f837b84ae287d6b6f9660908b517355cd1dded38283b74a7a54","schema_version":"1.0","event_id":"sha256:58923eb889a12f837b84ae287d6b6f9660908b517355cd1dded38283b74a7a54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4BLODIHIJDOHLOYQX5LQ3BJ6VE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stacked Structure Learning for Lifted Relational Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Filip Zelezny, Gustav Sourek, Martin Svatos, Ondrej Kuzelka, Steven Schockaert","submitted_at":"2017-10-05T21:15:45Z","abstract_excerpt":"Lifted Relational Neural Networks (LRNNs) describe relational domains using weighted first-order rules which act as templates for constructing feed-forward neural networks. While previous work has shown that using LRNNs can lead to state-of-the-art results in various ILP tasks, these results depended on hand-crafted rules. In this paper, we extend the framework of LRNNs with structure learning, thus enabling a fully automated learning process. Similarly to many ILP methods, our structure learning algorithm proceeds in an iterative fashion by top-down searching through the hypothesis space of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02221","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:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AojO7eie8QxvF3PJVTh7ktvLmMADeAKSIp2lCOp6BXbYhgCikNYjgwet3tb/BmS86Efr8o7/1k70gNkrmYBpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:26:50.189624Z"},"content_sha256":"049be242ae92706408cbc04044de17aaa4be7bf8862e50413a8f32ab59a97e23","schema_version":"1.0","event_id":"sha256:049be242ae92706408cbc04044de17aaa4be7bf8862e50413a8f32ab59a97e23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BLODIHIJDOHLOYQX5LQ3BJ6VE/bundle.json","state_url":"https://pith.science/pith/4BLODIHIJDOHLOYQX5LQ3BJ6VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BLODIHIJDOHLOYQX5LQ3BJ6VE/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-27T16:26:50Z","links":{"resolver":"https://pith.science/pith/4BLODIHIJDOHLOYQX5LQ3BJ6VE","bundle":"https://pith.science/pith/4BLODIHIJDOHLOYQX5LQ3BJ6VE/bundle.json","state":"https://pith.science/pith/4BLODIHIJDOHLOYQX5LQ3BJ6VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BLODIHIJDOHLOYQX5LQ3BJ6VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4BLODIHIJDOHLOYQX5LQ3BJ6VE","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":"4c1bfdc5fe65e150fa2741ed64a0f56ad932387fe5eb0b4fca16bc95cd4cd7a0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T21:15:45Z","title_canon_sha256":"2e24cfe76b4d7e7487b1dbc4616acc81f70b86994f5415ccd4a9e5b151d40245"},"schema_version":"1.0","source":{"id":"1710.02221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02221","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02221v1","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02221","created_at":"2026-05-18T00:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"4BLODIHIJDOH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4BLODIHIJDOHLOYQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4BLODIHI","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:049be242ae92706408cbc04044de17aaa4be7bf8862e50413a8f32ab59a97e23","target":"graph","created_at":"2026-05-18T00:33:34Z","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":"Lifted Relational Neural Networks (LRNNs) describe relational domains using weighted first-order rules which act as templates for constructing feed-forward neural networks. While previous work has shown that using LRNNs can lead to state-of-the-art results in various ILP tasks, these results depended on hand-crafted rules. In this paper, we extend the framework of LRNNs with structure learning, thus enabling a fully automated learning process. Similarly to many ILP methods, our structure learning algorithm proceeds in an iterative fashion by top-down searching through the hypothesis space of a","authors_text":"Filip Zelezny, Gustav Sourek, Martin Svatos, Ondrej Kuzelka, Steven Schockaert","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T21:15:45Z","title":"Stacked Structure Learning for Lifted Relational Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02221","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:58923eb889a12f837b84ae287d6b6f9660908b517355cd1dded38283b74a7a54","target":"record","created_at":"2026-05-18T00:33:34Z","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":"4c1bfdc5fe65e150fa2741ed64a0f56ad932387fe5eb0b4fca16bc95cd4cd7a0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-05T21:15:45Z","title_canon_sha256":"2e24cfe76b4d7e7487b1dbc4616acc81f70b86994f5415ccd4a9e5b151d40245"},"schema_version":"1.0","source":{"id":"1710.02221","kind":"arxiv","version":1}},"canonical_sha256":"e056e1a0e848dc75bb10bf570d853ea9311b24788fcb55dc1d3f215018d012be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e056e1a0e848dc75bb10bf570d853ea9311b24788fcb55dc1d3f215018d012be","first_computed_at":"2026-05-18T00:33:34.090233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:34.090233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XcgN6RwjZJVfsujZyh6di+cK+wio8HlZtHgr6qwTd2xKMaGHmhMN6EBp+EtFPiwy1NE7ZUqqurFLJowaxgskAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:34.090884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58923eb889a12f837b84ae287d6b6f9660908b517355cd1dded38283b74a7a54","sha256:049be242ae92706408cbc04044de17aaa4be7bf8862e50413a8f32ab59a97e23"],"state_sha256":"c4dbfeeda4947a98ec09d8955409159d6fb18ee87a67c2a4373a78831b419052"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6IqdyhCCYcybJvNiaFQdxDOv0191VJxT1pWwDcwzHU5G/wQ9XXSU5peBlmWriUjTxvERhgaqmYNS0Rc6RiSFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:26:50.193204Z","bundle_sha256":"206b67bde1094e33620b5ecb3bfa88768590449ff1831a69debe17b5586b954e"}}