{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OI3JTKXSYHKDJOBFMMOYIIUUSY","short_pith_number":"pith:OI3JTKXS","canonical_record":{"source":{"id":"1111.1011","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-03T23:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"d0a9841bd65db349c063a53ee261f55e7b7a02f0014f89e9dff317e32adfe482","abstract_canon_sha256":"81f62240d4ca7582232ffc0ecfd228ce2db85c24ff9bbcca403cc3ba0c110107"},"schema_version":"1.0"},"canonical_sha256":"723699aaf2c1d434b825631d8422949624204e8e3a7676655be5087a1bdb0c42","source":{"kind":"arxiv","id":"1111.1011","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1011","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1011v3","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1011","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"OI3JTKXSYHKD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OI3JTKXSYHKDJOBF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OI3JTKXS","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OI3JTKXSYHKDJOBFMMOYIIUUSY","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1011","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-03T23:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"d0a9841bd65db349c063a53ee261f55e7b7a02f0014f89e9dff317e32adfe482","abstract_canon_sha256":"81f62240d4ca7582232ffc0ecfd228ce2db85c24ff9bbcca403cc3ba0c110107"},"schema_version":"1.0"},"canonical_sha256":"723699aaf2c1d434b825631d8422949624204e8e3a7676655be5087a1bdb0c42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.169965Z","signature_b64":"vOA5rj+5Rcwxwa9yt4qbPyx69qQJxO7H27IcMS77XdoPW8agB+Gc73EDY09dUc2sCwGBBnU8IqzX1be6Gmr3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"723699aaf2c1d434b825631d8422949624204e8e3a7676655be5087a1bdb0c42","last_reissued_at":"2026-05-18T01:37:39.169346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.169346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1011","source_version":3,"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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l20dDf8V8A/TRovq1PbnfPjo9J71QfOD9ok6eoTQw4LNMO31uWHwECV6148u6EaVOFd4nTzSPgu6+nyZHrYUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:43.473202Z"},"content_sha256":"3cd246f099b3d4ee79f1273f15e51402b49cfd510d510089f1561b83fa55599f","schema_version":"1.0","event_id":"sha256:3cd246f099b3d4ee79f1273f15e51402b49cfd510d510089f1561b83fa55599f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OI3JTKXSYHKDJOBFMMOYIIUUSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ahmed Bouajjani (LIAFA, CNRS, Mohamed Faouzi Atig (LIAFA, Redmond), Shaz Qadeer (Microsoft Research, University of Paris Diderot (Paris 7))","submitted_at":"2011-11-03T23:37:53Z","abstract_excerpt":"Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number of context switches between threads. This definition is inadequate for programs that create threads dynamically because bounding the number of context switches in a computation also bounds the number of threads involved in the computation. In this paper, we propose a more general definition of context-bounded analysis useful for programs with dynami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1011","kind":"arxiv","version":3},"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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFRyIYf00+zqSJIjaRajrOppVONKgEb9pLg5Gir3/2ONhrcvpx5WMjaKbu8CE5+3qUhh9qMCTF7aDOObz41BCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:43.473564Z"},"content_sha256":"015ba30549fa468a0a800460e29a2e47f5b07f0cc3a4e4427b6dd1a0072ad644","schema_version":"1.0","event_id":"sha256:015ba30549fa468a0a800460e29a2e47f5b07f0cc3a4e4427b6dd1a0072ad644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/bundle.json","state_url":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/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-22T23:23:43Z","links":{"resolver":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY","bundle":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/bundle.json","state":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OI3JTKXSYHKDJOBFMMOYIIUUSY","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":"81f62240d4ca7582232ffc0ecfd228ce2db85c24ff9bbcca403cc3ba0c110107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-03T23:37:53Z","title_canon_sha256":"d0a9841bd65db349c063a53ee261f55e7b7a02f0014f89e9dff317e32adfe482"},"schema_version":"1.0","source":{"id":"1111.1011","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1011","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1011v3","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1011","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"OI3JTKXSYHKD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OI3JTKXSYHKDJOBF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OI3JTKXS","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:015ba30549fa468a0a800460e29a2e47f5b07f0cc3a4e4427b6dd1a0072ad644","target":"graph","created_at":"2026-05-18T01:37:39Z","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":"Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number of context switches between threads. This definition is inadequate for programs that create threads dynamically because bounding the number of context switches in a computation also bounds the number of threads involved in the computation. In this paper, we propose a more general definition of context-bounded analysis useful for programs with dynami","authors_text":"Ahmed Bouajjani (LIAFA, CNRS, Mohamed Faouzi Atig (LIAFA, Redmond), Shaz Qadeer (Microsoft Research, University of Paris Diderot (Paris 7))","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-03T23:37:53Z","title":"Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1011","kind":"arxiv","version":3},"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:3cd246f099b3d4ee79f1273f15e51402b49cfd510d510089f1561b83fa55599f","target":"record","created_at":"2026-05-18T01:37:39Z","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":"81f62240d4ca7582232ffc0ecfd228ce2db85c24ff9bbcca403cc3ba0c110107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-03T23:37:53Z","title_canon_sha256":"d0a9841bd65db349c063a53ee261f55e7b7a02f0014f89e9dff317e32adfe482"},"schema_version":"1.0","source":{"id":"1111.1011","kind":"arxiv","version":3}},"canonical_sha256":"723699aaf2c1d434b825631d8422949624204e8e3a7676655be5087a1bdb0c42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"723699aaf2c1d434b825631d8422949624204e8e3a7676655be5087a1bdb0c42","first_computed_at":"2026-05-18T01:37:39.169346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.169346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vOA5rj+5Rcwxwa9yt4qbPyx69qQJxO7H27IcMS77XdoPW8agB+Gc73EDY09dUc2sCwGBBnU8IqzX1be6Gmr3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.169965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1011","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cd246f099b3d4ee79f1273f15e51402b49cfd510d510089f1561b83fa55599f","sha256:015ba30549fa468a0a800460e29a2e47f5b07f0cc3a4e4427b6dd1a0072ad644"],"state_sha256":"4c53612a93a7a46f3c44b73be9bec6185b8909e3dd89754676d99f464b194953"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epLd2n2/7EeSF9fZ4q6vf0gjHb00oAKMDxNH5m0p+sRUqOVH758YGSVR4BvW1p2wcBfOAnT1mKZFI/8pfItmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:23:43.475468Z","bundle_sha256":"483d0a2c84c648381a0d16cffedee44628dc01cd8bfbc18989723bc223be9af1"}}