{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WUE2DPD5Q2SHXNSLDT7AUVPIBJ","short_pith_number":"pith:WUE2DPD5","canonical_record":{"source":{"id":"1405.5202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-16T05:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"bc4b4c59931ca581e791fb4dd86db72c33f69fb22d5b40e5647adbe042747718","abstract_canon_sha256":"a6d1e188398c612e648a499568bbe1d643c3bc5cc7dffbb305151318cdd93284"},"schema_version":"1.0"},"canonical_sha256":"b509a1bc7d86a47bb64b1cfe0a55e80a5199c69bcc063a8600913d1cbfa83059","source":{"kind":"arxiv","id":"1405.5202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5202","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5202v1","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5202","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"WUE2DPD5Q2SH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WUE2DPD5Q2SHXNSL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WUE2DPD5","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WUE2DPD5Q2SHXNSLDT7AUVPIBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-16T05:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"bc4b4c59931ca581e791fb4dd86db72c33f69fb22d5b40e5647adbe042747718","abstract_canon_sha256":"a6d1e188398c612e648a499568bbe1d643c3bc5cc7dffbb305151318cdd93284"},"schema_version":"1.0"},"canonical_sha256":"b509a1bc7d86a47bb64b1cfe0a55e80a5199c69bcc063a8600913d1cbfa83059","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:25.856810Z","signature_b64":"By7WYVP/6dmsDv679uHnQYXK7dGJSlDIiQRSty+nm4OC8gtpJvQWYGaZGW1TxTcqPvtJSjzueJOSzp0jH2lsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b509a1bc7d86a47bb64b1cfe0a55e80a5199c69bcc063a8600913d1cbfa83059","last_reissued_at":"2026-05-18T02:51:25.856148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:25.856148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5202","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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RURgPiVzYd+bu5BDEvqey7EdqV1nRrUqO7i8onbSwPCS+hfRR7da+9aBN+X8VpEcHK5QK7I5uL6Bv0Jysi5rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:01:02.605451Z"},"content_sha256":"6497be454b8acc054c7ba8b039259f04834a57b2a4bb518e3d2a7df91b4e4999","schema_version":"1.0","event_id":"sha256:6497be454b8acc054c7ba8b039259f04834a57b2a4bb518e3d2a7df91b4e4999"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WUE2DPD5Q2SHXNSLDT7AUVPIBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Narrowing the Modeling Gap: A Cluster-Ranking Approach to Coreference Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Altaf Rahman, Vincent Ng","submitted_at":"2014-01-16T05:06:09Z","abstract_excerpt":"Traditional learning-based coreference resolvers operate by training the mention-pair model for determining whether two mentions are coreferent or not. Though conceptually simple and easy to understand, the mention-pair model is linguistically rather unappealing and lags far behind the heuristic-based coreference models proposed in the pre-statistical NLP era in terms of sophistication. Two independent lines of recent research have attempted to improve the mention-pair model, one by acquiring the mention-ranking model to rank preceding mentions for a given anaphor, and the other by training th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5202","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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqBUqENWLJb5FlUdVzBSJxXSOYd2owA8s2yvCxWBGeSp55nz/XKEPJxEvCvawjDEbJc8p6ts7eafmHYyF0CnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:01:02.606213Z"},"content_sha256":"2e1ab1947e8fa4d19ac0bd3aa5d0e214dbbc30363954508e8662af7b51b4233a","schema_version":"1.0","event_id":"sha256:2e1ab1947e8fa4d19ac0bd3aa5d0e214dbbc30363954508e8662af7b51b4233a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUE2DPD5Q2SHXNSLDT7AUVPIBJ/bundle.json","state_url":"https://pith.science/pith/WUE2DPD5Q2SHXNSLDT7AUVPIBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUE2DPD5Q2SHXNSLDT7AUVPIBJ/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-06-06T07:01:02Z","links":{"resolver":"https://pith.science/pith/WUE2DPD5Q2SHXNSLDT7AUVPIBJ","bundle":"https://pith.science/pith/WUE2DPD5Q2SHXNSLDT7AUVPIBJ/bundle.json","state":"https://pith.science/pith/WUE2DPD5Q2SHXNSLDT7AUVPIBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUE2DPD5Q2SHXNSLDT7AUVPIBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WUE2DPD5Q2SHXNSLDT7AUVPIBJ","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":"a6d1e188398c612e648a499568bbe1d643c3bc5cc7dffbb305151318cdd93284","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-16T05:06:09Z","title_canon_sha256":"bc4b4c59931ca581e791fb4dd86db72c33f69fb22d5b40e5647adbe042747718"},"schema_version":"1.0","source":{"id":"1405.5202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5202","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5202v1","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5202","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"WUE2DPD5Q2SH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WUE2DPD5Q2SHXNSL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WUE2DPD5","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:2e1ab1947e8fa4d19ac0bd3aa5d0e214dbbc30363954508e8662af7b51b4233a","target":"graph","created_at":"2026-05-18T02:51:25Z","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":"Traditional learning-based coreference resolvers operate by training the mention-pair model for determining whether two mentions are coreferent or not. Though conceptually simple and easy to understand, the mention-pair model is linguistically rather unappealing and lags far behind the heuristic-based coreference models proposed in the pre-statistical NLP era in terms of sophistication. Two independent lines of recent research have attempted to improve the mention-pair model, one by acquiring the mention-ranking model to rank preceding mentions for a given anaphor, and the other by training th","authors_text":"Altaf Rahman, Vincent Ng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-16T05:06:09Z","title":"Narrowing the Modeling Gap: A Cluster-Ranking Approach to Coreference Resolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5202","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:6497be454b8acc054c7ba8b039259f04834a57b2a4bb518e3d2a7df91b4e4999","target":"record","created_at":"2026-05-18T02:51:25Z","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":"a6d1e188398c612e648a499568bbe1d643c3bc5cc7dffbb305151318cdd93284","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-16T05:06:09Z","title_canon_sha256":"bc4b4c59931ca581e791fb4dd86db72c33f69fb22d5b40e5647adbe042747718"},"schema_version":"1.0","source":{"id":"1405.5202","kind":"arxiv","version":1}},"canonical_sha256":"b509a1bc7d86a47bb64b1cfe0a55e80a5199c69bcc063a8600913d1cbfa83059","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b509a1bc7d86a47bb64b1cfe0a55e80a5199c69bcc063a8600913d1cbfa83059","first_computed_at":"2026-05-18T02:51:25.856148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:25.856148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"By7WYVP/6dmsDv679uHnQYXK7dGJSlDIiQRSty+nm4OC8gtpJvQWYGaZGW1TxTcqPvtJSjzueJOSzp0jH2lsCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:25.856810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6497be454b8acc054c7ba8b039259f04834a57b2a4bb518e3d2a7df91b4e4999","sha256:2e1ab1947e8fa4d19ac0bd3aa5d0e214dbbc30363954508e8662af7b51b4233a"],"state_sha256":"57bdf58500aa4f161026db422aa06aa5db0e3f85b516aae35460464e07346567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8C+F0MXb/s4pvmI7lrAEDwk5Yy/JgahhUn5+AXBi917kiWZU46ak+FU5PLuPYh+ILkMU9FHXLnDZSCVTkt4dDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T07:01:02.613897Z","bundle_sha256":"d8dea77929efbb671e6b05c01ad6d5112461138aa33549e8b2cc2e90d9bf0751"}}