{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KYPAE4564J5756CKRNOVY3VNJ7","short_pith_number":"pith:KYPAE456","canonical_record":{"source":{"id":"1804.08887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-24T08:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"b9c11298f8e8806d41b60eec60a49ab11df3449fe3fdd557a5dc6d6cf9eae345","abstract_canon_sha256":"d03f568c626c648b20ff5e805cee21d036b71d929018a04309806b848cd82b19"},"schema_version":"1.0"},"canonical_sha256":"561e0273bee27bfef84a8b5d5c6ead4feb56dc15e70282968b8d271d948ff909","source":{"kind":"arxiv","id":"1804.08887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08887","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08887v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08887","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KYPAE4564J57","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYPAE4564J5756CK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYPAE456","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KYPAE4564J5756CKRNOVY3VNJ7","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-24T08:10:07Z","cross_cats_sorted":[],"title_canon_sha256":"b9c11298f8e8806d41b60eec60a49ab11df3449fe3fdd557a5dc6d6cf9eae345","abstract_canon_sha256":"d03f568c626c648b20ff5e805cee21d036b71d929018a04309806b848cd82b19"},"schema_version":"1.0"},"canonical_sha256":"561e0273bee27bfef84a8b5d5c6ead4feb56dc15e70282968b8d271d948ff909","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.986120Z","signature_b64":"aJOlrrUMwuSEqaErjEGZj3TJu1WrCdwx25YmwCPbC5yWrAg4Om9BfNq2O2+f8PuKU1Nkv0XxuHOgmC5w24qyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"561e0273bee27bfef84a8b5d5c6ead4feb56dc15e70282968b8d271d948ff909","last_reissued_at":"2026-05-18T00:17:36.985444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.985444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08887","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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQcaTxPFJOXOD2lvWZAbKz0WQ+1L2DdVKDou2/RAWeTttLSsdG6hAY3row4Zh8lBwJRHU+IoM+JxA5xJeZFQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:06:04.489017Z"},"content_sha256":"ce923cf6be71535c9522f18ab5df887e76ec8fb5f137e1a5a7aa495eab3bb698","schema_version":"1.0","event_id":"sha256:ce923cf6be71535c9522f18ab5df887e76ec8fb5f137e1a5a7aa495eab3bb698"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KYPAE4564J5756CKRNOVY3VNJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SIRIUS-LTG-UiO at SemEval-2018 Task 7: Convolutional Neural Networks with Shortest Dependency Paths for Semantic Relation Extraction and Classification in Scientific Papers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Farhad Nooralahzadeh, Jan Tore L{\\o}nning, Lilja {\\O}vrelid","submitted_at":"2018-04-24T08:10:07Z","abstract_excerpt":"This article presents the SIRIUS-LTG-UiO system for the SemEval 2018 Task 7 on Semantic Relation Extraction and Classification in Scientific Papers. First we extract the shortest dependency path (sdp) between two entities, then we introduce a convolutional neural network (CNN) which takes the shortest dependency path embeddings as input and performs relation classification with differing objectives for each subtask of the shared task. This approach achieved overall F1 scores of 76.7 and 83.2 for relation classification on clean and noisy data, respectively. Furthermore, for combined relation e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08887","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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfOluCR7Dnr1VbOprcSoMOxGERiZmzsCBqeTxHVCC/m6iJ3qai+H+aTo0YtpKU2SVVUOoybKXpESYmY3EfAUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:06:04.489379Z"},"content_sha256":"04f9e1ec6a734ad523f2e708ce7e619cdb90e66e1034e6f88a7bae3b04f9bcd0","schema_version":"1.0","event_id":"sha256:04f9e1ec6a734ad523f2e708ce7e619cdb90e66e1034e6f88a7bae3b04f9bcd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYPAE4564J5756CKRNOVY3VNJ7/bundle.json","state_url":"https://pith.science/pith/KYPAE4564J5756CKRNOVY3VNJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYPAE4564J5756CKRNOVY3VNJ7/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-05-28T16:06:04Z","links":{"resolver":"https://pith.science/pith/KYPAE4564J5756CKRNOVY3VNJ7","bundle":"https://pith.science/pith/KYPAE4564J5756CKRNOVY3VNJ7/bundle.json","state":"https://pith.science/pith/KYPAE4564J5756CKRNOVY3VNJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYPAE4564J5756CKRNOVY3VNJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KYPAE4564J5756CKRNOVY3VNJ7","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":"d03f568c626c648b20ff5e805cee21d036b71d929018a04309806b848cd82b19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-24T08:10:07Z","title_canon_sha256":"b9c11298f8e8806d41b60eec60a49ab11df3449fe3fdd557a5dc6d6cf9eae345"},"schema_version":"1.0","source":{"id":"1804.08887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08887","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08887v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08887","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KYPAE4564J57","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYPAE4564J5756CK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYPAE456","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:04f9e1ec6a734ad523f2e708ce7e619cdb90e66e1034e6f88a7bae3b04f9bcd0","target":"graph","created_at":"2026-05-18T00:17:36Z","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":"This article presents the SIRIUS-LTG-UiO system for the SemEval 2018 Task 7 on Semantic Relation Extraction and Classification in Scientific Papers. First we extract the shortest dependency path (sdp) between two entities, then we introduce a convolutional neural network (CNN) which takes the shortest dependency path embeddings as input and performs relation classification with differing objectives for each subtask of the shared task. This approach achieved overall F1 scores of 76.7 and 83.2 for relation classification on clean and noisy data, respectively. Furthermore, for combined relation e","authors_text":"Farhad Nooralahzadeh, Jan Tore L{\\o}nning, Lilja {\\O}vrelid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-24T08:10:07Z","title":"SIRIUS-LTG-UiO at SemEval-2018 Task 7: Convolutional Neural Networks with Shortest Dependency Paths for Semantic Relation Extraction and Classification in Scientific Papers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08887","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:ce923cf6be71535c9522f18ab5df887e76ec8fb5f137e1a5a7aa495eab3bb698","target":"record","created_at":"2026-05-18T00:17:36Z","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":"d03f568c626c648b20ff5e805cee21d036b71d929018a04309806b848cd82b19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-24T08:10:07Z","title_canon_sha256":"b9c11298f8e8806d41b60eec60a49ab11df3449fe3fdd557a5dc6d6cf9eae345"},"schema_version":"1.0","source":{"id":"1804.08887","kind":"arxiv","version":1}},"canonical_sha256":"561e0273bee27bfef84a8b5d5c6ead4feb56dc15e70282968b8d271d948ff909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"561e0273bee27bfef84a8b5d5c6ead4feb56dc15e70282968b8d271d948ff909","first_computed_at":"2026-05-18T00:17:36.985444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:36.985444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aJOlrrUMwuSEqaErjEGZj3TJu1WrCdwx25YmwCPbC5yWrAg4Om9BfNq2O2+f8PuKU1Nkv0XxuHOgmC5w24qyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:36.986120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce923cf6be71535c9522f18ab5df887e76ec8fb5f137e1a5a7aa495eab3bb698","sha256:04f9e1ec6a734ad523f2e708ce7e619cdb90e66e1034e6f88a7bae3b04f9bcd0"],"state_sha256":"97958bc42fc610b34dc3b6210e2b8d741f2d539f36a5523fe62992e9ff330a58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fH/STV7P2sAMXEaN4sZnMCP3q6U0Knj7k8m5LjNf1W9uUPdshJo5ZNTeuYv5OSepW8PcL3CtnIwMCQ3dz1NRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:06:04.491276Z","bundle_sha256":"1f262c36be58e124614c18ad67940cc617fc6baae9a0ac326641259c6d243f95"}}