{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:55PW2N6SSRGKKUDMNP4RKKT7AQ","short_pith_number":"pith:55PW2N6S","canonical_record":{"source":{"id":"1603.01911","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T01:29:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"632d0884638346743f858fc52a2327ddada0cfaee27fdea27e4b50db6ec89301","abstract_canon_sha256":"657a70cd38af1a000a2dff00d397c6b44aea131a17de151463bfaee424020fac"},"schema_version":"1.0"},"canonical_sha256":"ef5f6d37d2944ca5506c6bf9152a7f043bc6d458500d33cb1850cf3301278e52","source":{"kind":"arxiv","id":"1603.01911","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01911","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01911v3","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01911","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"55PW2N6SSRGK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"55PW2N6SSRGKKUDM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"55PW2N6S","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:55PW2N6SSRGKKUDMNP4RKKT7AQ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01911","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T01:29:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"632d0884638346743f858fc52a2327ddada0cfaee27fdea27e4b50db6ec89301","abstract_canon_sha256":"657a70cd38af1a000a2dff00d397c6b44aea131a17de151463bfaee424020fac"},"schema_version":"1.0"},"canonical_sha256":"ef5f6d37d2944ca5506c6bf9152a7f043bc6d458500d33cb1850cf3301278e52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.865962Z","signature_b64":"IfU3pRWLFZZokjXlUKloZQ7+VsiruCadRASkjGVKwnscEQIGtat4SdVnBth7CHQ1cDQUkliRwtIMOJb2ZCv0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef5f6d37d2944ca5506c6bf9152a7f043bc6d458500d33cb1850cf3301278e52","last_reissued_at":"2026-05-18T00:49:06.865369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.865369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01911","source_version":3,"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-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxugCDDOjUosW8VjSE115AhSQztM8nHsBf1hQpbktbBwByDnPUuNNagGf4pc0t3zazxsKEtYAMtCCAtGh7wRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:26:17.721876Z"},"content_sha256":"a5fcf12cddccd03cb52ff4dc79e755479bca002359b2f79f1f802dc00119af79","schema_version":"1.0","event_id":"sha256:a5fcf12cddccd03cb52ff4dc79e755479bca002359b2f79f1f802dc00119af79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:55PW2N6SSRGKKUDMNP4RKKT7AQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hanabi is NP-hard, Even for Cheaters who Look at Their Cards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Andr\\'e van Renssen, Jean-Francois Baffier, Man-Kwun Chiu, Marcel Roeloffzen, Matias Korman, Valia Mitsou, Yago Diez, Yushi Uno","submitted_at":"2016-03-07T01:29:25Z","abstract_excerpt":"In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among $c$ colors and a number between $1$ and $n$. The aim is to make, for each color, a pile of cards of that color with all increasing numbers from $1$ to $n$. At each time during the game, each player holds $h$ cards in hand. Cards are drawn sequentially from a deck and the players should decide whether to play, discard or store them for future use. One of the features of the game is that the players can see their partners' cards but not thei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01911","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"},"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-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yd5F6U3oU4Ph9XfBBSNm0alHh84jNBt0TDMSdp23SXWjG1CrdM927LDBl8zNV21N8HSz4tjr/Hh/N31Gg0/LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:26:17.722601Z"},"content_sha256":"c68d5229d10a310bbf2ff0241b37cbf7e9e69ae6c61886e19d4e58b95357eca0","schema_version":"1.0","event_id":"sha256:c68d5229d10a310bbf2ff0241b37cbf7e9e69ae6c61886e19d4e58b95357eca0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55PW2N6SSRGKKUDMNP4RKKT7AQ/bundle.json","state_url":"https://pith.science/pith/55PW2N6SSRGKKUDMNP4RKKT7AQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55PW2N6SSRGKKUDMNP4RKKT7AQ/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-23T22:26:17Z","links":{"resolver":"https://pith.science/pith/55PW2N6SSRGKKUDMNP4RKKT7AQ","bundle":"https://pith.science/pith/55PW2N6SSRGKKUDMNP4RKKT7AQ/bundle.json","state":"https://pith.science/pith/55PW2N6SSRGKKUDMNP4RKKT7AQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55PW2N6SSRGKKUDMNP4RKKT7AQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:55PW2N6SSRGKKUDMNP4RKKT7AQ","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":"657a70cd38af1a000a2dff00d397c6b44aea131a17de151463bfaee424020fac","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T01:29:25Z","title_canon_sha256":"632d0884638346743f858fc52a2327ddada0cfaee27fdea27e4b50db6ec89301"},"schema_version":"1.0","source":{"id":"1603.01911","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01911","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01911v3","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01911","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"55PW2N6SSRGK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"55PW2N6SSRGKKUDM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"55PW2N6S","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:c68d5229d10a310bbf2ff0241b37cbf7e9e69ae6c61886e19d4e58b95357eca0","target":"graph","created_at":"2026-05-18T00:49:06Z","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":"In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among $c$ colors and a number between $1$ and $n$. The aim is to make, for each color, a pile of cards of that color with all increasing numbers from $1$ to $n$. At each time during the game, each player holds $h$ cards in hand. Cards are drawn sequentially from a deck and the players should decide whether to play, discard or store them for future use. One of the features of the game is that the players can see their partners' cards but not thei","authors_text":"Andr\\'e van Renssen, Jean-Francois Baffier, Man-Kwun Chiu, Marcel Roeloffzen, Matias Korman, Valia Mitsou, Yago Diez, Yushi Uno","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T01:29:25Z","title":"Hanabi is NP-hard, Even for Cheaters who Look at Their Cards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01911","kind":"arxiv","version":3},"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:a5fcf12cddccd03cb52ff4dc79e755479bca002359b2f79f1f802dc00119af79","target":"record","created_at":"2026-05-18T00:49:06Z","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":"657a70cd38af1a000a2dff00d397c6b44aea131a17de151463bfaee424020fac","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T01:29:25Z","title_canon_sha256":"632d0884638346743f858fc52a2327ddada0cfaee27fdea27e4b50db6ec89301"},"schema_version":"1.0","source":{"id":"1603.01911","kind":"arxiv","version":3}},"canonical_sha256":"ef5f6d37d2944ca5506c6bf9152a7f043bc6d458500d33cb1850cf3301278e52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef5f6d37d2944ca5506c6bf9152a7f043bc6d458500d33cb1850cf3301278e52","first_computed_at":"2026-05-18T00:49:06.865369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:06.865369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IfU3pRWLFZZokjXlUKloZQ7+VsiruCadRASkjGVKwnscEQIGtat4SdVnBth7CHQ1cDQUkliRwtIMOJb2ZCv0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:06.865962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01911","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5fcf12cddccd03cb52ff4dc79e755479bca002359b2f79f1f802dc00119af79","sha256:c68d5229d10a310bbf2ff0241b37cbf7e9e69ae6c61886e19d4e58b95357eca0"],"state_sha256":"4992e9737f4e813de6e1c77966026a288160bf0e6d9865ceb39aff411e8eb999"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CIkXDPvrdsBeGl0Jqc+TZiMz1GC3VRX7WN1pQhiG11ZZF2Vr1a3t6LIt9qvDRCJKcAZ7B9ro+YpHRzagO8lAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:26:17.726296Z","bundle_sha256":"4a483bdc9160cc5f4b3d73816c02b1f80f23c8d9a6147700a7245b5b1abb2be7"}}