{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K5JUWVXUO74Q2M6LWB4OBK52DJ","short_pith_number":"pith:K5JUWVXU","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"},"canonical_sha256":"57534b56f477f90d33cbb078e0abba1a4ec90bf7446584bf6beae7910e0852e1","source":{"kind":"arxiv","id":"1605.03569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03569","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03569v1","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03569","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"K5JUWVXUO74Q","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5JUWVXUO74Q2M6L","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5JUWVXU","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K5JUWVXUO74Q2M6LWB4OBK52DJ","target":"record","payload":{"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"},"canonical_sha256":"57534b56f477f90d33cbb078e0abba1a4ec90bf7446584bf6beae7910e0852e1","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"},"source_kind":"arxiv","source_id":"1605.03569","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:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SaIaUr/xmrUoepNImpoofmHogpR8c0Pgc09BX3XDh4FkJH6dXYv2s0e1BiCIi1o5OVcewCMVPr1HMOj/2bsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:34:55.900989Z"},"content_sha256":"73e7aac5aac077ad43342e327c03aea2259fbf1525d641e5eda46e30d205a992","schema_version":"1.0","event_id":"sha256:73e7aac5aac077ad43342e327c03aea2259fbf1525d641e5eda46e30d205a992"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K5JUWVXUO74Q2M6LWB4OBK52DJ","target":"graph","payload":{"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"},"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:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQeTR0Lcikt0H5hWGVOK3nZ71QReZ6vLefIzz49jbnSpUhwe+MwXUiemjafgpwUt8ZcH0ZaUDIDSoDFV9I/9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:34:55.901352Z"},"content_sha256":"8b5be55191625aef9ad610edfb1aff3d85e9ceb3b012fcdf39144686e23b4363","schema_version":"1.0","event_id":"sha256:8b5be55191625aef9ad610edfb1aff3d85e9ceb3b012fcdf39144686e23b4363"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/bundle.json","state_url":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/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:34:55Z","links":{"resolver":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ","bundle":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/bundle.json","state":"https://pith.science/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5JUWVXUO74Q2M6LWB4OBK52DJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K5JUWVXUO74Q2M6LWB4OBK52DJ","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":"54be1bc9894be07331540ed559edf7b6eecadf681e567d6b9c7078bdd3cc93f4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-11T19:25:31Z","title_canon_sha256":"d14241ff3ee312ccb9a180d71056a7274dc05de2d80e0aa7670139a115184869"},"schema_version":"1.0","source":{"id":"1605.03569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03569","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03569v1","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03569","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"K5JUWVXUO74Q","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5JUWVXUO74Q2M6L","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5JUWVXU","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:8b5be55191625aef9ad610edfb1aff3d85e9ceb3b012fcdf39144686e23b4363","target":"graph","created_at":"2026-05-18T01:15:00Z","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 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","authors_text":"Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-11T19:25:31Z","title":"The structure and topology of rooted weighted trees modeling layered cyber-security systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03569","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:73e7aac5aac077ad43342e327c03aea2259fbf1525d641e5eda46e30d205a992","target":"record","created_at":"2026-05-18T01:15:00Z","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":"54be1bc9894be07331540ed559edf7b6eecadf681e567d6b9c7078bdd3cc93f4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-11T19:25:31Z","title_canon_sha256":"d14241ff3ee312ccb9a180d71056a7274dc05de2d80e0aa7670139a115184869"},"schema_version":"1.0","source":{"id":"1605.03569","kind":"arxiv","version":1}},"canonical_sha256":"57534b56f477f90d33cbb078e0abba1a4ec90bf7446584bf6beae7910e0852e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57534b56f477f90d33cbb078e0abba1a4ec90bf7446584bf6beae7910e0852e1","first_computed_at":"2026-05-18T01:15:00.847183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:00.847183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"thW7mhSOUjjW2I79XDnSzANcihYZkfDqlXRVtUXe1Tikjl0xFEMAORs/JZorSGrbcVSzuLLLl4+eCBt716V6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:00.847651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73e7aac5aac077ad43342e327c03aea2259fbf1525d641e5eda46e30d205a992","sha256:8b5be55191625aef9ad610edfb1aff3d85e9ceb3b012fcdf39144686e23b4363"],"state_sha256":"b4c394ff8437967b3ab19aeab09d473969572ace6bb54f32c54ebe90931fcb1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QXdhXRMzyqiJsuXmaHVbfTUYDrxhYvrQ5IP4w3EIKmnqOeQx+2cFVla/xlbuxzuzS4ag81qIjgshjkX2FOriDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:34:55.903253Z","bundle_sha256":"ebd31f31508604060c36de3acb513f5c83e4a7b6addb6d872f9204ea8bac9245"}}