{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YRIDBLN5IX4BHF6YGGKL6HOND6","short_pith_number":"pith:YRIDBLN5","schema_version":"1.0","canonical_sha256":"c45030adbd45f81397d83194bf1dcd1f98eb576e9b57560deebccf04c36d2e1a","source":{"kind":"arxiv","id":"1505.07945","version":3},"attestation_state":"computed","paper":{"title":"Relationships, Paths and Principal Matching: A New Approach to Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"James Sellwood, Jason Crampton","submitted_at":"2015-05-29T07:26:38Z","abstract_excerpt":"Recent work on relationship-based access control has begun to show how it can be applied to general computing systems, as opposed to simply being employed for social networking applications. The use of relationships to determine authorization policies enables more powerful policies to be defined than those based solely on the commonly used concept of role membership. The relationships, paths and principal matching (RPPM) model described here is a formal access control model using relationships and a two-stage request evaluation process. We make use of path conditions, which are similar to regu"},"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":"1505.07945","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-29T07:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"b9c57a2a2aaf8bd7296485fec9d5c7172ab193a339421b3c6b93a11b916140e8","abstract_canon_sha256":"c4cd434f5ad33deba6a2a1a32a6aa756c36bc4ba55c26c934818b72199f0050e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:37.072760Z","signature_b64":"JVMUhQ8fjiErkA8TbPgU7KGItZkDRQnMuom7JMgLO0oBFFJfHwnDevpkJYZIVCR+6cwwLsTUyxETT10jcNGZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c45030adbd45f81397d83194bf1dcd1f98eb576e9b57560deebccf04c36d2e1a","last_reissued_at":"2026-05-18T01:32:37.072171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:37.072171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relationships, Paths and Principal Matching: A New Approach to Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"James Sellwood, Jason Crampton","submitted_at":"2015-05-29T07:26:38Z","abstract_excerpt":"Recent work on relationship-based access control has begun to show how it can be applied to general computing systems, as opposed to simply being employed for social networking applications. The use of relationships to determine authorization policies enables more powerful policies to be defined than those based solely on the commonly used concept of role membership. The relationships, paths and principal matching (RPPM) model described here is a formal access control model using relationships and a two-stage request evaluation process. We make use of path conditions, which are similar to regu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07945","kind":"arxiv","version":3},"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":"1505.07945","created_at":"2026-05-18T01:32:37.072249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07945v3","created_at":"2026-05-18T01:32:37.072249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07945","created_at":"2026-05-18T01:32:37.072249+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRIDBLN5IX4B","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRIDBLN5IX4BHF6Y","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRIDBLN5","created_at":"2026-05-18T12:29:50.041715+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/YRIDBLN5IX4BHF6YGGKL6HOND6","json":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6.json","graph_json":"https://pith.science/api/pith-number/YRIDBLN5IX4BHF6YGGKL6HOND6/graph.json","events_json":"https://pith.science/api/pith-number/YRIDBLN5IX4BHF6YGGKL6HOND6/events.json","paper":"https://pith.science/paper/YRIDBLN5"},"agent_actions":{"view_html":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6","download_json":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6.json","view_paper":"https://pith.science/paper/YRIDBLN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07945&json=true","fetch_graph":"https://pith.science/api/pith-number/YRIDBLN5IX4BHF6YGGKL6HOND6/graph.json","fetch_events":"https://pith.science/api/pith-number/YRIDBLN5IX4BHF6YGGKL6HOND6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6/action/storage_attestation","attest_author":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6/action/author_attestation","sign_citation":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6/action/citation_signature","submit_replication":"https://pith.science/pith/YRIDBLN5IX4BHF6YGGKL6HOND6/action/replication_record"}},"created_at":"2026-05-18T01:32:37.072249+00:00","updated_at":"2026-05-18T01:32:37.072249+00:00"}