{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WV4TZCXPZKPTNQJTPW4OPQSQL4","short_pith_number":"pith:WV4TZCXP","canonical_record":{"source":{"id":"1512.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T11:26:58Z","cross_cats_sorted":[],"title_canon_sha256":"16256daf660bd76b69d845ba6912d88537e2fe5bc225d5ea132edd51d7d4697b","abstract_canon_sha256":"5fe29a48ee3419cfa9485eff64317368c0fa2e33138e2fef8c3bd98b0d6af088"},"schema_version":"1.0"},"canonical_sha256":"b5793c8aefca9f36c1337db8e7c2505f3fff18e63c687b091e099e37547e79de","source":{"kind":"arxiv","id":"1512.00653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00653","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00653v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00653","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"WV4TZCXPZKPT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WV4TZCXPZKPTNQJT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WV4TZCXP","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WV4TZCXPZKPTNQJTPW4OPQSQL4","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T11:26:58Z","cross_cats_sorted":[],"title_canon_sha256":"16256daf660bd76b69d845ba6912d88537e2fe5bc225d5ea132edd51d7d4697b","abstract_canon_sha256":"5fe29a48ee3419cfa9485eff64317368c0fa2e33138e2fef8c3bd98b0d6af088"},"schema_version":"1.0"},"canonical_sha256":"b5793c8aefca9f36c1337db8e7c2505f3fff18e63c687b091e099e37547e79de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:25.462948Z","signature_b64":"PYZy2Calbwr5lcUT8Y2Y24bYO3KQbzeU6uMC86C+X9fqD0Sv1akVtLuadmJs6dsDIsgpOF7453lR35JY7DXfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5793c8aefca9f36c1337db8e7c2505f3fff18e63c687b091e099e37547e79de","last_reissued_at":"2026-05-18T01:25:25.462453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:25.462453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00653","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:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63uknVy+lhV/uMrO3YwjKnV4uXJrCyvnylBM2k16cE+j1sEng04csr9yIKKg6AQ9vIGhG/TLVpMuptV8N8IBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:30:22.831164Z"},"content_sha256":"ea0fdb45f8bbdbc587daef002a9e3d68ab39426db93739ec6a71de32df28ee14","schema_version":"1.0","event_id":"sha256:ea0fdb45f8bbdbc587daef002a9e3d68ab39426db93739ec6a71de32df28ee14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WV4TZCXPZKPTNQJTPW4OPQSQL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing all solutions of Nash equilibrium problems with discrete strategy sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Simone Sagratella","submitted_at":"2015-12-02T11:26:58Z","abstract_excerpt":"The Nash equilibrium problem is a widely used tool to model non-cooperative games. Many solution methods have been proposed in the literature to compute solutions of Nash equilibrium problems with continuous strategy sets, but, besides some specific methods for some particular applications, there are no general algorithms to compute solutions of Nash equilibrium problems in which the strategy set of each player is assumed to be discrete. We define a branching method to compute the whole solution set of Nash equilibrium problems with discrete strategy sets. This method is equipped with a proced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00653","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:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvFFLPg70heWhR0wn4uuhXpC1+OlaPomPJDugw2rFJoiGo445YAfUdrm5BKwhwPRkykjNT6ZgQrxgR9aTiq1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:30:22.831511Z"},"content_sha256":"23d7d01d1b31b42431688ad8cf79f3cf8a95b89077c628814191043962b90b1f","schema_version":"1.0","event_id":"sha256:23d7d01d1b31b42431688ad8cf79f3cf8a95b89077c628814191043962b90b1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WV4TZCXPZKPTNQJTPW4OPQSQL4/bundle.json","state_url":"https://pith.science/pith/WV4TZCXPZKPTNQJTPW4OPQSQL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WV4TZCXPZKPTNQJTPW4OPQSQL4/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-27T00:30:22Z","links":{"resolver":"https://pith.science/pith/WV4TZCXPZKPTNQJTPW4OPQSQL4","bundle":"https://pith.science/pith/WV4TZCXPZKPTNQJTPW4OPQSQL4/bundle.json","state":"https://pith.science/pith/WV4TZCXPZKPTNQJTPW4OPQSQL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WV4TZCXPZKPTNQJTPW4OPQSQL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WV4TZCXPZKPTNQJTPW4OPQSQL4","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":"5fe29a48ee3419cfa9485eff64317368c0fa2e33138e2fef8c3bd98b0d6af088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T11:26:58Z","title_canon_sha256":"16256daf660bd76b69d845ba6912d88537e2fe5bc225d5ea132edd51d7d4697b"},"schema_version":"1.0","source":{"id":"1512.00653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00653","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00653v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00653","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"WV4TZCXPZKPT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WV4TZCXPZKPTNQJT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WV4TZCXP","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:23d7d01d1b31b42431688ad8cf79f3cf8a95b89077c628814191043962b90b1f","target":"graph","created_at":"2026-05-18T01:25:25Z","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":"The Nash equilibrium problem is a widely used tool to model non-cooperative games. Many solution methods have been proposed in the literature to compute solutions of Nash equilibrium problems with continuous strategy sets, but, besides some specific methods for some particular applications, there are no general algorithms to compute solutions of Nash equilibrium problems in which the strategy set of each player is assumed to be discrete. We define a branching method to compute the whole solution set of Nash equilibrium problems with discrete strategy sets. This method is equipped with a proced","authors_text":"Simone Sagratella","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T11:26:58Z","title":"Computing all solutions of Nash equilibrium problems with discrete strategy sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00653","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:ea0fdb45f8bbdbc587daef002a9e3d68ab39426db93739ec6a71de32df28ee14","target":"record","created_at":"2026-05-18T01:25:25Z","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":"5fe29a48ee3419cfa9485eff64317368c0fa2e33138e2fef8c3bd98b0d6af088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-02T11:26:58Z","title_canon_sha256":"16256daf660bd76b69d845ba6912d88537e2fe5bc225d5ea132edd51d7d4697b"},"schema_version":"1.0","source":{"id":"1512.00653","kind":"arxiv","version":1}},"canonical_sha256":"b5793c8aefca9f36c1337db8e7c2505f3fff18e63c687b091e099e37547e79de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5793c8aefca9f36c1337db8e7c2505f3fff18e63c687b091e099e37547e79de","first_computed_at":"2026-05-18T01:25:25.462453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:25.462453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PYZy2Calbwr5lcUT8Y2Y24bYO3KQbzeU6uMC86C+X9fqD0Sv1akVtLuadmJs6dsDIsgpOF7453lR35JY7DXfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:25.462948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea0fdb45f8bbdbc587daef002a9e3d68ab39426db93739ec6a71de32df28ee14","sha256:23d7d01d1b31b42431688ad8cf79f3cf8a95b89077c628814191043962b90b1f"],"state_sha256":"af1fa79025d856c955515c4162cd62da88fa3541b8eed9ffdc1ba97191016c4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJx4S5Q5jVhOstRheq0kOUNbyFbEC5viBHRFe9/f6sLguE1npVU6AZuB3gPf0K5mKOvwWNzzq2mcGwx4AFUaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T00:30:22.833294Z","bundle_sha256":"5b384297a5df79b2d976e01c0ecf195d56438cd1576cc603924e427a23c990c8"}}