{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DMGP3KCWVOJF4AQXW3USOZOUTX","short_pith_number":"pith:DMGP3KCW","schema_version":"1.0","canonical_sha256":"1b0cfda856ab925e0217b6e92765d49dc03f6ba4e7afd1fb65f6ea87e2604ab1","source":{"kind":"arxiv","id":"1211.3700","version":2},"attestation_state":"computed","paper":{"title":"Nexus Authorization Logic (NAL): Logical Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CR","authors_text":"Andrew K. Hirsch, Michael R. Clarkson","submitted_at":"2012-11-15T19:22:11Z","abstract_excerpt":"Nexus Authorization Logic (NAL) [Schneider et al. 2011] is a logic for reasoning about authorization in distributed systems. A revised version of NAL is given here, including revised syntax, a revised proof theory using localized hypotheses, and a new Kripke semantics. The proof theory is proved sound with respect to the semantics, and that proof is formalized in Coq."},"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":"1211.3700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-11-15T19:22:11Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"be49a84453f5f78db2a4ff34d7bf8a7b6464ce6cad2e459cc0a96e8216c4388d","abstract_canon_sha256":"9334375a30548a5579dd3ccb1b7584d6b4349d41e0437718ca10ddd1f4fea5bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:38.120818Z","signature_b64":"gQjxhoVbI7784wyRR7f4AR8vuGfswOo2vOPf7XHy4CjWjvZIN2/FtsLN8qprGOKm/SdpxT/SXpXoVH6wlCl1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b0cfda856ab925e0217b6e92765d49dc03f6ba4e7afd1fb65f6ea87e2604ab1","last_reissued_at":"2026-05-18T03:40:38.120045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:38.120045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nexus Authorization Logic (NAL): Logical Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CR","authors_text":"Andrew K. Hirsch, Michael R. Clarkson","submitted_at":"2012-11-15T19:22:11Z","abstract_excerpt":"Nexus Authorization Logic (NAL) [Schneider et al. 2011] is a logic for reasoning about authorization in distributed systems. A revised version of NAL is given here, including revised syntax, a revised proof theory using localized hypotheses, and a new Kripke semantics. The proof theory is proved sound with respect to the semantics, and that proof is formalized in Coq."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3700","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":"1211.3700","created_at":"2026-05-18T03:40:38.120157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3700v2","created_at":"2026-05-18T03:40:38.120157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3700","created_at":"2026-05-18T03:40:38.120157+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMGP3KCWVOJF","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMGP3KCWVOJF4AQX","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMGP3KCW","created_at":"2026-05-18T12:27:04.183437+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/DMGP3KCWVOJF4AQXW3USOZOUTX","json":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX.json","graph_json":"https://pith.science/api/pith-number/DMGP3KCWVOJF4AQXW3USOZOUTX/graph.json","events_json":"https://pith.science/api/pith-number/DMGP3KCWVOJF4AQXW3USOZOUTX/events.json","paper":"https://pith.science/paper/DMGP3KCW"},"agent_actions":{"view_html":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX","download_json":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX.json","view_paper":"https://pith.science/paper/DMGP3KCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3700&json=true","fetch_graph":"https://pith.science/api/pith-number/DMGP3KCWVOJF4AQXW3USOZOUTX/graph.json","fetch_events":"https://pith.science/api/pith-number/DMGP3KCWVOJF4AQXW3USOZOUTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX/action/storage_attestation","attest_author":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX/action/author_attestation","sign_citation":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX/action/citation_signature","submit_replication":"https://pith.science/pith/DMGP3KCWVOJF4AQXW3USOZOUTX/action/replication_record"}},"created_at":"2026-05-18T03:40:38.120157+00:00","updated_at":"2026-05-18T03:40:38.120157+00:00"}