{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CMACLBVRMYBTDO63PVJFHWCM7Q","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":"116773ed56ba358f14f80f58fb7d6df5aa3bc82d4f0549deda5c9bec82aef3d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T18:50:04Z","title_canon_sha256":"04c8fc6154c75f404160dfe2187faa07505bec038b6ccc1cb0d2563fd1f09ba0"},"schema_version":"1.0","source":{"id":"1210.6944","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6944","created_at":"2026-05-18T03:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6944v3","created_at":"2026-05-18T03:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6944","created_at":"2026-05-18T03:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"CMACLBVRMYBT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CMACLBVRMYBTDO63","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CMACLBVR","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c295d99346c166d8ec32ebe290d4195b8e741afb492a422f7343e6a097a4f401","target":"graph","created_at":"2026-05-18T03:01:11Z","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":"Let $G = (V,E)$ be a graph, and for each $e \\in E(G)$, let $L_e$ be a list of real numbers. Let $w:E(G) \\to \\cup_{e \\in E(G)}L_e$ be an edge weighting function such that $w(e) \\in L_e$ for each $e \\in E(G)$, and let $c_w$ be the vertex colouring obtained by $c_w(v) = \\sum_{e \\ni v}w(e)$. We desire the smallest possible $k$ such that, for any choice of $\\{L_e \\,|\\, e \\in E(G)\\}$ where $|L_e| \\geq k$ for all $e \\in E(G)$, there exists an edge weighting function $w$ for which $c_w$ is proper. The smallest such value of $k$ is the weight choosability number of $G$.\n  This colouring problem, introd","authors_text":"Ben Seamone","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T18:50:04Z","title":"Bounding the weight choosability number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6944","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:44d128628b83abfcadc3912dd4658904c701f6f32a3466b423eeadc598a8af73","target":"record","created_at":"2026-05-18T03:01:11Z","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":"116773ed56ba358f14f80f58fb7d6df5aa3bc82d4f0549deda5c9bec82aef3d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-25T18:50:04Z","title_canon_sha256":"04c8fc6154c75f404160dfe2187faa07505bec038b6ccc1cb0d2563fd1f09ba0"},"schema_version":"1.0","source":{"id":"1210.6944","kind":"arxiv","version":3}},"canonical_sha256":"13002586b1660331bbdb7d5253d84cfc13bfc39b325f99d7e6037d609b53f010","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13002586b1660331bbdb7d5253d84cfc13bfc39b325f99d7e6037d609b53f010","first_computed_at":"2026-05-18T03:01:11.034186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:11.034186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1X/gKemyAeZj6qQ7UYoqYAbSikE48wEcLajLwd51rWOvJBHvC68c1FrsQgUpdxnitoy7sLPc3Sn4D/J4cXURDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:11.034927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6944","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44d128628b83abfcadc3912dd4658904c701f6f32a3466b423eeadc598a8af73","sha256:c295d99346c166d8ec32ebe290d4195b8e741afb492a422f7343e6a097a4f401"],"state_sha256":"35b0fa371f2baf592e2f6e19dc4e83b25ea4933130e73abc55315834e74da0f9"}