{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZAXX7Y5OE7QDDCNHGQK43JJPPA","short_pith_number":"pith:ZAXX7Y5O","canonical_record":{"source":{"id":"1102.3025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-15T10:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"9272715e284f3e2cd64377bc3e2d07e626c8263573d1f7a205536d58f51a106b","abstract_canon_sha256":"ff786aa41450a1cffbb25f1c63587c371704a064f4b161044197f2f60bbdbdb9"},"schema_version":"1.0"},"canonical_sha256":"c82f7fe3ae27e03189a73415cda52f783adc854c99d5d8ecf4af2c5354095fd5","source":{"kind":"arxiv","id":"1102.3025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3025","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3025v1","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3025","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZAXX7Y5OE7QD","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZAXX7Y5OE7QDDCNH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZAXX7Y5O","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZAXX7Y5OE7QDDCNHGQK43JJPPA","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-15T10:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"9272715e284f3e2cd64377bc3e2d07e626c8263573d1f7a205536d58f51a106b","abstract_canon_sha256":"ff786aa41450a1cffbb25f1c63587c371704a064f4b161044197f2f60bbdbdb9"},"schema_version":"1.0"},"canonical_sha256":"c82f7fe3ae27e03189a73415cda52f783adc854c99d5d8ecf4af2c5354095fd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:38.514850Z","signature_b64":"6288psXfkchVLV3A3KLu9qbEIBiO4UgWFws2e5CCVDxkLHeUaiogfTdps4qJSM7KCJGJItbLMeIIyt8Hb+J0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c82f7fe3ae27e03189a73415cda52f783adc854c99d5d8ecf4af2c5354095fd5","last_reissued_at":"2026-05-18T04:28:38.514458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:38.514458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3025","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-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qS6xLPMFkfK/iaO9MctYbLLAYhkpY4gZriiyFU0oAaLqN/dtlfS66EmG+jiSil1/fR97rJil/S9ZUUGUsftDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:02:45.345979Z"},"content_sha256":"fe032015e3dd27df0fa5577a4354f2692d236f7d349fd95f6ab29b73e9bd0487","schema_version":"1.0","event_id":"sha256:fe032015e3dd27df0fa5577a4354f2692d236f7d349fd95f6ab29b73e9bd0487"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZAXX7Y5OE7QDDCNHGQK43JJPPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithmic Analysis of the Honey-Bee Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gerhard J. Woeginger, Rudolf Fleischer","submitted_at":"2011-02-15T10:22:18Z","abstract_excerpt":"The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid or (in a generalized setting) on a connected graph with colored nodes. In a single move, a player calls a color and thereby conquers all the nodes of that color that are adjacent to his own current territory. Both players want to conquer the majority of the nodes. We show that winning the game is PSPACE-hard in general, NP-hard on series-parallel graphs, but easy on outerplanar graphs.\n  In the solitaire version, the goal of the single player is to conquer the entire graph with the minimum number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3025","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-18T04:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XE0jN+gzYMeWI1w4ID2zDRvDKCh6RNmRE81nNLggNZyyOs+RTDxmKYaYEOve99Okznz6GnPbdskGxSnUDDTxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:02:45.346338Z"},"content_sha256":"dcd8eaca6e18970cb98b5598a5be7a418f173db67493a880e09ffc1d7c4057f6","schema_version":"1.0","event_id":"sha256:dcd8eaca6e18970cb98b5598a5be7a418f173db67493a880e09ffc1d7c4057f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAXX7Y5OE7QDDCNHGQK43JJPPA/bundle.json","state_url":"https://pith.science/pith/ZAXX7Y5OE7QDDCNHGQK43JJPPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAXX7Y5OE7QDDCNHGQK43JJPPA/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-25T12:02:45Z","links":{"resolver":"https://pith.science/pith/ZAXX7Y5OE7QDDCNHGQK43JJPPA","bundle":"https://pith.science/pith/ZAXX7Y5OE7QDDCNHGQK43JJPPA/bundle.json","state":"https://pith.science/pith/ZAXX7Y5OE7QDDCNHGQK43JJPPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAXX7Y5OE7QDDCNHGQK43JJPPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZAXX7Y5OE7QDDCNHGQK43JJPPA","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":"ff786aa41450a1cffbb25f1c63587c371704a064f4b161044197f2f60bbdbdb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-15T10:22:18Z","title_canon_sha256":"9272715e284f3e2cd64377bc3e2d07e626c8263573d1f7a205536d58f51a106b"},"schema_version":"1.0","source":{"id":"1102.3025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3025","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3025v1","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3025","created_at":"2026-05-18T04:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZAXX7Y5OE7QD","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZAXX7Y5OE7QDDCNH","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZAXX7Y5O","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:dcd8eaca6e18970cb98b5598a5be7a418f173db67493a880e09ffc1d7c4057f6","target":"graph","created_at":"2026-05-18T04:28:38Z","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 Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid or (in a generalized setting) on a connected graph with colored nodes. In a single move, a player calls a color and thereby conquers all the nodes of that color that are adjacent to his own current territory. Both players want to conquer the majority of the nodes. We show that winning the game is PSPACE-hard in general, NP-hard on series-parallel graphs, but easy on outerplanar graphs.\n  In the solitaire version, the goal of the single player is to conquer the entire graph with the minimum number","authors_text":"Gerhard J. Woeginger, Rudolf Fleischer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-15T10:22:18Z","title":"An Algorithmic Analysis of the Honey-Bee Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3025","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:fe032015e3dd27df0fa5577a4354f2692d236f7d349fd95f6ab29b73e9bd0487","target":"record","created_at":"2026-05-18T04:28:38Z","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":"ff786aa41450a1cffbb25f1c63587c371704a064f4b161044197f2f60bbdbdb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-15T10:22:18Z","title_canon_sha256":"9272715e284f3e2cd64377bc3e2d07e626c8263573d1f7a205536d58f51a106b"},"schema_version":"1.0","source":{"id":"1102.3025","kind":"arxiv","version":1}},"canonical_sha256":"c82f7fe3ae27e03189a73415cda52f783adc854c99d5d8ecf4af2c5354095fd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c82f7fe3ae27e03189a73415cda52f783adc854c99d5d8ecf4af2c5354095fd5","first_computed_at":"2026-05-18T04:28:38.514458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:38.514458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6288psXfkchVLV3A3KLu9qbEIBiO4UgWFws2e5CCVDxkLHeUaiogfTdps4qJSM7KCJGJItbLMeIIyt8Hb+J0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:38.514850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe032015e3dd27df0fa5577a4354f2692d236f7d349fd95f6ab29b73e9bd0487","sha256:dcd8eaca6e18970cb98b5598a5be7a418f173db67493a880e09ffc1d7c4057f6"],"state_sha256":"adb01cd589c8d6ea5e4dd5260251fc2f076110eb475827bbfbd4b5087439dd15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tM/ukCxob0sNTZxjOj82XBLud6DfyudQbMr5N6Pap9pyv2JQBFVLTYxgPKY7i8CQt99D+PQ1JIohrnP/+GkXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:02:45.348359Z","bundle_sha256":"b22b5e1a53dca3cf475966e11f42dabdf9134859b6cf2b3f626d16b4ca557169"}}