{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D4NMXSI652FP5GCHY7BDI2XOUN","short_pith_number":"pith:D4NMXSI6","canonical_record":{"source":{"id":"1605.06868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-23T01:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"3ae925711ffcbc9d5aa72f3e284d8efdc62ad030e04b7e683754d60dd6d665f6","abstract_canon_sha256":"8919f1c543bac5ca35216bcaae5a9ed77556a0f6cb04ccc935cdfc2574398afb"},"schema_version":"1.0"},"canonical_sha256":"1f1acbc91eee8afe9847c7c2346aeea35461bc6d14fc9f9136c6bd43ed6bb324","source":{"kind":"arxiv","id":"1605.06868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06868","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06868v1","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06868","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"D4NMXSI652FP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D4NMXSI652FP5GCH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D4NMXSI6","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D4NMXSI652FP5GCHY7BDI2XOUN","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-23T01:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"3ae925711ffcbc9d5aa72f3e284d8efdc62ad030e04b7e683754d60dd6d665f6","abstract_canon_sha256":"8919f1c543bac5ca35216bcaae5a9ed77556a0f6cb04ccc935cdfc2574398afb"},"schema_version":"1.0"},"canonical_sha256":"1f1acbc91eee8afe9847c7c2346aeea35461bc6d14fc9f9136c6bd43ed6bb324","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:11.032676Z","signature_b64":"h1ktQZlFM78ZMOrw9sRS25DC5+dTFKbpdZZGZPMLXLczAzBJx4R+B7GBsqqaYInGmas7WZBzvyPk1LfSv5EXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f1acbc91eee8afe9847c7c2346aeea35461bc6d14fc9f9136c6bd43ed6bb324","last_reissued_at":"2026-05-18T01:14:11.031986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:11.031986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06868","source_version":1,"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:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gzlys5ZqNjju32cfbi5bcKtljL9KZiwJ7RGdNGfmslHcJemdKtzUMdhJEIUB4CpEfhKziP5sIBoFRFSi5HWSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:58:57.955890Z"},"content_sha256":"44b8d7156abcfdcfa91479a156bf50f669b52dcd0f6c61fb182a4dcd8c7bd429","schema_version":"1.0","event_id":"sha256:44b8d7156abcfdcfa91479a156bf50f669b52dcd0f6c61fb182a4dcd8c7bd429"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D4NMXSI652FP5GCHY7BDI2XOUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decidable models of integer-manipulating programs with recursive parallelism (technical report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anthony Widjaja Lin, Matthew Hague","submitted_at":"2016-05-23T01:17:38Z","abstract_excerpt":"We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a hierarchical fashion, our model is state-extended ground-tree rewrite systems equipped with shared unbounded integer counters that can be incremented, decremented, and compared against an integer constant. Since the model is Turing-complete, we propose a decidable underapproximation. First, using a restriction similar to context-bounding, we underapproximate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06868","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"},"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:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUzk9fhTZREwzwRRl1skisAB5NaMoBpl2zxEjvyyyiZVBwwrOTYRKlZLaWCdR7UMy74Kx+48Z9MAQOgTN2RmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:58:57.956256Z"},"content_sha256":"205bf8edbd117b1b7751922c8e66c15bcb5ab36efdfe1076a5feaa5ff3896024","schema_version":"1.0","event_id":"sha256:205bf8edbd117b1b7751922c8e66c15bcb5ab36efdfe1076a5feaa5ff3896024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4NMXSI652FP5GCHY7BDI2XOUN/bundle.json","state_url":"https://pith.science/pith/D4NMXSI652FP5GCHY7BDI2XOUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4NMXSI652FP5GCHY7BDI2XOUN/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-23T19:58:57Z","links":{"resolver":"https://pith.science/pith/D4NMXSI652FP5GCHY7BDI2XOUN","bundle":"https://pith.science/pith/D4NMXSI652FP5GCHY7BDI2XOUN/bundle.json","state":"https://pith.science/pith/D4NMXSI652FP5GCHY7BDI2XOUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4NMXSI652FP5GCHY7BDI2XOUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D4NMXSI652FP5GCHY7BDI2XOUN","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":"8919f1c543bac5ca35216bcaae5a9ed77556a0f6cb04ccc935cdfc2574398afb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-23T01:17:38Z","title_canon_sha256":"3ae925711ffcbc9d5aa72f3e284d8efdc62ad030e04b7e683754d60dd6d665f6"},"schema_version":"1.0","source":{"id":"1605.06868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06868","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06868v1","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06868","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"D4NMXSI652FP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D4NMXSI652FP5GCH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D4NMXSI6","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:205bf8edbd117b1b7751922c8e66c15bcb5ab36efdfe1076a5feaa5ff3896024","target":"graph","created_at":"2026-05-18T01:14:11Z","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":"We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a hierarchical fashion, our model is state-extended ground-tree rewrite systems equipped with shared unbounded integer counters that can be incremented, decremented, and compared against an integer constant. Since the model is Turing-complete, we propose a decidable underapproximation. First, using a restriction similar to context-bounding, we underapproximate t","authors_text":"Anthony Widjaja Lin, Matthew Hague","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-23T01:17:38Z","title":"Decidable models of integer-manipulating programs with recursive parallelism (technical report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06868","kind":"arxiv","version":1},"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:44b8d7156abcfdcfa91479a156bf50f669b52dcd0f6c61fb182a4dcd8c7bd429","target":"record","created_at":"2026-05-18T01:14:11Z","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":"8919f1c543bac5ca35216bcaae5a9ed77556a0f6cb04ccc935cdfc2574398afb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-23T01:17:38Z","title_canon_sha256":"3ae925711ffcbc9d5aa72f3e284d8efdc62ad030e04b7e683754d60dd6d665f6"},"schema_version":"1.0","source":{"id":"1605.06868","kind":"arxiv","version":1}},"canonical_sha256":"1f1acbc91eee8afe9847c7c2346aeea35461bc6d14fc9f9136c6bd43ed6bb324","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f1acbc91eee8afe9847c7c2346aeea35461bc6d14fc9f9136c6bd43ed6bb324","first_computed_at":"2026-05-18T01:14:11.031986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:11.031986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h1ktQZlFM78ZMOrw9sRS25DC5+dTFKbpdZZGZPMLXLczAzBJx4R+B7GBsqqaYInGmas7WZBzvyPk1LfSv5EXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:11.032676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44b8d7156abcfdcfa91479a156bf50f669b52dcd0f6c61fb182a4dcd8c7bd429","sha256:205bf8edbd117b1b7751922c8e66c15bcb5ab36efdfe1076a5feaa5ff3896024"],"state_sha256":"5a9b9e6fdaabe3abd4bb17c490f3f7f60336d4cd10217b6e5066d33812b41bd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKEMGwLpSeyheA6CPO0ZPt501xHcTumqJcclY1eoOwNuCaXMXpiMcgA1BtjU98cxsEypNMYMccthcq9n8YzxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:58:57.958349Z","bundle_sha256":"3e504d7634c821ffae41cfedfa427fb17bfbff6e4fc3a1a28bb7dba87221468e"}}