{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AYHYQQNDFAQESJ2FUELILOXP6C","short_pith_number":"pith:AYHYQQND","canonical_record":{"source":{"id":"1310.2188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T15:57:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"38f42e918d94d6f01d80097658fe2be546635788231128e2528f7d016e7eaf7e","abstract_canon_sha256":"f17de8965882d4aa1af913259ae20f0ba112f0991cb26cb79284e3269ebc34a7"},"schema_version":"1.0"},"canonical_sha256":"060f8841a32820492745a11685baeff0ace350a4ebbf2f22c0408348e9a2e646","source":{"kind":"arxiv","id":"1310.2188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2188","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2188v1","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2188","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"AYHYQQNDFAQE","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AYHYQQNDFAQESJ2F","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AYHYQQND","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AYHYQQNDFAQESJ2FUELILOXP6C","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T15:57:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"38f42e918d94d6f01d80097658fe2be546635788231128e2528f7d016e7eaf7e","abstract_canon_sha256":"f17de8965882d4aa1af913259ae20f0ba112f0991cb26cb79284e3269ebc34a7"},"schema_version":"1.0"},"canonical_sha256":"060f8841a32820492745a11685baeff0ace350a4ebbf2f22c0408348e9a2e646","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:59.033097Z","signature_b64":"3S3+SrX1Yt2cLpF32BsEgVumrzGSngqii3rsMWuSB2OhM55i/V+/H3SnV/R4PmS+n0FVZ0ZgJ31qlYJMhAceBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"060f8841a32820492745a11685baeff0ace350a4ebbf2f22c0408348e9a2e646","last_reissued_at":"2026-05-18T03:10:59.032327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:59.032327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2188","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:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJWSRndYVxr7RVc+nT9XZr90ZQlj6m0gRdsO8U16EPrQ0WEc981of44lbzsr2KuxuT7Zi4lYKqiKKpqZz0McDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:11:26.535922Z"},"content_sha256":"7ebb9424a244ce1a18bf0561aa9d34ca634033946f1f714ad4759f4fb9736a2b","schema_version":"1.0","event_id":"sha256:7ebb9424a244ce1a18bf0561aa9d34ca634033946f1f714ad4759f4fb9736a2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AYHYQQNDFAQESJ2FUELILOXP6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On r-equitable chromatic threshold of Kronecker products of complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Wei Wang, Xin Zhang, Zhidan Yan","submitted_at":"2013-10-08T15:57:06Z","abstract_excerpt":"A graph $G$ is $r$-equitably $k$-colorable if its vertex set can be partitioned into $k$ independent sets, any two of which differ in size by at most $r$. The $r$-equitable chromatic threshold of a graph $G$, denoted by $\\chi_{r=}^*(G)$, is the minimum $k$ such that $G$ is $r$-equitably $k'$-colorable for all $k'\\ge k$. Let $G\\times H$ denote the Kronecker product of graphs $G$ and $H$. In this paper, we completely determine the exact value of $\\chi_{r=}^*(K_m\\times K_n)$ for general $m,n$ and $r$. As a consequence, we show that for $r\\ge 2$, if $n\\ge \\frac{1}{r-1}(m+r)(m+2r-1)$ then $K_m\\time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2188","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:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnpOcYuccsN6ftDUJcrTJIdp4LXa8xg3DJ8f+w81xG5yXJ1eJhyPEGCYx0IEx6bkNp7sOH2uVAZSmZXRTkCTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:11:26.536624Z"},"content_sha256":"8471e3b458c79f4eacb2aa0e4e0abbb3963217026655861d43fa7564ae3081b5","schema_version":"1.0","event_id":"sha256:8471e3b458c79f4eacb2aa0e4e0abbb3963217026655861d43fa7564ae3081b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYHYQQNDFAQESJ2FUELILOXP6C/bundle.json","state_url":"https://pith.science/pith/AYHYQQNDFAQESJ2FUELILOXP6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYHYQQNDFAQESJ2FUELILOXP6C/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-09T10:11:26Z","links":{"resolver":"https://pith.science/pith/AYHYQQNDFAQESJ2FUELILOXP6C","bundle":"https://pith.science/pith/AYHYQQNDFAQESJ2FUELILOXP6C/bundle.json","state":"https://pith.science/pith/AYHYQQNDFAQESJ2FUELILOXP6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYHYQQNDFAQESJ2FUELILOXP6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AYHYQQNDFAQESJ2FUELILOXP6C","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":"f17de8965882d4aa1af913259ae20f0ba112f0991cb26cb79284e3269ebc34a7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T15:57:06Z","title_canon_sha256":"38f42e918d94d6f01d80097658fe2be546635788231128e2528f7d016e7eaf7e"},"schema_version":"1.0","source":{"id":"1310.2188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2188","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2188v1","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2188","created_at":"2026-05-18T03:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"AYHYQQNDFAQE","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AYHYQQNDFAQESJ2F","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AYHYQQND","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:8471e3b458c79f4eacb2aa0e4e0abbb3963217026655861d43fa7564ae3081b5","target":"graph","created_at":"2026-05-18T03:10:59Z","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 graph $G$ is $r$-equitably $k$-colorable if its vertex set can be partitioned into $k$ independent sets, any two of which differ in size by at most $r$. The $r$-equitable chromatic threshold of a graph $G$, denoted by $\\chi_{r=}^*(G)$, is the minimum $k$ such that $G$ is $r$-equitably $k'$-colorable for all $k'\\ge k$. Let $G\\times H$ denote the Kronecker product of graphs $G$ and $H$. In this paper, we completely determine the exact value of $\\chi_{r=}^*(K_m\\times K_n)$ for general $m,n$ and $r$. As a consequence, we show that for $r\\ge 2$, if $n\\ge \\frac{1}{r-1}(m+r)(m+2r-1)$ then $K_m\\time","authors_text":"Wei Wang, Xin Zhang, Zhidan Yan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T15:57:06Z","title":"On r-equitable chromatic threshold of Kronecker products of complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2188","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:7ebb9424a244ce1a18bf0561aa9d34ca634033946f1f714ad4759f4fb9736a2b","target":"record","created_at":"2026-05-18T03:10:59Z","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":"f17de8965882d4aa1af913259ae20f0ba112f0991cb26cb79284e3269ebc34a7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T15:57:06Z","title_canon_sha256":"38f42e918d94d6f01d80097658fe2be546635788231128e2528f7d016e7eaf7e"},"schema_version":"1.0","source":{"id":"1310.2188","kind":"arxiv","version":1}},"canonical_sha256":"060f8841a32820492745a11685baeff0ace350a4ebbf2f22c0408348e9a2e646","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"060f8841a32820492745a11685baeff0ace350a4ebbf2f22c0408348e9a2e646","first_computed_at":"2026-05-18T03:10:59.032327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:59.032327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3S3+SrX1Yt2cLpF32BsEgVumrzGSngqii3rsMWuSB2OhM55i/V+/H3SnV/R4PmS+n0FVZ0ZgJ31qlYJMhAceBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:59.033097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ebb9424a244ce1a18bf0561aa9d34ca634033946f1f714ad4759f4fb9736a2b","sha256:8471e3b458c79f4eacb2aa0e4e0abbb3963217026655861d43fa7564ae3081b5"],"state_sha256":"c600deb7c5b46f63da29ca594ac3f237c982ec917408a06e27bd9462a544dc97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ksKqHEs6Z82oRyHYSJzSPtMA2Zvn7ppzIUg8nvgPMAYe4jJuFZ1Hi0rCTe0hvwGs2J+ljf5bOq+8ZCL992BCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:11:26.540776Z","bundle_sha256":"3291306c58dd9c0906276ce9e766742f3b01e6d4643ffd2234a547499fd96115"}}