{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VAWQ4PN7ZS4AMICUTGOG7AFKWI","short_pith_number":"pith:VAWQ4PN7","canonical_record":{"source":{"id":"1802.00921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-02-03T06:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"f8011e1993681b71beb4661cd3987b35ab319e9b24fd86695fa6c878e17685c3","abstract_canon_sha256":"92296c1e2ef7e312b27409cdc15bf8e1d0722478b41425fbc0aff76b87d8574e"},"schema_version":"1.0"},"canonical_sha256":"a82d0e3dbfccb8062054999c6f80aab21c2494a1f95fc771e9bdd244538cde8a","source":{"kind":"arxiv","id":"1802.00921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00921","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00921v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00921","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"VAWQ4PN7ZS4A","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VAWQ4PN7ZS4AMICU","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VAWQ4PN7","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VAWQ4PN7ZS4AMICUTGOG7AFKWI","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-02-03T06:18:37Z","cross_cats_sorted":[],"title_canon_sha256":"f8011e1993681b71beb4661cd3987b35ab319e9b24fd86695fa6c878e17685c3","abstract_canon_sha256":"92296c1e2ef7e312b27409cdc15bf8e1d0722478b41425fbc0aff76b87d8574e"},"schema_version":"1.0"},"canonical_sha256":"a82d0e3dbfccb8062054999c6f80aab21c2494a1f95fc771e9bdd244538cde8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:27.887552Z","signature_b64":"xxx13Ni8qUqjjdxqdHvk/DOGPo62yWoRFhSRKj79MA/9YwvfR1k4PtQ+eOtK0c+5PbIgt+9qXfTfOFFTKE+rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a82d0e3dbfccb8062054999c6f80aab21c2494a1f95fc771e9bdd244538cde8a","last_reissued_at":"2026-05-18T00:24:27.886943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:27.886943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00921","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-05-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGKSApUAMJMe4nCw4111AnILIVHauCYSTkkuHIl30rTGrkfYrDTTNOlyQMfB4hop/SZ0UlAQuaFyLEiyD5CgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:51:45.656479Z"},"content_sha256":"6e45fd6b9078baf1899f9fad957130c1aaf6fefb311ef853a78b8b926d1cee73","schema_version":"1.0","event_id":"sha256:6e45fd6b9078baf1899f9fad957130c1aaf6fefb311ef853a78b8b926d1cee73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VAWQ4PN7ZS4AMICUTGOG7AFKWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A deep tree-based model for software defect prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Aditya Ghose, Chul-Joo Kim, Hoa Khanh Dam, John Grundy, Shien Wee Ng, Taeksu Kim, Trang Pham, Truyen Tran","submitted_at":"2018-02-03T06:18:37Z","abstract_excerpt":"Defects are common in software systems and can potentially cause various problems to software users. Different methods have been developed to quickly predict the most likely locations of defects in large code bases. Most of them focus on designing features (e.g. complexity metrics) that correlate with potentially defective code. Those approaches however do not sufficiently capture the syntax and different levels of semantics of source code, an important capability for building accurate prediction models. In this paper, we develop a novel prediction model which is capable of automatically learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00921","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"},"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-18T00:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RpL0zXIhDGd50lOpnkL9D+NUhHxRbaqS4GCXcGGfJ5UWF4TdNA7Ig6UoiiR1PhWaNINuWyw38zjRHutB9btgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:51:45.656986Z"},"content_sha256":"725a1d6a27a1b743be1454edfe66b056885de8079de1e721e5d28da28efe3837","schema_version":"1.0","event_id":"sha256:725a1d6a27a1b743be1454edfe66b056885de8079de1e721e5d28da28efe3837"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VAWQ4PN7ZS4AMICUTGOG7AFKWI/bundle.json","state_url":"https://pith.science/pith/VAWQ4PN7ZS4AMICUTGOG7AFKWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VAWQ4PN7ZS4AMICUTGOG7AFKWI/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-05-25T19:51:45Z","links":{"resolver":"https://pith.science/pith/VAWQ4PN7ZS4AMICUTGOG7AFKWI","bundle":"https://pith.science/pith/VAWQ4PN7ZS4AMICUTGOG7AFKWI/bundle.json","state":"https://pith.science/pith/VAWQ4PN7ZS4AMICUTGOG7AFKWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VAWQ4PN7ZS4AMICUTGOG7AFKWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VAWQ4PN7ZS4AMICUTGOG7AFKWI","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":"92296c1e2ef7e312b27409cdc15bf8e1d0722478b41425fbc0aff76b87d8574e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-02-03T06:18:37Z","title_canon_sha256":"f8011e1993681b71beb4661cd3987b35ab319e9b24fd86695fa6c878e17685c3"},"schema_version":"1.0","source":{"id":"1802.00921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00921","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00921v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00921","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"VAWQ4PN7ZS4A","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VAWQ4PN7ZS4AMICU","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VAWQ4PN7","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:725a1d6a27a1b743be1454edfe66b056885de8079de1e721e5d28da28efe3837","target":"graph","created_at":"2026-05-18T00:24:27Z","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":"Defects are common in software systems and can potentially cause various problems to software users. Different methods have been developed to quickly predict the most likely locations of defects in large code bases. Most of them focus on designing features (e.g. complexity metrics) that correlate with potentially defective code. Those approaches however do not sufficiently capture the syntax and different levels of semantics of source code, an important capability for building accurate prediction models. In this paper, we develop a novel prediction model which is capable of automatically learn","authors_text":"Aditya Ghose, Chul-Joo Kim, Hoa Khanh Dam, John Grundy, Shien Wee Ng, Taeksu Kim, Trang Pham, Truyen Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-02-03T06:18:37Z","title":"A deep tree-based model for software defect prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00921","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:6e45fd6b9078baf1899f9fad957130c1aaf6fefb311ef853a78b8b926d1cee73","target":"record","created_at":"2026-05-18T00:24:27Z","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":"92296c1e2ef7e312b27409cdc15bf8e1d0722478b41425fbc0aff76b87d8574e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-02-03T06:18:37Z","title_canon_sha256":"f8011e1993681b71beb4661cd3987b35ab319e9b24fd86695fa6c878e17685c3"},"schema_version":"1.0","source":{"id":"1802.00921","kind":"arxiv","version":1}},"canonical_sha256":"a82d0e3dbfccb8062054999c6f80aab21c2494a1f95fc771e9bdd244538cde8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a82d0e3dbfccb8062054999c6f80aab21c2494a1f95fc771e9bdd244538cde8a","first_computed_at":"2026-05-18T00:24:27.886943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:27.886943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xxx13Ni8qUqjjdxqdHvk/DOGPo62yWoRFhSRKj79MA/9YwvfR1k4PtQ+eOtK0c+5PbIgt+9qXfTfOFFTKE+rAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:27.887552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e45fd6b9078baf1899f9fad957130c1aaf6fefb311ef853a78b8b926d1cee73","sha256:725a1d6a27a1b743be1454edfe66b056885de8079de1e721e5d28da28efe3837"],"state_sha256":"7c1f781cacda8119f2cb1592009acca055a4b8cce55804a424e66a885a7f616a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuNytUqE1E0m4JgbquAT0wbtQckrNSNouWLW4yCnSj6teFFNtYP3NQDbzbciH+WxjEpwtxARW1NDidp6eXLJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:51:45.660907Z","bundle_sha256":"4921cbc840dca36029339e9c66e1bb8790c9a1db128ff9eac8ac39ad8cb37c49"}}