{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2MDC56I2IX5VT5YRXTYAHYKWNS","short_pith_number":"pith:2MDC56I2","schema_version":"1.0","canonical_sha256":"d3062ef91a45fb59f711bcf003e1566ca68653e236185486e49b3b3f09837571","source":{"kind":"arxiv","id":"2205.00212","version":1},"attestation_state":"computed","paper":{"title":"Aggregation of Stack Trace Similarities for Crash Report Deduplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Aleksandr Khvorov, Nikolay Karasov, Roman Vasiliev, Timofey Bryksin, Yaroslav Golubev","submitted_at":"2022-04-30T08:51:00Z","abstract_excerpt":"The automatic collection of stack traces in bug tracking systems is an integral part of many software projects and their maintenance. However, such reports often contain a lot of duplicates, and the problem of de-duplicating them into groups arises. In this paper, we propose a new approach to solve the deduplication task and report on its use on the real-world data from JetBrains, a leading developer of IDEs and other software. Unlike most of the existing methods, which assign the incoming stack trace to a particular group in which a single most similar stack trace is located, we use the infor"},"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":"2205.00212","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-04-30T08:51:00Z","cross_cats_sorted":[],"title_canon_sha256":"36a05f035760bc8d66476161f88101cd4d2c87767649e09d0e4449554fc4cd45","abstract_canon_sha256":"3bc4026c94ef53792e1ed12f921e22ac740a64c4ade2fd352490af28675d43a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:10.558699Z","signature_b64":"lLP0qMmUAurRKMmPvkBfLJt4ecwPHdqTDcx9cb2ROSh7wPmLqSMi7RV5vFlKbee4X7A+xtFB1xJt7pgKHmg8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3062ef91a45fb59f711bcf003e1566ca68653e236185486e49b3b3f09837571","last_reissued_at":"2026-07-05T04:19:10.558358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:10.558358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aggregation of Stack Trace Similarities for Crash Report Deduplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Aleksandr Khvorov, Nikolay Karasov, Roman Vasiliev, Timofey Bryksin, Yaroslav Golubev","submitted_at":"2022-04-30T08:51:00Z","abstract_excerpt":"The automatic collection of stack traces in bug tracking systems is an integral part of many software projects and their maintenance. However, such reports often contain a lot of duplicates, and the problem of de-duplicating them into groups arises. In this paper, we propose a new approach to solve the deduplication task and report on its use on the real-world data from JetBrains, a leading developer of IDEs and other software. Unlike most of the existing methods, which assign the incoming stack trace to a particular group in which a single most similar stack trace is located, we use the infor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00212","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/2205.00212/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":"2205.00212","created_at":"2026-07-05T04:19:10.558414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.00212v1","created_at":"2026-07-05T04:19:10.558414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00212","created_at":"2026-07-05T04:19:10.558414+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MDC56I2IX5V","created_at":"2026-07-05T04:19:10.558414+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MDC56I2IX5VT5YR","created_at":"2026-07-05T04:19:10.558414+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MDC56I2","created_at":"2026-07-05T04:19:10.558414+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/2MDC56I2IX5VT5YRXTYAHYKWNS","json":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS.json","graph_json":"https://pith.science/api/pith-number/2MDC56I2IX5VT5YRXTYAHYKWNS/graph.json","events_json":"https://pith.science/api/pith-number/2MDC56I2IX5VT5YRXTYAHYKWNS/events.json","paper":"https://pith.science/paper/2MDC56I2"},"agent_actions":{"view_html":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS","download_json":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS.json","view_paper":"https://pith.science/paper/2MDC56I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.00212&json=true","fetch_graph":"https://pith.science/api/pith-number/2MDC56I2IX5VT5YRXTYAHYKWNS/graph.json","fetch_events":"https://pith.science/api/pith-number/2MDC56I2IX5VT5YRXTYAHYKWNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/action/storage_attestation","attest_author":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/action/author_attestation","sign_citation":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/action/citation_signature","submit_replication":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/action/replication_record"}},"created_at":"2026-07-05T04:19:10.558414+00:00","updated_at":"2026-07-05T04:19:10.558414+00:00"}