{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6QXIB2TABOSH4JGRMKRFIQS4EH","short_pith_number":"pith:6QXIB2TA","schema_version":"1.0","canonical_sha256":"f42e80ea600ba47e24d162a254425c21e18b16ce093bdf3c9a7b07f5ac1ff138","source":{"kind":"arxiv","id":"1103.0510","version":2},"attestation_state":"computed","paper":{"title":"Logical Step-Indexed Logical Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Amal Ahmed (Indiana University), Derek Dreyer (MPI-SWS), Lars Birkedal (IT University of Copenhagen)","submitted_at":"2011-03-02T18:21:59Z","abstract_excerpt":"Appel and McAllester's \"step-indexed\" logical relations have proven to be a simple and effective technique for reasoning about programs in languages with semantically interesting types, such as general recursive types and general reference types. However, proofs using step-indexed models typically involve tedious, error-prone, and proof-obscuring step-index arithmetic, so it is important to develop clean, high-level, equational proof principles that avoid mention of step indices. In this paper, we show how to reason about binary step-indexed logical relations in an abstract and elegant way. Sp"},"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":"1103.0510","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-03-02T18:21:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"01e2e1f147535d503749883ff5013ff8d6c0c15b4c6de7ceac45ac1033571a05","abstract_canon_sha256":"00e71030e75d6c5b6fcff11b2cef8fcca1df36a80c0ad24357a7874e81dfa97a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.611416Z","signature_b64":"5aL1j+cQshx1mhbdJ0guK/+VnVjblm9QbHHxL6BKMDsTz11UxfuWnQeb3M86/6JrE+m96CwSF3criuE/lsZYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f42e80ea600ba47e24d162a254425c21e18b16ce093bdf3c9a7b07f5ac1ff138","last_reissued_at":"2026-05-18T01:37:39.610758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.610758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical Step-Indexed Logical Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Amal Ahmed (Indiana University), Derek Dreyer (MPI-SWS), Lars Birkedal (IT University of Copenhagen)","submitted_at":"2011-03-02T18:21:59Z","abstract_excerpt":"Appel and McAllester's \"step-indexed\" logical relations have proven to be a simple and effective technique for reasoning about programs in languages with semantically interesting types, such as general recursive types and general reference types. However, proofs using step-indexed models typically involve tedious, error-prone, and proof-obscuring step-index arithmetic, so it is important to develop clean, high-level, equational proof principles that avoid mention of step indices. In this paper, we show how to reason about binary step-indexed logical relations in an abstract and elegant way. Sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0510","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":"1103.0510","created_at":"2026-05-18T01:37:39.610841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0510v2","created_at":"2026-05-18T01:37:39.610841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0510","created_at":"2026-05-18T01:37:39.610841+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QXIB2TABOSH","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QXIB2TABOSH4JGR","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QXIB2TA","created_at":"2026-05-18T12:26:22.705136+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/6QXIB2TABOSH4JGRMKRFIQS4EH","json":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH.json","graph_json":"https://pith.science/api/pith-number/6QXIB2TABOSH4JGRMKRFIQS4EH/graph.json","events_json":"https://pith.science/api/pith-number/6QXIB2TABOSH4JGRMKRFIQS4EH/events.json","paper":"https://pith.science/paper/6QXIB2TA"},"agent_actions":{"view_html":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH","download_json":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH.json","view_paper":"https://pith.science/paper/6QXIB2TA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0510&json=true","fetch_graph":"https://pith.science/api/pith-number/6QXIB2TABOSH4JGRMKRFIQS4EH/graph.json","fetch_events":"https://pith.science/api/pith-number/6QXIB2TABOSH4JGRMKRFIQS4EH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH/action/storage_attestation","attest_author":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH/action/author_attestation","sign_citation":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH/action/citation_signature","submit_replication":"https://pith.science/pith/6QXIB2TABOSH4JGRMKRFIQS4EH/action/replication_record"}},"created_at":"2026-05-18T01:37:39.610841+00:00","updated_at":"2026-05-18T01:37:39.610841+00:00"}