{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z4G7EC2QLSDTMLIQM6RF63WCZW","short_pith_number":"pith:Z4G7EC2Q","canonical_record":{"source":{"id":"1801.09189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-28T06:51:18Z","cross_cats_sorted":[],"title_canon_sha256":"ec4879dbc0a3282797bfbf8cc6ab46f3dbf01a6eed5ec8d4072b5fda9241e1b1","abstract_canon_sha256":"bead599b290a43e8305480d358ea3f9e4f4ec189f55da4cedf477bc7c3591a29"},"schema_version":"1.0"},"canonical_sha256":"cf0df20b505c87362d1067a25f6ec2cd87095c65c1bae24a524a361cec498f0a","source":{"kind":"arxiv","id":"1801.09189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09189","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09189v1","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09189","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z4G7EC2QLSDT","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4G7EC2QLSDTMLIQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4G7EC2Q","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z4G7EC2QLSDTMLIQM6RF63WCZW","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-28T06:51:18Z","cross_cats_sorted":[],"title_canon_sha256":"ec4879dbc0a3282797bfbf8cc6ab46f3dbf01a6eed5ec8d4072b5fda9241e1b1","abstract_canon_sha256":"bead599b290a43e8305480d358ea3f9e4f4ec189f55da4cedf477bc7c3591a29"},"schema_version":"1.0"},"canonical_sha256":"cf0df20b505c87362d1067a25f6ec2cd87095c65c1bae24a524a361cec498f0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:58.271995Z","signature_b64":"pvIOUz5UnMi38QxRdR7VG/ivz1FahM5RxYChkjRpKLkwnY2JzyHHCUoJ4UH88zJOU8jnYiu5lV3swqZArS+ABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf0df20b505c87362d1067a25f6ec2cd87095c65c1bae24a524a361cec498f0a","last_reissued_at":"2026-05-18T00:24:58.271348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:58.271348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09189","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:24:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDdR7srcooXV6iBVu9PXY6lcrgwAG/oqY0n+QNzPla8HAt4wxczwMlOu1z0e3CJJDW8eEgN45VxHQYug3PyVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:37:05.901754Z"},"content_sha256":"e66c1c7b3254e89ff5fc468966b20188bc69ff32dabb3967ab13d3e2139f4020","schema_version":"1.0","event_id":"sha256:e66c1c7b3254e89ff5fc468966b20188bc69ff32dabb3967ab13d3e2139f4020"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z4G7EC2QLSDTMLIQM6RF63WCZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Points-to Graphs: A New Abstraction of Memory in the Presence of Pointers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alan Mycroft, Pritam M. Gharat, Uday P. Khedker","submitted_at":"2018-01-28T06:51:18Z","abstract_excerpt":"Flow- and context-sensitive points-to analysis is difficult to scale; for top-down approaches, the problem centers on repeated analysis of the same procedure; for bottom-up approaches, the abstractions used to represent procedure summaries have not scaled while preserving precision.\n  We propose a novel abstraction called the Generalized Points-to Graph (GPG) which views points-to relations as memory updates and generalizes them using the counts of indirection levels leaving the unknown pointees implicit. This allows us to construct GPGs as compact representations of bottom-up procedure summar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09189","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:24:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oera9vXxn15C3GjAmU4J7Agjsjy2Kf9sPJERzaNxuNjKqhNqKsR37D+yQPUGl5rt4ua4ZHcSI53sDnehWIq3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:37:05.902107Z"},"content_sha256":"eab7d99856b5a38e77c70300c187bd2bba0f82446ee50095eee294b3beeb9c4d","schema_version":"1.0","event_id":"sha256:eab7d99856b5a38e77c70300c187bd2bba0f82446ee50095eee294b3beeb9c4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4G7EC2QLSDTMLIQM6RF63WCZW/bundle.json","state_url":"https://pith.science/pith/Z4G7EC2QLSDTMLIQM6RF63WCZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4G7EC2QLSDTMLIQM6RF63WCZW/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-05-18T22:37:05Z","links":{"resolver":"https://pith.science/pith/Z4G7EC2QLSDTMLIQM6RF63WCZW","bundle":"https://pith.science/pith/Z4G7EC2QLSDTMLIQM6RF63WCZW/bundle.json","state":"https://pith.science/pith/Z4G7EC2QLSDTMLIQM6RF63WCZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4G7EC2QLSDTMLIQM6RF63WCZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z4G7EC2QLSDTMLIQM6RF63WCZW","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":"bead599b290a43e8305480d358ea3f9e4f4ec189f55da4cedf477bc7c3591a29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-28T06:51:18Z","title_canon_sha256":"ec4879dbc0a3282797bfbf8cc6ab46f3dbf01a6eed5ec8d4072b5fda9241e1b1"},"schema_version":"1.0","source":{"id":"1801.09189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09189","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09189v1","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09189","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z4G7EC2QLSDT","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4G7EC2QLSDTMLIQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4G7EC2Q","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:eab7d99856b5a38e77c70300c187bd2bba0f82446ee50095eee294b3beeb9c4d","target":"graph","created_at":"2026-05-18T00:24:58Z","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":"Flow- and context-sensitive points-to analysis is difficult to scale; for top-down approaches, the problem centers on repeated analysis of the same procedure; for bottom-up approaches, the abstractions used to represent procedure summaries have not scaled while preserving precision.\n  We propose a novel abstraction called the Generalized Points-to Graph (GPG) which views points-to relations as memory updates and generalizes them using the counts of indirection levels leaving the unknown pointees implicit. This allows us to construct GPGs as compact representations of bottom-up procedure summar","authors_text":"Alan Mycroft, Pritam M. Gharat, Uday P. Khedker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-28T06:51:18Z","title":"Generalized Points-to Graphs: A New Abstraction of Memory in the Presence of Pointers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09189","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:e66c1c7b3254e89ff5fc468966b20188bc69ff32dabb3967ab13d3e2139f4020","target":"record","created_at":"2026-05-18T00:24:58Z","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":"bead599b290a43e8305480d358ea3f9e4f4ec189f55da4cedf477bc7c3591a29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-28T06:51:18Z","title_canon_sha256":"ec4879dbc0a3282797bfbf8cc6ab46f3dbf01a6eed5ec8d4072b5fda9241e1b1"},"schema_version":"1.0","source":{"id":"1801.09189","kind":"arxiv","version":1}},"canonical_sha256":"cf0df20b505c87362d1067a25f6ec2cd87095c65c1bae24a524a361cec498f0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf0df20b505c87362d1067a25f6ec2cd87095c65c1bae24a524a361cec498f0a","first_computed_at":"2026-05-18T00:24:58.271348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:58.271348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pvIOUz5UnMi38QxRdR7VG/ivz1FahM5RxYChkjRpKLkwnY2JzyHHCUoJ4UH88zJOU8jnYiu5lV3swqZArS+ABw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:58.271995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e66c1c7b3254e89ff5fc468966b20188bc69ff32dabb3967ab13d3e2139f4020","sha256:eab7d99856b5a38e77c70300c187bd2bba0f82446ee50095eee294b3beeb9c4d"],"state_sha256":"45bf07cc90e6fc0c270200138cd020983d6a596ccedefdf16b7a0dc9ef397a5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7pp0FQyRzMlt+MrxDFOZE96kSfG9llhNa/5N7NlkpsXtq/7w6CCDErgVf7y5jowITU4BsJBV1nX896zZnd0NDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:37:05.903608Z","bundle_sha256":"815ece066a302c0031107e90f48677d1b1b63b71874ada7be90385d6bcca8a14"}}