{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QGOVJQ5IYUHDAKALO5O4AAQQDP","short_pith_number":"pith:QGOVJQ5I","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"},"canonical_sha256":"819d54c3a8c50e30280b775dc002101be0e4cbdfc27ff79c8194e1d8b34a957a","source":{"kind":"arxiv","id":"1207.2544","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2544","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2544v2","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2544","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"QGOVJQ5IYUHD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QGOVJQ5IYUHDAKAL","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QGOVJQ5I","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QGOVJQ5IYUHDAKALO5O4AAQQDP","target":"record","payload":{"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"},"canonical_sha256":"819d54c3a8c50e30280b775dc002101be0e4cbdfc27ff79c8194e1d8b34a957a","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"},"source_kind":"arxiv","source_id":"1207.2544","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jInvm0o6WXRyKFBzitsg4ezuu25ZDQJ5WsZ6x4N8iPbEvzw+59QQwhwM3yqTanB2cacx6iRGfxl5tplBG1dLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:17:01.952458Z"},"content_sha256":"c3d23591e1ac3606827f2aef024f559e5d8e64f58b7c573099b069334eefff66","schema_version":"1.0","event_id":"sha256:c3d23591e1ac3606827f2aef024f559e5d8e64f58b7c573099b069334eefff66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QGOVJQ5IYUHDAKALO5O4AAQQDP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rs6Z5IF9VqWHb1QbdtMh50Q4d5FhFnczC7gXXAb8aieLSKc865w4popCnleeS1LZRmg2InvI16BTNFNKlAMjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:17:01.952793Z"},"content_sha256":"90490a3fcac965995bd4f20744b45168c35c5f32791ad116dcf77d0dd0f2e527","schema_version":"1.0","event_id":"sha256:90490a3fcac965995bd4f20744b45168c35c5f32791ad116dcf77d0dd0f2e527"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/bundle.json","state_url":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T20:17:01Z","links":{"resolver":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP","bundle":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/bundle.json","state":"https://pith.science/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGOVJQ5IYUHDAKALO5O4AAQQDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QGOVJQ5IYUHDAKALO5O4AAQQDP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f9858341228caff6d21a85828f47f8d31b12598dca9440effe7f7e2c1f7ea465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-07-11T06:02:30Z","title_canon_sha256":"afe70f6e856946a0a00ae6975b02d3072231153f707a9977b29dcba5648319a0"},"schema_version":"1.0","source":{"id":"1207.2544","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2544","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2544v2","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2544","created_at":"2026-05-18T03:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"QGOVJQ5IYUHD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QGOVJQ5IYUHDAKAL","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QGOVJQ5I","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:90490a3fcac965995bd4f20744b45168c35c5f32791ad116dcf77d0dd0f2e527","target":"graph","created_at":"2026-05-18T03:34:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Akash Lal, Sandeep Bindal, Sorav Bansal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-07-11T06:02:30Z","title":"Variable and Thread Bounding for Systematic Testing of Multithreaded Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2544","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c3d23591e1ac3606827f2aef024f559e5d8e64f58b7c573099b069334eefff66","target":"record","created_at":"2026-05-18T03:34:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f9858341228caff6d21a85828f47f8d31b12598dca9440effe7f7e2c1f7ea465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-07-11T06:02:30Z","title_canon_sha256":"afe70f6e856946a0a00ae6975b02d3072231153f707a9977b29dcba5648319a0"},"schema_version":"1.0","source":{"id":"1207.2544","kind":"arxiv","version":2}},"canonical_sha256":"819d54c3a8c50e30280b775dc002101be0e4cbdfc27ff79c8194e1d8b34a957a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"819d54c3a8c50e30280b775dc002101be0e4cbdfc27ff79c8194e1d8b34a957a","first_computed_at":"2026-05-18T03:34:35.448537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:35.448537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/9Bqfb12GPxUIkjg2RckpGvbpNrI6ThRJh7I2VCl8+pp2DFP+rtg1nyfgDX6KieGSrAdqk1k3NI1LFxg+dqGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:35.449004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2544","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3d23591e1ac3606827f2aef024f559e5d8e64f58b7c573099b069334eefff66","sha256:90490a3fcac965995bd4f20744b45168c35c5f32791ad116dcf77d0dd0f2e527"],"state_sha256":"f16c42ecaadaa855835b3c61cc4685f33b074ee3c8f9133c7a8ad620888367d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/4ePpElG4u/lVcxE0Id/OOXd+KFQVXQkwHRDCnSUfIb+sSWFZGSMB/EA/dVG2+JpCel1cOf+FnXnwJl68jlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:17:01.954677Z","bundle_sha256":"e629212d521c701126dc8c2483dcca4a96f6c3d10c9bbd5d369ebc7c58a11767"}}