{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K5JUWVXUO74Q2M6LWB4OBK52DJ","short_pith_number":"pith:K5JUWVXU","schema_version":"1.0","canonical_sha256":"57534b56f477f90d33cbb078e0abba1a4ec90bf7446584bf6beae7910e0852e1","source":{"kind":"arxiv","id":"1605.03569","version":1},"attestation_state":"computed","paper":{"title":"The structure and topology of rooted weighted trees modeling layered cyber-security systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra","submitted_at":"2016-05-11T19:25:31Z","abstract_excerpt":"In this paper we consider a layered-security model in which the containers and their nestings are given in the form of a rooted tree $T$. A {\\em cyber-security model\\/} is an ordered three-tuple $M = (T, C, P)$ where $C$ and $P$ are multisets of {\\em penetration costs\\/} for the containers and {\\em target-acquisition values\\/} for the prizes that are located within the containers, respectively, both of the same cardinality as the set of the non-root vertices of $T$. The problem that we study is to assign the penetration costs to the edges and the target-acquisition values to the vertices of th"},"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":"1605.03569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-11T19:25:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d14241ff3ee312ccb9a180d71056a7274dc05de2d80e0aa7670139a115184869","abstract_canon_sha256":"54be1bc9894be07331540ed559edf7b6eecadf681e567d6b9c7078bdd3cc93f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.847651Z","signature_b64":"thW7mhSOUjjW2I79XDnSzANcihYZkfDqlXRVtUXe1Tikjl0xFEMAORs/JZorSGrbcVSzuLLLl4+eCBt716V6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57534b56f477f90d33cbb078e0abba1a4ec90bf7446584bf6beae7910e0852e1","last_reissued_at":"2026-05-18T01:15:00.847183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.847183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The structure and topology of rooted weighted trees modeling layered cyber-security systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra","submitted_at":"2016-05-11T19:25:31Z","abstract_excerpt":"In this paper we consider a layered-security model in which the containers and their nestings are given in the form of a rooted tree $T$. A {\\em cyber-security model\\/} is an ordered three-tuple $M = (T, C, P)$ where $C$ and $P$ are multisets of {\\em penetration costs\\/} for the containers and {\\em target-acquisition values\\/} for the prizes that are located within the containers, respectively, both of the same cardinality as the set of the non-root vertices of $T$. The problem that we study is to assign the penetration costs to the edges and the target-acquisition values to the vertices of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03569","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.03569","created_at":"2026-05-18T01:15:00.847243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03569v1","created_at":"2026-05-18T01:15:00.847243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03569","created_at":"2026-05-18T01:15:00.847243+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5JUWVXUO74Q","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5JUWVXUO74Q2M6L","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5JUWVXU","created_at":"2026-05-18T12:30:25.849896+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/K5JUWVXUO74Q2M6LWB4OBK52DJ","json":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ.json","graph_json":"https://pith.science/api/pith-number/K5JUWVXUO74Q2M6LWB4OBK52DJ/graph.json","events_json":"https://pith.science/api/pith-number/K5JUWVXUO74Q2M6LWB4OBK52DJ/events.json","paper":"https://pith.science/paper/K5JUWVXU"},"agent_actions":{"view_html":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ","download_json":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ.json","view_paper":"https://pith.science/paper/K5JUWVXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03569&json=true","fetch_graph":"https://pith.science/api/pith-number/K5JUWVXUO74Q2M6LWB4OBK52DJ/graph.json","fetch_events":"https://pith.science/api/pith-number/K5JUWVXUO74Q2M6LWB4OBK52DJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/action/storage_attestation","attest_author":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/action/author_attestation","sign_citation":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/action/citation_signature","submit_replication":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/action/replication_record"}},"created_at":"2026-05-18T01:15:00.847243+00:00","updated_at":"2026-05-18T01:15:00.847243+00:00"}