{"as_of":"2026-08-20T13:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4e30758dec300096832aa91798c81ceb11791ad0f51a015ebec18647d30dd00","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:57:08.351677Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:57:36.771671Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T20:56:05.689421Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"cited_work":{"arxiv_id":"2412.14802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.14802","snapshot_observed_at":"2026-08-10T20:56:05.689421Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","venue":"cs.SE","work_id":"5a35ee3d-9289-4b45-b24e-7abf9ee2bef1","year":2024},"citing_paper":{"arxiv_id":"2504.16934","last_updated":"2025-01-12T23:16:20Z","snapshot_observed_at":"2026-08-14T14:33:23.770846Z","submitted_at":"2025-01-12T23:16:20Z","title":"Finding Important Stack Frames in Large Systems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T20:56:05.607776Z"},"links":{"cited_paper":"/paper/2412.14802","citing_paper":"/paper/2504.16934"},"observation_digest":"sha256:4200651710f52ebae4270f8e4550a58a9696bf12a604e9ab11028e781608075e","observation_id":"0c28e80c-1f23-4e71-94c5-2743c5d90177","resolution":{"observed_at":"2026-08-10T20:56:05.694588Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14802","snapshot_observed_at":"2026-08-15T16:57:36.771671Z","title":"Stack trace deduplication: Faster, more accurately, and in more realistic scenarios,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19449","last_updated":"2025-08-26T21:51:10Z","snapshot_observed_at":"2026-08-16T08:58:07.852922Z","submitted_at":"2025-08-26T21:51:10Z","title":"Stack Trace-Based Crash Deduplication with Transformer Adaptation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T16:57:36.771671Z"},"links":{"cited_paper":"/paper/2412.14802","citing_paper":"/paper/2508.19449"},"observation_digest":"sha256:42b9d2dfcbd49919a65e5206610a364eff5d2b462419a11f0d982e02175a1df4","observation_id":"2fdec4a1-7bdf-430a-95c0-4e1b367533ea","resolution":{"observed_at":"2026-08-15T16:57:36.771671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.14802/citation-record","integrity":"/paper/2412.14802/integrity","json":"/paper/2412.14802/citation-record.json","paper":"/paper/2412.14802"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:09.044409Z","title":"Design, discussion, and dissent in open bug reports,","venue":null,"work_id":"7213fbfc-a627-4f36-84e9-e0639da6662e","year":2011},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.182613Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:58ecd42ac9094c51c3fb0dd99fcc0ab6a2fb4867dd485c186ee258a320f0b7e3","observation_id":"a96fc96f-5ae0-4adf-ac0d-0715b0cbb719","resolution":{"observed_at":"2026-08-11T11:57:09.049041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:09.027955Z","title":"What makes a good bug report?","venue":null,"work_id":"a890f16c-7ce4-4388-9e53-ee2e3090f1f6","year":2010},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.188390Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:83a45ce7c31867c4c3d225126c97d583d096c875fd6b058293b49000728a2c8d","observation_id":"f3d1791e-b82a-4799-80ea-934eb852ab20","resolution":{"observed_at":"2026-08-11T11:57:09.032853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:09.011703Z","title":"Mining version histories to guide software changes,","venue":null,"work_id":"54a53e60-cc76-4b98-af7e-33709ef82edc","year":2004},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.193317Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:0d8e74f2ecc645dab347fac8a6efb89328c70ab7badefd5f6ecc491ded735c87","observation_id":"a7dbb77d-fc4e-426d-b006-27813fa8c458","resolution":{"observed_at":"2026-08-11T11:57:09.016915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.995889Z","title":"Automated duplicate detection for bug track- ing systems,","venue":null,"work_id":"8f2ebb17-357a-4601-9e2f-1f746d00460d","year":2008},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.198327Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:3960056b105f4ca534659f6ae3ec26b3ef6a383e97ba3311d2451226c1a0bf68","observation_id":"209e577d-b7fb-4654-b39f-100ee333e5e0","resolution":{"observed_at":"2026-08-11T11:57:09.001306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.980802Z","title":"Detection of duplicate defect reports using natural language processing,","venue":null,"work_id":"8572355c-f019-458e-a8da-9694f9fa8963","year":2007},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.203504Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:4b4cd72460beadadaafde61a00f201ddbef4473555666272a936776ca3451a52","observation_id":"af051a86-b218-48d9-9ca8-90472779f1c3","resolution":{"observed_at":"2026-08-11T11:57:08.985891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.966224Z","title":"Automatically identifying known software problems,","venue":null,"work_id":"b65debb7-182a-4813-87dc-004d100b8ac1","year":2007},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.208582Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:51ddf5e8c51c6147a35e724ab39cab1cc83449acf52119ecde5eb6aa2840abbd","observation_id":"c4de5fd9-b509-42a1-a824-ea38be4f6dc0","resolution":{"observed_at":"2026-08-11T11:57:08.970781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.951502Z","title":"Finding similar failures using callstack similarity,","venue":null,"work_id":"3ee17927-1365-4e5a-a968-11fe32378148","year":2008},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.214154Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:ed20504d21bdfbc607cb9af3f6835a0f349eea173ae55d3c40cd18cb49c19c69","observation_id":"c3bbd8dd-2db7-4642-bdcb-06592c4ddef0","resolution":{"observed_at":"2026-08-11T11:57:08.956283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.936262Z","title":"Classifying field crash reports for fixing bugs: A case study of Mozilla Firefox,","venue":null,"work_id":"c72efff2-3510-4ee7-b50c-6d19451c3295","year":2011},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.218868Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:a94a6e24b3fb5c3f1bbdd5d50f1634b00abbca54d5a151d562b6eb833db1c3a1","observation_id":"e8d6bafb-fc16-4a0e-9cca-342493f7ea39","resolution":{"observed_at":"2026-08-11T11:57:08.941278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.920897Z","title":"Towards more accurate retrieval of duplicate bug reports,","venue":null,"work_id":"91c6d42e-a646-4c1b-9a5c-80f080723a8e","year":2011},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.223519Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:07ab2fe60810481bf2151678a29944123ebd37b17a16767a2bb75d19be1e30f0","observation_id":"18255148-daa5-49b6-b357-58700012f0ab","resolution":{"observed_at":"2026-08-11T11:57:08.926115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.905812Z","title":"DURFEX: A feature extraction technique for efficient detection of duplicate bug reports,","venue":null,"work_id":"feaad106-b27b-417e-a811-1d0bd3d7fec9","year":2017},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.228334Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:238ebfa86a1618da54adf87e01f2b69e18a831b5d2f3ccf4ba95bd0a77d38cf6","observation_id":"8b7a0655-6215-4795-b5eb-8dffd55f83a6","resolution":{"observed_at":"2026-08-11T11:57:08.910803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.889658Z","title":"Finding duplicates of your yet unwritten bug report,","venue":null,"work_id":"1deef132-2ea3-4256-9e08-33c2b70f876b","year":2013},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.233084Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:4db964c6680d558d6e6876beef3bd8cffdcd045f5692c2c0e9b08b33f85c0c81","observation_id":"00d1c988-4d9f-4042-8526-ab1c311644a5","resolution":{"observed_at":"2026-08-11T11:57:08.894756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.874299Z","title":"TraceSim: a method for calculating stack trace similarity,","venue":null,"work_id":"b93134be-1132-44ea-80f0-9ef460866799","year":2020},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.238033Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:5f8fd64e7ac057ec2815b2bf833473b18a4dac45b484269fef0141c1dced94cc","observation_id":"089cec8d-f6ec-4d15-b8a0-4b56a91004bc","resolution":{"observed_at":"2026-08-11T11:57:08.879570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.859115Z","title":"S3M: Siamese stack (trace) similarity measure,","venue":null,"work_id":"0aadd672-57e2-4f3e-8093-38ceb689e5a4","year":2021},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.242871Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:dfe3d2615f425fb41354d19c1eaeff62960dfa78c0c33a5aa3d73556e990d27b","observation_id":"39603c86-e489-4f8d-bf20-1dfe08a2874d","resolution":{"observed_at":"2026-08-11T11:57:08.864201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.00212","last_updated":"2022-04-30T08:51:00Z","snapshot_observed_at":"2026-08-16T17:03:31.054656Z","submitted_at":"2022-04-30T08:51:00Z","title":"Aggregation of Stack Trace Similarities for Crash Report Deduplication","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.00212","snapshot_observed_at":"2026-08-11T11:57:08.247958Z","title":"Aggregation of stack trace similarities for crash report deduplication,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.247958Z"},"links":{"cited_paper":"/paper/2205.00212","citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:2be74407b69f31e6805dfe74feead9d11e4c36215b150f2f798445562bde3ade","observation_id":"ff3b882e-d80d-448e-8591-1d4139c3be22","resolution":{"observed_at":"2026-08-11T11:57:08.247958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.840370Z","title":"Deep- Crash: deep metric learning for crash bucketing based on stack trace,","venue":null,"work_id":"043349e7-d1a5-40e9-a126-133a613450d2","year":2022},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.253354Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:a2e9018de781604d9f2569fbc759ac9ec85ddc393ce2043b23ecb15ea0b34456","observation_id":"2a1ffaa4-7db0-4f35-a31e-eb352dbf0b83","resolution":{"observed_at":"2026-08-11T11:57:08.846364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.822106Z","title":"FaST: A linear time stack trace alignment heuristic for crash report deduplication,","venue":null,"work_id":"4e2d331f-407d-4e47-b082-406ca0fea1ce","year":2022},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.258401Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:61917d77387e4652e4112eb76d7c038294341588d7cec319b6a1f13ab7594208","observation_id":"de8d7408-f329-42cc-a32a-99e9fa1331f3","resolution":{"observed_at":"2026-08-11T11:57:08.828368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.696691Z","title":"Long short-term memory,","venue":null,"work_id":"6f13c6cf-2125-4f52-83b2-1246e31f96d8","year":1997},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.263169Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:41a479b956f9e30fc5fce4d7721512d7cc37d969b891474de29d470b158cc6fe","observation_id":"9496199a-6e39-47cf-bda9-06b32cb41902","resolution":{"observed_at":"2026-08-11T11:57:08.701685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-12T23:25:05.204139Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-11T11:57:08.267483Z","title":"Passage re-ranking with BERT,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.267483Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:20ff561d17149b795c8c824dcd1608ba72291de5dd58246b36c5799edfd6dbcc","observation_id":"ca597947-667f-4a0d-9b47-8bdaf0810589","resolution":{"observed_at":"2026-08-11T11:57:08.267483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.681040Z","title":"The unreasonable effectiveness of traditional information retrieval in crash report dedupli- cation,","venue":null,"work_id":"a90517fe-fea9-4141-9844-efbb410193c7","year":2016},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.271927Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:bd2ea00a313e75d28c2b53a49e17e8c03135c9938d8c2a3f159e465afe7143f0","observation_id":"65367321-d470-4138-b50f-0ca2a8c19f11","resolution":{"observed_at":"2026-08-11T11:57:08.686055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.664971Z","title":"TraceSim: An alignment method for computing stack trace similarity,","venue":null,"work_id":"3809d067-19c0-4fe7-a0dc-db2ae5a7b6a8","year":2022},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.276396Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:4060b5f0b96493499003e10b65836377d91df54737fcd6f12d2dd43834056eaf","observation_id":"7fdbdad3-ae42-4dca-ba0f-7b1feaba20b2","resolution":{"observed_at":"2026-08-11T11:57:08.670220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.280568Z","title":"Neural machine translation of rare words with subword units,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.280568Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:4e82a52e74fe6ec1cb1a7b33815f16e3a00d3139dece3cfe01bf6f7a694fb167","observation_id":"30cb084c-4a11-435a-9e60-eb2b2c1c1437","resolution":{"observed_at":"2026-08-11T11:57:08.280568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.638103Z","title":"Billion-scale similarity search with GPUs,","venue":null,"work_id":"8c877159-93c1-4381-bba9-61cc5836c1b9","year":2021},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.285025Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:1cb141f241b3614560caae55e9aa909ebc30fe8f168b22fd8be56ca0189a7869","observation_id":"e93c97a4-2a29-4d2d-9024-a8387807e1e2","resolution":{"observed_at":"2026-08-11T11:57:08.643105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.622508Z","title":"The Intel- liJ Platform: A framework for building plugins and mining software data,","venue":null,"work_id":"7ef6015a-bf95-4028-8ac2-a8db88ef4d8a","year":2021},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.289327Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:40c3b69ab7bc39ce485008842d72617a21d08fd63fa859757c413200e496623f","observation_id":"6eec86fe-72ca-44a1-8d54-d2d0e53e625f","resolution":{"observed_at":"2026-08-11T11:57:08.627893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.607213Z","title":"(2022) text-embedding-ada-003","venue":null,"work_id":"2f640c55-cfb1-4ff4-9336-c9535f4d183b","year":2022},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.293755Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:219b008dc8147a1e514deb7e370d45f4c7a9e3d0f88a8c3b675d58b03129bf1d","observation_id":"7cb58541-b42c-42fb-b9e4-8f04d529d484","resolution":{"observed_at":"2026-08-11T11:57:08.611978Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.14364857","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.382821Z","title":"Shibaev, D","venue":null,"work_id":"668a068b-2939-4a43-adc4-f5cfcfee641e","year":2024},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.298110Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:4c07de59db61a59386bcbb1e88aee0ea70a38320b796744f3e3c9e3aa4cab934","observation_id":"4ca10740-38d5-4dec-8f41-c2d53a69e1f9","resolution":{"observed_at":"2026-08-11T11:57:08.388863Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.589940Z","title":"(2024) Repl","venue":null,"work_id":"cb025ef2-76fe-462b-bdd1-f0de47b16c3d","year":2024},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.303023Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:efc17324c962c4987fe39589757073825ae51f7f6668e30c331386ae4f4317e0","observation_id":"9d233118-64d7-4ad4-afff-d927ae6bb78e","resolution":{"observed_at":"2026-08-11T11:57:08.595311Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.574327Z","title":"Quickly finding known software problems via automated symptom matching,","venue":null,"work_id":"6c9cba9c-3dee-4864-8e59-7c3d0b3873d9","year":2005},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.307827Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:b6644fba78acd31e2ae5de2d29d89730b592560a023b53ceaad1697be9963a79","observation_id":"2a86db31-f12e-42c3-9d52-f34f9db0ad81","resolution":{"observed_at":"2026-08-11T11:57:08.578834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.559923Z","title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins,","venue":null,"work_id":"03afa7f7-68c0-4a30-9355-72fee903b72e","year":1970},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.312463Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:cf589b2c27445623edfa55c7faca7b719edf5a42f0dbe03430ad2686a43d7b32","observation_id":"813f06a6-8d7b-4729-a270-7ce49eb8282d","resolution":{"observed_at":"2026-08-11T11:57:08.564450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.544261Z","title":"Efficient estimation of word representations in vector space,","venue":null,"work_id":"bf0abee0-ea6e-47e6-b144-ac750b985a83","year":2013},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.317102Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:176e0092b1777bc77bc41d82ab819d3cb4990ae8dcf706b31687c220a5217f23","observation_id":"26666738-38d6-43d2-b8e8-5cbbc3ea9325","resolution":{"observed_at":"2026-08-11T11:57:08.549651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.527164Z","title":"Scaffle: Bug localization on millions of files,","venue":null,"work_id":"416586d2-72f4-494d-8397-2f3054ec8eb3","year":2020},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.322205Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:28a01cee99f0612bfa36efba498167cd9ff98ef4f5a7b33a9ff6e7b97e039cbe","observation_id":"5fa1b8d9-b263-4277-b58c-d219c35f03c6","resolution":{"observed_at":"2026-08-11T11:57:08.532106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.511565Z","title":"Smoothed con- trastive learning for unsupervised sentence embedding,","venue":null,"work_id":"1617adab-099b-4fda-ac7a-2cec2a1bc9df","year":2022},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.327061Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:cfb2f036ba8dce190a699e0ccbc4e5cf248d4be4674e2fb746e4eb8d9d84cfb5","observation_id":"c9fce75c-51b3-4fd9-a888-6a49d672146d","resolution":{"observed_at":"2026-08-11T11:57:08.516732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.13003","last_updated":"2021-05-27T08:38:29Z","snapshot_observed_at":"2026-08-18T15:16:45.917745Z","submitted_at":"2021-05-27T08:38:29Z","title":"Rethinking InfoNCE: How Many Negative Samples Do You Need?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.13003","snapshot_observed_at":"2026-08-11T11:57:08.331716Z","title":"Rethinking InfoNCE: How many negative samples do you need?","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.331716Z"},"links":{"cited_paper":"/paper/2105.13003","citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:9be525bd725611abd07630b5656196092b7466e175793a3120f4927c4e517dba","observation_id":"940b7ae3-e651-4d30-8f7a-5235bd7c78d9","resolution":{"observed_at":"2026-08-11T11:57:08.331716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-08-14T18:53:38.574749Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-11T11:57:08.336767Z","title":"Representation learning with contrastive predictive coding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.336767Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:93a36aa6806a917d07f7beea08a962fe81d7ded66d14de0b213bd731d74ae2db","observation_id":"dc4851e8-e515-4ba2-8f71-67ae05011063","resolution":{"observed_at":"2026-08-11T11:57:08.336767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.341887Z","title":"Poly-encoders: Architectures and pre-training strategies for fast and accurate multi- sentence scoring,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.341887Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:b65be2566b83eba507fac74a667bf51c24d84d7fcc749d214a36a6e579c0cf52","observation_id":"fd46ffcd-6281-4bf2-a928-4f15e3772526","resolution":{"observed_at":"2026-08-11T11:57:08.341887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.484189Z","title":"BERT with history answer embedding for conversational question answering,","venue":null,"work_id":"7423ef7f-f932-406a-9f6a-23c883d5f0fa","year":2019},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.346934Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:f0f66e516b42ae27c2eb52b6fba8c1184770f0d97a121593113752a3a0837ecc","observation_id":"ca0c24ee-c37e-4ae3-a39d-21492ee68998","resolution":{"observed_at":"2026-08-11T11:57:08.489821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:57:08.466862Z","title":"ColBERT: Efficient and effective passage search via contextualized late interaction over BERT,","venue":null,"work_id":"79b221f0-c2ad-4ce1-84e3-21fbbdf11258","year":2020},"citing_paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T11:57:08.351677Z"},"links":{"citing_paper":"/paper/2412.14802"},"observation_digest":"sha256:4f32d05140fc50f5a0d2063e318b547c444d13c802326def6e05e8ebe66576e8","observation_id":"cf0ae0d2-7f36-490d-8807-c9c0b4048d90","resolution":{"observed_at":"2026-08-11T11:57:08.472878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.14802","last_updated":"2024-12-19T12:48:17Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-11T11:52:06.650937Z","submitted_at":"2024-12-19T12:48:17Z","title":"Stack Trace Deduplication: Faster, More Accurately, and in More Realistic Scenarios"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 2 inbound Pith citation observations for arXiv:2412.14802."}