{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WTQCKHRV2LDEOZFKC3AQLFMX7K","short_pith_number":"pith:WTQCKHRV","schema_version":"1.0","canonical_sha256":"b4e0251e35d2c64764aa16c1059597fa88de38661a98019a78ba1e2e1c4711ae","source":{"kind":"arxiv","id":"2402.11243","version":1},"attestation_state":"computed","paper":{"title":"Can Large Language Models perform Relation-based Argument Mining?","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Antonio Rago, Deniz Gorur, Francesca Toni","submitted_at":"2024-02-17T10:37:51Z","abstract_excerpt":"Argument mining (AM) is the process of automatically extracting arguments, their components and/or relations amongst arguments and components from text. As the number of platforms supporting online debate increases, the need for AM becomes ever more urgent, especially in support of downstream tasks. Relation-based AM (RbAM) is a form of AM focusing on identifying agreement (support) and disagreement (attack) relations amongst arguments. RbAM is a challenging classification task, with existing methods failing to perform satisfactorily. In this paper, we show that general-purpose Large Language "},"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":"2402.11243","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2024-02-17T10:37:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"861ffecaec20007a0721af3a571627d4b354577cda95152ee0fe66a1cf380121","abstract_canon_sha256":"154649d739fa5fef50489ebce2e1df4bbeaa5eb609e2a35a7b7a29f49f1663f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:36.268597Z","signature_b64":"WYoCAlpfwWs2VmFE0mVNycMYV3yW8xXAglEsQZYu7Pm9RBKXZNWp1HIJ5G+iVt7+k2c9vy/LF/Xhtu9RhyAWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4e0251e35d2c64764aa16c1059597fa88de38661a98019a78ba1e2e1c4711ae","last_reissued_at":"2026-07-05T07:46:36.268198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:36.268198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Large Language Models perform Relation-based Argument Mining?","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Antonio Rago, Deniz Gorur, Francesca Toni","submitted_at":"2024-02-17T10:37:51Z","abstract_excerpt":"Argument mining (AM) is the process of automatically extracting arguments, their components and/or relations amongst arguments and components from text. As the number of platforms supporting online debate increases, the need for AM becomes ever more urgent, especially in support of downstream tasks. Relation-based AM (RbAM) is a form of AM focusing on identifying agreement (support) and disagreement (attack) relations amongst arguments. RbAM is a challenging classification task, with existing methods failing to perform satisfactorily. In this paper, we show that general-purpose Large Language "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11243","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/2402.11243/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":"2402.11243","created_at":"2026-07-05T07:46:36.268258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11243v1","created_at":"2026-07-05T07:46:36.268258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11243","created_at":"2026-07-05T07:46:36.268258+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTQCKHRV2LDE","created_at":"2026-07-05T07:46:36.268258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTQCKHRV2LDEOZFK","created_at":"2026-07-05T07:46:36.268258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTQCKHRV","created_at":"2026-07-05T07:46:36.268258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06646","citing_title":"CAF-Gen: A Multi-Agent System for Enriching Argumentation Structures","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17247","citing_title":"Towards Robust Argumentative Essay Understanding via TIDE: An Interactive Framework with Trial and Debate","ref_index":75,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K","json":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K.json","graph_json":"https://pith.science/api/pith-number/WTQCKHRV2LDEOZFKC3AQLFMX7K/graph.json","events_json":"https://pith.science/api/pith-number/WTQCKHRV2LDEOZFKC3AQLFMX7K/events.json","paper":"https://pith.science/paper/WTQCKHRV"},"agent_actions":{"view_html":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K","download_json":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K.json","view_paper":"https://pith.science/paper/WTQCKHRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11243&json=true","fetch_graph":"https://pith.science/api/pith-number/WTQCKHRV2LDEOZFKC3AQLFMX7K/graph.json","fetch_events":"https://pith.science/api/pith-number/WTQCKHRV2LDEOZFKC3AQLFMX7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K/action/storage_attestation","attest_author":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K/action/author_attestation","sign_citation":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K/action/citation_signature","submit_replication":"https://pith.science/pith/WTQCKHRV2LDEOZFKC3AQLFMX7K/action/replication_record"}},"created_at":"2026-07-05T07:46:36.268258+00:00","updated_at":"2026-07-05T07:46:36.268258+00:00"}