{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:FZFAR2GUZOSRML4JCE32UCDJWG","short_pith_number":"pith:FZFAR2GU","canonical_record":{"source":{"id":"2105.01442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-04T12:09:35Z","cross_cats_sorted":[],"title_canon_sha256":"0a5077a1601417ea4c1002979d762273ed1a5d25c37378f188ab0e796ce3261b","abstract_canon_sha256":"234dff03b8f2b88cd3c978403b50b885fd123ef025129f590320c28cf8e2edcd"},"schema_version":"1.0"},"canonical_sha256":"2e4a08e8d4cba5162f891137aa0869b1b3fb849bc21b5a541a07f28a5d7924c5","source":{"kind":"arxiv","id":"2105.01442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.01442","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"2105.01442v1","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01442","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"FZFAR2GUZOSR","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_16","alias_value":"FZFAR2GUZOSRML4J","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_8","alias_value":"FZFAR2GU","created_at":"2026-07-05T02:37:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:FZFAR2GUZOSRML4JCE32UCDJWG","target":"record","payload":{"canonical_record":{"source":{"id":"2105.01442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-04T12:09:35Z","cross_cats_sorted":[],"title_canon_sha256":"0a5077a1601417ea4c1002979d762273ed1a5d25c37378f188ab0e796ce3261b","abstract_canon_sha256":"234dff03b8f2b88cd3c978403b50b885fd123ef025129f590320c28cf8e2edcd"},"schema_version":"1.0"},"canonical_sha256":"2e4a08e8d4cba5162f891137aa0869b1b3fb849bc21b5a541a07f28a5d7924c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:17.396953Z","signature_b64":"iGIIGkoYUGH0q2ehbTwk42Il3PSCVL6XgVL6+6AditQaKaF3z1XuEQJOypuJLEGBxDQR9nou401uqFBFaSroDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e4a08e8d4cba5162f891137aa0869b1b3fb849bc21b5a541a07f28a5d7924c5","last_reissued_at":"2026-07-05T02:37:17.396538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:17.396538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.01442","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-07-05T02:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHrzJUKXIszyrsGp3oiWAFUS2MfDysvwjohlGEsRl6w6IhtxAwENBGm94s0llj2k0/SOqNh4+/7SpDqr0ET4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:43:26.627841Z"},"content_sha256":"10d4489578dd4be6d566aa1c92a9a45dd8707ea0e1bd518589a723602ebbd89b","schema_version":"1.0","event_id":"sha256:10d4489578dd4be6d566aa1c92a9a45dd8707ea0e1bd518589a723602ebbd89b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:FZFAR2GUZOSRML4JCE32UCDJWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NeuralLog: a Neural Logic Language","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Victor Guimar\\~aes, V\\'itor Santos Costa","submitted_at":"2021-05-04T12:09:35Z","abstract_excerpt":"Application domains that require considering relationships among objects which have real-valued attributes are becoming even more important. In this paper we propose NeuralLog, a first-order logic language that is compiled to a neural network. The main goal of NeuralLog is to bridge logic programming and deep learning, allowing advances in both fields to be combined in order to obtain better machine learning models. The main advantages of NeuralLog are: to allow neural networks to be defined as logic programs; and to be able to handle numeric attributes and functions. We compared NeuralLog wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01442","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.01442/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V78fqVaOp4bsyTXBCiZfFerV5F4pK1AaBiQ+2pTG2U1booGZa5tea2KSH4Y8gi4apf1AqwCJ1qi0hXuePtZkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:43:26.628221Z"},"content_sha256":"e961015a28a81242cdae491062df5cc37f12badebc6e53f0c419e9fea8e7f891","schema_version":"1.0","event_id":"sha256:e961015a28a81242cdae491062df5cc37f12badebc6e53f0c419e9fea8e7f891"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZFAR2GUZOSRML4JCE32UCDJWG/bundle.json","state_url":"https://pith.science/pith/FZFAR2GUZOSRML4JCE32UCDJWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZFAR2GUZOSRML4JCE32UCDJWG/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-07-09T01:43:26Z","links":{"resolver":"https://pith.science/pith/FZFAR2GUZOSRML4JCE32UCDJWG","bundle":"https://pith.science/pith/FZFAR2GUZOSRML4JCE32UCDJWG/bundle.json","state":"https://pith.science/pith/FZFAR2GUZOSRML4JCE32UCDJWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZFAR2GUZOSRML4JCE32UCDJWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:FZFAR2GUZOSRML4JCE32UCDJWG","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":"234dff03b8f2b88cd3c978403b50b885fd123ef025129f590320c28cf8e2edcd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-04T12:09:35Z","title_canon_sha256":"0a5077a1601417ea4c1002979d762273ed1a5d25c37378f188ab0e796ce3261b"},"schema_version":"1.0","source":{"id":"2105.01442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.01442","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"2105.01442v1","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01442","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"FZFAR2GUZOSR","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_16","alias_value":"FZFAR2GUZOSRML4J","created_at":"2026-07-05T02:37:17Z"},{"alias_kind":"pith_short_8","alias_value":"FZFAR2GU","created_at":"2026-07-05T02:37:17Z"}],"graph_snapshots":[{"event_id":"sha256:e961015a28a81242cdae491062df5cc37f12badebc6e53f0c419e9fea8e7f891","target":"graph","created_at":"2026-07-05T02:37:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.01442/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Application domains that require considering relationships among objects which have real-valued attributes are becoming even more important. In this paper we propose NeuralLog, a first-order logic language that is compiled to a neural network. The main goal of NeuralLog is to bridge logic programming and deep learning, allowing advances in both fields to be combined in order to obtain better machine learning models. The main advantages of NeuralLog are: to allow neural networks to be defined as logic programs; and to be able to handle numeric attributes and functions. We compared NeuralLog wit","authors_text":"Victor Guimar\\~aes, V\\'itor Santos Costa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-04T12:09:35Z","title":"NeuralLog: a Neural Logic Language"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01442","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:10d4489578dd4be6d566aa1c92a9a45dd8707ea0e1bd518589a723602ebbd89b","target":"record","created_at":"2026-07-05T02:37:17Z","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":"234dff03b8f2b88cd3c978403b50b885fd123ef025129f590320c28cf8e2edcd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-04T12:09:35Z","title_canon_sha256":"0a5077a1601417ea4c1002979d762273ed1a5d25c37378f188ab0e796ce3261b"},"schema_version":"1.0","source":{"id":"2105.01442","kind":"arxiv","version":1}},"canonical_sha256":"2e4a08e8d4cba5162f891137aa0869b1b3fb849bc21b5a541a07f28a5d7924c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e4a08e8d4cba5162f891137aa0869b1b3fb849bc21b5a541a07f28a5d7924c5","first_computed_at":"2026-07-05T02:37:17.396538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:37:17.396538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iGIIGkoYUGH0q2ehbTwk42Il3PSCVL6XgVL6+6AditQaKaF3z1XuEQJOypuJLEGBxDQR9nou401uqFBFaSroDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:37:17.396953Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.01442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10d4489578dd4be6d566aa1c92a9a45dd8707ea0e1bd518589a723602ebbd89b","sha256:e961015a28a81242cdae491062df5cc37f12badebc6e53f0c419e9fea8e7f891"],"state_sha256":"28aeb8469dfaf0b364aa55b912690bb6077dff6087f3ab7cb7c7018f5e0cf060"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIqdrOUmS61R/otBkk0f/poPkZbbOpx50QWLSN85TnLV36HP1kSasfKGvGevrexIAeyEac9iESh3WLPKitXXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T01:43:26.630276Z","bundle_sha256":"bd1cda0657d1db6bb768acb8ac2cc2b3a7edf6c7e185d684dff640ce19110759"}}