{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A4RMTU7TLQMGZDO3YV32JUEH5U","short_pith_number":"pith:A4RMTU7T","canonical_record":{"source":{"id":"1803.06638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2018-03-18T10:49:40Z","cross_cats_sorted":["cond-mat.stat-mech","cs.GT"],"title_canon_sha256":"60c75e6e637431bfff3ac26160183588001bde7c5a693f1133f227685284a89a","abstract_canon_sha256":"f84cd4668f8c25475be0016a2156bfb741ba457764dad05d593a74417f6166ef"},"schema_version":"1.0"},"canonical_sha256":"0722c9d3f35c186c8ddbc577a4d087ed2b12a7acedb2d3e12181c4cf99caeb97","source":{"kind":"arxiv","id":"1803.06638","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06638","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06638v2","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06638","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"A4RMTU7TLQMG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4RMTU7TLQMGZDO3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4RMTU7T","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A4RMTU7TLQMGZDO3YV32JUEH5U","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2018-03-18T10:49:40Z","cross_cats_sorted":["cond-mat.stat-mech","cs.GT"],"title_canon_sha256":"60c75e6e637431bfff3ac26160183588001bde7c5a693f1133f227685284a89a","abstract_canon_sha256":"f84cd4668f8c25475be0016a2156bfb741ba457764dad05d593a74417f6166ef"},"schema_version":"1.0"},"canonical_sha256":"0722c9d3f35c186c8ddbc577a4d087ed2b12a7acedb2d3e12181c4cf99caeb97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:22.867774Z","signature_b64":"LN5jIksqVSffZN5vSC/6YfAWUoNDVEiNHN1CRE2mpBWe2speh4UWG8KzcyzHUnQVABk5ztr8jiH63t587KauBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0722c9d3f35c186c8ddbc577a4d087ed2b12a7acedb2d3e12181c4cf99caeb97","last_reissued_at":"2026-05-17T23:59:22.867444Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:22.867444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06638","source_version":2,"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-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pec0T+Mz/cpGNX+fWx0rKMu2nHiAFLFW9AuFJG5uvB+qAr3ywMV/X8h4ByhyGWwN34EPm+mnXCH8NK1wSwgzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:19:06.515750Z"},"content_sha256":"deeb29390a4fc5c83dfe79ba1ed11d0629e0353ceadb0eba13fe2d8125dfb68d","schema_version":"1.0","event_id":"sha256:deeb29390a4fc5c83dfe79ba1ed11d0629e0353ceadb0eba13fe2d8125dfb68d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A4RMTU7TLQMGZDO3YV32JUEH5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Decision Making via Entropy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.GT"],"primary_cat":"physics.data-an","authors_text":"Ali E. Abbas, Aram Galstyan, Armen E. Allahverdyan, Zbigniew R. Struzik","submitted_at":"2018-03-18T10:49:40Z","abstract_excerpt":"An agent choosing between various actions tends to take the one with the lowest cost. But this choice is arguably too rigid (not adaptive) to be useful in complex situations, e.g., where exploration-exploitation trade-off is relevant in creative task solving or when stated preferences differ from revealed ones. Here we study an agent who is willing to sacrifice a fixed amount of expected utility for adaptation. How can/ought our agent choose an optimal (in a technical sense) mixed action? We explore consequences of making this choice via entropy minimization, which is argued to be a specific e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06638","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"},"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-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARcoX2XQH2GR3gVT5iazEOR4N69au7T3WAD/Rb/maFHPaQSuyJM3xO25FTFVptonp4oJG8Fj9cghAikKaHDcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:19:06.516087Z"},"content_sha256":"e03f4087fb819c12976780f3788be1f1ec416cf5fe0806b092e5813039aa7edd","schema_version":"1.0","event_id":"sha256:e03f4087fb819c12976780f3788be1f1ec416cf5fe0806b092e5813039aa7edd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4RMTU7TLQMGZDO3YV32JUEH5U/bundle.json","state_url":"https://pith.science/pith/A4RMTU7TLQMGZDO3YV32JUEH5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4RMTU7TLQMGZDO3YV32JUEH5U/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-03T20:19:06Z","links":{"resolver":"https://pith.science/pith/A4RMTU7TLQMGZDO3YV32JUEH5U","bundle":"https://pith.science/pith/A4RMTU7TLQMGZDO3YV32JUEH5U/bundle.json","state":"https://pith.science/pith/A4RMTU7TLQMGZDO3YV32JUEH5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4RMTU7TLQMGZDO3YV32JUEH5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A4RMTU7TLQMGZDO3YV32JUEH5U","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":"f84cd4668f8c25475be0016a2156bfb741ba457764dad05d593a74417f6166ef","cross_cats_sorted":["cond-mat.stat-mech","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2018-03-18T10:49:40Z","title_canon_sha256":"60c75e6e637431bfff3ac26160183588001bde7c5a693f1133f227685284a89a"},"schema_version":"1.0","source":{"id":"1803.06638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06638","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06638v2","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06638","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"A4RMTU7TLQMG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4RMTU7TLQMGZDO3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4RMTU7T","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:e03f4087fb819c12976780f3788be1f1ec416cf5fe0806b092e5813039aa7edd","target":"graph","created_at":"2026-05-17T23:59:22Z","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":"An agent choosing between various actions tends to take the one with the lowest cost. But this choice is arguably too rigid (not adaptive) to be useful in complex situations, e.g., where exploration-exploitation trade-off is relevant in creative task solving or when stated preferences differ from revealed ones. Here we study an agent who is willing to sacrifice a fixed amount of expected utility for adaptation. How can/ought our agent choose an optimal (in a technical sense) mixed action? We explore consequences of making this choice via entropy minimization, which is argued to be a specific e","authors_text":"Ali E. Abbas, Aram Galstyan, Armen E. Allahverdyan, Zbigniew R. Struzik","cross_cats":["cond-mat.stat-mech","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2018-03-18T10:49:40Z","title":"Adaptive Decision Making via Entropy Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06638","kind":"arxiv","version":2},"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:deeb29390a4fc5c83dfe79ba1ed11d0629e0353ceadb0eba13fe2d8125dfb68d","target":"record","created_at":"2026-05-17T23:59:22Z","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":"f84cd4668f8c25475be0016a2156bfb741ba457764dad05d593a74417f6166ef","cross_cats_sorted":["cond-mat.stat-mech","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2018-03-18T10:49:40Z","title_canon_sha256":"60c75e6e637431bfff3ac26160183588001bde7c5a693f1133f227685284a89a"},"schema_version":"1.0","source":{"id":"1803.06638","kind":"arxiv","version":2}},"canonical_sha256":"0722c9d3f35c186c8ddbc577a4d087ed2b12a7acedb2d3e12181c4cf99caeb97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0722c9d3f35c186c8ddbc577a4d087ed2b12a7acedb2d3e12181c4cf99caeb97","first_computed_at":"2026-05-17T23:59:22.867444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:22.867444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LN5jIksqVSffZN5vSC/6YfAWUoNDVEiNHN1CRE2mpBWe2speh4UWG8KzcyzHUnQVABk5ztr8jiH63t587KauBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:22.867774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:deeb29390a4fc5c83dfe79ba1ed11d0629e0353ceadb0eba13fe2d8125dfb68d","sha256:e03f4087fb819c12976780f3788be1f1ec416cf5fe0806b092e5813039aa7edd"],"state_sha256":"33abed68ea3b6233c4d78bef5d73c336addf3387a0d35d6bdceff4b9cf99bde1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJn+1MWGwC2P6TB3HycX8vkV6sOraysymnsgKmR4fWhGZrkwNswwZmGHGyNtVoc1RPRqMmSwBrcwDSgBEJxBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:19:06.518024Z","bundle_sha256":"d0339619d98ca01ec8d8d5f027ee94816bf09b1bf0bdf361c35ca4ea66cb84c3"}}