{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2YUR3SBT766UFXUY5IU4RLPMGV","short_pith_number":"pith:2YUR3SBT","schema_version":"1.0","canonical_sha256":"d6291dc833ffbd42de98ea29c8adec356e4670df2e772540487c6b197b5f6bf7","source":{"kind":"arxiv","id":"1708.02801","version":1},"attestation_state":"computed","paper":{"title":"Safety Verification of Phaser Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Rezine, Petru Eles, Zebo Peng, Zeinab Ganjei","submitted_at":"2017-08-09T12:17:01Z","abstract_excerpt":"We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point synchronizations. For instance, phasers can enforce barriers or producer-consumer synchronization schemes among all or subsets of the running tasks. Implementations %of these rece"},"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":"1708.02801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-09T12:17:01Z","cross_cats_sorted":[],"title_canon_sha256":"825f2d0c2b7b3b757201da9a58e45d3d04f3640d5478ea44f5ad55a70e078e78","abstract_canon_sha256":"1be93d27c5b16b8df4a1aef2b21b8a63eeddc45d83004712305ef3466c936699"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:19.486189Z","signature_b64":"DLZdzy7pMT+yEAU17IBIWUxC6pbl+6sKFVt4sfC1m8w1zCnjz2ucqcdtehvvsweQim6ImcMkJAbSnyM8KdBGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6291dc833ffbd42de98ea29c8adec356e4670df2e772540487c6b197b5f6bf7","last_reissued_at":"2026-05-18T00:38:19.485497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:19.485497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safety Verification of Phaser Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Rezine, Petru Eles, Zebo Peng, Zeinab Ganjei","submitted_at":"2017-08-09T12:17:01Z","abstract_excerpt":"We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point synchronizations. For instance, phasers can enforce barriers or producer-consumer synchronization schemes among all or subsets of the running tasks. Implementations %of these rece"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02801","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":"1708.02801","created_at":"2026-05-18T00:38:19.485600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02801v1","created_at":"2026-05-18T00:38:19.485600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02801","created_at":"2026-05-18T00:38:19.485600+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YUR3SBT766U","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YUR3SBT766UFXUY","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YUR3SBT","created_at":"2026-05-18T12:30:55.937587+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/2YUR3SBT766UFXUY5IU4RLPMGV","json":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV.json","graph_json":"https://pith.science/api/pith-number/2YUR3SBT766UFXUY5IU4RLPMGV/graph.json","events_json":"https://pith.science/api/pith-number/2YUR3SBT766UFXUY5IU4RLPMGV/events.json","paper":"https://pith.science/paper/2YUR3SBT"},"agent_actions":{"view_html":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV","download_json":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV.json","view_paper":"https://pith.science/paper/2YUR3SBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02801&json=true","fetch_graph":"https://pith.science/api/pith-number/2YUR3SBT766UFXUY5IU4RLPMGV/graph.json","fetch_events":"https://pith.science/api/pith-number/2YUR3SBT766UFXUY5IU4RLPMGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV/action/storage_attestation","attest_author":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV/action/author_attestation","sign_citation":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV/action/citation_signature","submit_replication":"https://pith.science/pith/2YUR3SBT766UFXUY5IU4RLPMGV/action/replication_record"}},"created_at":"2026-05-18T00:38:19.485600+00:00","updated_at":"2026-05-18T00:38:19.485600+00:00"}