{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5GLR5CILFSUMXZFEYQYLU3DVAH","short_pith_number":"pith:5GLR5CIL","canonical_record":{"source":{"id":"1007.3878","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-22T13:10:18Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"5f6396d4045d46e431305cb04c485977fabb6f735b54a078b90bc8ef722430b0","abstract_canon_sha256":"6d21e9e3e6ec530355fee67c60e106db1378646125349e09ba3f895ba364773b"},"schema_version":"1.0"},"canonical_sha256":"e9971e890b2ca8cbe4a4c430ba6c7501ec4b131baa94fcebc88eaf3d820f3416","source":{"kind":"arxiv","id":"1007.3878","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.3878","created_at":"2026-05-18T04:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1007.3878v4","created_at":"2026-05-18T04:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3878","created_at":"2026-05-18T04:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"5GLR5CILFSUM","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5GLR5CILFSUMXZFE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5GLR5CIL","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5GLR5CILFSUMXZFEYQYLU3DVAH","target":"record","payload":{"canonical_record":{"source":{"id":"1007.3878","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-22T13:10:18Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"5f6396d4045d46e431305cb04c485977fabb6f735b54a078b90bc8ef722430b0","abstract_canon_sha256":"6d21e9e3e6ec530355fee67c60e106db1378646125349e09ba3f895ba364773b"},"schema_version":"1.0"},"canonical_sha256":"e9971e890b2ca8cbe4a4c430ba6c7501ec4b131baa94fcebc88eaf3d820f3416","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:36.291465Z","signature_b64":"33euwWFKtLys3Ehs+nqPAo6IkE5ocrUs2Lsk0ClgW5wtA83oSXLMCEjBWESTe5JVoqsp20NlJEORDpb2TzD2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9971e890b2ca8cbe4a4c430ba6c7501ec4b131baa94fcebc88eaf3d820f3416","last_reissued_at":"2026-05-18T04:24:36.291023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:36.291023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.3878","source_version":4,"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-18T04:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvOlch3VBGUEe+1RnCfgJIbk50nXxSd5Avixwn3JYPS4dVgVD33qEkiRERawspY39L0bf5kcDG2Xq2uUPbLKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:22.762451Z"},"content_sha256":"f48cea094dce4a26786f103c7d6ad2b5472884761fde33882377279d278bd23b","schema_version":"1.0","event_id":"sha256:f48cea094dce4a26786f103c7d6ad2b5472884761fde33882377279d278bd23b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5GLR5CILFSUMXZFEYQYLU3DVAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Data Dependence problems for Program Schemas with Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CC","authors_text":"Michael R Laurence, Robert M Hierons, Sebastian Danicic","submitted_at":"2010-07-22T13:10:18Z","abstract_excerpt":"The problem of deciding whether one point in a program is data dependent upon another is fundamental to program analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of terms and predicate symbols, which represent arbitrary predicate functions, are allowed. Given a vertex l in the flowchart of a schema S having only equality (variable copying) assignments and variables v,w, we show that it is PSPACE-hard to decide whether there exists an execution of a program defined by S in w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3878","kind":"arxiv","version":4},"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-18T04:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvQDdPCvXkG6UcF38sjh36KZrZbDChFOUdgSUxyb+IxBJWMmXrAmqE+LMWHE9YNUYNaOKZ7H/cSXKZwHVqQnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:22.762796Z"},"content_sha256":"1a0a8b95a9a0f3fb9470a8fe2500110e8cbc29a7f9080cf9696368b578409780","schema_version":"1.0","event_id":"sha256:1a0a8b95a9a0f3fb9470a8fe2500110e8cbc29a7f9080cf9696368b578409780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GLR5CILFSUMXZFEYQYLU3DVAH/bundle.json","state_url":"https://pith.science/pith/5GLR5CILFSUMXZFEYQYLU3DVAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GLR5CILFSUMXZFEYQYLU3DVAH/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-09T14:52:22Z","links":{"resolver":"https://pith.science/pith/5GLR5CILFSUMXZFEYQYLU3DVAH","bundle":"https://pith.science/pith/5GLR5CILFSUMXZFEYQYLU3DVAH/bundle.json","state":"https://pith.science/pith/5GLR5CILFSUMXZFEYQYLU3DVAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GLR5CILFSUMXZFEYQYLU3DVAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5GLR5CILFSUMXZFEYQYLU3DVAH","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":"6d21e9e3e6ec530355fee67c60e106db1378646125349e09ba3f895ba364773b","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-22T13:10:18Z","title_canon_sha256":"5f6396d4045d46e431305cb04c485977fabb6f735b54a078b90bc8ef722430b0"},"schema_version":"1.0","source":{"id":"1007.3878","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.3878","created_at":"2026-05-18T04:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1007.3878v4","created_at":"2026-05-18T04:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3878","created_at":"2026-05-18T04:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"5GLR5CILFSUM","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5GLR5CILFSUMXZFE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5GLR5CIL","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:1a0a8b95a9a0f3fb9470a8fe2500110e8cbc29a7f9080cf9696368b578409780","target":"graph","created_at":"2026-05-18T04:24:36Z","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":"The problem of deciding whether one point in a program is data dependent upon another is fundamental to program analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of terms and predicate symbols, which represent arbitrary predicate functions, are allowed. Given a vertex l in the flowchart of a schema S having only equality (variable copying) assignments and variables v,w, we show that it is PSPACE-hard to decide whether there exists an execution of a program defined by S in w","authors_text":"Michael R Laurence, Robert M Hierons, Sebastian Danicic","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-22T13:10:18Z","title":"Complexity of Data Dependence problems for Program Schemas with Concurrency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3878","kind":"arxiv","version":4},"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:f48cea094dce4a26786f103c7d6ad2b5472884761fde33882377279d278bd23b","target":"record","created_at":"2026-05-18T04:24:36Z","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":"6d21e9e3e6ec530355fee67c60e106db1378646125349e09ba3f895ba364773b","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-22T13:10:18Z","title_canon_sha256":"5f6396d4045d46e431305cb04c485977fabb6f735b54a078b90bc8ef722430b0"},"schema_version":"1.0","source":{"id":"1007.3878","kind":"arxiv","version":4}},"canonical_sha256":"e9971e890b2ca8cbe4a4c430ba6c7501ec4b131baa94fcebc88eaf3d820f3416","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9971e890b2ca8cbe4a4c430ba6c7501ec4b131baa94fcebc88eaf3d820f3416","first_computed_at":"2026-05-18T04:24:36.291023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:36.291023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33euwWFKtLys3Ehs+nqPAo6IkE5ocrUs2Lsk0ClgW5wtA83oSXLMCEjBWESTe5JVoqsp20NlJEORDpb2TzD2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:36.291465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.3878","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f48cea094dce4a26786f103c7d6ad2b5472884761fde33882377279d278bd23b","sha256:1a0a8b95a9a0f3fb9470a8fe2500110e8cbc29a7f9080cf9696368b578409780"],"state_sha256":"eca7125298422f120708b600bb3b4eb5e3ffcf64c4f5eef08689f0b5a671355e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYfGNITr09C39aSUWuAOYgPMck4k8VVcSkOPrxnT1DiNXB85WyUQZFa5u+20R3L4v1GcWf+0fUTeKGpqUz96CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:52:22.766524Z","bundle_sha256":"5df676f5256e3ca76bbffe80c32342bdc2457529b015be157c46f21a11114e97"}}