{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RSHAOMEGPUGUM4Y4MPXZYT33XO","short_pith_number":"pith:RSHAOMEG","canonical_record":{"source":{"id":"0911.2993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-11-16T09:56:44Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"210ee96a9333982e7ab8585558813c61445f96298169d05b5ff22185d249c13d","abstract_canon_sha256":"93c30f32476cf3242e3be5533c2e7164644b4e657306321fb251124d8c3328fa"},"schema_version":"1.0"},"canonical_sha256":"8c8e0730867d0d46731c63ef9c4f7bbb8e79f0dd02fceee497dd82aa534a9d83","source":{"kind":"arxiv","id":"0911.2993","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.2993","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"0911.2993v2","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2993","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"RSHAOMEGPUGU","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RSHAOMEGPUGUM4Y4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RSHAOMEG","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RSHAOMEGPUGUM4Y4MPXZYT33XO","target":"record","payload":{"canonical_record":{"source":{"id":"0911.2993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-11-16T09:56:44Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"210ee96a9333982e7ab8585558813c61445f96298169d05b5ff22185d249c13d","abstract_canon_sha256":"93c30f32476cf3242e3be5533c2e7164644b4e657306321fb251124d8c3328fa"},"schema_version":"1.0"},"canonical_sha256":"8c8e0730867d0d46731c63ef9c4f7bbb8e79f0dd02fceee497dd82aa534a9d83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:35.868114Z","signature_b64":"sy2hA9vFudoZXJDwAzWkDqsdkQXkM8yewNGIVC9L1p+1TQW8sDIh2fUGOmAja+8zf3Qb5Ce4qk7gL7Namt5VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c8e0730867d0d46731c63ef9c4f7bbb8e79f0dd02fceee497dd82aa534a9d83","last_reissued_at":"2026-05-18T04:41:35.867751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:35.867751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.2993","source_version":2,"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-18T04:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NcomaD4cLNBYndkdP8BVhgFJDnTaZcTUsEA+F6yWBoFv9stHNPERQJ5UAqozLAoncWAWYD495YAR4ywBws9eDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:21.887215Z"},"content_sha256":"bf51fdfde2f0037f4dedf84105fcf99ba20a081266dff4731f3ec641fa440c19","schema_version":"1.0","event_id":"sha256:bf51fdfde2f0037f4dedf84105fcf99ba20a081266dff4731f3ec641fa440c19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RSHAOMEGPUGUM4Y4MPXZYT33XO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A two-level logic approach to reasoning about computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Andrew Gacek, Dale Miller, Gopalan Nadathur","submitted_at":"2009-11-16T09:56:44Z","abstract_excerpt":"Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory over relations as a language for specifying such notions. Our specification logic is further characterized by an ability to explicitly treat binding in object languages. Once such a logic is fixed, a natural next question is how we might prove theorems about specifications written in it. We propose to use a second logic, called a reasoning logic, for this purpo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2993","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"},"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-18T04:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A505dlF3x53T6RPoFEPR5KhUEVXLmwPvlV+2flYx5X0D86t4aO3PudKXceGKXf0xpvdlBlNXFF8knFXK5roEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:21.887931Z"},"content_sha256":"fd71afa8559c5a76db1807f59c3c45b122db88898a9778e11fa11bfbd88c0efc","schema_version":"1.0","event_id":"sha256:fd71afa8559c5a76db1807f59c3c45b122db88898a9778e11fa11bfbd88c0efc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/bundle.json","state_url":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/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-26T08:30:21Z","links":{"resolver":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO","bundle":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/bundle.json","state":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RSHAOMEGPUGUM4Y4MPXZYT33XO","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":"93c30f32476cf3242e3be5533c2e7164644b4e657306321fb251124d8c3328fa","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-11-16T09:56:44Z","title_canon_sha256":"210ee96a9333982e7ab8585558813c61445f96298169d05b5ff22185d249c13d"},"schema_version":"1.0","source":{"id":"0911.2993","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.2993","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"0911.2993v2","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2993","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"RSHAOMEGPUGU","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RSHAOMEGPUGUM4Y4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RSHAOMEG","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:fd71afa8559c5a76db1807f59c3c45b122db88898a9778e11fa11bfbd88c0efc","target":"graph","created_at":"2026-05-18T04:41:35Z","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":"Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory over relations as a language for specifying such notions. Our specification logic is further characterized by an ability to explicitly treat binding in object languages. Once such a logic is fixed, a natural next question is how we might prove theorems about specifications written in it. We propose to use a second logic, called a reasoning logic, for this purpo","authors_text":"Andrew Gacek, Dale Miller, Gopalan Nadathur","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-11-16T09:56:44Z","title":"A two-level logic approach to reasoning about computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2993","kind":"arxiv","version":2},"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:bf51fdfde2f0037f4dedf84105fcf99ba20a081266dff4731f3ec641fa440c19","target":"record","created_at":"2026-05-18T04:41:35Z","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":"93c30f32476cf3242e3be5533c2e7164644b4e657306321fb251124d8c3328fa","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-11-16T09:56:44Z","title_canon_sha256":"210ee96a9333982e7ab8585558813c61445f96298169d05b5ff22185d249c13d"},"schema_version":"1.0","source":{"id":"0911.2993","kind":"arxiv","version":2}},"canonical_sha256":"8c8e0730867d0d46731c63ef9c4f7bbb8e79f0dd02fceee497dd82aa534a9d83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c8e0730867d0d46731c63ef9c4f7bbb8e79f0dd02fceee497dd82aa534a9d83","first_computed_at":"2026-05-18T04:41:35.867751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:35.867751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sy2hA9vFudoZXJDwAzWkDqsdkQXkM8yewNGIVC9L1p+1TQW8sDIh2fUGOmAja+8zf3Qb5Ce4qk7gL7Namt5VAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:35.868114Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.2993","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf51fdfde2f0037f4dedf84105fcf99ba20a081266dff4731f3ec641fa440c19","sha256:fd71afa8559c5a76db1807f59c3c45b122db88898a9778e11fa11bfbd88c0efc"],"state_sha256":"97650639445c0cd73322457595b6f51852c3fbded17da5682263bb641ff320c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T87qi3dktg8fLN2gg4JwL+CTcAEP8V9A+lTJldNE1f3d8EBsrbVmQP1NOZ6FQaG3Oi3o+fjW+oNQGOIouexdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:30:21.891173Z","bundle_sha256":"63a0253102151ca68dfb4f2492c3376e2dacbdbe8a94dd694cc01ad99c2ab0d5"}}