{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G6IQWXIKSMNOFBVFZKHWDTQ2XH","short_pith_number":"pith:G6IQWXIK","schema_version":"1.0","canonical_sha256":"37910b5d0a931ae286a5ca8f61ce1ab9d7feb2577b4a1c39ec675864224fc683","source":{"kind":"arxiv","id":"1602.03755","version":2},"attestation_state":"computed","paper":{"title":"Hitting Families of Schedules for Asynchronous Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.DM","authors_text":"Dmitry Chistikov, Filip Niksic, Rupak Majumdar","submitted_at":"2016-02-11T14:44:44Z","abstract_excerpt":"We consider the following basic task in the testing of concurrent systems. The input to the task is a partial order of events, which models actions performed on or by the system and specifies ordering constraints between them. The task is to determine if some scheduling of these events can result in a bug. The number of schedules to be explored can, in general, be exponential.\n  Empirically, many bugs in concurrent programs have been observed to have small bug depth; that is, these bugs are exposed by every schedule that orders $d$ specific events in a particular way, irrespective of how the 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":"1602.03755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-11T14:44:44Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"80754f24b40aa7ddfc0bd48add6426a78a19cd0acbe69be9b92bb10c1b38941e","abstract_canon_sha256":"cf59595f0a68d13005e62621f8c66bf17b3567d19515932be43424aa71a21d44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:59.390127Z","signature_b64":"GVbs3hD86h2yqigg1iZW4MXiMTcsVOk+FtwnimxQ4J/QxfG4MdpXjAcGLpzXNE5sThjnM/bjlZSABkJQhNbSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37910b5d0a931ae286a5ca8f61ce1ab9d7feb2577b4a1c39ec675864224fc683","last_reissued_at":"2026-05-18T01:10:59.389635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:59.389635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting Families of Schedules for Asynchronous Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.DM","authors_text":"Dmitry Chistikov, Filip Niksic, Rupak Majumdar","submitted_at":"2016-02-11T14:44:44Z","abstract_excerpt":"We consider the following basic task in the testing of concurrent systems. The input to the task is a partial order of events, which models actions performed on or by the system and specifies ordering constraints between them. The task is to determine if some scheduling of these events can result in a bug. The number of schedules to be explored can, in general, be exponential.\n  Empirically, many bugs in concurrent programs have been observed to have small bug depth; that is, these bugs are exposed by every schedule that orders $d$ specific events in a particular way, irrespective of how the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03755","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":"1602.03755","created_at":"2026-05-18T01:10:59.389706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03755v2","created_at":"2026-05-18T01:10:59.389706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03755","created_at":"2026-05-18T01:10:59.389706+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6IQWXIKSMNO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6IQWXIKSMNOFBVF","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6IQWXIK","created_at":"2026-05-18T12:30:15.759754+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/G6IQWXIKSMNOFBVFZKHWDTQ2XH","json":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH.json","graph_json":"https://pith.science/api/pith-number/G6IQWXIKSMNOFBVFZKHWDTQ2XH/graph.json","events_json":"https://pith.science/api/pith-number/G6IQWXIKSMNOFBVFZKHWDTQ2XH/events.json","paper":"https://pith.science/paper/G6IQWXIK"},"agent_actions":{"view_html":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH","download_json":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH.json","view_paper":"https://pith.science/paper/G6IQWXIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03755&json=true","fetch_graph":"https://pith.science/api/pith-number/G6IQWXIKSMNOFBVFZKHWDTQ2XH/graph.json","fetch_events":"https://pith.science/api/pith-number/G6IQWXIKSMNOFBVFZKHWDTQ2XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH/action/storage_attestation","attest_author":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH/action/author_attestation","sign_citation":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH/action/citation_signature","submit_replication":"https://pith.science/pith/G6IQWXIKSMNOFBVFZKHWDTQ2XH/action/replication_record"}},"created_at":"2026-05-18T01:10:59.389706+00:00","updated_at":"2026-05-18T01:10:59.389706+00:00"}