{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2ELYND6QGFM5USWXUPG6ZXQDOR","short_pith_number":"pith:2ELYND6Q","canonical_record":{"source":{"id":"1905.10417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T19:20:03Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"5d4ca0dde3fc26d44c4bbb494cbe95be6aa961a788906c5f92fb7198b97ac225","abstract_canon_sha256":"494e1e73e2b73bf0567c0b0af9a8fe1fc8cd4c2e1eb6e05c7eeda987faf910d9"},"schema_version":"1.0"},"canonical_sha256":"d117868fd03159da4ad7a3cdecde037447ab34813e17d97c024c354f07d1170c","source":{"kind":"arxiv","id":"1905.10417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10417","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10417v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10417","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"2ELYND6QGFM5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2ELYND6QGFM5USWX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2ELYND6Q","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2ELYND6QGFM5USWXUPG6ZXQDOR","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T19:20:03Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"5d4ca0dde3fc26d44c4bbb494cbe95be6aa961a788906c5f92fb7198b97ac225","abstract_canon_sha256":"494e1e73e2b73bf0567c0b0af9a8fe1fc8cd4c2e1eb6e05c7eeda987faf910d9"},"schema_version":"1.0"},"canonical_sha256":"d117868fd03159da4ad7a3cdecde037447ab34813e17d97c024c354f07d1170c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.603955Z","signature_b64":"UIPKZosHw+/eK7TcP5TIYFQTE8Y727TrkdcBY25qrhJH6B8F+3kEOMFzyQVLk9wQcsOcMIOer+NyUV+DvxakCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d117868fd03159da4ad7a3cdecde037447ab34813e17d97c024c354f07d1170c","last_reissued_at":"2026-05-17T23:45:08.603154Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.603154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10417","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-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fhlm6iiU+qrrPGdrGn/6Om1UaGW9MxLm4N72A/kMHJFnUPKrFZVgAsize4/xXDYeqhJQLjuzCMR98PYTsxuqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:24:15.132336Z"},"content_sha256":"82f3597e33e141a111a10c5a7c10bce345a82fd027296e464efd03e539cb802a","schema_version":"1.0","event_id":"sha256:82f3597e33e141a111a10c5a7c10bce345a82fd027296e464efd03e539cb802a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2ELYND6QGFM5USWXUPG6ZXQDOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentiable Representations For Multihop Inference Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Haitian Sun, Matthew Siegler, R. Alex Hofer, William W. Cohen","submitted_at":"2019-05-24T19:20:03Z","abstract_excerpt":"We present efficient differentiable implementations of second-order multi-hop reasoning using a large symbolic knowledge base (KB). We introduce a new operation which can be used to compositionally construct second-order multi-hop templates in a neural model, and evaluate a number of alternative implementations, with different time and memory trade offs. These techniques scale to KBs with millions of entities and tens of millions of triples, and lead to simple models with competitive performance on several learning tasks requiring multi-hop reasoning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10417","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-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bx1yUipQSDv0LYesdiB08j9lngDp/jwywpiS9hgoE/8iSF7B9oKsK5aQt8qMtOZp0jg8KuNewPlxF7kZTuHzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:24:15.132696Z"},"content_sha256":"4032597ea1a0e8bbdbafc0bebc935865e6d325664cc8f95c3451a0b6e276f1d6","schema_version":"1.0","event_id":"sha256:4032597ea1a0e8bbdbafc0bebc935865e6d325664cc8f95c3451a0b6e276f1d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ELYND6QGFM5USWXUPG6ZXQDOR/bundle.json","state_url":"https://pith.science/pith/2ELYND6QGFM5USWXUPG6ZXQDOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ELYND6QGFM5USWXUPG6ZXQDOR/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-01T06:24:15Z","links":{"resolver":"https://pith.science/pith/2ELYND6QGFM5USWXUPG6ZXQDOR","bundle":"https://pith.science/pith/2ELYND6QGFM5USWXUPG6ZXQDOR/bundle.json","state":"https://pith.science/pith/2ELYND6QGFM5USWXUPG6ZXQDOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ELYND6QGFM5USWXUPG6ZXQDOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2ELYND6QGFM5USWXUPG6ZXQDOR","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":"494e1e73e2b73bf0567c0b0af9a8fe1fc8cd4c2e1eb6e05c7eeda987faf910d9","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T19:20:03Z","title_canon_sha256":"5d4ca0dde3fc26d44c4bbb494cbe95be6aa961a788906c5f92fb7198b97ac225"},"schema_version":"1.0","source":{"id":"1905.10417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10417","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10417v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10417","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"2ELYND6QGFM5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2ELYND6QGFM5USWX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2ELYND6Q","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:4032597ea1a0e8bbdbafc0bebc935865e6d325664cc8f95c3451a0b6e276f1d6","target":"graph","created_at":"2026-05-17T23:45:08Z","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":"We present efficient differentiable implementations of second-order multi-hop reasoning using a large symbolic knowledge base (KB). We introduce a new operation which can be used to compositionally construct second-order multi-hop templates in a neural model, and evaluate a number of alternative implementations, with different time and memory trade offs. These techniques scale to KBs with millions of entities and tens of millions of triples, and lead to simple models with competitive performance on several learning tasks requiring multi-hop reasoning.","authors_text":"Haitian Sun, Matthew Siegler, R. Alex Hofer, William W. Cohen","cross_cats":["cs.AI","cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T19:20:03Z","title":"Differentiable Representations For Multihop Inference Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10417","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:82f3597e33e141a111a10c5a7c10bce345a82fd027296e464efd03e539cb802a","target":"record","created_at":"2026-05-17T23:45:08Z","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":"494e1e73e2b73bf0567c0b0af9a8fe1fc8cd4c2e1eb6e05c7eeda987faf910d9","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T19:20:03Z","title_canon_sha256":"5d4ca0dde3fc26d44c4bbb494cbe95be6aa961a788906c5f92fb7198b97ac225"},"schema_version":"1.0","source":{"id":"1905.10417","kind":"arxiv","version":1}},"canonical_sha256":"d117868fd03159da4ad7a3cdecde037447ab34813e17d97c024c354f07d1170c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d117868fd03159da4ad7a3cdecde037447ab34813e17d97c024c354f07d1170c","first_computed_at":"2026-05-17T23:45:08.603154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.603154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UIPKZosHw+/eK7TcP5TIYFQTE8Y727TrkdcBY25qrhJH6B8F+3kEOMFzyQVLk9wQcsOcMIOer+NyUV+DvxakCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.603955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82f3597e33e141a111a10c5a7c10bce345a82fd027296e464efd03e539cb802a","sha256:4032597ea1a0e8bbdbafc0bebc935865e6d325664cc8f95c3451a0b6e276f1d6"],"state_sha256":"8cb049897756ad8161a213e67c9985d2a50592aff92292fad3fd292afebae795"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7i5cf8f3DrxDiHYd5Jb1x8y8tJ8rGGl+tFK4QNmk0AlhmBOEEOOGhM0SyMx8jEPd4NchLl+FQw4N/JgeYVVWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:24:15.134998Z","bundle_sha256":"eadd07b2c9e6a81af297047ca207a5034554a3ec1cdd5c359e5af46ceb79a789"}}