{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5OJIKXPYHLBY73PSO3DKZGOYNX","short_pith_number":"pith:5OJIKXPY","canonical_record":{"source":{"id":"1010.5846","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T03:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"b121eeb398df2257c940b65fa06e93037fe3382ace3768aed75ed607ad89f9d7","abstract_canon_sha256":"f65f4db672739beff0af89d2de0e3a60e9978b28796bc6030e8048f9dad567e8"},"schema_version":"1.0"},"canonical_sha256":"eb92855df83ac38fedf276c6ac99d86df190a67d4a5db3e5beb160ba55e44ed2","source":{"kind":"arxiv","id":"1010.5846","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5846","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5846v3","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5846","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"5OJIKXPYHLBY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5OJIKXPYHLBY73PS","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5OJIKXPY","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5OJIKXPYHLBY73PSO3DKZGOYNX","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5846","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T03:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"b121eeb398df2257c940b65fa06e93037fe3382ace3768aed75ed607ad89f9d7","abstract_canon_sha256":"f65f4db672739beff0af89d2de0e3a60e9978b28796bc6030e8048f9dad567e8"},"schema_version":"1.0"},"canonical_sha256":"eb92855df83ac38fedf276c6ac99d86df190a67d4a5db3e5beb160ba55e44ed2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:48.291770Z","signature_b64":"cbQkzHA1nIvdor7XfFenXK1e8BtIlQBhZgUC6HAq1/nANtdCGF044pqIQlIGjfCCDkfCVk4SKueLcd8JfaDvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb92855df83ac38fedf276c6ac99d86df190a67d4a5db3e5beb160ba55e44ed2","last_reissued_at":"2026-05-18T03:48:48.291135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:48.291135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5846","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-18T03:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YptAoRCRNCEo9VKYmut/3KrS1PJfvCl8zrNlr4+m54c7A+j9FzYzyRFAWuk/v1Y0sYZLS7bXi1lPn5ngw5hnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:38:37.703236Z"},"content_sha256":"448b66d1d00dca14c7473c8b314b47510d569eb13e646731d47538ecae6aa499","schema_version":"1.0","event_id":"sha256:448b66d1d00dca14c7473c8b314b47510d569eb13e646731d47538ecae6aa499"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5OJIKXPYHLBY73PSO3DKZGOYNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-lit trees for lit-only sigma-game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hau-wen Huang","submitted_at":"2010-10-28T03:23:21Z","abstract_excerpt":"A configuration of the lit-only $\\sigma$-game on a finite graph $\\Gamma$ is an assignment of one of two states, on or off, to all vertices of $\\Gamma.$ Given a configuration, a move of the lit-only $\\sigma$-game on $\\Gamma$ allows the player to choose an on vertex $s$ of $\\Gamma$ and change the states of all neighbors of $s.$ Given any integer $k$, we say that $\\Gamma$ is $k$-lit if, for any configuration, the number of on vertices can be reduced to at most $k$ by a finite sequence of moves. Assume that $\\Gamma$ is a tree with a perfect matching. We show that $\\Gamma$ is 1-lit and any tree obt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5846","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-18T03:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nl1Ts9aTHQhsyoR2LJSLHSTkplQF1gbVORs399ecje6kMKXy0XwKm/k3sbxUjEgF5LlToUbJjYQS0hb9hJXABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:38:37.703601Z"},"content_sha256":"288ae9c4c0e8f481e694cbbfed37c7559e3186bc3633cef76c4c970d2ca4f30e","schema_version":"1.0","event_id":"sha256:288ae9c4c0e8f481e694cbbfed37c7559e3186bc3633cef76c4c970d2ca4f30e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OJIKXPYHLBY73PSO3DKZGOYNX/bundle.json","state_url":"https://pith.science/pith/5OJIKXPYHLBY73PSO3DKZGOYNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OJIKXPYHLBY73PSO3DKZGOYNX/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-03T22:38:37Z","links":{"resolver":"https://pith.science/pith/5OJIKXPYHLBY73PSO3DKZGOYNX","bundle":"https://pith.science/pith/5OJIKXPYHLBY73PSO3DKZGOYNX/bundle.json","state":"https://pith.science/pith/5OJIKXPYHLBY73PSO3DKZGOYNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OJIKXPYHLBY73PSO3DKZGOYNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5OJIKXPYHLBY73PSO3DKZGOYNX","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":"f65f4db672739beff0af89d2de0e3a60e9978b28796bc6030e8048f9dad567e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T03:23:21Z","title_canon_sha256":"b121eeb398df2257c940b65fa06e93037fe3382ace3768aed75ed607ad89f9d7"},"schema_version":"1.0","source":{"id":"1010.5846","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5846","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5846v3","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5846","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"5OJIKXPYHLBY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5OJIKXPYHLBY73PS","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5OJIKXPY","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:288ae9c4c0e8f481e694cbbfed37c7559e3186bc3633cef76c4c970d2ca4f30e","target":"graph","created_at":"2026-05-18T03:48:48Z","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":"A configuration of the lit-only $\\sigma$-game on a finite graph $\\Gamma$ is an assignment of one of two states, on or off, to all vertices of $\\Gamma.$ Given a configuration, a move of the lit-only $\\sigma$-game on $\\Gamma$ allows the player to choose an on vertex $s$ of $\\Gamma$ and change the states of all neighbors of $s.$ Given any integer $k$, we say that $\\Gamma$ is $k$-lit if, for any configuration, the number of on vertices can be reduced to at most $k$ by a finite sequence of moves. Assume that $\\Gamma$ is a tree with a perfect matching. We show that $\\Gamma$ is 1-lit and any tree obt","authors_text":"Hau-wen Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T03:23:21Z","title":"Two-lit trees for lit-only sigma-game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5846","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:448b66d1d00dca14c7473c8b314b47510d569eb13e646731d47538ecae6aa499","target":"record","created_at":"2026-05-18T03:48:48Z","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":"f65f4db672739beff0af89d2de0e3a60e9978b28796bc6030e8048f9dad567e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-28T03:23:21Z","title_canon_sha256":"b121eeb398df2257c940b65fa06e93037fe3382ace3768aed75ed607ad89f9d7"},"schema_version":"1.0","source":{"id":"1010.5846","kind":"arxiv","version":3}},"canonical_sha256":"eb92855df83ac38fedf276c6ac99d86df190a67d4a5db3e5beb160ba55e44ed2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb92855df83ac38fedf276c6ac99d86df190a67d4a5db3e5beb160ba55e44ed2","first_computed_at":"2026-05-18T03:48:48.291135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:48.291135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cbQkzHA1nIvdor7XfFenXK1e8BtIlQBhZgUC6HAq1/nANtdCGF044pqIQlIGjfCCDkfCVk4SKueLcd8JfaDvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:48.291770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5846","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:448b66d1d00dca14c7473c8b314b47510d569eb13e646731d47538ecae6aa499","sha256:288ae9c4c0e8f481e694cbbfed37c7559e3186bc3633cef76c4c970d2ca4f30e"],"state_sha256":"794ae34e5a0bb567d85f4d6f0f5736ea221652411c974314deed9bf276a8a0d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LE28KW/eunPnxgr4OnQG+bMC1TUBZIGjrEhFOIM8aLRl2Vxa5qqOvdIAvIYGqsMGKXlbOdseWggfyHNBHTJkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:38:37.705531Z","bundle_sha256":"dc47b692a9b8449bb64723a378c9b08a7883f60a0f854b7bff917b95dc7cc9e8"}}