{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OYZ7JQFX5AB2ZC22WV643E7YP6","short_pith_number":"pith:OYZ7JQFX","canonical_record":{"source":{"id":"1508.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-12T16:00:30Z","cross_cats_sorted":["cs.CR","math.CO"],"title_canon_sha256":"01a8e55b7d0f79a30adc405ff00b97f8bdf0a7ac8bc6dcad0b27fd7926faf2cd","abstract_canon_sha256":"cc4f0ca0a5ff73e81462b882e825e5f61e499d14c5213dbf9b28cabfbb22d882"},"schema_version":"1.0"},"canonical_sha256":"7633f4c0b7e803ac8b5ab57dcd93f87fad3ebe9183ec0b1fb5598ea57ed34876","source":{"kind":"arxiv","id":"1508.03657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03657","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03657v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03657","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"OYZ7JQFX5AB2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OYZ7JQFX5AB2ZC22","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OYZ7JQFX","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OYZ7JQFX5AB2ZC22WV643E7YP6","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-12T16:00:30Z","cross_cats_sorted":["cs.CR","math.CO"],"title_canon_sha256":"01a8e55b7d0f79a30adc405ff00b97f8bdf0a7ac8bc6dcad0b27fd7926faf2cd","abstract_canon_sha256":"cc4f0ca0a5ff73e81462b882e825e5f61e499d14c5213dbf9b28cabfbb22d882"},"schema_version":"1.0"},"canonical_sha256":"7633f4c0b7e803ac8b5ab57dcd93f87fad3ebe9183ec0b1fb5598ea57ed34876","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.515876Z","signature_b64":"vdWRRQqJVJI3et7LFQywOmFjXvUDzQywYv1GZ5FCx7iW6NWPmwHXMdflFLgUJ2kSGCrn/x7Tq30/VJMxovMGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7633f4c0b7e803ac8b5ab57dcd93f87fad3ebe9183ec0b1fb5598ea57ed34876","last_reissued_at":"2026-05-18T01:35:15.515217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.515217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03657","source_version":1,"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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgT3ZFtkss5Ao2na2x5O36+Hq3rsrsgz48tuJ+TRmQeiguqpniFLOBeyXqVAN0wIUwQxLWg3a0NNtVoIGGZ1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:40:46.942468Z"},"content_sha256":"3af9bf962d2992454b9f6fe9ace755bf0142b221583e46931eba5d8cc70b8af8","schema_version":"1.0","event_id":"sha256:3af9bf962d2992454b9f6fe9ace755bf0142b221583e46931eba5d8cc70b8af8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OYZ7JQFX5AB2ZC22WV643E7YP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.CO"],"primary_cat":"cs.DS","authors_text":"Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra","submitted_at":"2015-08-12T16:00:30Z","abstract_excerpt":"In our cyber security model we define the concept of {\\em penetration cost}, which is the cost that must be paid in order to break into the next layer of security. Given a tree $T$ rooted at a vertex $r$, a {\\em penetrating cost} edge function $c$ on $T$, a {\\em target-acquisition} vertex function $p$ on $T$, the attacker's {\\em budget} and the {\\em game-over threshold} $B,G \\in {\\mathbb{Q}}^{+}$ respectively, we consider the problem of determining the existence of a rooted subtree $T'$ of $T$ within the attacker's budget (that is, the sum of the costs of the edges in $T'$ is less than or equa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03657","kind":"arxiv","version":1},"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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ev68PywkbBGB0IzWywG+fbw54Ev3TYi1J4Ph8F4iPGa4A+oFbpbXSQuEB8BLFQGse9p1z3n/4yyqQAFnhap+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:40:46.943115Z"},"content_sha256":"5cc36ae3da73560d5f733547a030487c0e817a807f2ffba3196e0c616251b60e","schema_version":"1.0","event_id":"sha256:5cc36ae3da73560d5f733547a030487c0e817a807f2ffba3196e0c616251b60e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYZ7JQFX5AB2ZC22WV643E7YP6/bundle.json","state_url":"https://pith.science/pith/OYZ7JQFX5AB2ZC22WV643E7YP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYZ7JQFX5AB2ZC22WV643E7YP6/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-07-01T02:40:46Z","links":{"resolver":"https://pith.science/pith/OYZ7JQFX5AB2ZC22WV643E7YP6","bundle":"https://pith.science/pith/OYZ7JQFX5AB2ZC22WV643E7YP6/bundle.json","state":"https://pith.science/pith/OYZ7JQFX5AB2ZC22WV643E7YP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYZ7JQFX5AB2ZC22WV643E7YP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OYZ7JQFX5AB2ZC22WV643E7YP6","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":"cc4f0ca0a5ff73e81462b882e825e5f61e499d14c5213dbf9b28cabfbb22d882","cross_cats_sorted":["cs.CR","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-12T16:00:30Z","title_canon_sha256":"01a8e55b7d0f79a30adc405ff00b97f8bdf0a7ac8bc6dcad0b27fd7926faf2cd"},"schema_version":"1.0","source":{"id":"1508.03657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03657","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03657v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03657","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"OYZ7JQFX5AB2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OYZ7JQFX5AB2ZC22","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OYZ7JQFX","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:5cc36ae3da73560d5f733547a030487c0e817a807f2ffba3196e0c616251b60e","target":"graph","created_at":"2026-05-18T01:35:15Z","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":"In our cyber security model we define the concept of {\\em penetration cost}, which is the cost that must be paid in order to break into the next layer of security. Given a tree $T$ rooted at a vertex $r$, a {\\em penetrating cost} edge function $c$ on $T$, a {\\em target-acquisition} vertex function $p$ on $T$, the attacker's {\\em budget} and the {\\em game-over threshold} $B,G \\in {\\mathbb{Q}}^{+}$ respectively, we consider the problem of determining the existence of a rooted subtree $T'$ of $T$ within the attacker's budget (that is, the sum of the costs of the edges in $T'$ is less than or equa","authors_text":"Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra","cross_cats":["cs.CR","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-12T16:00:30Z","title":"The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03657","kind":"arxiv","version":1},"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:3af9bf962d2992454b9f6fe9ace755bf0142b221583e46931eba5d8cc70b8af8","target":"record","created_at":"2026-05-18T01:35:15Z","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":"cc4f0ca0a5ff73e81462b882e825e5f61e499d14c5213dbf9b28cabfbb22d882","cross_cats_sorted":["cs.CR","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-12T16:00:30Z","title_canon_sha256":"01a8e55b7d0f79a30adc405ff00b97f8bdf0a7ac8bc6dcad0b27fd7926faf2cd"},"schema_version":"1.0","source":{"id":"1508.03657","kind":"arxiv","version":1}},"canonical_sha256":"7633f4c0b7e803ac8b5ab57dcd93f87fad3ebe9183ec0b1fb5598ea57ed34876","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7633f4c0b7e803ac8b5ab57dcd93f87fad3ebe9183ec0b1fb5598ea57ed34876","first_computed_at":"2026-05-18T01:35:15.515217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:15.515217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vdWRRQqJVJI3et7LFQywOmFjXvUDzQywYv1GZ5FCx7iW6NWPmwHXMdflFLgUJ2kSGCrn/x7Tq30/VJMxovMGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:15.515876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3af9bf962d2992454b9f6fe9ace755bf0142b221583e46931eba5d8cc70b8af8","sha256:5cc36ae3da73560d5f733547a030487c0e817a807f2ffba3196e0c616251b60e"],"state_sha256":"84999272804c906f13f29639e494270443d8f8823b74768b6d3aa9288b817b0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RuQBeRsrciT0msWVijPHno+3JpW31NYrr12pq9WDyyGqHb1gRDK4GnDkJGK/6mrykI5LG6A1b+vLdcOUPBbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:40:46.946607Z","bundle_sha256":"b9ba8cf3846e890dfba52f14dc987017f5db8eb62c6b36219326df3b446ff4c8"}}