{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5BAKFIGC3B6J4S4CN7D7ECDOJK","short_pith_number":"pith:5BAKFIGC","schema_version":"1.0","canonical_sha256":"e840a2a0c2d87c9e4b826fc7f2086e4aacd61b451cfd40d9151e002204ce9d45","source":{"kind":"arxiv","id":"1405.3296","version":1},"attestation_state":"computed","paper":{"title":"Algorithm Instance Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Samuel D. Johnson, Tsai-Ching Lu","submitted_at":"2014-05-13T20:13:54Z","abstract_excerpt":"This paper introduces algorithm instance games (AIGs) as a conceptual classification applying to games in which outcomes are resolved from joint strategies algorithmically. For such games, a fundamental question asks: How do the details of the algorithm's description influence agents' strategic behavior?\n  We analyze two versions of an AIG based on the set-cover optimization problem. In these games, joint strategies correspond to instances of the set-cover problem, with each subset (of a given universe of elements) representing the strategy of a single agent. Outcomes are covers computed from "},"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":"1405.3296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-13T20:13:54Z","cross_cats_sorted":[],"title_canon_sha256":"0330c249c2fd4841648bd8eca916f09a3aa95d2a934a212162eef7d6320f3912","abstract_canon_sha256":"d48e74630ba08853ed9e1dab98e1cce42599c9c3557425fd952ed1ee17470271"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:56.448437Z","signature_b64":"uRbYQF7O199jXqBWzn5JG4j/mGknwpd4FA6yqzsxVB7yBj7Kf/2V1Yxq+FpmqrnQ84wfMf8AOSTJJ+jv6PqOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e840a2a0c2d87c9e4b826fc7f2086e4aacd61b451cfd40d9151e002204ce9d45","last_reissued_at":"2026-05-18T02:51:56.447842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:56.447842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm Instance Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Samuel D. Johnson, Tsai-Ching Lu","submitted_at":"2014-05-13T20:13:54Z","abstract_excerpt":"This paper introduces algorithm instance games (AIGs) as a conceptual classification applying to games in which outcomes are resolved from joint strategies algorithmically. For such games, a fundamental question asks: How do the details of the algorithm's description influence agents' strategic behavior?\n  We analyze two versions of an AIG based on the set-cover optimization problem. In these games, joint strategies correspond to instances of the set-cover problem, with each subset (of a given universe of elements) representing the strategy of a single agent. Outcomes are covers computed from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3296","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":"1405.3296","created_at":"2026-05-18T02:51:56.447934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3296v1","created_at":"2026-05-18T02:51:56.447934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3296","created_at":"2026-05-18T02:51:56.447934+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BAKFIGC3B6J","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BAKFIGC3B6J4S4C","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BAKFIGC","created_at":"2026-05-18T12:28:14.216126+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/5BAKFIGC3B6J4S4CN7D7ECDOJK","json":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK.json","graph_json":"https://pith.science/api/pith-number/5BAKFIGC3B6J4S4CN7D7ECDOJK/graph.json","events_json":"https://pith.science/api/pith-number/5BAKFIGC3B6J4S4CN7D7ECDOJK/events.json","paper":"https://pith.science/paper/5BAKFIGC"},"agent_actions":{"view_html":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK","download_json":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK.json","view_paper":"https://pith.science/paper/5BAKFIGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3296&json=true","fetch_graph":"https://pith.science/api/pith-number/5BAKFIGC3B6J4S4CN7D7ECDOJK/graph.json","fetch_events":"https://pith.science/api/pith-number/5BAKFIGC3B6J4S4CN7D7ECDOJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK/action/storage_attestation","attest_author":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK/action/author_attestation","sign_citation":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK/action/citation_signature","submit_replication":"https://pith.science/pith/5BAKFIGC3B6J4S4CN7D7ECDOJK/action/replication_record"}},"created_at":"2026-05-18T02:51:56.447934+00:00","updated_at":"2026-05-18T02:51:56.447934+00:00"}