{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:XEHMHWXVY5MBZ3N4X5GSU5XYMZ","short_pith_number":"pith:XEHMHWXV","schema_version":"1.0","canonical_sha256":"b90ec3daf5c7581cedbcbf4d2a76f8665244ab09a7211aa14bce059c3655bf0e","source":{"kind":"arxiv","id":"0910.5399","version":2},"attestation_state":"computed","paper":{"title":"A Graph Model for Imperative Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Guy McCusker","submitted_at":"2009-10-28T15:09:12Z","abstract_excerpt":"Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to output values.\n  We consider a similar model based on relations whose input values are finite sequences rather than sets. This alteration means that we are taking into account the order in which observations are made. This new notion of graph gives rise to a model of affine lambda-calculus that admits an interpretation of imperative constructs including variable "},"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":"0910.5399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-10-28T15:09:12Z","cross_cats_sorted":[],"title_canon_sha256":"873611e6000f1b9e3b32c1de57751d10439dcc5bf68638c1af8e94ecfb511682","abstract_canon_sha256":"811d72b9d04ade8c6555f9f4acd1dea61092a34f25f016a62283d8a7ab436e18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.252179Z","signature_b64":"j0uatOOL+eyFHPyufonIfZZVcZEXeNdaK31LlV+sQwo/oNTwNmCeZLEVIW0QDBiWbnBlCJg5n2CD1vj1i6fWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b90ec3daf5c7581cedbcbf4d2a76f8665244ab09a7211aa14bce059c3655bf0e","last_reissued_at":"2026-05-18T01:37:40.251294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.251294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graph Model for Imperative Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Guy McCusker","submitted_at":"2009-10-28T15:09:12Z","abstract_excerpt":"Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to output values.\n  We consider a similar model based on relations whose input values are finite sequences rather than sets. This alteration means that we are taking into account the order in which observations are made. This new notion of graph gives rise to a model of affine lambda-calculus that admits an interpretation of imperative constructs including variable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5399","kind":"arxiv","version":2},"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":"0910.5399","created_at":"2026-05-18T01:37:40.251425+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.5399v2","created_at":"2026-05-18T01:37:40.251425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5399","created_at":"2026-05-18T01:37:40.251425+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEHMHWXVY5MB","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEHMHWXVY5MBZ3N4","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEHMHWXV","created_at":"2026-05-18T12:26:02.257875+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/XEHMHWXVY5MBZ3N4X5GSU5XYMZ","json":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ.json","graph_json":"https://pith.science/api/pith-number/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/graph.json","events_json":"https://pith.science/api/pith-number/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/events.json","paper":"https://pith.science/paper/XEHMHWXV"},"agent_actions":{"view_html":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ","download_json":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ.json","view_paper":"https://pith.science/paper/XEHMHWXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.5399&json=true","fetch_graph":"https://pith.science/api/pith-number/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/action/storage_attestation","attest_author":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/action/author_attestation","sign_citation":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/action/citation_signature","submit_replication":"https://pith.science/pith/XEHMHWXVY5MBZ3N4X5GSU5XYMZ/action/replication_record"}},"created_at":"2026-05-18T01:37:40.251425+00:00","updated_at":"2026-05-18T01:37:40.251425+00:00"}