{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CGUX4PBKXUDD2AOARKVQEFIZU5","short_pith_number":"pith:CGUX4PBK","schema_version":"1.0","canonical_sha256":"11a97e3c2abd063d01c08aab021519a7497835d5756f95a2ded8fb0121e1fb11","source":{"kind":"arxiv","id":"1407.3681","version":1},"attestation_state":"computed","paper":{"title":"Regression-free Synthesis for Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Leonid Ryzhyk, Pavol \\v{C}ern\\'y, Thomas A. Henzinger, Thorsten Tarrach","submitted_at":"2014-07-14T14:54:58Z","abstract_excerpt":"While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in for repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each posit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.3681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-07-14T14:54:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f2b76def331704a17cfa08863ac64b99860045c7e829656d128d659a2974c7af","abstract_canon_sha256":"7df4b17f86183cbd3bccbf8047d82a42f73bf3f86cbb05fb226863c0a7cd94a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:42.015358Z","signature_b64":"/yUvqCkVmRmJOdzJN7W9kVfSlAPDL8VQ7AeYCRE6r6wmiBcz89WlMtx1+lhzSRAwW9kVuUlXhUivesX5d2DtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11a97e3c2abd063d01c08aab021519a7497835d5756f95a2ded8fb0121e1fb11","last_reissued_at":"2026-05-18T02:47:42.014621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:42.014621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regression-free Synthesis for Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Leonid Ryzhyk, Pavol \\v{C}ern\\'y, Thomas A. Henzinger, Thorsten Tarrach","submitted_at":"2014-07-14T14:54:58Z","abstract_excerpt":"While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in for repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each posit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3681","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.3681","created_at":"2026-05-18T02:47:42.014726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3681v1","created_at":"2026-05-18T02:47:42.014726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3681","created_at":"2026-05-18T02:47:42.014726+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGUX4PBKXUDD","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGUX4PBKXUDD2AOA","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGUX4PBK","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5","json":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5.json","graph_json":"https://pith.science/api/pith-number/CGUX4PBKXUDD2AOARKVQEFIZU5/graph.json","events_json":"https://pith.science/api/pith-number/CGUX4PBKXUDD2AOARKVQEFIZU5/events.json","paper":"https://pith.science/paper/CGUX4PBK"},"agent_actions":{"view_html":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5","download_json":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5.json","view_paper":"https://pith.science/paper/CGUX4PBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3681&json=true","fetch_graph":"https://pith.science/api/pith-number/CGUX4PBKXUDD2AOARKVQEFIZU5/graph.json","fetch_events":"https://pith.science/api/pith-number/CGUX4PBKXUDD2AOARKVQEFIZU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5/action/storage_attestation","attest_author":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5/action/author_attestation","sign_citation":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5/action/citation_signature","submit_replication":"https://pith.science/pith/CGUX4PBKXUDD2AOARKVQEFIZU5/action/replication_record"}},"created_at":"2026-05-18T02:47:42.014726+00:00","updated_at":"2026-05-18T02:47:42.014726+00:00"}