{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5YRVBFYRQWUBWCATKBSXUPALKU","short_pith_number":"pith:5YRVBFYR","schema_version":"1.0","canonical_sha256":"ee2350971185a81b081350657a3c0b55254136ce99c3aa547745fa70bd98197b","source":{"kind":"arxiv","id":"1804.05392","version":1},"attestation_state":"computed","paper":{"title":"Higher-order Coreference Resolution with Coarse-to-fine Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kenton Lee, Luheng He, Luke Zettlemoyer","submitted_at":"2018-04-15T17:47:26Z","abstract_excerpt":"We introduce a fully differentiable approximation to higher-order inference for coreference resolution. Our approach uses the antecedent distribution from a span-ranking architecture as an attention mechanism to iteratively refine span representations. This enables the model to softly consider multiple hops in the predicted clusters. To alleviate the computational cost of this iterative process, we introduce a coarse-to-fine approach that incorporates a less accurate but more efficient bilinear factor, enabling more aggressive pruning without hurting accuracy. Compared to the existing state-of"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.05392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-15T17:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"b11c7fcc0f121804408dbf58faa787b01bf2590822dfa2b6aca5bad61d5e9251","abstract_canon_sha256":"5ce5d506ba12c6c7a2499275fbb7bdbec0b4f6b0a148d15e73cb4cc00f3d00b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:28.250560Z","signature_b64":"XBwX4nqq5X52wRGpXEzuHuJV6yxMVaAlnCLeW4SHYZL+Pb8FFqPy2rdCe/TjFk6Tf0UXats1eTg3ZtZmXOGXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee2350971185a81b081350657a3c0b55254136ce99c3aa547745fa70bd98197b","last_reissued_at":"2026-05-18T00:18:28.250232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:28.250232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order Coreference Resolution with Coarse-to-fine Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kenton Lee, Luheng He, Luke Zettlemoyer","submitted_at":"2018-04-15T17:47:26Z","abstract_excerpt":"We introduce a fully differentiable approximation to higher-order inference for coreference resolution. Our approach uses the antecedent distribution from a span-ranking architecture as an attention mechanism to iteratively refine span representations. This enables the model to softly consider multiple hops in the predicted clusters. To alleviate the computational cost of this iterative process, we introduce a coarse-to-fine approach that incorporates a less accurate but more efficient bilinear factor, enabling more aggressive pruning without hurting accuracy. Compared to the existing state-of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05392","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.05392","created_at":"2026-05-18T00:18:28.250283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05392v1","created_at":"2026-05-18T00:18:28.250283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05392","created_at":"2026-05-18T00:18:28.250283+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YRVBFYRQWUB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YRVBFYRQWUBWCAT","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YRVBFYR","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU","json":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU.json","graph_json":"https://pith.science/api/pith-number/5YRVBFYRQWUBWCATKBSXUPALKU/graph.json","events_json":"https://pith.science/api/pith-number/5YRVBFYRQWUBWCATKBSXUPALKU/events.json","paper":"https://pith.science/paper/5YRVBFYR"},"agent_actions":{"view_html":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU","download_json":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU.json","view_paper":"https://pith.science/paper/5YRVBFYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05392&json=true","fetch_graph":"https://pith.science/api/pith-number/5YRVBFYRQWUBWCATKBSXUPALKU/graph.json","fetch_events":"https://pith.science/api/pith-number/5YRVBFYRQWUBWCATKBSXUPALKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU/action/storage_attestation","attest_author":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU/action/author_attestation","sign_citation":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU/action/citation_signature","submit_replication":"https://pith.science/pith/5YRVBFYRQWUBWCATKBSXUPALKU/action/replication_record"}},"created_at":"2026-05-18T00:18:28.250283+00:00","updated_at":"2026-05-18T00:18:28.250283+00:00"}