{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KBJ3E4AC2E5IHM54WINYH32TGQ","short_pith_number":"pith:KBJ3E4AC","schema_version":"1.0","canonical_sha256":"5053b27002d13a83b3bcb21b83ef533413e2c507b8bf48adbafaee506f9e3952","source":{"kind":"arxiv","id":"1705.02663","version":3},"attestation_state":"computed","paper":{"title":"SOS for bounded rationality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessandro Facchini, Alessio Benavoli, Dario Piga, Marco Zaffalon","submitted_at":"2017-05-07T17:20:11Z","abstract_excerpt":"In the gambling foundation of probability theory, rationality requires that a subject should always (never) find desirable all nonnegative (negative) gambles, because no matter the result of the experiment the subject never (always) decreases her money. Evaluating the nonnegativity of a gamble in infinite spaces is a difficult task. In fact, even if we restrict the gambles to be polynomials in R^n , the problem of determining nonnegativity is NP-hard. The aim of this paper is to develop a computable theory of desirable gambles. Instead of requiring the subject to accept all nonnegative gambles"},"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":"1705.02663","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-07T17:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"77c68b0de35febe35635314bdc3336a63ebce1ccafe6c3beea00907aea73ee30","abstract_canon_sha256":"937d50792b8b1aa1354341282e2151f292dd1db674e1ac43b085497d1941ae3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:22.633301Z","signature_b64":"LQFRYyD9r7FvpjUm3qy/AFIyUT3iQKJi1zvJCZlketuNqROr64Mfmfkiphe19u6gQPJqIdTgQ9ZCQ/9ZyqhCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5053b27002d13a83b3bcb21b83ef533413e2c507b8bf48adbafaee506f9e3952","last_reissued_at":"2026-05-18T00:00:22.632697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:22.632697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOS for bounded rationality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessandro Facchini, Alessio Benavoli, Dario Piga, Marco Zaffalon","submitted_at":"2017-05-07T17:20:11Z","abstract_excerpt":"In the gambling foundation of probability theory, rationality requires that a subject should always (never) find desirable all nonnegative (negative) gambles, because no matter the result of the experiment the subject never (always) decreases her money. Evaluating the nonnegativity of a gamble in infinite spaces is a difficult task. In fact, even if we restrict the gambles to be polynomials in R^n , the problem of determining nonnegativity is NP-hard. The aim of this paper is to develop a computable theory of desirable gambles. Instead of requiring the subject to accept all nonnegative gambles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02663","kind":"arxiv","version":3},"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":"1705.02663","created_at":"2026-05-18T00:00:22.632781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02663v3","created_at":"2026-05-18T00:00:22.632781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02663","created_at":"2026-05-18T00:00:22.632781+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBJ3E4AC2E5I","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBJ3E4AC2E5IHM54","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBJ3E4AC","created_at":"2026-05-18T12:31:24.725408+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/KBJ3E4AC2E5IHM54WINYH32TGQ","json":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ.json","graph_json":"https://pith.science/api/pith-number/KBJ3E4AC2E5IHM54WINYH32TGQ/graph.json","events_json":"https://pith.science/api/pith-number/KBJ3E4AC2E5IHM54WINYH32TGQ/events.json","paper":"https://pith.science/paper/KBJ3E4AC"},"agent_actions":{"view_html":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ","download_json":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ.json","view_paper":"https://pith.science/paper/KBJ3E4AC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02663&json=true","fetch_graph":"https://pith.science/api/pith-number/KBJ3E4AC2E5IHM54WINYH32TGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KBJ3E4AC2E5IHM54WINYH32TGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ/action/storage_attestation","attest_author":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ/action/author_attestation","sign_citation":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ/action/citation_signature","submit_replication":"https://pith.science/pith/KBJ3E4AC2E5IHM54WINYH32TGQ/action/replication_record"}},"created_at":"2026-05-18T00:00:22.632781+00:00","updated_at":"2026-05-18T00:00:22.632781+00:00"}