{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CTTBZUKURLAI4SB2XHGLHAUAFF","short_pith_number":"pith:CTTBZUKU","schema_version":"1.0","canonical_sha256":"14e61cd1548ac08e483ab9ccb38280294f0b1cf5e91681ad455c04439ba28afc","source":{"kind":"arxiv","id":"0904.3050","version":1},"attestation_state":"computed","paper":{"title":"Difference between minimum light numbers of sigma-game and lit-only sigma-game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinmao Wang, Yaokun Wu","submitted_at":"2009-04-20T14:54:20Z","abstract_excerpt":"A configuration of a graph is an assignment of one of two states, on or off, to each vertex of it. A regular move at a vertex changes the states of the neighbors of that vertex. A valid move is a regular move at an on vertex. The following result is proved in this note: given any starting configuration $x$ of a tree, if there is a sequence of regular moves which brings $x$ to another configuration in which there are $\\ell$ on vertices then there must exist a sequence of valid moves which takes $x$ to a configuration with at most $\\ell +2$ on vertices. We provide example to show that the upper "},"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":"0904.3050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-04-20T14:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"89687fd51ba843ac98ccad91a2fe1cb4b4a773bf9bff8629365bdc47e901350c","abstract_canon_sha256":"3352e606ce0c8e5341ad22f136d933feb5f79e8c8dd3fd9adef7a34448a7a02b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:28.408485Z","signature_b64":"KikDkQ/9DFw97qMyb1bD1NvdTI8RNXpnmREC3VlIX1pruALHzfS3pLxD8Ou/7Z36YWUj+OmHOADpo+UjmmawAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14e61cd1548ac08e483ab9ccb38280294f0b1cf5e91681ad455c04439ba28afc","last_reissued_at":"2026-05-18T04:28:28.407962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:28.407962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Difference between minimum light numbers of sigma-game and lit-only sigma-game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinmao Wang, Yaokun Wu","submitted_at":"2009-04-20T14:54:20Z","abstract_excerpt":"A configuration of a graph is an assignment of one of two states, on or off, to each vertex of it. A regular move at a vertex changes the states of the neighbors of that vertex. A valid move is a regular move at an on vertex. The following result is proved in this note: given any starting configuration $x$ of a tree, if there is a sequence of regular moves which brings $x$ to another configuration in which there are $\\ell$ on vertices then there must exist a sequence of valid moves which takes $x$ to a configuration with at most $\\ell +2$ on vertices. We provide example to show that the upper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3050","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0904.3050","created_at":"2026-05-18T04:28:28.408034+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.3050v1","created_at":"2026-05-18T04:28:28.408034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3050","created_at":"2026-05-18T04:28:28.408034+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTTBZUKURLAI","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTTBZUKURLAI4SB2","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTTBZUKU","created_at":"2026-05-18T12:25:59.703012+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/CTTBZUKURLAI4SB2XHGLHAUAFF","json":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF.json","graph_json":"https://pith.science/api/pith-number/CTTBZUKURLAI4SB2XHGLHAUAFF/graph.json","events_json":"https://pith.science/api/pith-number/CTTBZUKURLAI4SB2XHGLHAUAFF/events.json","paper":"https://pith.science/paper/CTTBZUKU"},"agent_actions":{"view_html":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF","download_json":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF.json","view_paper":"https://pith.science/paper/CTTBZUKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.3050&json=true","fetch_graph":"https://pith.science/api/pith-number/CTTBZUKURLAI4SB2XHGLHAUAFF/graph.json","fetch_events":"https://pith.science/api/pith-number/CTTBZUKURLAI4SB2XHGLHAUAFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF/action/storage_attestation","attest_author":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF/action/author_attestation","sign_citation":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF/action/citation_signature","submit_replication":"https://pith.science/pith/CTTBZUKURLAI4SB2XHGLHAUAFF/action/replication_record"}},"created_at":"2026-05-18T04:28:28.408034+00:00","updated_at":"2026-05-18T04:28:28.408034+00:00"}