{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DWBKWL23M4PSI2QYB46AXOZCOI","short_pith_number":"pith:DWBKWL23","schema_version":"1.0","canonical_sha256":"1d82ab2f5b671f246a180f3c0bbb22720d00120bfffd98b8592027e5961eb375","source":{"kind":"arxiv","id":"1412.2034","version":2},"attestation_state":"computed","paper":{"title":"Game Brush Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pawel Pralat, William B. Kinnersley","submitted_at":"2014-12-05T15:41:24Z","abstract_excerpt":"We study a two-person game based on the well-studied brushing process on graphs. Players Min and Max alternately place brushes on the vertices of a graph. When a vertex accumulates at least as many brushes as its degree, it sends one brush to each neighbor and is removed from the graph; this may in turn induce the removal of other vertices. The game ends once all vertices have been removed. Min seeks to minimize the number of brushes played during the game, while Max seeks to maximize it. When both players play optimally, the length of the game is the game brush number of the graph $G$, denote"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.2034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-05T15:41:24Z","cross_cats_sorted":[],"title_canon_sha256":"6ffc7781abec903748edb1ae9ca4c94d824e2c9dbfc9d88fa385dc708a662a7b","abstract_canon_sha256":"e474af3b600a101b1083b0b7f6b0a150b0a981467b29a58496397dca48277c86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:49.290853Z","signature_b64":"53leBriJRjq84qi7wuRYH3Tv+G40Q5WqwS4ArdnPysjFBzpXllSKeA+RHVHaQXFDrmMNdOHDh/PkRq8wf5rhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d82ab2f5b671f246a180f3c0bbb22720d00120bfffd98b8592027e5961eb375","last_reissued_at":"2026-05-18T01:21:49.290306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:49.290306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game Brush Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pawel Pralat, William B. Kinnersley","submitted_at":"2014-12-05T15:41:24Z","abstract_excerpt":"We study a two-person game based on the well-studied brushing process on graphs. Players Min and Max alternately place brushes on the vertices of a graph. When a vertex accumulates at least as many brushes as its degree, it sends one brush to each neighbor and is removed from the graph; this may in turn induce the removal of other vertices. The game ends once all vertices have been removed. Min seeks to minimize the number of brushes played during the game, while Max seeks to maximize it. When both players play optimally, the length of the game is the game brush number of the graph $G$, denote"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2034","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.2034","created_at":"2026-05-18T01:21:49.290399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2034v2","created_at":"2026-05-18T01:21:49.290399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2034","created_at":"2026-05-18T01:21:49.290399+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWBKWL23M4PS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWBKWL23M4PSI2QY","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWBKWL23","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI","json":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI.json","graph_json":"https://pith.science/api/pith-number/DWBKWL23M4PSI2QYB46AXOZCOI/graph.json","events_json":"https://pith.science/api/pith-number/DWBKWL23M4PSI2QYB46AXOZCOI/events.json","paper":"https://pith.science/paper/DWBKWL23"},"agent_actions":{"view_html":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI","download_json":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI.json","view_paper":"https://pith.science/paper/DWBKWL23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2034&json=true","fetch_graph":"https://pith.science/api/pith-number/DWBKWL23M4PSI2QYB46AXOZCOI/graph.json","fetch_events":"https://pith.science/api/pith-number/DWBKWL23M4PSI2QYB46AXOZCOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI/action/storage_attestation","attest_author":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI/action/author_attestation","sign_citation":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI/action/citation_signature","submit_replication":"https://pith.science/pith/DWBKWL23M4PSI2QYB46AXOZCOI/action/replication_record"}},"created_at":"2026-05-18T01:21:49.290399+00:00","updated_at":"2026-05-18T01:21:49.290399+00:00"}