{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:UI4SKVFTZUYRKSH3RWZKK3SLLK","short_pith_number":"pith:UI4SKVFT","canonical_record":{"source":{"id":"2001.11850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-29T23:34:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"75fcaa64772027f72461931106a718e12cd13d8f309ec3c975b3764e8e8769ec","abstract_canon_sha256":"a2f12c07fd737e97ed210157c7702e6df41402bbd354c6e6df683232af0e1f7b"},"schema_version":"1.0"},"canonical_sha256":"a2392554b3cd311548fb8db2a56e4b5a9c3f1256ef6e4f8b17c5f398f0aff96b","source":{"kind":"arxiv","id":"2001.11850","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11850","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11850v2","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11850","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"pith_short_12","alias_value":"UI4SKVFTZUYR","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"pith_short_16","alias_value":"UI4SKVFTZUYRKSH3","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"pith_short_8","alias_value":"UI4SKVFT","created_at":"2026-07-05T00:38:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:UI4SKVFTZUYRKSH3RWZKK3SLLK","target":"record","payload":{"canonical_record":{"source":{"id":"2001.11850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-29T23:34:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"75fcaa64772027f72461931106a718e12cd13d8f309ec3c975b3764e8e8769ec","abstract_canon_sha256":"a2f12c07fd737e97ed210157c7702e6df41402bbd354c6e6df683232af0e1f7b"},"schema_version":"1.0"},"canonical_sha256":"a2392554b3cd311548fb8db2a56e4b5a9c3f1256ef6e4f8b17c5f398f0aff96b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:13.182734Z","signature_b64":"nuKzeGntOkIT0xLVPODMmwxTFFM8HD6RAxoW1G+QETwshQJWSTNycw4WXYjuXQbxkMItkrfWNTUMQReI3pM0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2392554b3cd311548fb8db2a56e4b5a9c3f1256ef6e4f8b17c5f398f0aff96b","last_reissued_at":"2026-07-05T00:38:13.182000Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:13.182000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.11850","source_version":2,"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-05T00:38:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skgG5YOPp9iQBYYGbRMsvRU68RbwKkSFNmS1YdZn21Cylu8aPLg6Ud9aXHyHRmMyinYFfdy8SuNMAF/FYe3xCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:29:37.148298Z"},"content_sha256":"6758bb1d7178020334d65fcd3acbabebb6b9afd53c0b09d78598deb72407e33a","schema_version":"1.0","event_id":"sha256:6758bb1d7178020334d65fcd3acbabebb6b9afd53c0b09d78598deb72407e33a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:UI4SKVFTZUYRKSH3RWZKK3SLLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Probabilistic Logic Reasoning with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Arun Ramamurthy, Bo Li, Le Song, Xinshi Chen, Yuan Qi, Yuan Yang, Yuyu Zhang","submitted_at":"2020-01-29T23:34:36Z","abstract_excerpt":"Markov Logic Networks (MLNs), which elegantly combine logic rules and probabilistic graphical models, can be used to address many knowledge graph problems. However, inference in MLN is computationally intensive, making the industrial-scale application of MLN very difficult. In recent years, graph neural networks (GNNs) have emerged as efficient and effective tools for large-scale graph problems. Nevertheless, GNNs do not explicitly incorporate prior logic rules into the models, and may require many labeled examples for a target task. In this paper, we explore the combination of MLNs and GNNs, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11850","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/2001.11850/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-05T00:38:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIfZKy1V5Q9gRLJ4brw4FepCH7iGL/wGvjG8QQ16rktOe7as9nn7Q5Ueg8TtJ0Wvbo9APHkOk+1UPTyI1hmSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:29:37.149278Z"},"content_sha256":"6b4e8489866d5c446a26009876e0dc3812b7e44d8da602120cb8d1ccbef4e495","schema_version":"1.0","event_id":"sha256:6b4e8489866d5c446a26009876e0dc3812b7e44d8da602120cb8d1ccbef4e495"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UI4SKVFTZUYRKSH3RWZKK3SLLK/bundle.json","state_url":"https://pith.science/pith/UI4SKVFTZUYRKSH3RWZKK3SLLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UI4SKVFTZUYRKSH3RWZKK3SLLK/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-08-07T21:29:37Z","links":{"resolver":"https://pith.science/pith/UI4SKVFTZUYRKSH3RWZKK3SLLK","bundle":"https://pith.science/pith/UI4SKVFTZUYRKSH3RWZKK3SLLK/bundle.json","state":"https://pith.science/pith/UI4SKVFTZUYRKSH3RWZKK3SLLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UI4SKVFTZUYRKSH3RWZKK3SLLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:UI4SKVFTZUYRKSH3RWZKK3SLLK","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":"a2f12c07fd737e97ed210157c7702e6df41402bbd354c6e6df683232af0e1f7b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-29T23:34:36Z","title_canon_sha256":"75fcaa64772027f72461931106a718e12cd13d8f309ec3c975b3764e8e8769ec"},"schema_version":"1.0","source":{"id":"2001.11850","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11850","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11850v2","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11850","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"pith_short_12","alias_value":"UI4SKVFTZUYR","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"pith_short_16","alias_value":"UI4SKVFTZUYRKSH3","created_at":"2026-07-05T00:38:13Z"},{"alias_kind":"pith_short_8","alias_value":"UI4SKVFT","created_at":"2026-07-05T00:38:13Z"}],"graph_snapshots":[{"event_id":"sha256:6b4e8489866d5c446a26009876e0dc3812b7e44d8da602120cb8d1ccbef4e495","target":"graph","created_at":"2026-07-05T00:38:13Z","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/2001.11850/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Markov Logic Networks (MLNs), which elegantly combine logic rules and probabilistic graphical models, can be used to address many knowledge graph problems. However, inference in MLN is computationally intensive, making the industrial-scale application of MLN very difficult. In recent years, graph neural networks (GNNs) have emerged as efficient and effective tools for large-scale graph problems. Nevertheless, GNNs do not explicitly incorporate prior logic rules into the models, and may require many labeled examples for a target task. In this paper, we explore the combination of MLNs and GNNs, ","authors_text":"Arun Ramamurthy, Bo Li, Le Song, Xinshi Chen, Yuan Qi, Yuan Yang, Yuyu Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-29T23:34:36Z","title":"Efficient Probabilistic Logic Reasoning with Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11850","kind":"arxiv","version":2},"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:6758bb1d7178020334d65fcd3acbabebb6b9afd53c0b09d78598deb72407e33a","target":"record","created_at":"2026-07-05T00:38:13Z","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":"a2f12c07fd737e97ed210157c7702e6df41402bbd354c6e6df683232af0e1f7b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-29T23:34:36Z","title_canon_sha256":"75fcaa64772027f72461931106a718e12cd13d8f309ec3c975b3764e8e8769ec"},"schema_version":"1.0","source":{"id":"2001.11850","kind":"arxiv","version":2}},"canonical_sha256":"a2392554b3cd311548fb8db2a56e4b5a9c3f1256ef6e4f8b17c5f398f0aff96b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2392554b3cd311548fb8db2a56e4b5a9c3f1256ef6e4f8b17c5f398f0aff96b","first_computed_at":"2026-07-05T00:38:13.182000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:38:13.182000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nuKzeGntOkIT0xLVPODMmwxTFFM8HD6RAxoW1G+QETwshQJWSTNycw4WXYjuXQbxkMItkrfWNTUMQReI3pM0Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:38:13.182734Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.11850","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6758bb1d7178020334d65fcd3acbabebb6b9afd53c0b09d78598deb72407e33a","sha256:6b4e8489866d5c446a26009876e0dc3812b7e44d8da602120cb8d1ccbef4e495"],"state_sha256":"02c0ce70677941723432e521a2a23974571c712c61c470f09d36081ea297df4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1mLrjSEhtD4tol+dQ+9M57BCP1Zajhhj1wzMUEJjvg63vr+usyuJ/AIJ8hm0maNzreRyzSe7yO+jQKoNOHXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T21:29:37.155158Z","bundle_sha256":"91b9f7e41603305599eccc4e17d453b095c2bdb96962bffc3b87ad25691f9e38"}}