{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VWYYFVAPRH3K5F6XOJEWLQOJVM","short_pith_number":"pith:VWYYFVAP","canonical_record":{"source":{"id":"1812.10754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T16:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"d64907e36769b8755c8a8eb2591b4780a69c8caacca17f3798e9fa718fb43f2e","abstract_canon_sha256":"f9c426a7a4d422241365ac931f114e798609c31580fc1840728d5cd6da5283c0"},"schema_version":"1.0"},"canonical_sha256":"adb182d40f89f6ae97d7724965c1c9ab32bbc4a1308b01286efa15e4fcb44c76","source":{"kind":"arxiv","id":"1812.10754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10754","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10754v2","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10754","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"VWYYFVAPRH3K","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VWYYFVAPRH3K5F6X","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VWYYFVAP","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VWYYFVAPRH3K5F6XOJEWLQOJVM","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T16:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"d64907e36769b8755c8a8eb2591b4780a69c8caacca17f3798e9fa718fb43f2e","abstract_canon_sha256":"f9c426a7a4d422241365ac931f114e798609c31580fc1840728d5cd6da5283c0"},"schema_version":"1.0"},"canonical_sha256":"adb182d40f89f6ae97d7724965c1c9ab32bbc4a1308b01286efa15e4fcb44c76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.043030Z","signature_b64":"DphgqAX87H5GLZKobCidCwaPPPmZnzHyPURl5i5nb6KA3BYCnNBRwXxBnhk1xZvrMpGWs9ycqTiidGH37xukAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adb182d40f89f6ae97d7724965c1c9ab32bbc4a1308b01286efa15e4fcb44c76","last_reissued_at":"2026-05-17T23:56:35.042522Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.042522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10754","source_version":2,"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-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iujnVml9iwTMvCvRf4K8kKsQgiQk7cZtEWtCeu/0pJl8xU3cI9ju25t0Xe+HYswYZdfpgkIbyRh0HkZ+4XvDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:53:53.254500Z"},"content_sha256":"3bc0a4197bc353ffe5c9a119d973784a392c06066818eca0c79e98256807fabc","schema_version":"1.0","event_id":"sha256:3bc0a4197bc353ffe5c9a119d973784a392c06066818eca0c79e98256807fabc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VWYYFVAPRH3K5F6XOJEWLQOJVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attribute Evaluation on Attack Trees with Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ahto Buldas, Aleksandr Lenin, Olga Gadyatskaya, Rolando Trujillo-Rasua, Sjouke Mauw","submitted_at":"2018-12-27T16:13:45Z","abstract_excerpt":"Attack trees are considered a useful tool for security modelling because they support qualitative as well as quantitative analysis. The quantitative approach is based on values associated to each node in the tree, expressing, for instance, the minimal cost or probability of an attack. Current quantitative methods for attack trees allow the analyst to, based on an initial assignment of values to the leaf nodes, derive the values of the higher nodes in the tree. In practice, however, it shows to be very difficult to obtain reliable values for all leaf nodes. The main reasons are that data is onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10754","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"},"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-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jl1qnjsrRi4BkibTLf4FVRYIB6HZjDcjc9f7iAxF2kq1n2o+F0T5hnPM1Xg5ZJP+CleEHdNrWR4av959vnjxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:53:53.254857Z"},"content_sha256":"a1d23919a8ae52166c8e1bc619387758cbfaf85d55c155da1f4ca6ab6c032612","schema_version":"1.0","event_id":"sha256:a1d23919a8ae52166c8e1bc619387758cbfaf85d55c155da1f4ca6ab6c032612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWYYFVAPRH3K5F6XOJEWLQOJVM/bundle.json","state_url":"https://pith.science/pith/VWYYFVAPRH3K5F6XOJEWLQOJVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWYYFVAPRH3K5F6XOJEWLQOJVM/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-06-02T21:53:53Z","links":{"resolver":"https://pith.science/pith/VWYYFVAPRH3K5F6XOJEWLQOJVM","bundle":"https://pith.science/pith/VWYYFVAPRH3K5F6XOJEWLQOJVM/bundle.json","state":"https://pith.science/pith/VWYYFVAPRH3K5F6XOJEWLQOJVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWYYFVAPRH3K5F6XOJEWLQOJVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VWYYFVAPRH3K5F6XOJEWLQOJVM","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":"f9c426a7a4d422241365ac931f114e798609c31580fc1840728d5cd6da5283c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T16:13:45Z","title_canon_sha256":"d64907e36769b8755c8a8eb2591b4780a69c8caacca17f3798e9fa718fb43f2e"},"schema_version":"1.0","source":{"id":"1812.10754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10754","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10754v2","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10754","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"VWYYFVAPRH3K","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VWYYFVAPRH3K5F6X","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VWYYFVAP","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:a1d23919a8ae52166c8e1bc619387758cbfaf85d55c155da1f4ca6ab6c032612","target":"graph","created_at":"2026-05-17T23:56:35Z","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":"Attack trees are considered a useful tool for security modelling because they support qualitative as well as quantitative analysis. The quantitative approach is based on values associated to each node in the tree, expressing, for instance, the minimal cost or probability of an attack. Current quantitative methods for attack trees allow the analyst to, based on an initial assignment of values to the leaf nodes, derive the values of the higher nodes in the tree. In practice, however, it shows to be very difficult to obtain reliable values for all leaf nodes. The main reasons are that data is onl","authors_text":"Ahto Buldas, Aleksandr Lenin, Olga Gadyatskaya, Rolando Trujillo-Rasua, Sjouke Mauw","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T16:13:45Z","title":"Attribute Evaluation on Attack Trees with Incomplete Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10754","kind":"arxiv","version":2},"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:3bc0a4197bc353ffe5c9a119d973784a392c06066818eca0c79e98256807fabc","target":"record","created_at":"2026-05-17T23:56:35Z","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":"f9c426a7a4d422241365ac931f114e798609c31580fc1840728d5cd6da5283c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-27T16:13:45Z","title_canon_sha256":"d64907e36769b8755c8a8eb2591b4780a69c8caacca17f3798e9fa718fb43f2e"},"schema_version":"1.0","source":{"id":"1812.10754","kind":"arxiv","version":2}},"canonical_sha256":"adb182d40f89f6ae97d7724965c1c9ab32bbc4a1308b01286efa15e4fcb44c76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adb182d40f89f6ae97d7724965c1c9ab32bbc4a1308b01286efa15e4fcb44c76","first_computed_at":"2026-05-17T23:56:35.042522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:35.042522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DphgqAX87H5GLZKobCidCwaPPPmZnzHyPURl5i5nb6KA3BYCnNBRwXxBnhk1xZvrMpGWs9ycqTiidGH37xukAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:35.043030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bc0a4197bc353ffe5c9a119d973784a392c06066818eca0c79e98256807fabc","sha256:a1d23919a8ae52166c8e1bc619387758cbfaf85d55c155da1f4ca6ab6c032612"],"state_sha256":"fb9e102b6ce1ca115beee6a9a77b1c72d227c94f134c58519249e0ae0e0ea90c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9islUpOrV8s542OgmZLadu2sPLxFWnHRUBY3/boV47cA5UHeQBuVKw5tcNso9lqi2u0hSvp6OCHHyae9SZvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:53:53.256848Z","bundle_sha256":"46954da71cb2fa650500cfed8a5c4c78d1857507a9ccd0c6bd9fab380d800f60"}}