{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MQBUCOMWUXZ2Q5KOLWDHW4R2QT","short_pith_number":"pith:MQBUCOMW","canonical_record":{"source":{"id":"1712.03049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T13:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"04d5849c8eb925d2f96fdd65d1152ad6c729c8a9792d59bce522671fb644a30a","abstract_canon_sha256":"96f7b845017cccc711213b9bbb9ae370c4d4689382019b30b99768bf83eae0db"},"schema_version":"1.0"},"canonical_sha256":"6403413996a5f3a8754e5d867b723a84e706397f599b5af63f02e45c87a3071c","source":{"kind":"arxiv","id":"1712.03049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03049","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03049v1","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03049","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"MQBUCOMWUXZ2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MQBUCOMWUXZ2Q5KO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MQBUCOMW","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MQBUCOMWUXZ2Q5KOLWDHW4R2QT","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T13:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"04d5849c8eb925d2f96fdd65d1152ad6c729c8a9792d59bce522671fb644a30a","abstract_canon_sha256":"96f7b845017cccc711213b9bbb9ae370c4d4689382019b30b99768bf83eae0db"},"schema_version":"1.0"},"canonical_sha256":"6403413996a5f3a8754e5d867b723a84e706397f599b5af63f02e45c87a3071c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:28.477527Z","signature_b64":"my0uo9UhtPTn5CXANWlbxJ4ZGsYqxNiynYZl9ZhMC63z8VQf9CxhagLP6pBkkAwxH8dDcei+pJqgU/oI7YmuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6403413996a5f3a8754e5d867b723a84e706397f599b5af63f02e45c87a3071c","last_reissued_at":"2026-05-18T00:28:28.476880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:28.476880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03049","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Afdbg57dFxC7L6tomuxCMe5VHoO7/+vfCGolPVWcqRFZorWg6Hbh15TML2fkE733PpdIdFch27nxx1Fteqv0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:39:53.794565Z"},"content_sha256":"10968310bd7d221171e79a077d6ef0f47a71e124536e89e9f9551e8555818677","schema_version":"1.0","event_id":"sha256:10968310bd7d221171e79a077d6ef0f47a71e124536e89e9f9551e8555818677"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MQBUCOMWUXZ2Q5KOLWDHW4R2QT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Artificial Neural Networks that Learn to Satisfy Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gadi Pinkas, Shimon Cohen","submitted_at":"2017-12-08T13:12:04Z","abstract_excerpt":"Logic-based problems such as planning, theorem proving, or puzzles, typically involve combinatoric search and structured knowledge representation. Artificial neural networks are very successful statistical learners, however, for many years, they have been criticized for their weaknesses in representing and in processing complex structured knowledge which is crucial for combinatoric search and symbol manipulation. Two neural architectures are presented, which can encode structured relational knowledge in neural activation, and store bounded First Order Logic constraints in connection weights. B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03049","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1MltGeWSR8JgKnZLJaHm1prNxHcGwGSiDsvF+T5Sj83KxbZeWmzw8iuIzsS90XCD+9TzqbpnkezmaGjtUv5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:39:53.795231Z"},"content_sha256":"d59e457b431ce3bdc0a07c0d951d1207b0c8956a015082c8e7bddfd8793ca6cf","schema_version":"1.0","event_id":"sha256:d59e457b431ce3bdc0a07c0d951d1207b0c8956a015082c8e7bddfd8793ca6cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQBUCOMWUXZ2Q5KOLWDHW4R2QT/bundle.json","state_url":"https://pith.science/pith/MQBUCOMWUXZ2Q5KOLWDHW4R2QT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQBUCOMWUXZ2Q5KOLWDHW4R2QT/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-07T16:39:53Z","links":{"resolver":"https://pith.science/pith/MQBUCOMWUXZ2Q5KOLWDHW4R2QT","bundle":"https://pith.science/pith/MQBUCOMWUXZ2Q5KOLWDHW4R2QT/bundle.json","state":"https://pith.science/pith/MQBUCOMWUXZ2Q5KOLWDHW4R2QT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQBUCOMWUXZ2Q5KOLWDHW4R2QT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MQBUCOMWUXZ2Q5KOLWDHW4R2QT","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":"96f7b845017cccc711213b9bbb9ae370c4d4689382019b30b99768bf83eae0db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T13:12:04Z","title_canon_sha256":"04d5849c8eb925d2f96fdd65d1152ad6c729c8a9792d59bce522671fb644a30a"},"schema_version":"1.0","source":{"id":"1712.03049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03049","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03049v1","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03049","created_at":"2026-05-18T00:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"MQBUCOMWUXZ2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MQBUCOMWUXZ2Q5KO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MQBUCOMW","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:d59e457b431ce3bdc0a07c0d951d1207b0c8956a015082c8e7bddfd8793ca6cf","target":"graph","created_at":"2026-05-18T00:28:28Z","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":"Logic-based problems such as planning, theorem proving, or puzzles, typically involve combinatoric search and structured knowledge representation. Artificial neural networks are very successful statistical learners, however, for many years, they have been criticized for their weaknesses in representing and in processing complex structured knowledge which is crucial for combinatoric search and symbol manipulation. Two neural architectures are presented, which can encode structured relational knowledge in neural activation, and store bounded First Order Logic constraints in connection weights. B","authors_text":"Gadi Pinkas, Shimon Cohen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T13:12:04Z","title":"Artificial Neural Networks that Learn to Satisfy Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03049","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:10968310bd7d221171e79a077d6ef0f47a71e124536e89e9f9551e8555818677","target":"record","created_at":"2026-05-18T00:28:28Z","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":"96f7b845017cccc711213b9bbb9ae370c4d4689382019b30b99768bf83eae0db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T13:12:04Z","title_canon_sha256":"04d5849c8eb925d2f96fdd65d1152ad6c729c8a9792d59bce522671fb644a30a"},"schema_version":"1.0","source":{"id":"1712.03049","kind":"arxiv","version":1}},"canonical_sha256":"6403413996a5f3a8754e5d867b723a84e706397f599b5af63f02e45c87a3071c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6403413996a5f3a8754e5d867b723a84e706397f599b5af63f02e45c87a3071c","first_computed_at":"2026-05-18T00:28:28.476880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:28.476880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"my0uo9UhtPTn5CXANWlbxJ4ZGsYqxNiynYZl9ZhMC63z8VQf9CxhagLP6pBkkAwxH8dDcei+pJqgU/oI7YmuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:28.477527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10968310bd7d221171e79a077d6ef0f47a71e124536e89e9f9551e8555818677","sha256:d59e457b431ce3bdc0a07c0d951d1207b0c8956a015082c8e7bddfd8793ca6cf"],"state_sha256":"145126cb888d2c93c9d5d5739e6a2e3f8662cc2b520d103840ad33592bd8c55d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47Ry1h3L8ARLkDJvYYx9KB/ganHcaWEQaE+HZB0THYxkseEtTNFoyiOQj6tfy/79izyZ87hEkpG09PtTjsU2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:39:53.799211Z","bundle_sha256":"48722deb69267c8d82d9b299a38caaed56214a2a920c2c60455e98086c24174d"}}