{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AMXCMERAWFZ5DO7D7YXJNZ44BF","short_pith_number":"pith:AMXCMERA","schema_version":"1.0","canonical_sha256":"032e261220b173d1bbe3fe2e96e79c0961899d300ad9ac65f7bfef219d016b76","source":{"kind":"arxiv","id":"1108.3265","version":1},"attestation_state":"computed","paper":{"title":"Self-Adjusting Stack Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Georg Neis, Matthew A. Hammer, Umut A. Acar, Yan Chen","submitted_at":"2011-08-16T15:19:42Z","abstract_excerpt":"Self-adjusting computation offers a language-based approach to writing programs that automatically respond to dynamically changing data. Recent work made significant progress in developing sound semantics and associated implementations of self-adjusting computation for high-level, functional languages. These techniques, however, do not address issues that arise for low-level languages, i.e., stack-based imperative languages that lack strong type systems and automatic memory management.\n  In this paper, we describe techniques for self-adjusting computation which are suitable for low-level langu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.3265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-08-16T15:19:42Z","cross_cats_sorted":[],"title_canon_sha256":"34ecbd7005833618be9a2050380801790978429a46cdf176e977e9b3966777cc","abstract_canon_sha256":"5253e244c631b0065aeae2561be67ca6644af4311762d4eaf937c6ec763d96cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:27.656537Z","signature_b64":"jgQwPPC20f1A09VMfNVxp8ApXbhwpNCV3brgtU/XaRLFdi/epEEkE0Ess0C9OTlJczZ4omcYjOBk5qeHU3osBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"032e261220b173d1bbe3fe2e96e79c0961899d300ad9ac65f7bfef219d016b76","last_reissued_at":"2026-05-18T04:15:27.656128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:27.656128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Adjusting Stack Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Georg Neis, Matthew A. Hammer, Umut A. Acar, Yan Chen","submitted_at":"2011-08-16T15:19:42Z","abstract_excerpt":"Self-adjusting computation offers a language-based approach to writing programs that automatically respond to dynamically changing data. Recent work made significant progress in developing sound semantics and associated implementations of self-adjusting computation for high-level, functional languages. These techniques, however, do not address issues that arise for low-level languages, i.e., stack-based imperative languages that lack strong type systems and automatic memory management.\n  In this paper, we describe techniques for self-adjusting computation which are suitable for low-level langu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3265","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.3265","created_at":"2026-05-18T04:15:27.656184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3265v1","created_at":"2026-05-18T04:15:27.656184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3265","created_at":"2026-05-18T04:15:27.656184+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMXCMERAWFZ5","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMXCMERAWFZ5DO7D","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMXCMERA","created_at":"2026-05-18T12:26:24.575870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF","json":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF.json","graph_json":"https://pith.science/api/pith-number/AMXCMERAWFZ5DO7D7YXJNZ44BF/graph.json","events_json":"https://pith.science/api/pith-number/AMXCMERAWFZ5DO7D7YXJNZ44BF/events.json","paper":"https://pith.science/paper/AMXCMERA"},"agent_actions":{"view_html":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF","download_json":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF.json","view_paper":"https://pith.science/paper/AMXCMERA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3265&json=true","fetch_graph":"https://pith.science/api/pith-number/AMXCMERAWFZ5DO7D7YXJNZ44BF/graph.json","fetch_events":"https://pith.science/api/pith-number/AMXCMERAWFZ5DO7D7YXJNZ44BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF/action/storage_attestation","attest_author":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF/action/author_attestation","sign_citation":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF/action/citation_signature","submit_replication":"https://pith.science/pith/AMXCMERAWFZ5DO7D7YXJNZ44BF/action/replication_record"}},"created_at":"2026-05-18T04:15:27.656184+00:00","updated_at":"2026-05-18T04:15:27.656184+00:00"}