{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QGOVJQ5IYUHDAKALO5O4AAQQDP","short_pith_number":"pith:QGOVJQ5I","schema_version":"1.0","canonical_sha256":"819d54c3a8c50e30280b775dc002101be0e4cbdfc27ff79c8194e1d8b34a957a","source":{"kind":"arxiv","id":"1207.2544","version":2},"attestation_state":"computed","paper":{"title":"Variable and Thread Bounding for Systematic Testing of Multithreaded Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Akash Lal, Sandeep Bindal, Sorav Bansal","submitted_at":"2012-07-11T06:02:30Z","abstract_excerpt":"Previous approaches to systematic state-space exploration for testing multi-threaded programs have proposed context-bounding and depth-bounding to be effective ranking algorithms for testing multithreaded programs. This paper proposes two new metrics to rank thread schedules for systematic state-space exploration. Our metrics are based on characterization of a concurrency bug using v (the minimum number of distinct variables that need to be involved for the bug to manifest) and t (the minimum number of distinct threads among which scheduling constraints are required to manifest the bug). Our a"},"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":"1207.2544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-07-11T06:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"afe70f6e856946a0a00ae6975b02d3072231153f707a9977b29dcba5648319a0","abstract_canon_sha256":"f9858341228caff6d21a85828f47f8d31b12598dca9440effe7f7e2c1f7ea465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:35.449004Z","signature_b64":"/9Bqfb12GPxUIkjg2RckpGvbpNrI6ThRJh7I2VCl8+pp2DFP+rtg1nyfgDX6KieGSrAdqk1k3NI1LFxg+dqGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"819d54c3a8c50e30280b775dc002101be0e4cbdfc27ff79c8194e1d8b34a957a","last_reissued_at":"2026-05-18T03:34:35.448537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:35.448537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variable and Thread Bounding for Systematic Testing of Multithreaded Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Akash Lal, Sandeep Bindal, Sorav Bansal","submitted_at":"2012-07-11T06:02:30Z","abstract_excerpt":"Previous approaches to systematic state-space exploration for testing multi-threaded programs have proposed context-bounding and depth-bounding to be effective ranking algorithms for testing multithreaded programs. This paper proposes two new metrics to rank thread schedules for systematic state-space exploration. Our metrics are based on characterization of a concurrency bug using v (the minimum number of distinct variables that need to be involved for the bug to manifest) and t (the minimum number of distinct threads among which scheduling constraints are required to manifest the bug). Our a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2544","kind":"arxiv","version":2},"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":"1207.2544","created_at":"2026-05-18T03:34:35.448603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2544v2","created_at":"2026-05-18T03:34:35.448603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2544","created_at":"2026-05-18T03:34:35.448603+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGOVJQ5IYUHD","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGOVJQ5IYUHDAKAL","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGOVJQ5I","created_at":"2026-05-18T12:27:18.751474+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/QGOVJQ5IYUHDAKALO5O4AAQQDP","json":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP.json","graph_json":"https://pith.science/api/pith-number/QGOVJQ5IYUHDAKALO5O4AAQQDP/graph.json","events_json":"https://pith.science/api/pith-number/QGOVJQ5IYUHDAKALO5O4AAQQDP/events.json","paper":"https://pith.science/paper/QGOVJQ5I"},"agent_actions":{"view_html":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP","download_json":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP.json","view_paper":"https://pith.science/paper/QGOVJQ5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2544&json=true","fetch_graph":"https://pith.science/api/pith-number/QGOVJQ5IYUHDAKALO5O4AAQQDP/graph.json","fetch_events":"https://pith.science/api/pith-number/QGOVJQ5IYUHDAKALO5O4AAQQDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/action/storage_attestation","attest_author":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/action/author_attestation","sign_citation":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/action/citation_signature","submit_replication":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/action/replication_record"}},"created_at":"2026-05-18T03:34:35.448603+00:00","updated_at":"2026-05-18T03:34:35.448603+00:00"}