{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:53HLASRT4P7B67KPZKFZ6PVHUQ","short_pith_number":"pith:53HLASRT","schema_version":"1.0","canonical_sha256":"eeceb04a33e3fe1f7d4fca8b9f3ea7a40e8a0ad70c5ec9b0d64b2dcbe38e6880","source":{"kind":"arxiv","id":"1604.01550","version":2},"attestation_state":"computed","paper":{"title":"A Multivariate Approach for Checking Resiliency in Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Gregory Gutin, Jason Crampton, R\\'emi Watrigant","submitted_at":"2016-04-06T09:20:24Z","abstract_excerpt":"In recent years, several combinatorial problems were introduced in the area of access control. Typically, such problems deal with an authorization policy, seen as a relation $UR \\subseteq U \\times R$, where $(u, r) \\in UR$ means that user $u$ is authorized to access resource $r$. Li, Tripunitara and Wang (2009) introduced the Resiliency Checking Problem (RCP), in which we are given an authorization policy, a subset of resources $P \\subseteq R$, as well as integers $s \\ge 0$, $d \\ge 1$ and $t \\geq 1$. It asks whether upon removal of any set of at most $s$ users, there still exist $d$ pairwise d"},"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":"1604.01550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-06T09:20:24Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"d48ee26e6b916849aef1fa338f970a61f6f16e53567d0ea57ce2b6ed77b165d2","abstract_canon_sha256":"4b0e5a7e71574269e30a8cf6e733b0271318bb9cd16f2471f5d8d73caf12d0c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:24.078390Z","signature_b64":"0DKFK68zt7eiWSMwIVMt9pFJvS0R8G8Fr+FdamceC1LgvGNM217DrUkPYe1eUA3nYvOjeyGGAWIbC1vkX01rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeceb04a33e3fe1f7d4fca8b9f3ea7a40e8a0ad70c5ec9b0d64b2dcbe38e6880","last_reissued_at":"2026-05-18T01:16:24.077805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:24.077805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multivariate Approach for Checking Resiliency in Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Gregory Gutin, Jason Crampton, R\\'emi Watrigant","submitted_at":"2016-04-06T09:20:24Z","abstract_excerpt":"In recent years, several combinatorial problems were introduced in the area of access control. Typically, such problems deal with an authorization policy, seen as a relation $UR \\subseteq U \\times R$, where $(u, r) \\in UR$ means that user $u$ is authorized to access resource $r$. Li, Tripunitara and Wang (2009) introduced the Resiliency Checking Problem (RCP), in which we are given an authorization policy, a subset of resources $P \\subseteq R$, as well as integers $s \\ge 0$, $d \\ge 1$ and $t \\geq 1$. It asks whether upon removal of any set of at most $s$ users, there still exist $d$ pairwise d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01550","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":"1604.01550","created_at":"2026-05-18T01:16:24.077899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01550v2","created_at":"2026-05-18T01:16:24.077899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01550","created_at":"2026-05-18T01:16:24.077899+00:00"},{"alias_kind":"pith_short_12","alias_value":"53HLASRT4P7B","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"53HLASRT4P7B67KP","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"53HLASRT","created_at":"2026-05-18T12:29:58.707656+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/53HLASRT4P7B67KPZKFZ6PVHUQ","json":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ.json","graph_json":"https://pith.science/api/pith-number/53HLASRT4P7B67KPZKFZ6PVHUQ/graph.json","events_json":"https://pith.science/api/pith-number/53HLASRT4P7B67KPZKFZ6PVHUQ/events.json","paper":"https://pith.science/paper/53HLASRT"},"agent_actions":{"view_html":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ","download_json":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ.json","view_paper":"https://pith.science/paper/53HLASRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01550&json=true","fetch_graph":"https://pith.science/api/pith-number/53HLASRT4P7B67KPZKFZ6PVHUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/53HLASRT4P7B67KPZKFZ6PVHUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ/action/storage_attestation","attest_author":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ/action/author_attestation","sign_citation":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ/action/citation_signature","submit_replication":"https://pith.science/pith/53HLASRT4P7B67KPZKFZ6PVHUQ/action/replication_record"}},"created_at":"2026-05-18T01:16:24.077899+00:00","updated_at":"2026-05-18T01:16:24.077899+00:00"}