{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7ZA7UAQWQWYSMKUQTIVXBCT7FN","short_pith_number":"pith:7ZA7UAQW","canonical_record":{"source":{"id":"1701.05650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-20T00:51:09Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"c8b4d6b59a99327cf377af83e02814777318fc25aba4e9f71492b41dcdd52ffe","abstract_canon_sha256":"b79b7a4be893ea8053dd8af8ca26fb9f77cbd636076fab53f119bee35ce7b536"},"schema_version":"1.0"},"canonical_sha256":"fe41fa021685b1262a909a2b708a7f2b6d989cf9a6aa5cb614c41ed2d729554d","source":{"kind":"arxiv","id":"1701.05650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05650","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05650v1","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05650","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"7ZA7UAQWQWYS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ZA7UAQWQWYSMKUQ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ZA7UAQW","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7ZA7UAQWQWYSMKUQTIVXBCT7FN","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-20T00:51:09Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"c8b4d6b59a99327cf377af83e02814777318fc25aba4e9f71492b41dcdd52ffe","abstract_canon_sha256":"b79b7a4be893ea8053dd8af8ca26fb9f77cbd636076fab53f119bee35ce7b536"},"schema_version":"1.0"},"canonical_sha256":"fe41fa021685b1262a909a2b708a7f2b6d989cf9a6aa5cb614c41ed2d729554d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:28.885352Z","signature_b64":"Jne5vJ83NDAsshB1FpcyDJ38FQVIk1DvT+43lPwi6iO3sTGqq/DRPim36I35YY9zVGB0i1AI8f1dxWQoowp9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe41fa021685b1262a909a2b708a7f2b6d989cf9a6aa5cb614c41ed2d729554d","last_reissued_at":"2026-05-18T00:52:28.884777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:28.884777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05650","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-18T00:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lrr6uUPMbKKV0kKvObKjp4mBRPc/W2MJ1CB8m8TFP3p/yuMkuy7l89GA8PwogatbhA9Unu12VJ96C+Pp6cMzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:34:55.927582Z"},"content_sha256":"ad5f9734964dff9f511bcc1e288768127ab992442bf1b4241768dff82d92244f","schema_version":"1.0","event_id":"sha256:ad5f9734964dff9f511bcc1e288768127ab992442bf1b4241768dff82d92244f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7ZA7UAQWQWYSMKUQTIVXBCT7FN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Demand-Driven Pointer Analysis with Strong Updates via Value-Flow Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Jingling Xue, Yulei Sui","submitted_at":"2017-01-20T00:51:09Z","abstract_excerpt":"We present a new demand-driven flow- and context-sensitive pointer analysis with strong updates for C programs, called SUPA, that enables computing points-to information via value-flow refinement, in environments with small time and memory budgets such as IDEs. We formulate SUPA by solving a graph reachability problem on an inter-procedural value-flow graph representing a program's def-use chains, which are pre-computed efficiently but over-approximately. To answer a client query (a request for a variable's points-to set), SUPA reasons about the flow of values along the pre-computed def-use ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05650","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-18T00:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tL86abFP0HIV5LhDjfbdacZ5/li/RZwHPwAiNyBPyUOYi8iIb256MUFnSh2MuxLFRDKi6eT7n+J4c53uSCPHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:34:55.927926Z"},"content_sha256":"4fce896aa2afb917471f9c02dd267717d4d7918f923e96784a0c676b52194d72","schema_version":"1.0","event_id":"sha256:4fce896aa2afb917471f9c02dd267717d4d7918f923e96784a0c676b52194d72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/bundle.json","state_url":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/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-26T15:34:55Z","links":{"resolver":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN","bundle":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/bundle.json","state":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7ZA7UAQWQWYSMKUQTIVXBCT7FN","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":"b79b7a4be893ea8053dd8af8ca26fb9f77cbd636076fab53f119bee35ce7b536","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-20T00:51:09Z","title_canon_sha256":"c8b4d6b59a99327cf377af83e02814777318fc25aba4e9f71492b41dcdd52ffe"},"schema_version":"1.0","source":{"id":"1701.05650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05650","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05650v1","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05650","created_at":"2026-05-18T00:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"7ZA7UAQWQWYS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7ZA7UAQWQWYSMKUQ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7ZA7UAQW","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:4fce896aa2afb917471f9c02dd267717d4d7918f923e96784a0c676b52194d72","target":"graph","created_at":"2026-05-18T00:52:28Z","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 present a new demand-driven flow- and context-sensitive pointer analysis with strong updates for C programs, called SUPA, that enables computing points-to information via value-flow refinement, in environments with small time and memory budgets such as IDEs. We formulate SUPA by solving a graph reachability problem on an inter-procedural value-flow graph representing a program's def-use chains, which are pre-computed efficiently but over-approximately. To answer a client query (a request for a variable's points-to set), SUPA reasons about the flow of values along the pre-computed def-use ch","authors_text":"Jingling Xue, Yulei Sui","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-20T00:51:09Z","title":"Demand-Driven Pointer Analysis with Strong Updates via Value-Flow Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05650","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:ad5f9734964dff9f511bcc1e288768127ab992442bf1b4241768dff82d92244f","target":"record","created_at":"2026-05-18T00:52:28Z","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":"b79b7a4be893ea8053dd8af8ca26fb9f77cbd636076fab53f119bee35ce7b536","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-20T00:51:09Z","title_canon_sha256":"c8b4d6b59a99327cf377af83e02814777318fc25aba4e9f71492b41dcdd52ffe"},"schema_version":"1.0","source":{"id":"1701.05650","kind":"arxiv","version":1}},"canonical_sha256":"fe41fa021685b1262a909a2b708a7f2b6d989cf9a6aa5cb614c41ed2d729554d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe41fa021685b1262a909a2b708a7f2b6d989cf9a6aa5cb614c41ed2d729554d","first_computed_at":"2026-05-18T00:52:28.884777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:28.884777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jne5vJ83NDAsshB1FpcyDJ38FQVIk1DvT+43lPwi6iO3sTGqq/DRPim36I35YY9zVGB0i1AI8f1dxWQoowp9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:28.885352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad5f9734964dff9f511bcc1e288768127ab992442bf1b4241768dff82d92244f","sha256:4fce896aa2afb917471f9c02dd267717d4d7918f923e96784a0c676b52194d72"],"state_sha256":"43e9b9c53abed3469a3cfbac632e61f5ab1813c091ac0233637eb7fba729aa8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lv4oA5ZvPeery5Jx+bWGvplqFTepN7FlbTf82/ERYjYIBrymZxsZ5UW0+NFGUcbxJRErbPUzRTgOzyZSVtTcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:34:55.929891Z","bundle_sha256":"b5d3e3077748c871987e04ee4a6ec8fd1544395024ddc85fc95c88e845647a5a"}}