{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4KW7ABML2L4JE7GLMQ3XRVTPHK","short_pith_number":"pith:4KW7ABML","canonical_record":{"source":{"id":"1101.5876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T08:42:14Z","cross_cats_sorted":[],"title_canon_sha256":"68db243c27aec08d1f4afd676732565b775e5a777fe93788f23deaf258747a51","abstract_canon_sha256":"652376298cbbddde26580890cded232a407fb9ad3239325e1ab78a319e479236"},"schema_version":"1.0"},"canonical_sha256":"e2adf0058bd2f8927ccb643778d66f3aae5124825792e6fb85b4307ee5202dd8","source":{"kind":"arxiv","id":"1101.5876","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5876","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5876v3","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5876","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"4KW7ABML2L4J","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4KW7ABML2L4JE7GL","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4KW7ABML","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4KW7ABML2L4JE7GLMQ3XRVTPHK","target":"record","payload":{"canonical_record":{"source":{"id":"1101.5876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T08:42:14Z","cross_cats_sorted":[],"title_canon_sha256":"68db243c27aec08d1f4afd676732565b775e5a777fe93788f23deaf258747a51","abstract_canon_sha256":"652376298cbbddde26580890cded232a407fb9ad3239325e1ab78a319e479236"},"schema_version":"1.0"},"canonical_sha256":"e2adf0058bd2f8927ccb643778d66f3aae5124825792e6fb85b4307ee5202dd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.861418Z","signature_b64":"lUFQk/tv5llHm91CEIqecA0iUxaEbGK4erqm7ONZUeTEDsQd1tS3x1QPX1BPygfrxigMbkVoiOcwgilZRkl8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2adf0058bd2f8927ccb643778d66f3aae5124825792e6fb85b4307ee5202dd8","last_reissued_at":"2026-05-18T02:22:41.860931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.860931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.5876","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-18T02:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZR3/C7PlQKYTO6dg06F3WTExNTU56xxsXwQ5d/m86GA/tUTXj2n3dIBO6lBAQuENONiTXntxFU1F8EtQfhSnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:46:58.017150Z"},"content_sha256":"470d8ba886f2307494814afc97e8ff77a5b8109d4e716b7b8bc99160620f77fd","schema_version":"1.0","event_id":"sha256:470d8ba886f2307494814afc97e8ff77a5b8109d4e716b7b8bc99160620f77fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4KW7ABML2L4JE7GLMQ3XRVTPHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of flood-filling games on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Scott, Kitty Meeks","submitted_at":"2011-01-31T08:42:14Z","abstract_excerpt":"We consider the complexity of problems related to the combinatorial game Free-Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. Although computing the minimum number of moves required to flood an arbitrary graph is known to be NP-hard, we demonstrate a polynomial time algorithm to compute the minimum number of moves required to link each pair of vertices. We apply this result to compute in polynomial time the minimum number of moves required to flood a path, and an additive approximation to this quantity for an arbitr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5876","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-18T02:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jhbrkCudtiigmsCZVzWWn5JVvoE/79Hn4y6/2YigIGKE2eY3WEhZhdmi4Zy9Va8jAYkgt+6ae+M0o/Yb2gbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:46:58.017836Z"},"content_sha256":"2da812e65f7460d789efc37690bc47b1d153240a20bfbee9228058fc6e7897c4","schema_version":"1.0","event_id":"sha256:2da812e65f7460d789efc37690bc47b1d153240a20bfbee9228058fc6e7897c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KW7ABML2L4JE7GLMQ3XRVTPHK/bundle.json","state_url":"https://pith.science/pith/4KW7ABML2L4JE7GLMQ3XRVTPHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KW7ABML2L4JE7GLMQ3XRVTPHK/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-09T22:46:58Z","links":{"resolver":"https://pith.science/pith/4KW7ABML2L4JE7GLMQ3XRVTPHK","bundle":"https://pith.science/pith/4KW7ABML2L4JE7GLMQ3XRVTPHK/bundle.json","state":"https://pith.science/pith/4KW7ABML2L4JE7GLMQ3XRVTPHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KW7ABML2L4JE7GLMQ3XRVTPHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4KW7ABML2L4JE7GLMQ3XRVTPHK","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":"652376298cbbddde26580890cded232a407fb9ad3239325e1ab78a319e479236","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T08:42:14Z","title_canon_sha256":"68db243c27aec08d1f4afd676732565b775e5a777fe93788f23deaf258747a51"},"schema_version":"1.0","source":{"id":"1101.5876","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5876","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5876v3","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5876","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"4KW7ABML2L4J","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4KW7ABML2L4JE7GL","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4KW7ABML","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:2da812e65f7460d789efc37690bc47b1d153240a20bfbee9228058fc6e7897c4","target":"graph","created_at":"2026-05-18T02:22: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":"We consider the complexity of problems related to the combinatorial game Free-Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. Although computing the minimum number of moves required to flood an arbitrary graph is known to be NP-hard, we demonstrate a polynomial time algorithm to compute the minimum number of moves required to link each pair of vertices. We apply this result to compute in polynomial time the minimum number of moves required to flood a path, and an additive approximation to this quantity for an arbitr","authors_text":"Alexander Scott, Kitty Meeks","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T08:42:14Z","title":"The complexity of flood-filling games on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5876","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:470d8ba886f2307494814afc97e8ff77a5b8109d4e716b7b8bc99160620f77fd","target":"record","created_at":"2026-05-18T02:22: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":"652376298cbbddde26580890cded232a407fb9ad3239325e1ab78a319e479236","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T08:42:14Z","title_canon_sha256":"68db243c27aec08d1f4afd676732565b775e5a777fe93788f23deaf258747a51"},"schema_version":"1.0","source":{"id":"1101.5876","kind":"arxiv","version":3}},"canonical_sha256":"e2adf0058bd2f8927ccb643778d66f3aae5124825792e6fb85b4307ee5202dd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2adf0058bd2f8927ccb643778d66f3aae5124825792e6fb85b4307ee5202dd8","first_computed_at":"2026-05-18T02:22:41.860931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:41.860931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lUFQk/tv5llHm91CEIqecA0iUxaEbGK4erqm7ONZUeTEDsQd1tS3x1QPX1BPygfrxigMbkVoiOcwgilZRkl8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:41.861418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5876","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:470d8ba886f2307494814afc97e8ff77a5b8109d4e716b7b8bc99160620f77fd","sha256:2da812e65f7460d789efc37690bc47b1d153240a20bfbee9228058fc6e7897c4"],"state_sha256":"7e7a8f5b0dc4b0332972571f89335217392e55d4219052d9c7c1cde89b1c2f0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHiW7IkJecVTk/pfMfYGKBB03Unhs8HC1G/uItS6sIgfRYD6V+mbdP879WFk9L4wSKNCXoyJznUxzv1Pt3hKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:46:58.021563Z","bundle_sha256":"0db21cb1250bd4241e3cfdd8f537e12a7979288d53fcdd44ebb1f9cb63eeff77"}}