{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KBXUTAB5257CG5S5RBVBUQEHUQ","short_pith_number":"pith:KBXUTAB5","canonical_record":{"source":{"id":"1903.05333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-13T06:31:12Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"62a6faf23a82225271bd1ad71e48d2e558666aaaaf3df2acf11992727f53135f","abstract_canon_sha256":"df68ae6ef294582e2cf33404bc6742114324faffa13ab4e84ab2481323f49d29"},"schema_version":"1.0"},"canonical_sha256":"506f49803dd77e23765d886a1a4087a422543fa5f03257695032ece4b08530a2","source":{"kind":"arxiv","id":"1903.05333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05333","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05333v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05333","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"KBXUTAB5257C","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KBXUTAB5257CG5S5","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KBXUTAB5","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KBXUTAB5257CG5S5RBVBUQEHUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-13T06:31:12Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"62a6faf23a82225271bd1ad71e48d2e558666aaaaf3df2acf11992727f53135f","abstract_canon_sha256":"df68ae6ef294582e2cf33404bc6742114324faffa13ab4e84ab2481323f49d29"},"schema_version":"1.0"},"canonical_sha256":"506f49803dd77e23765d886a1a4087a422543fa5f03257695032ece4b08530a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.629453Z","signature_b64":"bTabljgE+RIKVDwhbe3r48rdqRtY7twEoZZmCHRgsc6/YQb5D32hJ0wK8h2Q8aUZCStxjgdpZTBM6283EV+jAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506f49803dd77e23765d886a1a4087a422543fa5f03257695032ece4b08530a2","last_reissued_at":"2026-05-17T23:51:24.628640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.628640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05333","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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eg2E8JA50lDvO3DkNChvPb0xnCL/tjQbsfbA8+G6rVKli6BFuvA0yUu+bLh21NWc3jdrRKvOHyABHR6uGkl4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:17:05.423853Z"},"content_sha256":"2629a97bfe5c1e411ced48aaec28a87025934d24d6512ee94b26d78ab5bca310","schema_version":"1.0","event_id":"sha256:2629a97bfe5c1e411ced48aaec28a87025934d24d6512ee94b26d78ab5bca310"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KBXUTAB5257CG5S5RBVBUQEHUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SymPas: Symbolic Program Slicing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Yingzhou Zhang","submitted_at":"2019-03-13T06:31:12Z","abstract_excerpt":"Program slicing is a technique for simplifying programs by focusing on selected aspects of their behaviour. Current mainstream static slicing methods operate on the PDG (program dependence graph) or SDG (system dependence graph), but these friendly graph representations may be expensive and error-prone for some users. We attempt in this paper to study a light-weight approach of static program slicing, called Symbolic Program Slicing (SymPas), which works as a dataflow analysis on LLVM (Low-Level Virtual Machine). In our SymPas approach, slices are stored symbolically rather than procedure bein"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05333","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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l18+CSrDzYvws447RONME/dbrquKXggXSF1J4AzqPZbkAa+Xg7W4/2EoKwAcLA9vCrgWzk/TqIEmGu3SgNApDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:17:05.424893Z"},"content_sha256":"66e538a2d06ec035f4048657d79576e2f8b44c8a05895ce6bdfea522315936ad","schema_version":"1.0","event_id":"sha256:66e538a2d06ec035f4048657d79576e2f8b44c8a05895ce6bdfea522315936ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBXUTAB5257CG5S5RBVBUQEHUQ/bundle.json","state_url":"https://pith.science/pith/KBXUTAB5257CG5S5RBVBUQEHUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBXUTAB5257CG5S5RBVBUQEHUQ/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-08-15T19:17:05Z","links":{"resolver":"https://pith.science/pith/KBXUTAB5257CG5S5RBVBUQEHUQ","bundle":"https://pith.science/pith/KBXUTAB5257CG5S5RBVBUQEHUQ/bundle.json","state":"https://pith.science/pith/KBXUTAB5257CG5S5RBVBUQEHUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBXUTAB5257CG5S5RBVBUQEHUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KBXUTAB5257CG5S5RBVBUQEHUQ","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":"df68ae6ef294582e2cf33404bc6742114324faffa13ab4e84ab2481323f49d29","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-13T06:31:12Z","title_canon_sha256":"62a6faf23a82225271bd1ad71e48d2e558666aaaaf3df2acf11992727f53135f"},"schema_version":"1.0","source":{"id":"1903.05333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05333","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05333v1","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05333","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"KBXUTAB5257C","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KBXUTAB5257CG5S5","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KBXUTAB5","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:66e538a2d06ec035f4048657d79576e2f8b44c8a05895ce6bdfea522315936ad","target":"graph","created_at":"2026-05-17T23:51:24Z","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":"Program slicing is a technique for simplifying programs by focusing on selected aspects of their behaviour. Current mainstream static slicing methods operate on the PDG (program dependence graph) or SDG (system dependence graph), but these friendly graph representations may be expensive and error-prone for some users. We attempt in this paper to study a light-weight approach of static program slicing, called Symbolic Program Slicing (SymPas), which works as a dataflow analysis on LLVM (Low-Level Virtual Machine). In our SymPas approach, slices are stored symbolically rather than procedure bein","authors_text":"Yingzhou Zhang","cross_cats":["cs.LO","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-13T06:31:12Z","title":"SymPas: Symbolic Program Slicing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05333","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:2629a97bfe5c1e411ced48aaec28a87025934d24d6512ee94b26d78ab5bca310","target":"record","created_at":"2026-05-17T23:51:24Z","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":"df68ae6ef294582e2cf33404bc6742114324faffa13ab4e84ab2481323f49d29","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-13T06:31:12Z","title_canon_sha256":"62a6faf23a82225271bd1ad71e48d2e558666aaaaf3df2acf11992727f53135f"},"schema_version":"1.0","source":{"id":"1903.05333","kind":"arxiv","version":1}},"canonical_sha256":"506f49803dd77e23765d886a1a4087a422543fa5f03257695032ece4b08530a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"506f49803dd77e23765d886a1a4087a422543fa5f03257695032ece4b08530a2","first_computed_at":"2026-05-17T23:51:24.628640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.628640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bTabljgE+RIKVDwhbe3r48rdqRtY7twEoZZmCHRgsc6/YQb5D32hJ0wK8h2Q8aUZCStxjgdpZTBM6283EV+jAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.629453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2629a97bfe5c1e411ced48aaec28a87025934d24d6512ee94b26d78ab5bca310","sha256:66e538a2d06ec035f4048657d79576e2f8b44c8a05895ce6bdfea522315936ad"],"state_sha256":"6d18076cdd582fe330beaa3745924c3bea4a8a7699f565ff845d7707b5f35935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMix9K86mJXLCFwunSYatcprUETcWvj9y69mxapWIdq4G4+IZBBV1qHn6AwxPUmLhX4qJLMHvQpjUP5EUUfJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T19:17:05.429630Z","bundle_sha256":"80c1092f343f3e97df5a3cd40cceec6fee636c05363d2b528902f80549d9b0ec"}}