{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2MDC56I2IX5VT5YRXTYAHYKWNS","short_pith_number":"pith:2MDC56I2","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"},"canonical_sha256":"d3062ef91a45fb59f711bcf003e1566ca68653e236185486e49b3b3f09837571","source":{"kind":"arxiv","id":"2205.00212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00212","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00212v1","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00212","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"2MDC56I2IX5V","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"2MDC56I2IX5VT5YR","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"2MDC56I2","created_at":"2026-07-05T04:19:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2MDC56I2IX5VT5YRXTYAHYKWNS","target":"record","payload":{"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"},"canonical_sha256":"d3062ef91a45fb59f711bcf003e1566ca68653e236185486e49b3b3f09837571","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"},"source_kind":"arxiv","source_id":"2205.00212","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8karq1vldk8GrMDOTPON7tPdjS4hu/nk8VeQMgXKXG3LwS5TmrBGZ1mxSSOM5sDac+UO9vvBpYkSr4bcwZJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:02:49.092972Z"},"content_sha256":"9820d2989a54ad73b8096a7708b54ef9e2cf032c1741c9113864ef4163c1f49a","schema_version":"1.0","event_id":"sha256:9820d2989a54ad73b8096a7708b54ef9e2cf032c1741c9113864ef4163c1f49a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2MDC56I2IX5VT5YRXTYAHYKWNS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zga7mTm0cJKoTFj7Fot7ufQjaX6gzd13x7rcEvNFtpyWCYNh389GxV9GAdQdS6ICudvRpNS5emxB8p3dAfIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:02:49.093426Z"},"content_sha256":"21a13ac550c34e0f843854fa472aeedd60a42c79935f39de3f70f406265992ac","schema_version":"1.0","event_id":"sha256:21a13ac550c34e0f843854fa472aeedd60a42c79935f39de3f70f406265992ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/bundle.json","state_url":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T16:02:49Z","links":{"resolver":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS","bundle":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/bundle.json","state":"https://pith.science/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MDC56I2IX5VT5YRXTYAHYKWNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2MDC56I2IX5VT5YRXTYAHYKWNS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3bc4026c94ef53792e1ed12f921e22ac740a64c4ade2fd352490af28675d43a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-04-30T08:51:00Z","title_canon_sha256":"36a05f035760bc8d66476161f88101cd4d2c87767649e09d0e4449554fc4cd45"},"schema_version":"1.0","source":{"id":"2205.00212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.00212","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"2205.00212v1","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00212","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"2MDC56I2IX5V","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"2MDC56I2IX5VT5YR","created_at":"2026-07-05T04:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"2MDC56I2","created_at":"2026-07-05T04:19:10Z"}],"graph_snapshots":[{"event_id":"sha256:21a13ac550c34e0f843854fa472aeedd60a42c79935f39de3f70f406265992ac","target":"graph","created_at":"2026-07-05T04:19:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.00212/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aleksandr Khvorov, Nikolay Karasov, Roman Vasiliev, Timofey Bryksin, Yaroslav Golubev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-04-30T08:51:00Z","title":"Aggregation of Stack Trace Similarities for Crash Report Deduplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00212","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9820d2989a54ad73b8096a7708b54ef9e2cf032c1741c9113864ef4163c1f49a","target":"record","created_at":"2026-07-05T04:19:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3bc4026c94ef53792e1ed12f921e22ac740a64c4ade2fd352490af28675d43a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-04-30T08:51:00Z","title_canon_sha256":"36a05f035760bc8d66476161f88101cd4d2c87767649e09d0e4449554fc4cd45"},"schema_version":"1.0","source":{"id":"2205.00212","kind":"arxiv","version":1}},"canonical_sha256":"d3062ef91a45fb59f711bcf003e1566ca68653e236185486e49b3b3f09837571","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3062ef91a45fb59f711bcf003e1566ca68653e236185486e49b3b3f09837571","first_computed_at":"2026-07-05T04:19:10.558358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:19:10.558358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lLP0qMmUAurRKMmPvkBfLJt4ecwPHdqTDcx9cb2ROSh7wPmLqSMi7RV5vFlKbee4X7A+xtFB1xJt7pgKHmg8Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:19:10.558699Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.00212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9820d2989a54ad73b8096a7708b54ef9e2cf032c1741c9113864ef4163c1f49a","sha256:21a13ac550c34e0f843854fa472aeedd60a42c79935f39de3f70f406265992ac"],"state_sha256":"4307fa4a2bc596c9d331f9142e47e162a229c67d9f89f0eb2fc4310acb51be50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bd/hWzErNeUkjZmQ960G9Notb9yJEUsGg7A2vIULV7Qk3mwqgAIofZRtW2IGVHsg500JXpE5p+k259drU7vICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:02:49.095490Z","bundle_sha256":"84e3ab518eea016cb4a9d91188383042eb22c94c5ab2f0b21861a472d64a941e"}}