{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PVLHMZXD5GZ6K37CAEILMQZ54C","short_pith_number":"pith:PVLHMZXD","canonical_record":{"source":{"id":"1903.12431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-29T10:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"c2779f5653a3a97f14bccad4d5074f6ff1a971e8703a83ead77db494c48e46ff","abstract_canon_sha256":"ae6a43e2dbae262da4d25974b80556b6be6b852287669a60db964b4cd80d19db"},"schema_version":"1.0"},"canonical_sha256":"7d567666e3e9b3e56fe20110b6433de0ac8185c352da404553c2d5348a55bc47","source":{"kind":"arxiv","id":"1903.12431","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12431","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12431v2","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12431","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"PVLHMZXD5GZ6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PVLHMZXD5GZ6K37C","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PVLHMZXD","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PVLHMZXD5GZ6K37CAEILMQZ54C","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-29T10:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"c2779f5653a3a97f14bccad4d5074f6ff1a971e8703a83ead77db494c48e46ff","abstract_canon_sha256":"ae6a43e2dbae262da4d25974b80556b6be6b852287669a60db964b4cd80d19db"},"schema_version":"1.0"},"canonical_sha256":"7d567666e3e9b3e56fe20110b6433de0ac8185c352da404553c2d5348a55bc47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:24.392147Z","signature_b64":"wl62ZGWdF0zxyPdsfcOjk2hCCl+iJxmJo6L1CmdTbQZDpUPEOuyc1lLWUW2gFbn6h3tRvj2AfWrW9wLaPDmiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d567666e3e9b3e56fe20110b6433de0ac8185c352da404553c2d5348a55bc47","last_reissued_at":"2026-05-17T23:49:24.391626Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:24.391626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12431","source_version":2,"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-05-17T23:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNEGho/KWqNNrnjj9aH+29NuV9yCUPke3642L7uTfAWI8ukxN6WnGIzOlsDqAmZ5atkyVOZiEGNrzy08KmmDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:05:31.972262Z"},"content_sha256":"c3f85df258c6589212ad4244ded0ab48bd4e69854996cf7d9bbf2ef47d68207e","schema_version":"1.0","event_id":"sha256:c3f85df258c6589212ad4244ded0ab48bd4e69854996cf7d9bbf2ef47d68207e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PVLHMZXD5GZ6K37CAEILMQZ54C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Train One Get One Free: Partially Supervised Neural Network for Bug Report Duplicate Detection and Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Lahari Poddar, Leonardo Neves, Luis Marujo, Pradeep Karuturi, Sergey Tulyakov, William Brendel","submitted_at":"2019-03-29T10:15:45Z","abstract_excerpt":"Tracking user reported bugs requires considerable engineering effort in going through many repetitive reports and assigning them to the correct teams. This paper proposes a neural architecture that can jointly (1) detect if two bug reports are duplicates, and (2) aggregate them into latent topics. Leveraging the assumption that learning the topic of a bug is a sub-task for detecting duplicates, we design a loss function that can jointly perform both tasks but needs supervision for only duplicate classification, achieving topic clustering in an unsupervised fashion. We use a two-step attention "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12431","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":""},"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-05-17T23:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxKEXc9Pa44/2dZt4P4c0gmxPBHOeH2ULt5apyZQ3wv4LC7a+XUMDcckHHDiunsRepFLgGj6BuCGb+qn1YEGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:05:31.972981Z"},"content_sha256":"bb74b3112de0079e957e363f95639386d90968b85d269cdc604e277df35e87d3","schema_version":"1.0","event_id":"sha256:bb74b3112de0079e957e363f95639386d90968b85d269cdc604e277df35e87d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVLHMZXD5GZ6K37CAEILMQZ54C/bundle.json","state_url":"https://pith.science/pith/PVLHMZXD5GZ6K37CAEILMQZ54C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVLHMZXD5GZ6K37CAEILMQZ54C/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-06-08T19:05:31Z","links":{"resolver":"https://pith.science/pith/PVLHMZXD5GZ6K37CAEILMQZ54C","bundle":"https://pith.science/pith/PVLHMZXD5GZ6K37CAEILMQZ54C/bundle.json","state":"https://pith.science/pith/PVLHMZXD5GZ6K37CAEILMQZ54C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVLHMZXD5GZ6K37CAEILMQZ54C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PVLHMZXD5GZ6K37CAEILMQZ54C","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":"ae6a43e2dbae262da4d25974b80556b6be6b852287669a60db964b4cd80d19db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-29T10:15:45Z","title_canon_sha256":"c2779f5653a3a97f14bccad4d5074f6ff1a971e8703a83ead77db494c48e46ff"},"schema_version":"1.0","source":{"id":"1903.12431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12431","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12431v2","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12431","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"PVLHMZXD5GZ6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PVLHMZXD5GZ6K37C","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PVLHMZXD","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:bb74b3112de0079e957e363f95639386d90968b85d269cdc604e277df35e87d3","target":"graph","created_at":"2026-05-17T23:49:24Z","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"},"paper":{"abstract_excerpt":"Tracking user reported bugs requires considerable engineering effort in going through many repetitive reports and assigning them to the correct teams. This paper proposes a neural architecture that can jointly (1) detect if two bug reports are duplicates, and (2) aggregate them into latent topics. Leveraging the assumption that learning the topic of a bug is a sub-task for detecting duplicates, we design a loss function that can jointly perform both tasks but needs supervision for only duplicate classification, achieving topic clustering in an unsupervised fashion. We use a two-step attention ","authors_text":"Lahari Poddar, Leonardo Neves, Luis Marujo, Pradeep Karuturi, Sergey Tulyakov, William Brendel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-29T10:15:45Z","title":"Train One Get One Free: Partially Supervised Neural Network for Bug Report Duplicate Detection and Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12431","kind":"arxiv","version":2},"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:c3f85df258c6589212ad4244ded0ab48bd4e69854996cf7d9bbf2ef47d68207e","target":"record","created_at":"2026-05-17T23:49:24Z","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":"ae6a43e2dbae262da4d25974b80556b6be6b852287669a60db964b4cd80d19db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-29T10:15:45Z","title_canon_sha256":"c2779f5653a3a97f14bccad4d5074f6ff1a971e8703a83ead77db494c48e46ff"},"schema_version":"1.0","source":{"id":"1903.12431","kind":"arxiv","version":2}},"canonical_sha256":"7d567666e3e9b3e56fe20110b6433de0ac8185c352da404553c2d5348a55bc47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d567666e3e9b3e56fe20110b6433de0ac8185c352da404553c2d5348a55bc47","first_computed_at":"2026-05-17T23:49:24.391626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:24.391626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wl62ZGWdF0zxyPdsfcOjk2hCCl+iJxmJo6L1CmdTbQZDpUPEOuyc1lLWUW2gFbn6h3tRvj2AfWrW9wLaPDmiDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:24.392147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f85df258c6589212ad4244ded0ab48bd4e69854996cf7d9bbf2ef47d68207e","sha256:bb74b3112de0079e957e363f95639386d90968b85d269cdc604e277df35e87d3"],"state_sha256":"f5d9475f864502c2682d2f6d2499a3ccc7db1b9e0cbee2af0057ecd467b37281"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKPkhtkGfPVJ5/J59N/uxr0uqjZ2aUrBYr/qfom9XOYil2I9dcTCoriZK5bOUsscvhRt9NJTL6ZJKcY1LPXPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:05:31.977007Z","bundle_sha256":"8c3cee3e2bbde5e6fba5c8e3c93b4f7d5f5ce48bb7234852797f2b24dfa1d855"}}