{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SWFRFDBBKNWHSB6SYI3EXBWYEV","short_pith_number":"pith:SWFRFDBB","schema_version":"1.0","canonical_sha256":"958b128c21536c7907d2c2364b86d825465171c74a11767c379c51fcf886b13a","source":{"kind":"arxiv","id":"1403.6279","version":2},"attestation_state":"computed","paper":{"title":"Quantum(-like) decision making: on validity of the Aumann theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","quant-ph"],"primary_cat":"q-bio.NC","authors_text":"Andrei Khrennikov, Irina Basieva","submitted_at":"2014-03-25T10:24:12Z","abstract_excerpt":"Through set-theoretic formalization of the notion of common knowledge, Aumann proved that if two agents have the common priors, and their posteriors for a given event are common knowledge, then their posteriors must be equal. In this paper we investigate the problem of validity of this theorem in the framework of quantum(-like) decision making."},"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":"1403.6279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2014-03-25T10:24:12Z","cross_cats_sorted":["math.PR","quant-ph"],"title_canon_sha256":"cd687769da152a0bede970335ab65c5412e302ba23d550e83b16a8f511bea9ee","abstract_canon_sha256":"0674a057be310e92d9ea2c9e03aa69aa38b7e27c61de538a236463b74ddde7c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:30.783312Z","signature_b64":"pW/Y1z3CA1261QmAB1BhpHqDbObr3KEnsRvTbNvA0u4OHiLoFZAHQvNTxoBNPeCh79OjeCkWwBT5heoWe1NgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"958b128c21536c7907d2c2364b86d825465171c74a11767c379c51fcf886b13a","last_reissued_at":"2026-05-18T02:46:30.782881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:30.782881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum(-like) decision making: on validity of the Aumann theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","quant-ph"],"primary_cat":"q-bio.NC","authors_text":"Andrei Khrennikov, Irina Basieva","submitted_at":"2014-03-25T10:24:12Z","abstract_excerpt":"Through set-theoretic formalization of the notion of common knowledge, Aumann proved that if two agents have the common priors, and their posteriors for a given event are common knowledge, then their posteriors must be equal. In this paper we investigate the problem of validity of this theorem in the framework of quantum(-like) decision making."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6279","kind":"arxiv","version":2},"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":"1403.6279","created_at":"2026-05-18T02:46:30.782944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6279v2","created_at":"2026-05-18T02:46:30.782944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6279","created_at":"2026-05-18T02:46:30.782944+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWFRFDBBKNWH","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWFRFDBBKNWHSB6S","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWFRFDBB","created_at":"2026-05-18T12:28:49.207871+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/SWFRFDBBKNWHSB6SYI3EXBWYEV","json":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV.json","graph_json":"https://pith.science/api/pith-number/SWFRFDBBKNWHSB6SYI3EXBWYEV/graph.json","events_json":"https://pith.science/api/pith-number/SWFRFDBBKNWHSB6SYI3EXBWYEV/events.json","paper":"https://pith.science/paper/SWFRFDBB"},"agent_actions":{"view_html":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV","download_json":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV.json","view_paper":"https://pith.science/paper/SWFRFDBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6279&json=true","fetch_graph":"https://pith.science/api/pith-number/SWFRFDBBKNWHSB6SYI3EXBWYEV/graph.json","fetch_events":"https://pith.science/api/pith-number/SWFRFDBBKNWHSB6SYI3EXBWYEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV/action/storage_attestation","attest_author":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV/action/author_attestation","sign_citation":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV/action/citation_signature","submit_replication":"https://pith.science/pith/SWFRFDBBKNWHSB6SYI3EXBWYEV/action/replication_record"}},"created_at":"2026-05-18T02:46:30.782944+00:00","updated_at":"2026-05-18T02:46:30.782944+00:00"}