{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6XQADLAXTLXTQTFEFDPO2OWWWJ","short_pith_number":"pith:6XQADLAX","canonical_record":{"source":{"id":"1708.04749","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-16T02:18:06Z","cross_cats_sorted":[],"title_canon_sha256":"bc6677d349809b8b9e5761031070ef73fb5809507752a7ffe0b2fc8b3e3698f6","abstract_canon_sha256":"ad5d7c4c34baa657e7a46b2f292e9f8af9ff86c6c292cc19088e4f2dec9aeb88"},"schema_version":"1.0"},"canonical_sha256":"f5e001ac179aef384ca428deed3ad6b2406e9f5b3ffd5c0d69c307ae4d5db1f5","source":{"kind":"arxiv","id":"1708.04749","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04749","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04749v4","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04749","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"6XQADLAXTLXT","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XQADLAXTLXTQTFE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XQADLAX","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6XQADLAXTLXTQTFEFDPO2OWWWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04749","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-16T02:18:06Z","cross_cats_sorted":[],"title_canon_sha256":"bc6677d349809b8b9e5761031070ef73fb5809507752a7ffe0b2fc8b3e3698f6","abstract_canon_sha256":"ad5d7c4c34baa657e7a46b2f292e9f8af9ff86c6c292cc19088e4f2dec9aeb88"},"schema_version":"1.0"},"canonical_sha256":"f5e001ac179aef384ca428deed3ad6b2406e9f5b3ffd5c0d69c307ae4d5db1f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:33.095256Z","signature_b64":"HCNfpBo1uTdawS4eg2K1K25bu+S/nUlyb9fR9vl5HmJhhzEBGa1N6WewhCbwh8HLix7saJbMgK3x8rX1cG6GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5e001ac179aef384ca428deed3ad6b2406e9f5b3ffd5c0d69c307ae4d5db1f5","last_reissued_at":"2026-05-18T00:07:33.094625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:33.094625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04749","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tekOFlOyhXoKNHbj8qwl45M06tmw/2o8+nYKqNjaGPrc9pQUwyikCN4/u8R36uZ6pPyW9ggJ1n9uJAvZertEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:35:22.384427Z"},"content_sha256":"91387f652aa8d40c340d3f70a50d27c0ac658d3000925f0e2a2f746df17fd2cc","schema_version":"1.0","event_id":"sha256:91387f652aa8d40c340d3f70a50d27c0ac658d3000925f0e2a2f746df17fd2cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6XQADLAXTLXTQTFEFDPO2OWWWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy and Evolutionary Algorithms for Mining Relationship-Based Access Control Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jiajie Li, Scott D. Stoller, Thang Bui","submitted_at":"2017-08-16T02:18:06Z","abstract_excerpt":"Relationship-based access control (ReBAC) provides a high level of expressiveness and flexibility that promotes security and information sharing. We formulate ReBAC as an object-oriented extension of attribute-based access control (ABAC) in which relationships are expressed using fields that refer to other objects, and path expressions are used to follow chains of relationships between objects.\n  ReBAC policy mining algorithms have potential to significantly reduce the cost of migration from legacy access control systems to ReBAC, by partially automating the development of a ReBAC policy from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04749","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlrQ3uLevDYJSfdSyDJO9xdJJd+vaROxQ4mfzU/NwywdB6OvgK7XCG55L6V4s1dvwyma4AFuDd0nw+iYdb4XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:35:22.385198Z"},"content_sha256":"f8fc233bc9e13a965ee5e091f45ba3fc53b5f31d1a270aec589b0519d92d7244","schema_version":"1.0","event_id":"sha256:f8fc233bc9e13a965ee5e091f45ba3fc53b5f31d1a270aec589b0519d92d7244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XQADLAXTLXTQTFEFDPO2OWWWJ/bundle.json","state_url":"https://pith.science/pith/6XQADLAXTLXTQTFEFDPO2OWWWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XQADLAXTLXTQTFEFDPO2OWWWJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T19:35:22Z","links":{"resolver":"https://pith.science/pith/6XQADLAXTLXTQTFEFDPO2OWWWJ","bundle":"https://pith.science/pith/6XQADLAXTLXTQTFEFDPO2OWWWJ/bundle.json","state":"https://pith.science/pith/6XQADLAXTLXTQTFEFDPO2OWWWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XQADLAXTLXTQTFEFDPO2OWWWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6XQADLAXTLXTQTFEFDPO2OWWWJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ad5d7c4c34baa657e7a46b2f292e9f8af9ff86c6c292cc19088e4f2dec9aeb88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-16T02:18:06Z","title_canon_sha256":"bc6677d349809b8b9e5761031070ef73fb5809507752a7ffe0b2fc8b3e3698f6"},"schema_version":"1.0","source":{"id":"1708.04749","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04749","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04749v4","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04749","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"6XQADLAXTLXT","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XQADLAXTLXTQTFE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XQADLAX","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:f8fc233bc9e13a965ee5e091f45ba3fc53b5f31d1a270aec589b0519d92d7244","target":"graph","created_at":"2026-05-18T00:07:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Relationship-based access control (ReBAC) provides a high level of expressiveness and flexibility that promotes security and information sharing. We formulate ReBAC as an object-oriented extension of attribute-based access control (ABAC) in which relationships are expressed using fields that refer to other objects, and path expressions are used to follow chains of relationships between objects.\n  ReBAC policy mining algorithms have potential to significantly reduce the cost of migration from legacy access control systems to ReBAC, by partially automating the development of a ReBAC policy from ","authors_text":"Jiajie Li, Scott D. Stoller, Thang Bui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-16T02:18:06Z","title":"Greedy and Evolutionary Algorithms for Mining Relationship-Based Access Control Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04749","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:91387f652aa8d40c340d3f70a50d27c0ac658d3000925f0e2a2f746df17fd2cc","target":"record","created_at":"2026-05-18T00:07:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ad5d7c4c34baa657e7a46b2f292e9f8af9ff86c6c292cc19088e4f2dec9aeb88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-16T02:18:06Z","title_canon_sha256":"bc6677d349809b8b9e5761031070ef73fb5809507752a7ffe0b2fc8b3e3698f6"},"schema_version":"1.0","source":{"id":"1708.04749","kind":"arxiv","version":4}},"canonical_sha256":"f5e001ac179aef384ca428deed3ad6b2406e9f5b3ffd5c0d69c307ae4d5db1f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5e001ac179aef384ca428deed3ad6b2406e9f5b3ffd5c0d69c307ae4d5db1f5","first_computed_at":"2026-05-18T00:07:33.094625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:33.094625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HCNfpBo1uTdawS4eg2K1K25bu+S/nUlyb9fR9vl5HmJhhzEBGa1N6WewhCbwh8HLix7saJbMgK3x8rX1cG6GDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:33.095256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04749","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91387f652aa8d40c340d3f70a50d27c0ac658d3000925f0e2a2f746df17fd2cc","sha256:f8fc233bc9e13a965ee5e091f45ba3fc53b5f31d1a270aec589b0519d92d7244"],"state_sha256":"6df966ebf454af7a91208dc2020ef6c35514db15924a6e98bef9b84437dea423"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6VqMMQ/51OcAHS25kYvjdq25iFiY4sglkT/J4cp96QxBC7RJ/ZTGKYXeODvM0QKmQlU1Gd9hZUFTCtW21/SCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:35:22.389114Z","bundle_sha256":"e2bfe2b8aaa23a3c04d81b36512cf779a782492c8d8ecab4384fa0bc63362d7d"}}