{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ISRUF7QYEWNOMQTGWJUQQSK7HI","short_pith_number":"pith:ISRUF7QY","canonical_record":{"source":{"id":"1411.4455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-11-17T12:43:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2f0c7ebef309db25899f95248965735fdb94d6207939f0711493edf414b0ecf7","abstract_canon_sha256":"a3ad120c306ee38d8eb50ca08ed2c265df1e0c9a88f7ad42680520b20101c6f9"},"schema_version":"1.0"},"canonical_sha256":"44a342fe18259ae64266b26908495f3a31e8a3d06e23ff549e089f13d17db7ff","source":{"kind":"arxiv","id":"1411.4455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4455","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4455v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4455","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"ISRUF7QYEWNO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ISRUF7QYEWNOMQTG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ISRUF7QY","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ISRUF7QYEWNOMQTGWJUQQSK7HI","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-11-17T12:43:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2f0c7ebef309db25899f95248965735fdb94d6207939f0711493edf414b0ecf7","abstract_canon_sha256":"a3ad120c306ee38d8eb50ca08ed2c265df1e0c9a88f7ad42680520b20101c6f9"},"schema_version":"1.0"},"canonical_sha256":"44a342fe18259ae64266b26908495f3a31e8a3d06e23ff549e089f13d17db7ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:45.705823Z","signature_b64":"0fj71ww/dPDwLRAvLQuJS+kCfwigNLJwMTNGUoR/6r+2ikdQmL75dMDx6DRWlg/gd1SGlTJDhi8dHOD99dNcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44a342fe18259ae64266b26908495f3a31e8a3d06e23ff549e089f13d17db7ff","last_reissued_at":"2026-05-18T02:35:45.705380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:45.705380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4455","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-18T02:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+fuCebUoXzYs4OXQUGdD4uXKdc8tqyCUXqmsFUb0nWE1VP2ugoPp7njc/EfySPFiFqSWnjBYD4HnVt2XLErBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T03:41:41.128682Z"},"content_sha256":"78f5a13b3b0c2d058761bc140a38ace128307ef9a1a6c4c8f68643c1d7dfa30f","schema_version":"1.0","event_id":"sha256:78f5a13b3b0c2d058761bc140a38ace128307ef9a1a6c4c8f68643c1d7dfa30f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ISRUF7QYEWNOMQTGWJUQQSK7HI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Errata: Distant Supervision for Relation Extraction with Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Deli Zhao, Edward Y. Chang, Miao Fan, Qiang Zhou, Thomas Fang Zheng, Zhiyuan Liu","submitted_at":"2014-11-17T12:43:30Z","abstract_excerpt":"The essence of distantly supervised relation extraction is that it is an incomplete multi-label classification problem with sparse and noisy features. To tackle the sparsity and noise challenges, we propose solving the classification problem using matrix completion on factorized matrix of minimized rank. We formulate relation classification as completing the unknown labels of testing items (entity pairs) in a sparse matrix that concatenates training and testing textual features with training labels. Our algorithmic framework is based on the assumption that the rank of item-by-feature and item-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4455","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-18T02:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nK/F4XIaBgb5weWUj3aMRJfHhiDeZfWHZz4GNQRdRcQ3GVE9P4dQtbf5AMcU6PhRv6iMXpv+xwq3uv0yExxzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T03:41:41.129033Z"},"content_sha256":"77a059d23efae0db118bbc43a911fedc0e4501adc2211d2a88ed65c210c4030c","schema_version":"1.0","event_id":"sha256:77a059d23efae0db118bbc43a911fedc0e4501adc2211d2a88ed65c210c4030c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISRUF7QYEWNOMQTGWJUQQSK7HI/bundle.json","state_url":"https://pith.science/pith/ISRUF7QYEWNOMQTGWJUQQSK7HI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISRUF7QYEWNOMQTGWJUQQSK7HI/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-01T03:41:41Z","links":{"resolver":"https://pith.science/pith/ISRUF7QYEWNOMQTGWJUQQSK7HI","bundle":"https://pith.science/pith/ISRUF7QYEWNOMQTGWJUQQSK7HI/bundle.json","state":"https://pith.science/pith/ISRUF7QYEWNOMQTGWJUQQSK7HI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISRUF7QYEWNOMQTGWJUQQSK7HI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ISRUF7QYEWNOMQTGWJUQQSK7HI","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":"a3ad120c306ee38d8eb50ca08ed2c265df1e0c9a88f7ad42680520b20101c6f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-11-17T12:43:30Z","title_canon_sha256":"2f0c7ebef309db25899f95248965735fdb94d6207939f0711493edf414b0ecf7"},"schema_version":"1.0","source":{"id":"1411.4455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4455","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4455v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4455","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"ISRUF7QYEWNO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ISRUF7QYEWNOMQTG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ISRUF7QY","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:77a059d23efae0db118bbc43a911fedc0e4501adc2211d2a88ed65c210c4030c","target":"graph","created_at":"2026-05-18T02:35:45Z","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":"The essence of distantly supervised relation extraction is that it is an incomplete multi-label classification problem with sparse and noisy features. To tackle the sparsity and noise challenges, we propose solving the classification problem using matrix completion on factorized matrix of minimized rank. We formulate relation classification as completing the unknown labels of testing items (entity pairs) in a sparse matrix that concatenates training and testing textual features with training labels. Our algorithmic framework is based on the assumption that the rank of item-by-feature and item-","authors_text":"Deli Zhao, Edward Y. Chang, Miao Fan, Qiang Zhou, Thomas Fang Zheng, Zhiyuan Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-11-17T12:43:30Z","title":"Errata: Distant Supervision for Relation Extraction with Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4455","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:78f5a13b3b0c2d058761bc140a38ace128307ef9a1a6c4c8f68643c1d7dfa30f","target":"record","created_at":"2026-05-18T02:35:45Z","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":"a3ad120c306ee38d8eb50ca08ed2c265df1e0c9a88f7ad42680520b20101c6f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-11-17T12:43:30Z","title_canon_sha256":"2f0c7ebef309db25899f95248965735fdb94d6207939f0711493edf414b0ecf7"},"schema_version":"1.0","source":{"id":"1411.4455","kind":"arxiv","version":1}},"canonical_sha256":"44a342fe18259ae64266b26908495f3a31e8a3d06e23ff549e089f13d17db7ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44a342fe18259ae64266b26908495f3a31e8a3d06e23ff549e089f13d17db7ff","first_computed_at":"2026-05-18T02:35:45.705380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:45.705380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0fj71ww/dPDwLRAvLQuJS+kCfwigNLJwMTNGUoR/6r+2ikdQmL75dMDx6DRWlg/gd1SGlTJDhi8dHOD99dNcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:45.705823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78f5a13b3b0c2d058761bc140a38ace128307ef9a1a6c4c8f68643c1d7dfa30f","sha256:77a059d23efae0db118bbc43a911fedc0e4501adc2211d2a88ed65c210c4030c"],"state_sha256":"9dcef45198156dded7ce18a8d762c7d01a09d592033e858ee7521a55aecd0c37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hfuq4e3+RjlMsE84NZzjpgqj5dKT/K0uk3aM5q3ZJEdPUSAdI/idWL3zW3gHO2hiNp+gdMWDXvkTWyv8JYQjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T03:41:41.131013Z","bundle_sha256":"f48cb198505abcde6ca3e5040c95ececd5018069d596771983efa4d94193ecc2"}}