{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YCFTZLIKBTNTQGHC5PSW3FGUIE","short_pith_number":"pith:YCFTZLIK","schema_version":"1.0","canonical_sha256":"c08b3cad0a0cdb3818e2ebe56d94d44134faf2a686643c1cba01f557385e9386","source":{"kind":"arxiv","id":"1607.07727","version":1},"attestation_state":"computed","paper":{"title":"Leveraging the Potential of Control-Flow Error Resilient Techniques in Multithreaded Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hamid R. Zarandi, Mohammad Maghsoudloo, Navid Khoshavi","submitted_at":"2016-07-20T15:39:55Z","abstract_excerpt":"This paper presents a software-based technique to recover control-flow errors in multithreaded programs. Control-flow error recovery is achieved through inserting additional instructions into multithreaded program at compile time regarding to two dependency graphs. These graphs are extracted to model control-flow and data dependencies among basic blocks and thread interactions between different threads of a program. In order to evaluate the proposed technique, three multithreaded benchmarks quick sort, matrix multiplication and linked list utilized to run on a multi-core processor, and a total"},"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":"1607.07727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-20T15:39:55Z","cross_cats_sorted":[],"title_canon_sha256":"f8210c677f41b7961c58d083b17737b6e2dd2949d5885322692e8498f985ce34","abstract_canon_sha256":"aa8d88d2628e8e45f9097a3bb1629567f62bb4156607227ccc9c81c384676b3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:25.405658Z","signature_b64":"pFZ1dTmaTW8YIbzGwM1Px/P2sYTL+6Y3n8DjUTx7equTbd1V06tgM2x8RtpgdfUMhs6j/QzNbpCY7cg0fmIJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08b3cad0a0cdb3818e2ebe56d94d44134faf2a686643c1cba01f557385e9386","last_reissued_at":"2026-05-18T01:10:25.405128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:25.405128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging the Potential of Control-Flow Error Resilient Techniques in Multithreaded Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hamid R. Zarandi, Mohammad Maghsoudloo, Navid Khoshavi","submitted_at":"2016-07-20T15:39:55Z","abstract_excerpt":"This paper presents a software-based technique to recover control-flow errors in multithreaded programs. Control-flow error recovery is achieved through inserting additional instructions into multithreaded program at compile time regarding to two dependency graphs. These graphs are extracted to model control-flow and data dependencies among basic blocks and thread interactions between different threads of a program. In order to evaluate the proposed technique, three multithreaded benchmarks quick sort, matrix multiplication and linked list utilized to run on a multi-core processor, and a total"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07727","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":"1607.07727","created_at":"2026-05-18T01:10:25.405220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07727v1","created_at":"2026-05-18T01:10:25.405220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07727","created_at":"2026-05-18T01:10:25.405220+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCFTZLIKBTNT","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCFTZLIKBTNTQGHC","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCFTZLIK","created_at":"2026-05-18T12:30:53.716459+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/YCFTZLIKBTNTQGHC5PSW3FGUIE","json":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE.json","graph_json":"https://pith.science/api/pith-number/YCFTZLIKBTNTQGHC5PSW3FGUIE/graph.json","events_json":"https://pith.science/api/pith-number/YCFTZLIKBTNTQGHC5PSW3FGUIE/events.json","paper":"https://pith.science/paper/YCFTZLIK"},"agent_actions":{"view_html":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE","download_json":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE.json","view_paper":"https://pith.science/paper/YCFTZLIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07727&json=true","fetch_graph":"https://pith.science/api/pith-number/YCFTZLIKBTNTQGHC5PSW3FGUIE/graph.json","fetch_events":"https://pith.science/api/pith-number/YCFTZLIKBTNTQGHC5PSW3FGUIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE/action/storage_attestation","attest_author":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE/action/author_attestation","sign_citation":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE/action/citation_signature","submit_replication":"https://pith.science/pith/YCFTZLIKBTNTQGHC5PSW3FGUIE/action/replication_record"}},"created_at":"2026-05-18T01:10:25.405220+00:00","updated_at":"2026-05-18T01:10:25.405220+00:00"}