{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WBFBJSKRT7WVRVGLGZKNKTVRWW","short_pith_number":"pith:WBFBJSKR","canonical_record":{"source":{"id":"1309.0888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T02:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"9f239c42749008bc076e4dec406c3b8e4e9182d25660640e33f24a69aed92ec3","abstract_canon_sha256":"68480ec6d82bc4ccdcc8c747732212d9d7d350352d5d7a919fc65f7a7f0391d5"},"schema_version":"1.0"},"canonical_sha256":"b04a14c9519fed58d4cb3654d54eb1b58bb8c916274c08ad4439a3933c15e1b2","source":{"kind":"arxiv","id":"1309.0888","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0888","created_at":"2026-05-18T03:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0888v1","created_at":"2026-05-18T03:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0888","created_at":"2026-05-18T03:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"WBFBJSKRT7WV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBFBJSKRT7WVRVGL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBFBJSKR","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WBFBJSKRT7WVRVGLGZKNKTVRWW","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T02:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"9f239c42749008bc076e4dec406c3b8e4e9182d25660640e33f24a69aed92ec3","abstract_canon_sha256":"68480ec6d82bc4ccdcc8c747732212d9d7d350352d5d7a919fc65f7a7f0391d5"},"schema_version":"1.0"},"canonical_sha256":"b04a14c9519fed58d4cb3654d54eb1b58bb8c916274c08ad4439a3933c15e1b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:16.598993Z","signature_b64":"Kt5Zs3qu3uCLU9b8X49TxebtnXv2ctyCv7fScgPJuWpSxJtUskYyhPKMJpiaKtqhYRO6ylzPo/MUjZy5nHf2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04a14c9519fed58d4cb3654d54eb1b58bb8c916274c08ad4439a3933c15e1b2","last_reissued_at":"2026-05-18T03:14:16.598435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:16.598435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0888","source_version":1,"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:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Anne9BBeHRt2fgnFBGtGBMGXm5Jxysyd1BtTjr4AkbLbDdxHSW7ORsxzIx6/xlOgLOSuR2hKdBB4ksYlritBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:56.890401Z"},"content_sha256":"2fc931ed1e2762f9f28942f86abb12cada08035eef39f2bcfca039b2a647bf3d","schema_version":"1.0","event_id":"sha256:2fc931ed1e2762f9f28942f86abb12cada08035eef39f2bcfca039b2a647bf3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WBFBJSKRT7WVRVGLGZKNKTVRWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chromatic-choosability of the power of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Seog-Jin Kim, Young Soo Kwon","submitted_at":"2013-09-04T02:02:02Z","abstract_excerpt":"The $k$th power $G^k$ of a graph $G$ is the graph defined on $V(G)$ such that two vertices $u$ and $v$ are adjacent in $G^k$ if the distance between $u$ and $v$ in $G$ is at most $k$. Let $\\chi(H)$ and $\\chi_l(H)$ be the chromatic number and the list chromatic number of $H$, respectively. A graph $H$ is called {\\em chromatic-choosable} if $\\chi_l (H) = \\chi(H)$. It is an interesting problem to find graphs that are chromatic-choosable. A natural question raised by Xuding Zhu (2012) is whether there exists a constant integer $k$ such that $G^k$ is chromatic-choosable for every graph $G$. Motivat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0888","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"},"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:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4IKyIqJw2FUPvxb8R06TrEB9YLQ/ZC1lMFMt1Efc/vJhVqYPKOTOZbyoMuIKeOklWz6wKyjAE56rEr1jLpsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:56.891087Z"},"content_sha256":"7a3445042219f855e383244c4bed802554a96b6eff8765f8405d0b6ab7fb23ee","schema_version":"1.0","event_id":"sha256:7a3445042219f855e383244c4bed802554a96b6eff8765f8405d0b6ab7fb23ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBFBJSKRT7WVRVGLGZKNKTVRWW/bundle.json","state_url":"https://pith.science/pith/WBFBJSKRT7WVRVGLGZKNKTVRWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBFBJSKRT7WVRVGLGZKNKTVRWW/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-05-25T19:52:56Z","links":{"resolver":"https://pith.science/pith/WBFBJSKRT7WVRVGLGZKNKTVRWW","bundle":"https://pith.science/pith/WBFBJSKRT7WVRVGLGZKNKTVRWW/bundle.json","state":"https://pith.science/pith/WBFBJSKRT7WVRVGLGZKNKTVRWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBFBJSKRT7WVRVGLGZKNKTVRWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WBFBJSKRT7WVRVGLGZKNKTVRWW","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":"68480ec6d82bc4ccdcc8c747732212d9d7d350352d5d7a919fc65f7a7f0391d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T02:02:02Z","title_canon_sha256":"9f239c42749008bc076e4dec406c3b8e4e9182d25660640e33f24a69aed92ec3"},"schema_version":"1.0","source":{"id":"1309.0888","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0888","created_at":"2026-05-18T03:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0888v1","created_at":"2026-05-18T03:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0888","created_at":"2026-05-18T03:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"WBFBJSKRT7WV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBFBJSKRT7WVRVGL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBFBJSKR","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:7a3445042219f855e383244c4bed802554a96b6eff8765f8405d0b6ab7fb23ee","target":"graph","created_at":"2026-05-18T03:14:16Z","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":"The $k$th power $G^k$ of a graph $G$ is the graph defined on $V(G)$ such that two vertices $u$ and $v$ are adjacent in $G^k$ if the distance between $u$ and $v$ in $G$ is at most $k$. Let $\\chi(H)$ and $\\chi_l(H)$ be the chromatic number and the list chromatic number of $H$, respectively. A graph $H$ is called {\\em chromatic-choosable} if $\\chi_l (H) = \\chi(H)$. It is an interesting problem to find graphs that are chromatic-choosable. A natural question raised by Xuding Zhu (2012) is whether there exists a constant integer $k$ such that $G^k$ is chromatic-choosable for every graph $G$. Motivat","authors_text":"Boram Park, Seog-Jin Kim, Young Soo Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T02:02:02Z","title":"Chromatic-choosability of the power of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0888","kind":"arxiv","version":1},"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:2fc931ed1e2762f9f28942f86abb12cada08035eef39f2bcfca039b2a647bf3d","target":"record","created_at":"2026-05-18T03:14:16Z","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":"68480ec6d82bc4ccdcc8c747732212d9d7d350352d5d7a919fc65f7a7f0391d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T02:02:02Z","title_canon_sha256":"9f239c42749008bc076e4dec406c3b8e4e9182d25660640e33f24a69aed92ec3"},"schema_version":"1.0","source":{"id":"1309.0888","kind":"arxiv","version":1}},"canonical_sha256":"b04a14c9519fed58d4cb3654d54eb1b58bb8c916274c08ad4439a3933c15e1b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b04a14c9519fed58d4cb3654d54eb1b58bb8c916274c08ad4439a3933c15e1b2","first_computed_at":"2026-05-18T03:14:16.598435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:16.598435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kt5Zs3qu3uCLU9b8X49TxebtnXv2ctyCv7fScgPJuWpSxJtUskYyhPKMJpiaKtqhYRO6ylzPo/MUjZy5nHf2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:16.598993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0888","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fc931ed1e2762f9f28942f86abb12cada08035eef39f2bcfca039b2a647bf3d","sha256:7a3445042219f855e383244c4bed802554a96b6eff8765f8405d0b6ab7fb23ee"],"state_sha256":"8ceea596d0d133fb86c1519fd95a54709e9152c92e14671b514e5f0a7f45eed0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFaEBIIQgyiH6MAFXahFhqVP9vl+xB8PqRsHSzfG/clu1fYkr2JpPKnlpPZpYJytXvTZG+D7q2UImeSaTk2fDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:52:56.894732Z","bundle_sha256":"d94db8c4394a931a1b62e343eb6b2bb605352f227ae46f0ca98380fe45a8a0cb"}}