{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:D6W5FPKFBGV265HO6BWML525BK","short_pith_number":"pith:D6W5FPKF","canonical_record":{"source":{"id":"2204.04437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-04-09T09:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"8f40304a3c72f3049fd1709aaf71ca6be07664447ca65bd0e5d30d3f0ab2cf6b","abstract_canon_sha256":"50eafda9124fce80fdb67a3987443cc3a18b65ffe77e7f2f839a68442d268492"},"schema_version":"1.0"},"canonical_sha256":"1fadd2bd4509abaf74eef06cc5f75d0ab2984d893aebef1e5bb9f52fb26094d3","source":{"kind":"arxiv","id":"2204.04437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.04437","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2204.04437v1","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04437","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"D6W5FPKFBGV2","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"D6W5FPKFBGV265HO","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"D6W5FPKF","created_at":"2026-07-05T04:12:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:D6W5FPKFBGV265HO6BWML525BK","target":"record","payload":{"canonical_record":{"source":{"id":"2204.04437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-04-09T09:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"8f40304a3c72f3049fd1709aaf71ca6be07664447ca65bd0e5d30d3f0ab2cf6b","abstract_canon_sha256":"50eafda9124fce80fdb67a3987443cc3a18b65ffe77e7f2f839a68442d268492"},"schema_version":"1.0"},"canonical_sha256":"1fadd2bd4509abaf74eef06cc5f75d0ab2984d893aebef1e5bb9f52fb26094d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:12:57.232057Z","signature_b64":"Igy+I58aYCgTo81yyab3OtYZPN9cHZIkSyB9JWxZjl0ncb7yrzJf6APRn+VDe+LQSbvOWv90J2dafMwyAtvtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fadd2bd4509abaf74eef06cc5f75d0ab2984d893aebef1e5bb9f52fb26094d3","last_reissued_at":"2026-07-05T04:12:57.231650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:12:57.231650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.04437","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-07-05T04:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0EGgAf0m5Ekl4fBUaqMM28JoC7S4GzZCjJteq2Oq2YyCQPofxhCZOzPY2/e6CwLCsOS73TFmtnd6prwNhpjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T04:56:19.601066Z"},"content_sha256":"d6ed3f48fa9260a54aee1c6fe4a868b43addf56920caca2adcffe635d364cbcd","schema_version":"1.0","event_id":"sha256:d6ed3f48fa9260a54aee1c6fe4a868b43addf56920caca2adcffe635d364cbcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:D6W5FPKFBGV265HO6BWML525BK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Multi-Granularity Hierarchical Features for Relation Extraction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Mu Li, Shuangzhi Wu, Xinnian Liang, Zhoujun Li","submitted_at":"2022-04-09T09:44:05Z","abstract_excerpt":"Relation extraction is a key task in Natural Language Processing (NLP), which aims to extract relations between entity pairs from given texts. Recently, relation extraction (RE) has achieved remarkable progress with the development of deep neural networks. Most existing research focuses on constructing explicit structured features using external knowledge such as knowledge graph and dependency tree. In this paper, we propose a novel method to extract multi-granularity features based solely on the original input sentences. We show that effective structured features can be attained even without "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04437","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.04437/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-05T04:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzpUtLV5fN1Wq4HtpI71N99l+dJk/2ABhgXSoVfL48YWmB/F/74y+azJZwViJjLLjYku7hvk7q3/9GN80Y6yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T04:56:19.601456Z"},"content_sha256":"6c69920f2ff958ab973df50be314fc667abbe16093856e72428c72ce731291a0","schema_version":"1.0","event_id":"sha256:6c69920f2ff958ab973df50be314fc667abbe16093856e72428c72ce731291a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6W5FPKFBGV265HO6BWML525BK/bundle.json","state_url":"https://pith.science/pith/D6W5FPKFBGV265HO6BWML525BK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6W5FPKFBGV265HO6BWML525BK/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-16T04:56:19Z","links":{"resolver":"https://pith.science/pith/D6W5FPKFBGV265HO6BWML525BK","bundle":"https://pith.science/pith/D6W5FPKFBGV265HO6BWML525BK/bundle.json","state":"https://pith.science/pith/D6W5FPKFBGV265HO6BWML525BK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6W5FPKFBGV265HO6BWML525BK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:D6W5FPKFBGV265HO6BWML525BK","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":"50eafda9124fce80fdb67a3987443cc3a18b65ffe77e7f2f839a68442d268492","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-04-09T09:44:05Z","title_canon_sha256":"8f40304a3c72f3049fd1709aaf71ca6be07664447ca65bd0e5d30d3f0ab2cf6b"},"schema_version":"1.0","source":{"id":"2204.04437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.04437","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2204.04437v1","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04437","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"D6W5FPKFBGV2","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"D6W5FPKFBGV265HO","created_at":"2026-07-05T04:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"D6W5FPKF","created_at":"2026-07-05T04:12:57Z"}],"graph_snapshots":[{"event_id":"sha256:6c69920f2ff958ab973df50be314fc667abbe16093856e72428c72ce731291a0","target":"graph","created_at":"2026-07-05T04:12:57Z","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/2204.04437/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Relation extraction is a key task in Natural Language Processing (NLP), which aims to extract relations between entity pairs from given texts. Recently, relation extraction (RE) has achieved remarkable progress with the development of deep neural networks. Most existing research focuses on constructing explicit structured features using external knowledge such as knowledge graph and dependency tree. In this paper, we propose a novel method to extract multi-granularity features based solely on the original input sentences. We show that effective structured features can be attained even without ","authors_text":"Mu Li, Shuangzhi Wu, Xinnian Liang, Zhoujun Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-04-09T09:44:05Z","title":"Modeling Multi-Granularity Hierarchical Features for Relation Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04437","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:d6ed3f48fa9260a54aee1c6fe4a868b43addf56920caca2adcffe635d364cbcd","target":"record","created_at":"2026-07-05T04:12:57Z","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":"50eafda9124fce80fdb67a3987443cc3a18b65ffe77e7f2f839a68442d268492","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-04-09T09:44:05Z","title_canon_sha256":"8f40304a3c72f3049fd1709aaf71ca6be07664447ca65bd0e5d30d3f0ab2cf6b"},"schema_version":"1.0","source":{"id":"2204.04437","kind":"arxiv","version":1}},"canonical_sha256":"1fadd2bd4509abaf74eef06cc5f75d0ab2984d893aebef1e5bb9f52fb26094d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fadd2bd4509abaf74eef06cc5f75d0ab2984d893aebef1e5bb9f52fb26094d3","first_computed_at":"2026-07-05T04:12:57.231650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:12:57.231650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Igy+I58aYCgTo81yyab3OtYZPN9cHZIkSyB9JWxZjl0ncb7yrzJf6APRn+VDe+LQSbvOWv90J2dafMwyAtvtCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:12:57.232057Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.04437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6ed3f48fa9260a54aee1c6fe4a868b43addf56920caca2adcffe635d364cbcd","sha256:6c69920f2ff958ab973df50be314fc667abbe16093856e72428c72ce731291a0"],"state_sha256":"785158295e7ac5bf13c01d89a002fa72da480cadaaf1604976900e4a9067f053"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fj4upQUh4osY35i9SBUVeIqj8sLdNiSIcVnfZsnMBuYXKoZRJAU+6WQPft28+YRtta/FO5MmBgMXfaiNEWhlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T04:56:19.603627Z","bundle_sha256":"27e09cb0eaf2850e07d8115049d50b1a528b243c1230abcdf7b43fe8bbc5133d"}}