{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CAR2IQQXFPPUS36PIOFCTOKRB3","short_pith_number":"pith:CAR2IQQX","schema_version":"1.0","canonical_sha256":"1023a442172bdf496fcf438a29b9510ecdd3602c346df37ca4a3ae57c615ec89","source":{"kind":"arxiv","id":"1511.07163","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Solution Quality in Synchronization Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Edmund M. Clarke, Leonid Ryzhyk, Pavol \\v{C}ern\\'y, Roopsha Samanta, Thomas A. Henzinger, Thorsten Tarrach","submitted_at":"2015-11-23T10:24:30Z","abstract_excerpt":"Given a multithreaded program written assuming a friendly, non-preemptive scheduler, the goal of synchronization synthesis is to automatically insert synchronization primitives to ensure that the modified program behaves correctly, even with a preemptive scheduler. In this work, we focus on the quality of the synthesized solution: we aim to infer synchronization placements that not only ensure correctness, but also meet some quantitative objectives such as optimal program performance on a given computing platform.\n  The key step that enables solution optimization is the construction of a set o"},"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":"1511.07163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-23T10:24:30Z","cross_cats_sorted":[],"title_canon_sha256":"fae96c82c276e19d30fa94d9d5001637cc0eba35b76b45908e622d84a9aa8d8d","abstract_canon_sha256":"8adb3a6207afdf38879f46cfe558d35f9e409f2c6d2cda14f288cb19b70f3118"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:12.059460Z","signature_b64":"LdSx+TeUwgPbmH8xuBqy/7Vv82s9bpareWGd/3SSLKfb8a6Uo8vE4EUT2jK9rlX007e7z2StsuJuLz8Cw0+fAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1023a442172bdf496fcf438a29b9510ecdd3602c346df37ca4a3ae57c615ec89","last_reissued_at":"2026-05-18T01:26:12.058785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:12.058785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Solution Quality in Synchronization Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Edmund M. Clarke, Leonid Ryzhyk, Pavol \\v{C}ern\\'y, Roopsha Samanta, Thomas A. Henzinger, Thorsten Tarrach","submitted_at":"2015-11-23T10:24:30Z","abstract_excerpt":"Given a multithreaded program written assuming a friendly, non-preemptive scheduler, the goal of synchronization synthesis is to automatically insert synchronization primitives to ensure that the modified program behaves correctly, even with a preemptive scheduler. In this work, we focus on the quality of the synthesized solution: we aim to infer synchronization placements that not only ensure correctness, but also meet some quantitative objectives such as optimal program performance on a given computing platform.\n  The key step that enables solution optimization is the construction of a set o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07163","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":"1511.07163","created_at":"2026-05-18T01:26:12.058887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07163v1","created_at":"2026-05-18T01:26:12.058887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07163","created_at":"2026-05-18T01:26:12.058887+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAR2IQQXFPPU","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAR2IQQXFPPUS36P","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAR2IQQX","created_at":"2026-05-18T12:29:14.074870+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/CAR2IQQXFPPUS36PIOFCTOKRB3","json":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3.json","graph_json":"https://pith.science/api/pith-number/CAR2IQQXFPPUS36PIOFCTOKRB3/graph.json","events_json":"https://pith.science/api/pith-number/CAR2IQQXFPPUS36PIOFCTOKRB3/events.json","paper":"https://pith.science/paper/CAR2IQQX"},"agent_actions":{"view_html":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3","download_json":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3.json","view_paper":"https://pith.science/paper/CAR2IQQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07163&json=true","fetch_graph":"https://pith.science/api/pith-number/CAR2IQQXFPPUS36PIOFCTOKRB3/graph.json","fetch_events":"https://pith.science/api/pith-number/CAR2IQQXFPPUS36PIOFCTOKRB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3/action/storage_attestation","attest_author":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3/action/author_attestation","sign_citation":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3/action/citation_signature","submit_replication":"https://pith.science/pith/CAR2IQQXFPPUS36PIOFCTOKRB3/action/replication_record"}},"created_at":"2026-05-18T01:26:12.058887+00:00","updated_at":"2026-05-18T01:26:12.058887+00:00"}