{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HURRXKMIZRNQJLNTUWNRLBWJGC","short_pith_number":"pith:HURRXKMI","canonical_record":{"source":{"id":"1901.09180","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-26T09:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"f86d77c14ad284b243f7efac50f63475ecebeeebc4cb2810259c4e83c28dbe52","abstract_canon_sha256":"ceb0ac66d65c1add5bd26b84eae50f3a532649adeddddebc1ddd769631006a48"},"schema_version":"1.0"},"canonical_sha256":"3d231ba988cc5b04adb3a59b1586c93080a4f3c5fb8981af29ff5cd5cd33c993","source":{"kind":"arxiv","id":"1901.09180","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09180","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09180v2","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09180","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"HURRXKMIZRNQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HURRXKMIZRNQJLNT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HURRXKMI","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HURRXKMIZRNQJLNTUWNRLBWJGC","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09180","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-26T09:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"f86d77c14ad284b243f7efac50f63475ecebeeebc4cb2810259c4e83c28dbe52","abstract_canon_sha256":"ceb0ac66d65c1add5bd26b84eae50f3a532649adeddddebc1ddd769631006a48"},"schema_version":"1.0"},"canonical_sha256":"3d231ba988cc5b04adb3a59b1586c93080a4f3c5fb8981af29ff5cd5cd33c993","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:41.086616Z","signature_b64":"DmzZPKr/hWu5vQEDDgKX4MVo+hXDeF+v3IZWPr/oip6dKwqp5P/Q3rKpdHHZPX7BFjfQBzYRD4NYa+UKDXaoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d231ba988cc5b04adb3a59b1586c93080a4f3c5fb8981af29ff5cd5cd33c993","last_reissued_at":"2026-05-17T23:53:41.086207Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:41.086207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09180","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:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IS2hT1QfTv6fK3cultLru32PIxnMsgtE9jETa4TDwkE/CdWmV1jmHPibYLtMsPkU8IhmU5+aYxCQBJpC2322BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:20:56.608688Z"},"content_sha256":"ba771271544b0c4616058fe2d6f7a1b86a5cf9c90f2f02e68c014888ac51f575","schema_version":"1.0","event_id":"sha256:ba771271544b0c4616058fe2d6f7a1b86a5cf9c90f2f02e68c014888ac51f575"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HURRXKMIZRNQJLNTUWNRLBWJGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Credulous Acceptability, Poison Games and Modal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Davide Grossi, Simon Rey","submitted_at":"2019-01-26T09:04:01Z","abstract_excerpt":"The Poison Game is a two-player game played on a graph in which one player can influence which edges the other player is able to traverse. It operationalizes the notion of existence of credulously admissible sets in an argumentation framework or, in graph-theoretic terminology, the existence of non-trivial semi-kernels. We develop a modal logic (poison modal logic, PML) tailored to represent winning positions in such a game, thereby identifying the precise modal reasoning that underlies the notion of credulous admissibility in argumentation. We study model-theoretic and decidability properties"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09180","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:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A56aO5GOgyY3Pqhb9xhNNLpXaah16xaOCifgbi7VIs8gooO/5AjMDx1qkTd3s0u3/VK7yu2AKW3m0FNIv+HDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:20:56.609335Z"},"content_sha256":"e435c62e5c4b1480c82a6e8f24a11ab1683fd5793e2a77127ccee5f5b95a069c","schema_version":"1.0","event_id":"sha256:e435c62e5c4b1480c82a6e8f24a11ab1683fd5793e2a77127ccee5f5b95a069c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HURRXKMIZRNQJLNTUWNRLBWJGC/bundle.json","state_url":"https://pith.science/pith/HURRXKMIZRNQJLNTUWNRLBWJGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HURRXKMIZRNQJLNTUWNRLBWJGC/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-05-28T10:20:56Z","links":{"resolver":"https://pith.science/pith/HURRXKMIZRNQJLNTUWNRLBWJGC","bundle":"https://pith.science/pith/HURRXKMIZRNQJLNTUWNRLBWJGC/bundle.json","state":"https://pith.science/pith/HURRXKMIZRNQJLNTUWNRLBWJGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HURRXKMIZRNQJLNTUWNRLBWJGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HURRXKMIZRNQJLNTUWNRLBWJGC","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":"ceb0ac66d65c1add5bd26b84eae50f3a532649adeddddebc1ddd769631006a48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-26T09:04:01Z","title_canon_sha256":"f86d77c14ad284b243f7efac50f63475ecebeeebc4cb2810259c4e83c28dbe52"},"schema_version":"1.0","source":{"id":"1901.09180","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09180","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09180v2","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09180","created_at":"2026-05-17T23:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"HURRXKMIZRNQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HURRXKMIZRNQJLNT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HURRXKMI","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:e435c62e5c4b1480c82a6e8f24a11ab1683fd5793e2a77127ccee5f5b95a069c","target":"graph","created_at":"2026-05-17T23:53:41Z","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 Poison Game is a two-player game played on a graph in which one player can influence which edges the other player is able to traverse. It operationalizes the notion of existence of credulously admissible sets in an argumentation framework or, in graph-theoretic terminology, the existence of non-trivial semi-kernels. We develop a modal logic (poison modal logic, PML) tailored to represent winning positions in such a game, thereby identifying the precise modal reasoning that underlies the notion of credulous admissibility in argumentation. We study model-theoretic and decidability properties","authors_text":"Davide Grossi, Simon Rey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-26T09:04:01Z","title":"Credulous Acceptability, Poison Games and Modal Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09180","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:ba771271544b0c4616058fe2d6f7a1b86a5cf9c90f2f02e68c014888ac51f575","target":"record","created_at":"2026-05-17T23:53:41Z","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":"ceb0ac66d65c1add5bd26b84eae50f3a532649adeddddebc1ddd769631006a48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-26T09:04:01Z","title_canon_sha256":"f86d77c14ad284b243f7efac50f63475ecebeeebc4cb2810259c4e83c28dbe52"},"schema_version":"1.0","source":{"id":"1901.09180","kind":"arxiv","version":2}},"canonical_sha256":"3d231ba988cc5b04adb3a59b1586c93080a4f3c5fb8981af29ff5cd5cd33c993","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d231ba988cc5b04adb3a59b1586c93080a4f3c5fb8981af29ff5cd5cd33c993","first_computed_at":"2026-05-17T23:53:41.086207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:41.086207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DmzZPKr/hWu5vQEDDgKX4MVo+hXDeF+v3IZWPr/oip6dKwqp5P/Q3rKpdHHZPX7BFjfQBzYRD4NYa+UKDXaoAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:41.086616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09180","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba771271544b0c4616058fe2d6f7a1b86a5cf9c90f2f02e68c014888ac51f575","sha256:e435c62e5c4b1480c82a6e8f24a11ab1683fd5793e2a77127ccee5f5b95a069c"],"state_sha256":"9839918bac8e48a185e797502453ce1b49f1cbc8acd2deee41d6d8aad51017c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2vbNn8WSzWRDwsF41jvkzcGVte9wNynmmAhKX8oFDkEk3/Py3ykSO28Z6fhXXJF6ujKlZytKPNZh2CEjfHxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:20:56.612716Z","bundle_sha256":"2e9e0e4e98f0a865c5b9aa2d98ef9f3d86bf43f574fa1649e0477a0652f86a93"}}