{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NHZUWRAWEASNIHXQGS2ODZM7K4","short_pith_number":"pith:NHZUWRAW","schema_version":"1.0","canonical_sha256":"69f34b44162024d41ef034b4e1e59f572eb0796875081e116f0f88f792a79fde","source":{"kind":"arxiv","id":"1906.08495","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic Logic Neural Networks for Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Tang, Meng Qu","submitted_at":"2019-06-20T08:22:26Z","abstract_excerpt":"Knowledge graph reasoning, which aims at predicting the missing facts through reasoning with the observed facts, is critical to many applications. Such a problem has been widely explored by traditional logic rule-based approaches and recent knowledge graph embedding methods. A principled logic rule-based approach is the Markov Logic Network (MLN), which is able to leverage domain knowledge with first-order logic and meanwhile handle their uncertainty. However, the inference of MLNs is usually very difficult due to the complicated graph structures. Different from MLNs, knowledge graph embedding"},"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":"1906.08495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T08:22:26Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"cac45ea3e7d179034e2620392763d31a3329664d04e2a4ad470ef9348f7509aa","abstract_canon_sha256":"2cc0ca532fa43fda4e60e9a71d64b3e345ca6a8f361ed57913cada3f87d937f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:37.987059Z","signature_b64":"5MbsfJJXYNQAPdQFh83gok4771mN4ImAxdZvxBvUaWaZU0eYp8qA2veWRP6wwWS8DkkEQdj7pcORCDpQH6/lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69f34b44162024d41ef034b4e1e59f572eb0796875081e116f0f88f792a79fde","last_reissued_at":"2026-07-05T00:15:37.986585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:37.986585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Logic Neural Networks for Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Tang, Meng Qu","submitted_at":"2019-06-20T08:22:26Z","abstract_excerpt":"Knowledge graph reasoning, which aims at predicting the missing facts through reasoning with the observed facts, is critical to many applications. Such a problem has been widely explored by traditional logic rule-based approaches and recent knowledge graph embedding methods. A principled logic rule-based approach is the Markov Logic Network (MLN), which is able to leverage domain knowledge with first-order logic and meanwhile handle their uncertainty. However, the inference of MLNs is usually very difficult due to the complicated graph structures. Different from MLNs, knowledge graph embedding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08495","kind":"arxiv","version":2},"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/1906.08495/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.08495","created_at":"2026-07-05T00:15:37.986643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08495v2","created_at":"2026-07-05T00:15:37.986643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08495","created_at":"2026-07-05T00:15:37.986643+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHZUWRAWEASN","created_at":"2026-07-05T00:15:37.986643+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHZUWRAWEASNIHXQ","created_at":"2026-07-05T00:15:37.986643+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHZUWRAW","created_at":"2026-07-05T00:15:37.986643+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/NHZUWRAWEASNIHXQGS2ODZM7K4","json":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4.json","graph_json":"https://pith.science/api/pith-number/NHZUWRAWEASNIHXQGS2ODZM7K4/graph.json","events_json":"https://pith.science/api/pith-number/NHZUWRAWEASNIHXQGS2ODZM7K4/events.json","paper":"https://pith.science/paper/NHZUWRAW"},"agent_actions":{"view_html":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4","download_json":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4.json","view_paper":"https://pith.science/paper/NHZUWRAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08495&json=true","fetch_graph":"https://pith.science/api/pith-number/NHZUWRAWEASNIHXQGS2ODZM7K4/graph.json","fetch_events":"https://pith.science/api/pith-number/NHZUWRAWEASNIHXQGS2ODZM7K4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4/action/storage_attestation","attest_author":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4/action/author_attestation","sign_citation":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4/action/citation_signature","submit_replication":"https://pith.science/pith/NHZUWRAWEASNIHXQGS2ODZM7K4/action/replication_record"}},"created_at":"2026-07-05T00:15:37.986643+00:00","updated_at":"2026-07-05T00:15:37.986643+00:00"}