{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NSLPYKTHOHRJQDFOSVMRMSLNAI","short_pith_number":"pith:NSLPYKTH","schema_version":"1.0","canonical_sha256":"6c96fc2a6771e2980cae955916496d023396c8d6e73008ef5565b672edcfad49","source":{"kind":"arxiv","id":"1306.0388","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.0388","created_at":"2026-05-18T03:21:55.352131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0388v1","created_at":"2026-05-18T03:21:55.352131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0388","created_at":"2026-05-18T03:21:55.352131+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSLPYKTHOHRJ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSLPYKTHOHRJQDFO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSLPYKTH","created_at":"2026-05-18T12:27:52.871228+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/NSLPYKTHOHRJQDFOSVMRMSLNAI","json":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI.json","graph_json":"https://pith.science/api/pith-number/NSLPYKTHOHRJQDFOSVMRMSLNAI/graph.json","events_json":"https://pith.science/api/pith-number/NSLPYKTHOHRJQDFOSVMRMSLNAI/events.json","paper":"https://pith.science/paper/NSLPYKTH"},"agent_actions":{"view_html":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI","download_json":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI.json","view_paper":"https://pith.science/paper/NSLPYKTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0388&json=true","fetch_graph":"https://pith.science/api/pith-number/NSLPYKTHOHRJQDFOSVMRMSLNAI/graph.json","fetch_events":"https://pith.science/api/pith-number/NSLPYKTHOHRJQDFOSVMRMSLNAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/action/storage_attestation","attest_author":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/action/author_attestation","sign_citation":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/action/citation_signature","submit_replication":"https://pith.science/pith/NSLPYKTHOHRJQDFOSVMRMSLNAI/action/replication_record"}},"created_at":"2026-05-18T03:21:55.352131+00:00","updated_at":"2026-05-18T03:21:55.352131+00:00"}