{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RSHAOMEGPUGUM4Y4MPXZYT33XO","short_pith_number":"pith:RSHAOMEG","schema_version":"1.0","canonical_sha256":"8c8e0730867d0d46731c63ef9c4f7bbb8e79f0dd02fceee497dd82aa534a9d83","source":{"kind":"arxiv","id":"0911.2993","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0911.2993","created_at":"2026-05-18T04:41:35.867801+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.2993v2","created_at":"2026-05-18T04:41:35.867801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2993","created_at":"2026-05-18T04:41:35.867801+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSHAOMEGPUGU","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSHAOMEGPUGUM4Y4","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSHAOMEG","created_at":"2026-05-18T12:26:01.383474+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/RSHAOMEGPUGUM4Y4MPXZYT33XO","json":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO.json","graph_json":"https://pith.science/api/pith-number/RSHAOMEGPUGUM4Y4MPXZYT33XO/graph.json","events_json":"https://pith.science/api/pith-number/RSHAOMEGPUGUM4Y4MPXZYT33XO/events.json","paper":"https://pith.science/paper/RSHAOMEG"},"agent_actions":{"view_html":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO","download_json":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO.json","view_paper":"https://pith.science/paper/RSHAOMEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.2993&json=true","fetch_graph":"https://pith.science/api/pith-number/RSHAOMEGPUGUM4Y4MPXZYT33XO/graph.json","fetch_events":"https://pith.science/api/pith-number/RSHAOMEGPUGUM4Y4MPXZYT33XO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/action/storage_attestation","attest_author":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/action/author_attestation","sign_citation":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/action/citation_signature","submit_replication":"https://pith.science/pith/RSHAOMEGPUGUM4Y4MPXZYT33XO/action/replication_record"}},"created_at":"2026-05-18T04:41:35.867801+00:00","updated_at":"2026-05-18T04:41:35.867801+00:00"}