{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6CUYYYYHCOLNCR3YVNMIHM26AE","short_pith_number":"pith:6CUYYYYH","canonical_record":{"source":{"id":"1804.03589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-04-10T15:33:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a6f9a5093686d12ebab7411521ac4288704b66086e6b7df277f02fe0f89f2ff","abstract_canon_sha256":"03549fc080297ffa25707a9649da58d1ff4390f44453bd77bc6ac03bf660f009"},"schema_version":"1.0"},"canonical_sha256":"f0a98c63071396d14778ab5883b35e0118574c9d42d2d3165e81209861b1c9e1","source":{"kind":"arxiv","id":"1804.03589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03589","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03589v1","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03589","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"6CUYYYYHCOLN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CUYYYYHCOLNCR3Y","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CUYYYYH","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6CUYYYYHCOLNCR3YVNMIHM26AE","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-04-10T15:33:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a6f9a5093686d12ebab7411521ac4288704b66086e6b7df277f02fe0f89f2ff","abstract_canon_sha256":"03549fc080297ffa25707a9649da58d1ff4390f44453bd77bc6ac03bf660f009"},"schema_version":"1.0"},"canonical_sha256":"f0a98c63071396d14778ab5883b35e0118574c9d42d2d3165e81209861b1c9e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:47.613840Z","signature_b64":"5RV4OUBNMHisUVCZsUOq6Pj7Hnz1ccIQrWGHOe++vzLoOD8rUXK1MqtMMyyDGBwsaS6JTFr1mNdHOQQxBLP/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a98c63071396d14778ab5883b35e0118574c9d42d2d3165e81209861b1c9e1","last_reissued_at":"2026-05-18T00:18:47.613171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:47.613171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03589","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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9qAUOzsW06N3mB4T8BZfusMiOvixrwDsQtWg7QDgYVsKbHK+kzghoQ44bwCqaHcE1/gZSkwR2H9ay4ckfVLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:36:41.385296Z"},"content_sha256":"33593560637ad5ec90efe67bb2a18259533f854beec409da94e4d4a36d21cbf5","schema_version":"1.0","event_id":"sha256:33593560637ad5ec90efe67bb2a18259533f854beec409da94e4d4a36d21cbf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6CUYYYYHCOLNCR3YVNMIHM26AE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ConPredictor: Concurrency Defect Prediction in Real-World Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jane Hayes, Tingting Yu, Wei Wen, Xue Han","submitted_at":"2018-04-10T15:33:29Z","abstract_excerpt":"Concurrent programs are difficult to test due to their inherent non-determinism. To address this problem, testing often requires the exploration of thread schedules of a program; this can be time-consuming when applied to real-world programs. Software defect prediction has been used to help developers find faults and prioritize their testing efforts. Prior studies have used machine learning to build such predicting models based on designed features that encode the characteristics of programs. However, research has focused on sequential programs; to date, no work has considered defect predictio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03589","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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOLSZJsVLo1eIz3cxuivXPySo6QFIDR52earGqT3wyn602m/PnJne+4XEky3LAn263or71e6zLNdjlKIlngMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:36:41.385652Z"},"content_sha256":"1eda6a5180ac57474f644148f56e199e2781f9ba4302eccaf59b52ec0086ac26","schema_version":"1.0","event_id":"sha256:1eda6a5180ac57474f644148f56e199e2781f9ba4302eccaf59b52ec0086ac26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CUYYYYHCOLNCR3YVNMIHM26AE/bundle.json","state_url":"https://pith.science/pith/6CUYYYYHCOLNCR3YVNMIHM26AE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CUYYYYHCOLNCR3YVNMIHM26AE/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-20T20:36:41Z","links":{"resolver":"https://pith.science/pith/6CUYYYYHCOLNCR3YVNMIHM26AE","bundle":"https://pith.science/pith/6CUYYYYHCOLNCR3YVNMIHM26AE/bundle.json","state":"https://pith.science/pith/6CUYYYYHCOLNCR3YVNMIHM26AE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CUYYYYHCOLNCR3YVNMIHM26AE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6CUYYYYHCOLNCR3YVNMIHM26AE","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":"03549fc080297ffa25707a9649da58d1ff4390f44453bd77bc6ac03bf660f009","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-04-10T15:33:29Z","title_canon_sha256":"5a6f9a5093686d12ebab7411521ac4288704b66086e6b7df277f02fe0f89f2ff"},"schema_version":"1.0","source":{"id":"1804.03589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03589","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03589v1","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03589","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"6CUYYYYHCOLN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CUYYYYHCOLNCR3Y","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CUYYYYH","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:1eda6a5180ac57474f644148f56e199e2781f9ba4302eccaf59b52ec0086ac26","target":"graph","created_at":"2026-05-18T00:18:47Z","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":"Concurrent programs are difficult to test due to their inherent non-determinism. To address this problem, testing often requires the exploration of thread schedules of a program; this can be time-consuming when applied to real-world programs. Software defect prediction has been used to help developers find faults and prioritize their testing efforts. Prior studies have used machine learning to build such predicting models based on designed features that encode the characteristics of programs. However, research has focused on sequential programs; to date, no work has considered defect predictio","authors_text":"Jane Hayes, Tingting Yu, Wei Wen, Xue Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-04-10T15:33:29Z","title":"ConPredictor: Concurrency Defect Prediction in Real-World Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03589","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:33593560637ad5ec90efe67bb2a18259533f854beec409da94e4d4a36d21cbf5","target":"record","created_at":"2026-05-18T00:18:47Z","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":"03549fc080297ffa25707a9649da58d1ff4390f44453bd77bc6ac03bf660f009","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-04-10T15:33:29Z","title_canon_sha256":"5a6f9a5093686d12ebab7411521ac4288704b66086e6b7df277f02fe0f89f2ff"},"schema_version":"1.0","source":{"id":"1804.03589","kind":"arxiv","version":1}},"canonical_sha256":"f0a98c63071396d14778ab5883b35e0118574c9d42d2d3165e81209861b1c9e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a98c63071396d14778ab5883b35e0118574c9d42d2d3165e81209861b1c9e1","first_computed_at":"2026-05-18T00:18:47.613171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:47.613171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5RV4OUBNMHisUVCZsUOq6Pj7Hnz1ccIQrWGHOe++vzLoOD8rUXK1MqtMMyyDGBwsaS6JTFr1mNdHOQQxBLP/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:47.613840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33593560637ad5ec90efe67bb2a18259533f854beec409da94e4d4a36d21cbf5","sha256:1eda6a5180ac57474f644148f56e199e2781f9ba4302eccaf59b52ec0086ac26"],"state_sha256":"2e2ec10859b69d4e6e85650c37e3a1180202bd99258a74ec2e6554268fe586b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HiFvt53l7z1kw9Rp2KjYheuv3mxDPLPl7HMW7EPG3fsWCT07jhIZo9NJ03lBZB3EfCMYbqibE0IOIfdtEVAEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:36:41.387639Z","bundle_sha256":"5fdd3e3390b63645f50d20f663d1ef57d400c9d1fad9f6f6760d28712f3a09b6"}}