{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:REXHK3IZTE7G45TGUAY62ZEHLC","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":"bd03a0062622b6b376cdd0571a4f0f2c67b325606fa2c58497d316989c19b61a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-14T02:02:35Z","title_canon_sha256":"a4639e75edf62db75015f51a597fc97380953c31782355d3f91fb20df5ef40d7"},"schema_version":"1.0","source":{"id":"1202.2910","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2910","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2910v2","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2910","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"REXHK3IZTE7G","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"REXHK3IZTE7G45TG","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"REXHK3IZ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:327d56844b2e3d9baacc7bf145df3669e29d5b0cece94c57f03e2f97fdaa8636","target":"graph","created_at":"2026-05-18T01:35:53Z","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 study a game on a graph $G$ played by $r$ {\\it revolutionaries} and $s$ {\\it spies}. Initially, revolutionaries and then spies occupy vertices. In each subsequent round, each revolutionary may move to a neighboring vertex or not move, and then each spy has the same option. The revolutionaries win if $m$ of them meet at some vertex having no spy (at the end of a round); the spies win if they can avoid this forever.\n  Let $\\sigma(G,m,r)$ denote the minimum number of spies needed to win. To avoid degenerate cases, assume $|V(G)|\\ge r-m+1\\ge\\floor{r/m}\\ge 1$. The easy bounds are then $\\floor{r/","authors_text":"Daniel W. Cranston, Douglas B. West, Gregory J. Puleo, Jane V. Butterfield, Reza Zamani","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-14T02:02:35Z","title":"Revolutionaries and spies: Spy-good and spy-bad graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2910","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:576caa1570d9752f0c2f4da12c42192d7ef1c81318eddc67b91471de9e293990","target":"record","created_at":"2026-05-18T01:35:53Z","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":"bd03a0062622b6b376cdd0571a4f0f2c67b325606fa2c58497d316989c19b61a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-14T02:02:35Z","title_canon_sha256":"a4639e75edf62db75015f51a597fc97380953c31782355d3f91fb20df5ef40d7"},"schema_version":"1.0","source":{"id":"1202.2910","kind":"arxiv","version":2}},"canonical_sha256":"892e756d19993e6e7666a031ed648758adb5c38950d2ae99a67bbf89fd15fab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"892e756d19993e6e7666a031ed648758adb5c38950d2ae99a67bbf89fd15fab8","first_computed_at":"2026-05-18T01:35:53.069857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:53.069857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ENFX/0F7mtLpcHPBXMnp39FCnq6oIFwxZoyXxUQAm+iLI4h6ARw+0UAkSYWEEUQlUKK3ZiDhY2ekzn9oSeJUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:53.070545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2910","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:576caa1570d9752f0c2f4da12c42192d7ef1c81318eddc67b91471de9e293990","sha256:327d56844b2e3d9baacc7bf145df3669e29d5b0cece94c57f03e2f97fdaa8636"],"state_sha256":"c0cb86547ec5e465f3f45e1dbdba10baf6ddf69b59425e9b74b85623a4284412"}