{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2PEZTYHMF2Q35UKLDI5TLCPH6V","short_pith_number":"pith:2PEZTYHM","canonical_record":{"source":{"id":"1305.2700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T08:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"3959b696bf94af37f7e986652d15703c83eddf3df678cba769a7427dd41e90f5","abstract_canon_sha256":"45892fb798f3b98f249595e691f0ce9d66fe12ec8a63779e60c1a25c93e2a89b"},"schema_version":"1.0"},"canonical_sha256":"d3c999e0ec2ea1bed14b1a3b3589e7f57135067bbf22ed88113a41bb83787ef1","source":{"kind":"arxiv","id":"1305.2700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2700","created_at":"2026-05-18T02:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2700v2","created_at":"2026-05-18T02:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2700","created_at":"2026-05-18T02:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"2PEZTYHMF2Q3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2PEZTYHMF2Q35UKL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2PEZTYHM","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2PEZTYHMF2Q35UKLDI5TLCPH6V","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T08:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"3959b696bf94af37f7e986652d15703c83eddf3df678cba769a7427dd41e90f5","abstract_canon_sha256":"45892fb798f3b98f249595e691f0ce9d66fe12ec8a63779e60c1a25c93e2a89b"},"schema_version":"1.0"},"canonical_sha256":"d3c999e0ec2ea1bed14b1a3b3589e7f57135067bbf22ed88113a41bb83787ef1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:04.125512Z","signature_b64":"GcNmSY9Vi5Pyt/EI2w+1KDSKG2DMt2gscQElxZGxl4nfLwcuw2UT2iRUHYBGGhjHrU6IiMzqeuwwB3yp7U+RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c999e0ec2ea1bed14b1a3b3589e7f57135067bbf22ed88113a41bb83787ef1","last_reissued_at":"2026-05-18T02:31:04.125024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:04.125024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2700","source_version":2,"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-18T02:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5WhBbowJ/jOISPK3AX3e8g8V/OzJqdh5NEwBr1/BcmqXIEmisO6ev+KoEuw6jYvRhiRsTaQxBFd6MkAZFshAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:09:04.000966Z"},"content_sha256":"fa55c30b77dda64adfadad1c3d4f5309091c1c81f0115032cfb50a7f994b62e5","schema_version":"1.0","event_id":"sha256:fa55c30b77dda64adfadad1c3d4f5309091c1c81f0115032cfb50a7f994b62e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2PEZTYHMF2Q35UKLDI5TLCPH6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Yu-Pei Huang","submitted_at":"2013-05-13T08:16:16Z","abstract_excerpt":"This paper studies the on-line choice number on complete multipartite graphs with independence number $m$. We give a unified strategy for every prescribed $m$. Our main result leads to several interesting consequences comparable to known results. (1) If $ k_1-\\sum_{p=2}^m(\\frac{p^2}{2}-\\frac{3p}{2}+1)k_p\\geq 0$, where $k_p$ denotes the number of parts of cardinality $p$, then $G$ is on-line chromatic-choosable. (2) If $ |V(G)|\\leq\\frac{m^2-m+2}{m^2-3m+4}\\chi(G)$, then $G$ is on-line chromatic-choosable. (3) The on-line choice number of regular complete multipartite graphs $K_{m\\star k}$ is at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2700","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"},"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-18T02:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aGAQHMsUnAWzwkE3JSxHbtwnohLJP/JvIVnYjzo4gAbVkXFDBOT6So3Zpcy50JNnjD66FNK4EgJy3JPuWr+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:09:04.001303Z"},"content_sha256":"d55b8ad7b6f22c04ac4551de8bf6ace9b9cd521fae7a12792a0df89b81259606","schema_version":"1.0","event_id":"sha256:d55b8ad7b6f22c04ac4551de8bf6ace9b9cd521fae7a12792a0df89b81259606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/bundle.json","state_url":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/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-08T22:09:04Z","links":{"resolver":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V","bundle":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/bundle.json","state":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2PEZTYHMF2Q35UKLDI5TLCPH6V","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":"45892fb798f3b98f249595e691f0ce9d66fe12ec8a63779e60c1a25c93e2a89b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T08:16:16Z","title_canon_sha256":"3959b696bf94af37f7e986652d15703c83eddf3df678cba769a7427dd41e90f5"},"schema_version":"1.0","source":{"id":"1305.2700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2700","created_at":"2026-05-18T02:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2700v2","created_at":"2026-05-18T02:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2700","created_at":"2026-05-18T02:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"2PEZTYHMF2Q3","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2PEZTYHMF2Q35UKL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2PEZTYHM","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:d55b8ad7b6f22c04ac4551de8bf6ace9b9cd521fae7a12792a0df89b81259606","target":"graph","created_at":"2026-05-18T02:31:04Z","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":"This paper studies the on-line choice number on complete multipartite graphs with independence number $m$. We give a unified strategy for every prescribed $m$. Our main result leads to several interesting consequences comparable to known results. (1) If $ k_1-\\sum_{p=2}^m(\\frac{p^2}{2}-\\frac{3p}{2}+1)k_p\\geq 0$, where $k_p$ denotes the number of parts of cardinality $p$, then $G$ is on-line chromatic-choosable. (2) If $ |V(G)|\\leq\\frac{m^2-m+2}{m^2-3m+4}\\chi(G)$, then $G$ is on-line chromatic-choosable. (3) The on-line choice number of regular complete multipartite graphs $K_{m\\star k}$ is at ","authors_text":"Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Yu-Pei Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T08:16:16Z","title":"On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2700","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:fa55c30b77dda64adfadad1c3d4f5309091c1c81f0115032cfb50a7f994b62e5","target":"record","created_at":"2026-05-18T02:31:04Z","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":"45892fb798f3b98f249595e691f0ce9d66fe12ec8a63779e60c1a25c93e2a89b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T08:16:16Z","title_canon_sha256":"3959b696bf94af37f7e986652d15703c83eddf3df678cba769a7427dd41e90f5"},"schema_version":"1.0","source":{"id":"1305.2700","kind":"arxiv","version":2}},"canonical_sha256":"d3c999e0ec2ea1bed14b1a3b3589e7f57135067bbf22ed88113a41bb83787ef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3c999e0ec2ea1bed14b1a3b3589e7f57135067bbf22ed88113a41bb83787ef1","first_computed_at":"2026-05-18T02:31:04.125024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:04.125024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GcNmSY9Vi5Pyt/EI2w+1KDSKG2DMt2gscQElxZGxl4nfLwcuw2UT2iRUHYBGGhjHrU6IiMzqeuwwB3yp7U+RCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:04.125512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa55c30b77dda64adfadad1c3d4f5309091c1c81f0115032cfb50a7f994b62e5","sha256:d55b8ad7b6f22c04ac4551de8bf6ace9b9cd521fae7a12792a0df89b81259606"],"state_sha256":"0807848703f12684db1140d8137699932d845ece903b297e79f9f6496d8ba6e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+cHjvfj9f44dFGFa6BhavoFQpBQhj30s22a/j0BHzUY/GYIvv59yRitv1f8aXTq5g4+9KMVGXuwn1AwlptEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:09:04.003375Z","bundle_sha256":"7bd2a684bc41d622894fb8c5c04388a645bb3640518b59917cd11e398897ab0e"}}