{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HP4DRZPNGCGLUXOTN3WOU7VO23","short_pith_number":"pith:HP4DRZPN","schema_version":"1.0","canonical_sha256":"3bf838e5ed308cba5dd36eecea7eaed6e1e26214ea9d2ec25ae5e693e094fcca","source":{"kind":"arxiv","id":"1902.02703","version":1},"attestation_state":"computed","paper":{"title":"D&C: A Divide-and-Conquer Approach to IR-based Bug Localization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Anil Koyuncu, Dongsun Kim, Jacques Klein, Kui Liu, Martin Monperrus, Tegawend\\'e F. Bissyand\\'e, Yves Le Traon","submitted_at":"2019-02-07T15:59:08Z","abstract_excerpt":"Many automated tasks in software maintenance rely on information retrieval techniques to identify specific information within unstructured data. Bug localization is such a typical task, where text in a bug report is analyzed to identify file locations in the source code that can be associated to the reported bug. Despite the promising results, the performance offered by IR-based bug localization tools is still not significant for large adoption. We argue that one reason could be the attempt to build a one-size-fits-all approach. In this paper, we extensively study the performance of state-of-t"},"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":"1902.02703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-02-07T15:59:08Z","cross_cats_sorted":[],"title_canon_sha256":"c88565cdf34d850808f123635e0fddf7b49bc62c3f97455ae34663f42496adce","abstract_canon_sha256":"d8b4b26f1a176b7202195e32eddf9ffbc80ac642e6006273e16a4bfda7d74df4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:32.409426Z","signature_b64":"/p2AxNv5abHHxo8aYQBNC8orGrMc4gPqkk2a9a1uWV2g1BMvV63LFq7zKCX5fSxMReZzK0OC3hOMkL0dTl2ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf838e5ed308cba5dd36eecea7eaed6e1e26214ea9d2ec25ae5e693e094fcca","last_reissued_at":"2026-05-17T23:54:32.408727Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:32.408727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"D&C: A Divide-and-Conquer Approach to IR-based Bug Localization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Anil Koyuncu, Dongsun Kim, Jacques Klein, Kui Liu, Martin Monperrus, Tegawend\\'e F. Bissyand\\'e, Yves Le Traon","submitted_at":"2019-02-07T15:59:08Z","abstract_excerpt":"Many automated tasks in software maintenance rely on information retrieval techniques to identify specific information within unstructured data. Bug localization is such a typical task, where text in a bug report is analyzed to identify file locations in the source code that can be associated to the reported bug. Despite the promising results, the performance offered by IR-based bug localization tools is still not significant for large adoption. We argue that one reason could be the attempt to build a one-size-fits-all approach. In this paper, we extensively study the performance of state-of-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02703","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":"1902.02703","created_at":"2026-05-17T23:54:32.408840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02703v1","created_at":"2026-05-17T23:54:32.408840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02703","created_at":"2026-05-17T23:54:32.408840+00:00"},{"alias_kind":"pith_short_12","alias_value":"HP4DRZPNGCGL","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HP4DRZPNGCGLUXOT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HP4DRZPN","created_at":"2026-05-18T12:33:18.533446+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/HP4DRZPNGCGLUXOTN3WOU7VO23","json":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23.json","graph_json":"https://pith.science/api/pith-number/HP4DRZPNGCGLUXOTN3WOU7VO23/graph.json","events_json":"https://pith.science/api/pith-number/HP4DRZPNGCGLUXOTN3WOU7VO23/events.json","paper":"https://pith.science/paper/HP4DRZPN"},"agent_actions":{"view_html":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23","download_json":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23.json","view_paper":"https://pith.science/paper/HP4DRZPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02703&json=true","fetch_graph":"https://pith.science/api/pith-number/HP4DRZPNGCGLUXOTN3WOU7VO23/graph.json","fetch_events":"https://pith.science/api/pith-number/HP4DRZPNGCGLUXOTN3WOU7VO23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23/action/storage_attestation","attest_author":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23/action/author_attestation","sign_citation":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23/action/citation_signature","submit_replication":"https://pith.science/pith/HP4DRZPNGCGLUXOTN3WOU7VO23/action/replication_record"}},"created_at":"2026-05-17T23:54:32.408840+00:00","updated_at":"2026-05-17T23:54:32.408840+00:00"}