{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P2YHT2NDCICRUWHRDFALBMLQRW","short_pith_number":"pith:P2YHT2ND","canonical_record":{"source":{"id":"1907.09106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-22T03:16:38Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"7a60aed5cfbbba8ac6f6ffd650725712e68bbb37fd40aab5af0f9a16d5047148","abstract_canon_sha256":"d1463f29ead041a7e8c0bb6f9b3828728133a0b284ee9bc148009406559ad9a6"},"schema_version":"1.0"},"canonical_sha256":"7eb079e9a312051a58f11940b0b1708dba41d89e5a85e5c68bf9b5b9389d2b61","source":{"kind":"arxiv","id":"1907.09106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09106","created_at":"2026-05-17T23:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09106v1","created_at":"2026-05-17T23:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09106","created_at":"2026-05-17T23:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"P2YHT2NDCICR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P2YHT2NDCICRUWHR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P2YHT2ND","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P2YHT2NDCICRUWHRDFALBMLQRW","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-22T03:16:38Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"7a60aed5cfbbba8ac6f6ffd650725712e68bbb37fd40aab5af0f9a16d5047148","abstract_canon_sha256":"d1463f29ead041a7e8c0bb6f9b3828728133a0b284ee9bc148009406559ad9a6"},"schema_version":"1.0"},"canonical_sha256":"7eb079e9a312051a58f11940b0b1708dba41d89e5a85e5c68bf9b5b9389d2b61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:00.127033Z","signature_b64":"W8cJzgyMI42vZWCNMf+Royz3xaLHJJ7cr4yM8TPhgRPkBmcMOtzYQqzWWWAqa5yHuUaE3nLGi5dCXcIn7/X+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eb079e9a312051a58f11940b0b1708dba41d89e5a85e5c68bf9b5b9389d2b61","last_reissued_at":"2026-05-17T23:40:00.126528Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:00.126528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09106","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-17T23:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbPFBnmLyc8uuasgm2gkZsYahJEA9Htqwc7dewHlHb13CzoXKf+M9a6cEoDfkhMpzFV/sqVmKS7uWi+3+PRbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:28:03.177943Z"},"content_sha256":"a05c48b9c7154369ef988ff5b6d93f7933e9d2d9fe57574a79c8603c967e4f38","schema_version":"1.0","event_id":"sha256:a05c48b9c7154369ef988ff5b6d93f7933e9d2d9fe57574a79c8603c967e4f38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P2YHT2NDCICRUWHRDFALBMLQRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Conceptually Well-Founded Characterization of Iterated Admissibility Using an \"All I Know\" Operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.GT","authors_text":"Joseph Y. Halpern (Cornell University), Rafael Pass (Cornell University)","submitted_at":"2019-07-22T03:16:38Z","abstract_excerpt":"Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (IA), also known as iterated deletion of weakly dominated strategies, where uncertainty is represented using LPSs (lexicographic probability sequences). Their characterization holds in a rich structure called a complete structure, where all types are possible. In earlier work, we gave a characterization of iterated admissibility using an \"all I know\" operator, that captures the intuition that \"all the agent knows\" is that agents satisfy the appropriate rationality assumptions. That character"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09106","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-17T23:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axfL1pSaMLgwRpOJmpGVl76nSu9ii7aBGaoRe4CpON8MoH7635bCv83cW8+bKEgtPsiLKyc6TEh4z9vylMFMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:28:03.178287Z"},"content_sha256":"2cdf031dd905fb11b0ca1a5d8f5b7ca00b731585724473a71c363c76957b14f0","schema_version":"1.0","event_id":"sha256:2cdf031dd905fb11b0ca1a5d8f5b7ca00b731585724473a71c363c76957b14f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2YHT2NDCICRUWHRDFALBMLQRW/bundle.json","state_url":"https://pith.science/pith/P2YHT2NDCICRUWHRDFALBMLQRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2YHT2NDCICRUWHRDFALBMLQRW/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-02T21:28:03Z","links":{"resolver":"https://pith.science/pith/P2YHT2NDCICRUWHRDFALBMLQRW","bundle":"https://pith.science/pith/P2YHT2NDCICRUWHRDFALBMLQRW/bundle.json","state":"https://pith.science/pith/P2YHT2NDCICRUWHRDFALBMLQRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2YHT2NDCICRUWHRDFALBMLQRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P2YHT2NDCICRUWHRDFALBMLQRW","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":"d1463f29ead041a7e8c0bb6f9b3828728133a0b284ee9bc148009406559ad9a6","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-22T03:16:38Z","title_canon_sha256":"7a60aed5cfbbba8ac6f6ffd650725712e68bbb37fd40aab5af0f9a16d5047148"},"schema_version":"1.0","source":{"id":"1907.09106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09106","created_at":"2026-05-17T23:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09106v1","created_at":"2026-05-17T23:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09106","created_at":"2026-05-17T23:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"P2YHT2NDCICR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P2YHT2NDCICRUWHR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P2YHT2ND","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:2cdf031dd905fb11b0ca1a5d8f5b7ca00b731585724473a71c363c76957b14f0","target":"graph","created_at":"2026-05-17T23:40:00Z","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":"Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (IA), also known as iterated deletion of weakly dominated strategies, where uncertainty is represented using LPSs (lexicographic probability sequences). Their characterization holds in a rich structure called a complete structure, where all types are possible. In earlier work, we gave a characterization of iterated admissibility using an \"all I know\" operator, that captures the intuition that \"all the agent knows\" is that agents satisfy the appropriate rationality assumptions. That character","authors_text":"Joseph Y. Halpern (Cornell University), Rafael Pass (Cornell University)","cross_cats":["cs.AI","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-22T03:16:38Z","title":"A Conceptually Well-Founded Characterization of Iterated Admissibility Using an \"All I Know\" Operator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09106","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:a05c48b9c7154369ef988ff5b6d93f7933e9d2d9fe57574a79c8603c967e4f38","target":"record","created_at":"2026-05-17T23:40:00Z","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":"d1463f29ead041a7e8c0bb6f9b3828728133a0b284ee9bc148009406559ad9a6","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-22T03:16:38Z","title_canon_sha256":"7a60aed5cfbbba8ac6f6ffd650725712e68bbb37fd40aab5af0f9a16d5047148"},"schema_version":"1.0","source":{"id":"1907.09106","kind":"arxiv","version":1}},"canonical_sha256":"7eb079e9a312051a58f11940b0b1708dba41d89e5a85e5c68bf9b5b9389d2b61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7eb079e9a312051a58f11940b0b1708dba41d89e5a85e5c68bf9b5b9389d2b61","first_computed_at":"2026-05-17T23:40:00.126528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:00.126528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8cJzgyMI42vZWCNMf+Royz3xaLHJJ7cr4yM8TPhgRPkBmcMOtzYQqzWWWAqa5yHuUaE3nLGi5dCXcIn7/X+Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:00.127033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a05c48b9c7154369ef988ff5b6d93f7933e9d2d9fe57574a79c8603c967e4f38","sha256:2cdf031dd905fb11b0ca1a5d8f5b7ca00b731585724473a71c363c76957b14f0"],"state_sha256":"3607d2bb559a954ac14d0cee40af26e0f52727fb718ed353546a0787125ccb56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYVoWXvdRyCFsY2K0uli5umqmWfLhWPNaaTN0A1bsHL96sy647suc6f6QVuNXLaoAl+SP5Vgb0lfuvYTnQl/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:28:03.180258Z","bundle_sha256":"7ea6095019a26a3fca96642f5f830d190bf2e674feb89fc0fab56de6d7ecc984"}}