{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZPBD6XIGTUNCHPIAYWEGI6FHDJ","short_pith_number":"pith:ZPBD6XIG","schema_version":"1.0","canonical_sha256":"cbc23f5d069d1a23bd00c5886478a71a77c37c7f765d5792dad0b323563326a2","source":{"kind":"arxiv","id":"1307.7766","version":2},"attestation_state":"computed","paper":{"title":"Policy as Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CR","authors_text":"Lucius G Meredith, Mike Stay, Sophia Drossopoulou","submitted_at":"2013-07-30T00:22:19Z","abstract_excerpt":"Drossopoulou and Noble argue persuasively for the need for a means to express policy in object-capability-based systems. We investigate a practical means to realize their aim via the Curry-Howard isomorphism. Specifically, we investigate representing policy as types in a behavioral type system for the RHO-calculus, a reflective higher-order variant of the pi-calculus."},"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":"1307.7766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-30T00:22:19Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"877e934ba4b32158b7236a97ceb973b4706abdec1aa398be94905c9bedf498cd","abstract_canon_sha256":"fa167c33950e019adff859287ce1e9d06581577ed6c5e2abccbaf46082a62300"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:02.537241Z","signature_b64":"oH8m9Uj67xUXP/jxN7Z0flbcgvOnWjmKQAH8fJnCITbOKpgJXePBctvcF3RTqz0VsUcVLSavzyOC6NnaphFRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbc23f5d069d1a23bd00c5886478a71a77c37c7f765d5792dad0b323563326a2","last_reissued_at":"2026-05-18T03:17:02.536506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:02.536506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Policy as Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CR","authors_text":"Lucius G Meredith, Mike Stay, Sophia Drossopoulou","submitted_at":"2013-07-30T00:22:19Z","abstract_excerpt":"Drossopoulou and Noble argue persuasively for the need for a means to express policy in object-capability-based systems. We investigate a practical means to realize their aim via the Curry-Howard isomorphism. Specifically, we investigate representing policy as types in a behavioral type system for the RHO-calculus, a reflective higher-order variant of the pi-calculus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7766","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":"1307.7766","created_at":"2026-05-18T03:17:02.536631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7766v2","created_at":"2026-05-18T03:17:02.536631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7766","created_at":"2026-05-18T03:17:02.536631+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPBD6XIGTUNC","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPBD6XIGTUNCHPIA","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPBD6XIG","created_at":"2026-05-18T12:28:09.283467+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/ZPBD6XIGTUNCHPIAYWEGI6FHDJ","json":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ.json","graph_json":"https://pith.science/api/pith-number/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/graph.json","events_json":"https://pith.science/api/pith-number/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/events.json","paper":"https://pith.science/paper/ZPBD6XIG"},"agent_actions":{"view_html":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ","download_json":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ.json","view_paper":"https://pith.science/paper/ZPBD6XIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7766&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZPBD6XIGTUNCHPIAYWEGI6FHDJ/action/replication_record"}},"created_at":"2026-05-18T03:17:02.536631+00:00","updated_at":"2026-05-18T03:17:02.536631+00:00"}