{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YHDEY2DXQUHU3FWDZZKVSVISD2","short_pith_number":"pith:YHDEY2DX","canonical_record":{"source":{"id":"1609.00626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-02T14:42:18Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"6aa7ccaf7832a8f8417fd71acb773103de04e8e4a2bde6cd844490924b1a872f","abstract_canon_sha256":"c4e542b06875e54cc3e9c0a2364d6b7f3059239af38fcfe33b403ac9b8197dc8"},"schema_version":"1.0"},"canonical_sha256":"c1c64c6877850f4d96c3ce555955121e8643087969dd5959a53080b7f672918e","source":{"kind":"arxiv","id":"1609.00626","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00626","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00626v2","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00626","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"YHDEY2DXQUHU","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YHDEY2DXQUHU3FWD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YHDEY2DX","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YHDEY2DXQUHU3FWDZZKVSVISD2","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-02T14:42:18Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"6aa7ccaf7832a8f8417fd71acb773103de04e8e4a2bde6cd844490924b1a872f","abstract_canon_sha256":"c4e542b06875e54cc3e9c0a2364d6b7f3059239af38fcfe33b403ac9b8197dc8"},"schema_version":"1.0"},"canonical_sha256":"c1c64c6877850f4d96c3ce555955121e8643087969dd5959a53080b7f672918e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:32.444597Z","signature_b64":"0Za/QwhTbeBnc1+ipxS9Q9JmCYbcMX7JHceT3UR4grtLi1rgfNzGGyBxkIPH6icBd4A8VozlDY/BJV7hjAGbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1c64c6877850f4d96c3ce555955121e8643087969dd5959a53080b7f672918e","last_reissued_at":"2026-05-18T01:04:32.443837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:32.443837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00626","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-05-18T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgrXU9YpaA3/O+lrDsojFXEx0WdTb+0XNxwM9Zal9/cU8Szs+kW2wRPR2Cane/sL5kOwZFPKEC7BzSQLtSdxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:55:20.738541Z"},"content_sha256":"b769d6f777939999731fcea487127146ecbbb5ebe6c04b6934ee510d429c8ad8","schema_version":"1.0","event_id":"sha256:b769d6f777939999731fcea487127146ecbbb5ebe6c04b6934ee510d429c8ad8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YHDEY2DXQUHU3FWDZZKVSVISD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SynsetRank: Degree-adjusted Random Walk for Relation Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.CL","authors_text":"Dirk Weissenborn, Feiyu Xu, Nico Goernitz, Sebastian Krause, Shinichi Nakajima, Sven Schmeier","submitted_at":"2016-09-02T14:42:18Z","abstract_excerpt":"In relation extraction, a key process is to obtain good detectors that find relevant sentences describing the target relation. To minimize the necessity of labeled data for refining detectors, previous work successfully made use of BabelNet, a semantic graph structure expressing relationships between synsets, as side information or prior knowledge. The goal of this paper is to enhance the use of graph structure in the framework of random walk with a few adjustable parameters. Actually, a straightforward application of random walk degrades the performance even after parameter optimization. With"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00626","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":""},"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-18T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZP08rnosUXi5Cm6wbEAQphIL5QUWqaDwK/9ZSmNte/BrSVp0kybWIbiAB8ItDxmXzb1PBxeWJa3WyFxUd0UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:55:20.739211Z"},"content_sha256":"77c9ea17f6f136973c1b735f31681306961a11c89de15f128dfb4d1102dd2bb7","schema_version":"1.0","event_id":"sha256:77c9ea17f6f136973c1b735f31681306961a11c89de15f128dfb4d1102dd2bb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHDEY2DXQUHU3FWDZZKVSVISD2/bundle.json","state_url":"https://pith.science/pith/YHDEY2DXQUHU3FWDZZKVSVISD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHDEY2DXQUHU3FWDZZKVSVISD2/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-23T21:55:20Z","links":{"resolver":"https://pith.science/pith/YHDEY2DXQUHU3FWDZZKVSVISD2","bundle":"https://pith.science/pith/YHDEY2DXQUHU3FWDZZKVSVISD2/bundle.json","state":"https://pith.science/pith/YHDEY2DXQUHU3FWDZZKVSVISD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHDEY2DXQUHU3FWDZZKVSVISD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YHDEY2DXQUHU3FWDZZKVSVISD2","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":"c4e542b06875e54cc3e9c0a2364d6b7f3059239af38fcfe33b403ac9b8197dc8","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-02T14:42:18Z","title_canon_sha256":"6aa7ccaf7832a8f8417fd71acb773103de04e8e4a2bde6cd844490924b1a872f"},"schema_version":"1.0","source":{"id":"1609.00626","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00626","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00626v2","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00626","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"YHDEY2DXQUHU","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YHDEY2DXQUHU3FWD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YHDEY2DX","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:77c9ea17f6f136973c1b735f31681306961a11c89de15f128dfb4d1102dd2bb7","target":"graph","created_at":"2026-05-18T01:04:32Z","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":"In relation extraction, a key process is to obtain good detectors that find relevant sentences describing the target relation. To minimize the necessity of labeled data for refining detectors, previous work successfully made use of BabelNet, a semantic graph structure expressing relationships between synsets, as side information or prior knowledge. The goal of this paper is to enhance the use of graph structure in the framework of random walk with a few adjustable parameters. Actually, a straightforward application of random walk degrades the performance even after parameter optimization. With","authors_text":"Dirk Weissenborn, Feiyu Xu, Nico Goernitz, Sebastian Krause, Shinichi Nakajima, Sven Schmeier","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-02T14:42:18Z","title":"SynsetRank: Degree-adjusted Random Walk for Relation Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00626","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:b769d6f777939999731fcea487127146ecbbb5ebe6c04b6934ee510d429c8ad8","target":"record","created_at":"2026-05-18T01:04:32Z","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":"c4e542b06875e54cc3e9c0a2364d6b7f3059239af38fcfe33b403ac9b8197dc8","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-02T14:42:18Z","title_canon_sha256":"6aa7ccaf7832a8f8417fd71acb773103de04e8e4a2bde6cd844490924b1a872f"},"schema_version":"1.0","source":{"id":"1609.00626","kind":"arxiv","version":2}},"canonical_sha256":"c1c64c6877850f4d96c3ce555955121e8643087969dd5959a53080b7f672918e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1c64c6877850f4d96c3ce555955121e8643087969dd5959a53080b7f672918e","first_computed_at":"2026-05-18T01:04:32.443837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:32.443837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Za/QwhTbeBnc1+ipxS9Q9JmCYbcMX7JHceT3UR4grtLi1rgfNzGGyBxkIPH6icBd4A8VozlDY/BJV7hjAGbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:32.444597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00626","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b769d6f777939999731fcea487127146ecbbb5ebe6c04b6934ee510d429c8ad8","sha256:77c9ea17f6f136973c1b735f31681306961a11c89de15f128dfb4d1102dd2bb7"],"state_sha256":"bd7cc7a4e3823e97367c5b7da70580d2b472a473857242bc9177022d34fa4a04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poDuLQ27aCO7inwAImtJIiWqgdY0DC+Pw+cCxMCzWUIQLZaw63WSQessW5n4rSPdcFc+lNTOCEpP0aHKH5RCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:55:20.743246Z","bundle_sha256":"584ef409c98f3a7b2b29ae35de59789ab2b87496f6c10c9748518a26cfe5cace"}}