{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RSMQGWEQEVDVJ3S2KJZFXXPQGR","short_pith_number":"pith:RSMQGWEQ","canonical_record":{"source":{"id":"1904.02996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T11:29:57Z","cross_cats_sorted":[],"title_canon_sha256":"d0ce8b54ef124fb32b8f86750bb734af39f6eab79fd251b00890e864ccb0b28a","abstract_canon_sha256":"2fb2ddad97866d547485499a86acf88b04a10ead98b0996f1598b3c34cdeab27"},"schema_version":"1.0"},"canonical_sha256":"8c99035890254754ee5a52725bddf03450ccc4e497dd69eddd35d5c912c00ca2","source":{"kind":"arxiv","id":"1904.02996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02996","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02996v1","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02996","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"RSMQGWEQEVDV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RSMQGWEQEVDVJ3S2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RSMQGWEQ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RSMQGWEQEVDVJ3S2KJZFXXPQGR","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T11:29:57Z","cross_cats_sorted":[],"title_canon_sha256":"d0ce8b54ef124fb32b8f86750bb734af39f6eab79fd251b00890e864ccb0b28a","abstract_canon_sha256":"2fb2ddad97866d547485499a86acf88b04a10ead98b0996f1598b3c34cdeab27"},"schema_version":"1.0"},"canonical_sha256":"8c99035890254754ee5a52725bddf03450ccc4e497dd69eddd35d5c912c00ca2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.948347Z","signature_b64":"bqKb5LEXjgQyCfBxgISkRTjX+lkSF/N3n7HMIJQUI9bf17+aVhXtT6HPR6tsNhL3Fgz4vK7IBVFZzLYnqStLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c99035890254754ee5a52725bddf03450ccc4e497dd69eddd35d5c912c00ca2","last_reissued_at":"2026-05-17T23:49:18.947754Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.947754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02996","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:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uROT1IL96Za8/ds3g+b1QSrCBUS4/LFiII44SZrzcmt9ev2Q4Af+CVkJC5kr9xdO5GpLU2SfITcZShcNS6GfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T05:58:20.823019Z"},"content_sha256":"efd3de4d44d7dea89dbdd79f845189a0c5c9244d30d047e678fdbf95a7b96ed4","schema_version":"1.0","event_id":"sha256:efd3de4d44d7dea89dbdd79f845189a0c5c9244d30d047e678fdbf95a7b96ed4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RSMQGWEQEVDVJ3S2KJZFXXPQGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating Knowledge Graph Paths from Textual Definitions using Sequence-to-Sequence Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Mohammad Taher Pilehvar, Nigel Collier, Victor Prokhorov","submitted_at":"2019-04-05T11:29:57Z","abstract_excerpt":"We present a novel method for mapping unrestricted text to knowledge graph entities by framing the task as a sequence-to-sequence problem. Specifically, given the encoded state of an input text, our decoder directly predicts paths in the knowledge graph, starting from the root and ending at the target node following hypernym-hyponym relationships. In this way, and in contrast to other text-to-entity mapping systems, our model outputs hierarchically structured predictions that are fully interpretable in the context of the underlying ontology, in an end-to-end manner. We present a proof-of-conce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02996","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:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHQwJcjFI/A+kcY1jMppalfc8QvlYEOfX+PvY5qFgmKYxpBPLmuEIHCHkPYTGZj58R7bnhljELxNSokyfBBOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T05:58:20.823616Z"},"content_sha256":"277f41ea9b7d0da6fd0eb5911118a51cd8eae35439fbafb55bf5c37925575897","schema_version":"1.0","event_id":"sha256:277f41ea9b7d0da6fd0eb5911118a51cd8eae35439fbafb55bf5c37925575897"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSMQGWEQEVDVJ3S2KJZFXXPQGR/bundle.json","state_url":"https://pith.science/pith/RSMQGWEQEVDVJ3S2KJZFXXPQGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSMQGWEQEVDVJ3S2KJZFXXPQGR/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-07-04T05:58:20Z","links":{"resolver":"https://pith.science/pith/RSMQGWEQEVDVJ3S2KJZFXXPQGR","bundle":"https://pith.science/pith/RSMQGWEQEVDVJ3S2KJZFXXPQGR/bundle.json","state":"https://pith.science/pith/RSMQGWEQEVDVJ3S2KJZFXXPQGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSMQGWEQEVDVJ3S2KJZFXXPQGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RSMQGWEQEVDVJ3S2KJZFXXPQGR","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":"2fb2ddad97866d547485499a86acf88b04a10ead98b0996f1598b3c34cdeab27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T11:29:57Z","title_canon_sha256":"d0ce8b54ef124fb32b8f86750bb734af39f6eab79fd251b00890e864ccb0b28a"},"schema_version":"1.0","source":{"id":"1904.02996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02996","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02996v1","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02996","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"RSMQGWEQEVDV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RSMQGWEQEVDVJ3S2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RSMQGWEQ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:277f41ea9b7d0da6fd0eb5911118a51cd8eae35439fbafb55bf5c37925575897","target":"graph","created_at":"2026-05-17T23:49:18Z","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 a novel method for mapping unrestricted text to knowledge graph entities by framing the task as a sequence-to-sequence problem. Specifically, given the encoded state of an input text, our decoder directly predicts paths in the knowledge graph, starting from the root and ending at the target node following hypernym-hyponym relationships. In this way, and in contrast to other text-to-entity mapping systems, our model outputs hierarchically structured predictions that are fully interpretable in the context of the underlying ontology, in an end-to-end manner. We present a proof-of-conce","authors_text":"Mohammad Taher Pilehvar, Nigel Collier, Victor Prokhorov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T11:29:57Z","title":"Generating Knowledge Graph Paths from Textual Definitions using Sequence-to-Sequence Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02996","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:efd3de4d44d7dea89dbdd79f845189a0c5c9244d30d047e678fdbf95a7b96ed4","target":"record","created_at":"2026-05-17T23:49:18Z","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":"2fb2ddad97866d547485499a86acf88b04a10ead98b0996f1598b3c34cdeab27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-05T11:29:57Z","title_canon_sha256":"d0ce8b54ef124fb32b8f86750bb734af39f6eab79fd251b00890e864ccb0b28a"},"schema_version":"1.0","source":{"id":"1904.02996","kind":"arxiv","version":1}},"canonical_sha256":"8c99035890254754ee5a52725bddf03450ccc4e497dd69eddd35d5c912c00ca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c99035890254754ee5a52725bddf03450ccc4e497dd69eddd35d5c912c00ca2","first_computed_at":"2026-05-17T23:49:18.947754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:18.947754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bqKb5LEXjgQyCfBxgISkRTjX+lkSF/N3n7HMIJQUI9bf17+aVhXtT6HPR6tsNhL3Fgz4vK7IBVFZzLYnqStLBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:18.948347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efd3de4d44d7dea89dbdd79f845189a0c5c9244d30d047e678fdbf95a7b96ed4","sha256:277f41ea9b7d0da6fd0eb5911118a51cd8eae35439fbafb55bf5c37925575897"],"state_sha256":"b049c997a2f93eb0dbc3788e04f8fbdf6289d0d7d6cc817fce593bcafa87204b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6/RZEsTmKu3Ix9ftiTN1/5WVeZN0M8BJvvd+ljV9WfNgvfkPUpagj04GeeijxKKRnFfrVjIc24XVsYV/sIAjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T05:58:20.826692Z","bundle_sha256":"6f55955482a7341b26b73b04ad91d697b87df317adbcda935414e80c0b4dac0d"}}