{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NSLPYKTHOHRJQDFOSVMRMSLNAI","short_pith_number":"pith:NSLPYKTH","canonical_record":{"source":{"id":"1306.0388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-06-03T12:53:36Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"62d64c8b7d440f646721963f36c30be74e9ab723ea900f79e1df910cd2f502b3","abstract_canon_sha256":"9a806c3a62a09e04a7ae2bb1ef74acfa3e740a134c2638aedaa0a42bf56d7319"},"schema_version":"1.0"},"canonical_sha256":"6c96fc2a6771e2980cae955916496d023396c8d6e73008ef5565b672edcfad49","source":{"kind":"arxiv","id":"1306.0388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0388","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0388v1","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0388","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"NSLPYKTHOHRJ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NSLPYKTHOHRJQDFO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NSLPYKTH","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NSLPYKTHOHRJQDFOSVMRMSLNAI","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-06-03T12:53:36Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"62d64c8b7d440f646721963f36c30be74e9ab723ea900f79e1df910cd2f502b3","abstract_canon_sha256":"9a806c3a62a09e04a7ae2bb1ef74acfa3e740a134c2638aedaa0a42bf56d7319"},"schema_version":"1.0"},"canonical_sha256":"6c96fc2a6771e2980cae955916496d023396c8d6e73008ef5565b672edcfad49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:55.352563Z","signature_b64":"Reu+jsbKi/vky2ilDvtQ1iESEprKzaDSo9+p25UJGmyNRfNoLiNqu5KEr15a4kqYhgSKhn3p+rgCcx4OJFjuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c96fc2a6771e2980cae955916496d023396c8d6e73008ef5565b672edcfad49","last_reissued_at":"2026-05-18T03:21:55.352067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:55.352067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0388","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-18T03:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BkrbXMO2dnn6ZTCQ0cu6sqzDO6GiWHqf8wwd3dm/kofQN/7fJBS/RbSX2jhnDTOL+y3/h78inYmpY3M3MSSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:11:54.153713Z"},"content_sha256":"a38e9d71fb359076f9b80079281e0f134c6797b4040f1edf4d24ff2edfc6a68e","schema_version":"1.0","event_id":"sha256:a38e9d71fb359076f9b80079281e0f134c6797b4040f1edf4d24ff2edfc6a68e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NSLPYKTHOHRJQDFOSVMRMSLNAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing Incentives for Protocol Compliance in Complex Domains: A Case Study of Introduction-Based Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.GT","authors_text":"Michael P. Wellman, Quang Duong, Tae Hyung Kim","submitted_at":"2013-06-03T12:53:36Z","abstract_excerpt":"Formal analyses of incentives for compliance with network protocols often appeal to game-theoretic models and concepts. Applications of game-theoretic analysis to network security have generally been limited to highly stylized models, where simplified environments enable tractable study of key strategic variables. We propose a simulation-based approach to game-theoretic analysis of protocol compliance, for scenarios with large populations of agents and large policy spaces. We define a general procedure for systematically exploring a structured policy space, directed expressly to resolve the qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0388","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-18T03:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8szOIKL2VvZW3yntSADjrwuOd/zRKZULxqiQPwHhkJE18meRpCH16WzIqWJR3bEp6WsDvOO6z28Y6/IhBtbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:11:54.154057Z"},"content_sha256":"ebbbd82bab7d5e27bed2f25fd426067e5f4161bb51fb51b2896574eb5ee0297d","schema_version":"1.0","event_id":"sha256:ebbbd82bab7d5e27bed2f25fd426067e5f4161bb51fb51b2896574eb5ee0297d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/bundle.json","state_url":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/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-02T23:11:54Z","links":{"resolver":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI","bundle":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/bundle.json","state":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NSLPYKTHOHRJQDFOSVMRMSLNAI","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":"9a806c3a62a09e04a7ae2bb1ef74acfa3e740a134c2638aedaa0a42bf56d7319","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-06-03T12:53:36Z","title_canon_sha256":"62d64c8b7d440f646721963f36c30be74e9ab723ea900f79e1df910cd2f502b3"},"schema_version":"1.0","source":{"id":"1306.0388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0388","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0388v1","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0388","created_at":"2026-05-18T03:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"NSLPYKTHOHRJ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NSLPYKTHOHRJQDFO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NSLPYKTH","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:ebbbd82bab7d5e27bed2f25fd426067e5f4161bb51fb51b2896574eb5ee0297d","target":"graph","created_at":"2026-05-18T03:21:55Z","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":"Formal analyses of incentives for compliance with network protocols often appeal to game-theoretic models and concepts. Applications of game-theoretic analysis to network security have generally been limited to highly stylized models, where simplified environments enable tractable study of key strategic variables. We propose a simulation-based approach to game-theoretic analysis of protocol compliance, for scenarios with large populations of agents and large policy spaces. We define a general procedure for systematically exploring a structured policy space, directed expressly to resolve the qu","authors_text":"Michael P. Wellman, Quang Duong, Tae Hyung Kim","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-06-03T12:53:36Z","title":"Analyzing Incentives for Protocol Compliance in Complex Domains: A Case Study of Introduction-Based Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0388","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:a38e9d71fb359076f9b80079281e0f134c6797b4040f1edf4d24ff2edfc6a68e","target":"record","created_at":"2026-05-18T03:21:55Z","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":"9a806c3a62a09e04a7ae2bb1ef74acfa3e740a134c2638aedaa0a42bf56d7319","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-06-03T12:53:36Z","title_canon_sha256":"62d64c8b7d440f646721963f36c30be74e9ab723ea900f79e1df910cd2f502b3"},"schema_version":"1.0","source":{"id":"1306.0388","kind":"arxiv","version":1}},"canonical_sha256":"6c96fc2a6771e2980cae955916496d023396c8d6e73008ef5565b672edcfad49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c96fc2a6771e2980cae955916496d023396c8d6e73008ef5565b672edcfad49","first_computed_at":"2026-05-18T03:21:55.352067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:55.352067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Reu+jsbKi/vky2ilDvtQ1iESEprKzaDSo9+p25UJGmyNRfNoLiNqu5KEr15a4kqYhgSKhn3p+rgCcx4OJFjuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:55.352563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a38e9d71fb359076f9b80079281e0f134c6797b4040f1edf4d24ff2edfc6a68e","sha256:ebbbd82bab7d5e27bed2f25fd426067e5f4161bb51fb51b2896574eb5ee0297d"],"state_sha256":"5207eda5813c22d136af93c80301e620c5254d7f79e120eb018ce7d111d0996e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0nbce2hn2pd7mjDy9jiYDtD2cpuu9PhOnz6fvrjqVcBJJ9I29jE+V7HssIFZnC06FIuiIgit9wj5nG+o3FQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:11:54.156000Z","bundle_sha256":"00b034270e6f9aeee821803df8f8090b73ac9129fb8dea8fb036e215fdce61bc"}}