{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7P4Z76U34UVJBQKWMD6MVV5QFC","short_pith_number":"pith:7P4Z76U3","canonical_record":{"source":{"id":"1902.08712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-23T01:12:36Z","cross_cats_sorted":[],"title_canon_sha256":"052bb57d0dd33cf22abad6611653995b608e85d749028e3d1ea446634be3ad2e","abstract_canon_sha256":"fce2cd65bfa9cb9f2c11a874540802425ec85a35a4849b3976b8ea4b6092d577"},"schema_version":"1.0"},"canonical_sha256":"fbf99ffa9be52a90c15660fccad7b028b8e4429ec47211fe7bcec012b61e3d50","source":{"kind":"arxiv","id":"1902.08712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08712","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08712v1","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08712","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"7P4Z76U34UVJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7P4Z76U34UVJBQKW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7P4Z76U3","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7P4Z76U34UVJBQKWMD6MVV5QFC","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-23T01:12:36Z","cross_cats_sorted":[],"title_canon_sha256":"052bb57d0dd33cf22abad6611653995b608e85d749028e3d1ea446634be3ad2e","abstract_canon_sha256":"fce2cd65bfa9cb9f2c11a874540802425ec85a35a4849b3976b8ea4b6092d577"},"schema_version":"1.0"},"canonical_sha256":"fbf99ffa9be52a90c15660fccad7b028b8e4429ec47211fe7bcec012b61e3d50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:50.214525Z","signature_b64":"CmSjLot6Kvbuqz3tGymG/5Z17rYi3neQvRtdqk99OKeExsEOiKV7h+CDxnovwUp1zDNcFblxF78NK09RT6/2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbf99ffa9be52a90c15660fccad7b028b8e4429ec47211fe7bcec012b61e3d50","last_reissued_at":"2026-05-17T23:52:50.213742Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:50.213742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08712","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-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ljrwt/NuW3KoclQekhyjTXmagxnFlfQW0Pk5/wrohsswuSMSQASQXf50pEQYGJUjejeLJNf6O9PdHcEyib5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:43:58.650266Z"},"content_sha256":"d2a49ccc9852afb2fb4d5e3cc9093f21370388df9a63045ccb4981e5ce2d3c1e","schema_version":"1.0","event_id":"sha256:d2a49ccc9852afb2fb4d5e3cc9093f21370388df9a63045ccb4981e5ce2d3c1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7P4Z76U34UVJBQKWMD6MVV5QFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Allocating Limited Resources to Protect a Massive Number of Targets using a Game Theoretic Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Huamin Yang, Huan Wang, Jianping Zhao, Jinqing Li, Ligang Cong, Xiaoqiang Di, Xu Liu","submitted_at":"2019-02-23T01:12:36Z","abstract_excerpt":"Resource allocation is the process of optimizing the rare resources. In the area of security, how to allocate limited resources to protect a massive number of targets is especially challenging. This paper addresses this resource allocation issue by constructing a game theoretic model. A defender and an attacker are players and the interaction is formulated as a trade-off between protecting targets and consuming resources. The action cost which is a necessary role of consuming resource, is considered in the proposed model. Additionally, a bounded rational behavior model (Quantal Response, QR), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08712","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-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sygUD5cUFgzl2rkkyrx1h3u/TRxBME4Ld+WmyLdMAUNngYpKLaEUzywlWhRVIn9glWWlMeR7D5zdQU5GuHGFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:43:58.650616Z"},"content_sha256":"096e165b11b69b26de16eae41e4ffcdeedc39d3cd0311bfb59f92a9c7d9158c1","schema_version":"1.0","event_id":"sha256:096e165b11b69b26de16eae41e4ffcdeedc39d3cd0311bfb59f92a9c7d9158c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7P4Z76U34UVJBQKWMD6MVV5QFC/bundle.json","state_url":"https://pith.science/pith/7P4Z76U34UVJBQKWMD6MVV5QFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7P4Z76U34UVJBQKWMD6MVV5QFC/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-30T10:43:58Z","links":{"resolver":"https://pith.science/pith/7P4Z76U34UVJBQKWMD6MVV5QFC","bundle":"https://pith.science/pith/7P4Z76U34UVJBQKWMD6MVV5QFC/bundle.json","state":"https://pith.science/pith/7P4Z76U34UVJBQKWMD6MVV5QFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7P4Z76U34UVJBQKWMD6MVV5QFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7P4Z76U34UVJBQKWMD6MVV5QFC","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":"fce2cd65bfa9cb9f2c11a874540802425ec85a35a4849b3976b8ea4b6092d577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-23T01:12:36Z","title_canon_sha256":"052bb57d0dd33cf22abad6611653995b608e85d749028e3d1ea446634be3ad2e"},"schema_version":"1.0","source":{"id":"1902.08712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08712","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08712v1","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08712","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"7P4Z76U34UVJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7P4Z76U34UVJBQKW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7P4Z76U3","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:096e165b11b69b26de16eae41e4ffcdeedc39d3cd0311bfb59f92a9c7d9158c1","target":"graph","created_at":"2026-05-17T23:52:50Z","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":"Resource allocation is the process of optimizing the rare resources. In the area of security, how to allocate limited resources to protect a massive number of targets is especially challenging. This paper addresses this resource allocation issue by constructing a game theoretic model. A defender and an attacker are players and the interaction is formulated as a trade-off between protecting targets and consuming resources. The action cost which is a necessary role of consuming resource, is considered in the proposed model. Additionally, a bounded rational behavior model (Quantal Response, QR), ","authors_text":"Huamin Yang, Huan Wang, Jianping Zhao, Jinqing Li, Ligang Cong, Xiaoqiang Di, Xu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-23T01:12:36Z","title":"Allocating Limited Resources to Protect a Massive Number of Targets using a Game Theoretic Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08712","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:d2a49ccc9852afb2fb4d5e3cc9093f21370388df9a63045ccb4981e5ce2d3c1e","target":"record","created_at":"2026-05-17T23:52:50Z","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":"fce2cd65bfa9cb9f2c11a874540802425ec85a35a4849b3976b8ea4b6092d577","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-23T01:12:36Z","title_canon_sha256":"052bb57d0dd33cf22abad6611653995b608e85d749028e3d1ea446634be3ad2e"},"schema_version":"1.0","source":{"id":"1902.08712","kind":"arxiv","version":1}},"canonical_sha256":"fbf99ffa9be52a90c15660fccad7b028b8e4429ec47211fe7bcec012b61e3d50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbf99ffa9be52a90c15660fccad7b028b8e4429ec47211fe7bcec012b61e3d50","first_computed_at":"2026-05-17T23:52:50.213742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:50.213742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CmSjLot6Kvbuqz3tGymG/5Z17rYi3neQvRtdqk99OKeExsEOiKV7h+CDxnovwUp1zDNcFblxF78NK09RT6/2CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:50.214525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2a49ccc9852afb2fb4d5e3cc9093f21370388df9a63045ccb4981e5ce2d3c1e","sha256:096e165b11b69b26de16eae41e4ffcdeedc39d3cd0311bfb59f92a9c7d9158c1"],"state_sha256":"be7ce7d819eace89a6c469131e1b29485afefcfa597f9be32bf65c12ea82aebc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOd3rv6yR0e8j83pi1mWgmjUOomvZu0gRiO34ZVqHNOsH7TkrpfDofKAwdwylQPA0spXjc9GP0ITmaTE35oXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T10:43:58.652549Z","bundle_sha256":"18903c39bf725b76b82b19d3d9a9e393964f1f68769fb723c05ea770291d2568"}}