{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:POSAWUJHNHWZTMA5XVHKYH5QN6","short_pith_number":"pith:POSAWUJH","schema_version":"1.0","canonical_sha256":"7ba40b512769ed99b01dbd4eac1fb06fb0289bfd27f61883d31c4f1d75baf91a","source":{"kind":"arxiv","id":"1807.08204","version":1},"attestation_state":"computed","paper":{"title":"Towards Neural Theorem Proving at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Matko Bosnjak, Pasquale Minervini, Sebastian Riedel, Tim Rockt\\\"aschel","submitted_at":"2018-07-21T20:48:53Z","abstract_excerpt":"Neural models combining representation learning and reasoning in an end-to-end trainable manner are receiving increasing interest. However, their use is severely limited by their computational complexity, which renders them unusable on real world datasets. We focus on the Neural Theorem Prover (NTP) model proposed by Rockt{\\\"{a}}schel and Riedel (2017), a continuous relaxation of the Prolog backward chaining algorithm where unification between terms is replaced by the similarity between their embedding representations. For answering a given query, this model needs to consider all possible proo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.08204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-21T20:48:53Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7122e789f4995ec51f14df48e872b39a8e878cbe4b064e330139be66fcbb61b6","abstract_canon_sha256":"0174c76306bbc0c955b177e0f57d689f1c948a10503aada8458b39bd65656e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.937453Z","signature_b64":"+0aHQgUKjzXmM2UP+Exovotgvgcd91LWyhX2YActgW16ST/hwrpGWMOhQwcSprzpGGSC9QuLguTeCRV3p0+rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ba40b512769ed99b01dbd4eac1fb06fb0289bfd27f61883d31c4f1d75baf91a","last_reissued_at":"2026-05-18T00:10:08.936821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.936821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Neural Theorem Proving at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Matko Bosnjak, Pasquale Minervini, Sebastian Riedel, Tim Rockt\\\"aschel","submitted_at":"2018-07-21T20:48:53Z","abstract_excerpt":"Neural models combining representation learning and reasoning in an end-to-end trainable manner are receiving increasing interest. However, their use is severely limited by their computational complexity, which renders them unusable on real world datasets. We focus on the Neural Theorem Prover (NTP) model proposed by Rockt{\\\"{a}}schel and Riedel (2017), a continuous relaxation of the Prolog backward chaining algorithm where unification between terms is replaced by the similarity between their embedding representations. For answering a given query, this model needs to consider all possible proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08204","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.08204","created_at":"2026-05-18T00:10:08.936915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08204v1","created_at":"2026-05-18T00:10:08.936915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08204","created_at":"2026-05-18T00:10:08.936915+00:00"},{"alias_kind":"pith_short_12","alias_value":"POSAWUJHNHWZ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"POSAWUJHNHWZTMA5","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"POSAWUJH","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6","json":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6.json","graph_json":"https://pith.science/api/pith-number/POSAWUJHNHWZTMA5XVHKYH5QN6/graph.json","events_json":"https://pith.science/api/pith-number/POSAWUJHNHWZTMA5XVHKYH5QN6/events.json","paper":"https://pith.science/paper/POSAWUJH"},"agent_actions":{"view_html":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6","download_json":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6.json","view_paper":"https://pith.science/paper/POSAWUJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08204&json=true","fetch_graph":"https://pith.science/api/pith-number/POSAWUJHNHWZTMA5XVHKYH5QN6/graph.json","fetch_events":"https://pith.science/api/pith-number/POSAWUJHNHWZTMA5XVHKYH5QN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6/action/storage_attestation","attest_author":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6/action/author_attestation","sign_citation":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6/action/citation_signature","submit_replication":"https://pith.science/pith/POSAWUJHNHWZTMA5XVHKYH5QN6/action/replication_record"}},"created_at":"2026-05-18T00:10:08.936915+00:00","updated_at":"2026-05-18T00:10:08.936915+00:00"}