{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HNZ3NOMXKMPW6IVLLLTFXMAMX7","short_pith_number":"pith:HNZ3NOMX","schema_version":"1.0","canonical_sha256":"3b73b6b997531f6f22ab5ae65bb00cbff359ccd3db6143e3ce6aa0d9c20ca273","source":{"kind":"arxiv","id":"2301.03709","version":2},"attestation_state":"computed","paper":{"title":"Transfer learning for conflict and duplicate detection in software requirement pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SE","authors_text":"Ayse Bener, Devang Parikh, Garima Malik, Mucahit Cevik, Savas Yildirim","submitted_at":"2023-01-09T22:47:12Z","abstract_excerpt":"Consistent and holistic expression of software requirements is important for the success of software projects. In this study, we aim to enhance the efficiency of the software development processes by automatically identifying conflicting and duplicate software requirement specifications. We formulate the conflict and duplicate detection problem as a requirement pair classification task. We design a novel transformers-based architecture, SR-BERT, which incorporates Sentence-BERT and Bi-encoders for the conflict and duplicate identification task. Furthermore, we apply supervised multi-stage fine"},"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":"2301.03709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2023-01-09T22:47:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3002c5f983efb53c0ce5b8f8131deb337988bcf72314bfa83df233d193bc982f","abstract_canon_sha256":"cb7fecd7b606f639aad11037d92443971f936ba36e27ba68e64281fb0ef626a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:06.201709Z","signature_b64":"tEE8M4J7BBtHT7zAsSj2HQAXuG5mqrNG2SB66nsfONfzh5F9woTqWTXEhWW/Z5zxQzHrS6JE3Q/uJpUkOwnICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b73b6b997531f6f22ab5ae65bb00cbff359ccd3db6143e3ce6aa0d9c20ca273","last_reissued_at":"2026-07-05T08:50:06.201271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:06.201271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transfer learning for conflict and duplicate detection in software requirement pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SE","authors_text":"Ayse Bener, Devang Parikh, Garima Malik, Mucahit Cevik, Savas Yildirim","submitted_at":"2023-01-09T22:47:12Z","abstract_excerpt":"Consistent and holistic expression of software requirements is important for the success of software projects. In this study, we aim to enhance the efficiency of the software development processes by automatically identifying conflicting and duplicate software requirement specifications. We formulate the conflict and duplicate detection problem as a requirement pair classification task. We design a novel transformers-based architecture, SR-BERT, which incorporates Sentence-BERT and Bi-encoders for the conflict and duplicate identification task. Furthermore, we apply supervised multi-stage fine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03709","kind":"arxiv","version":2},"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/2301.03709/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":"2301.03709","created_at":"2026-07-05T08:50:06.201343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.03709v2","created_at":"2026-07-05T08:50:06.201343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03709","created_at":"2026-07-05T08:50:06.201343+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNZ3NOMXKMPW","created_at":"2026-07-05T08:50:06.201343+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNZ3NOMXKMPW6IVL","created_at":"2026-07-05T08:50:06.201343+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNZ3NOMX","created_at":"2026-07-05T08:50:06.201343+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00959","citing_title":"Generative Language Models Potential for Requirement Engineering Applications: Insights into Current Strengths and Limitations","ref_index":100,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7","json":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7.json","graph_json":"https://pith.science/api/pith-number/HNZ3NOMXKMPW6IVLLLTFXMAMX7/graph.json","events_json":"https://pith.science/api/pith-number/HNZ3NOMXKMPW6IVLLLTFXMAMX7/events.json","paper":"https://pith.science/paper/HNZ3NOMX"},"agent_actions":{"view_html":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7","download_json":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7.json","view_paper":"https://pith.science/paper/HNZ3NOMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.03709&json=true","fetch_graph":"https://pith.science/api/pith-number/HNZ3NOMXKMPW6IVLLLTFXMAMX7/graph.json","fetch_events":"https://pith.science/api/pith-number/HNZ3NOMXKMPW6IVLLLTFXMAMX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7/action/storage_attestation","attest_author":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7/action/author_attestation","sign_citation":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7/action/citation_signature","submit_replication":"https://pith.science/pith/HNZ3NOMXKMPW6IVLLLTFXMAMX7/action/replication_record"}},"created_at":"2026-07-05T08:50:06.201343+00:00","updated_at":"2026-07-05T08:50:06.201343+00:00"}