{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WY5PN7TLF3SLZZLMJW3RIRLWWF","short_pith_number":"pith:WY5PN7TL","schema_version":"1.0","canonical_sha256":"b63af6fe6b2ee4bce56c4db7144576b1603a65a2494ca4fd86d485be84afb206","source":{"kind":"arxiv","id":"2505.24553","version":1},"attestation_state":"computed","paper":{"title":"CREFT: Sequential Multi-Agent LLM for Character Relation Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Byung-Hak Kim, Seung-won Hwang, Taeyoon Hwang, Ye Eun Chun","submitted_at":"2025-05-30T13:01:36Z","abstract_excerpt":"Understanding complex character relations is crucial for narrative analysis and efficient script evaluation, yet existing extraction methods often fail to handle long-form narratives with nuanced interactions. To address this challenge, we present CREFT, a novel sequential framework leveraging specialized Large Language Model (LLM) agents. First, CREFT builds a base character graph through knowledge distillation, then iteratively refines character composition, relation extraction, role identification, and group assignments. Experiments on a curated Korean drama dataset demonstrate that CREFT s"},"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":"2505.24553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-30T13:01:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e2387db9c04b603f763c1ca4bdcd8f5eee047d54ee8f718e0025a46a55ca7827","abstract_canon_sha256":"1253ee2c4449c5f534673eaedededbd4ecc2e7767999cbafb5e090d41a8136da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:52.184657Z","signature_b64":"AQbMo0XWA8f1cGHaiACE79aheO7lDtWxuC3RDYl12MqAPnSwWY/t8nF/LxBygUekjKQFJnZG3d4IdtDPuWsPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b63af6fe6b2ee4bce56c4db7144576b1603a65a2494ca4fd86d485be84afb206","last_reissued_at":"2026-07-05T11:12:52.184113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:52.184113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CREFT: Sequential Multi-Agent LLM for Character Relation Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Byung-Hak Kim, Seung-won Hwang, Taeyoon Hwang, Ye Eun Chun","submitted_at":"2025-05-30T13:01:36Z","abstract_excerpt":"Understanding complex character relations is crucial for narrative analysis and efficient script evaluation, yet existing extraction methods often fail to handle long-form narratives with nuanced interactions. To address this challenge, we present CREFT, a novel sequential framework leveraging specialized Large Language Model (LLM) agents. First, CREFT builds a base character graph through knowledge distillation, then iteratively refines character composition, relation extraction, role identification, and group assignments. Experiments on a curated Korean drama dataset demonstrate that CREFT s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24553","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/2505.24553/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.24553","created_at":"2026-07-05T11:12:52.184175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24553v1","created_at":"2026-07-05T11:12:52.184175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24553","created_at":"2026-07-05T11:12:52.184175+00:00"},{"alias_kind":"pith_short_12","alias_value":"WY5PN7TLF3SL","created_at":"2026-07-05T11:12:52.184175+00:00"},{"alias_kind":"pith_short_16","alias_value":"WY5PN7TLF3SLZZLM","created_at":"2026-07-05T11:12:52.184175+00:00"},{"alias_kind":"pith_short_8","alias_value":"WY5PN7TL","created_at":"2026-07-05T11:12:52.184175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23412","citing_title":"Overcoming Copyright Barriers in Corpus Distribution Through Non-Reversible Hashing","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF","json":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF.json","graph_json":"https://pith.science/api/pith-number/WY5PN7TLF3SLZZLMJW3RIRLWWF/graph.json","events_json":"https://pith.science/api/pith-number/WY5PN7TLF3SLZZLMJW3RIRLWWF/events.json","paper":"https://pith.science/paper/WY5PN7TL"},"agent_actions":{"view_html":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF","download_json":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF.json","view_paper":"https://pith.science/paper/WY5PN7TL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24553&json=true","fetch_graph":"https://pith.science/api/pith-number/WY5PN7TLF3SLZZLMJW3RIRLWWF/graph.json","fetch_events":"https://pith.science/api/pith-number/WY5PN7TLF3SLZZLMJW3RIRLWWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF/action/storage_attestation","attest_author":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF/action/author_attestation","sign_citation":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF/action/citation_signature","submit_replication":"https://pith.science/pith/WY5PN7TLF3SLZZLMJW3RIRLWWF/action/replication_record"}},"created_at":"2026-07-05T11:12:52.184175+00:00","updated_at":"2026-07-05T11:12:52.184175+00:00"}